./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-ext/09_fmaxsym-race.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/09_fmaxsym-race.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 f225ad0ddd29038af28d51fbbac3525492e9437e240dca78f58919375937976a --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 10:43:49,393 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 10:43:49,450 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-17 10:43:49,457 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 10:43:49,457 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 10:43:49,479 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 10:43:49,480 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 10:43:49,481 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 10:43:49,481 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 10:43:49,481 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 10:43:49,482 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 10:43:49,482 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 10:43:49,482 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 10:43:49,482 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 10:43:49,482 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 10:43:49,482 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 10:43:49,482 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 10:43:49,483 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 10:43:49,483 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 10:43:49,483 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 10:43:49,483 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 10:43:49,483 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 10:43:49,483 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-17 10:43:49,483 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 10:43:49,483 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 10:43:49,483 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 10:43:49,484 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 10:43:49,484 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 10:43:49,484 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 10:43:49,484 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 10:43:49,484 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 10:43:49,484 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 10:43:49,484 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 10:43:49,484 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 10:43:49,485 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 10:43:49,485 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 10:43:49,485 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 10:43:49,485 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 10:43:49,485 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 10:43:49,485 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 10:43:49,485 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 10:43:49,485 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 10:43:49,485 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 -> f225ad0ddd29038af28d51fbbac3525492e9437e240dca78f58919375937976a [2025-03-17 10:43:49,693 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 10:43:49,698 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 10:43:49,699 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 10:43:49,700 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 10:43:49,700 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 10:43:49,701 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/09_fmaxsym-race.i [2025-03-17 10:43:50,842 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd6cd265f/0e07457b8b0a463dbd02312c9fa66bea/FLAG64d2e9ae1 [2025-03-17 10:43:51,119 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 10:43:51,120 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/09_fmaxsym-race.i [2025-03-17 10:43:51,132 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd6cd265f/0e07457b8b0a463dbd02312c9fa66bea/FLAG64d2e9ae1 [2025-03-17 10:43:51,146 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd6cd265f/0e07457b8b0a463dbd02312c9fa66bea [2025-03-17 10:43:51,148 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 10:43:51,149 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 10:43:51,150 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 10:43:51,150 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 10:43:51,153 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 10:43:51,153 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 10:43:51" (1/1) ... [2025-03-17 10:43:51,155 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54cf90ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:43:51, skipping insertion in model container [2025-03-17 10:43:51,156 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 10:43:51" (1/1) ... [2025-03-17 10:43:51,188 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 10:43:51,439 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 10:43:51,452 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 10:43:51,484 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 10:43:51,511 INFO L204 MainTranslator]: Completed translation [2025-03-17 10:43:51,513 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:43:51 WrapperNode [2025-03-17 10:43:51,513 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 10:43:51,515 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 10:43:51,515 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 10:43:51,515 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 10:43:51,519 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:43:51" (1/1) ... [2025-03-17 10:43:51,525 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:43:51" (1/1) ... [2025-03-17 10:43:51,542 INFO L138 Inliner]: procedures = 164, calls = 27, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 97 [2025-03-17 10:43:51,542 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 10:43:51,543 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 10:43:51,543 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 10:43:51,543 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 10:43:51,546 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:43:51" (1/1) ... [2025-03-17 10:43:51,546 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:43:51" (1/1) ... [2025-03-17 10:43:51,548 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:43:51" (1/1) ... [2025-03-17 10:43:51,548 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:43:51" (1/1) ... [2025-03-17 10:43:51,552 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:43:51" (1/1) ... [2025-03-17 10:43:51,553 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:43:51" (1/1) ... [2025-03-17 10:43:51,554 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:43:51" (1/1) ... [2025-03-17 10:43:51,554 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:43:51" (1/1) ... [2025-03-17 10:43:51,555 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 10:43:51,556 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 10:43:51,556 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 10:43:51,556 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 10:43:51,557 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:43:51" (1/1) ... [2025-03-17 10:43:51,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 10:43:51,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:43:51,578 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:43:51,580 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:43:51,594 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-17 10:43:51,595 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-03-17 10:43:51,595 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-03-17 10:43:51,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-17 10:43:51,595 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-17 10:43:51,595 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 10:43:51,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-17 10:43:51,595 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-17 10:43:51,595 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 10:43:51,595 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 10:43:51,596 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:43:51,678 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 10:43:51,680 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 10:43:51,864 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 10:43:51,865 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 10:43:51,886 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 10:43:51,886 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 10:43:51,887 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 10:43:51 BoogieIcfgContainer [2025-03-17 10:43:51,887 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 10:43:51,888 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 10:43:51,888 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 10:43:51,894 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 10:43:51,894 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 10:43:51" (1/3) ... [2025-03-17 10:43:51,895 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f87241a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 10:43:51, skipping insertion in model container [2025-03-17 10:43:51,895 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:43:51" (2/3) ... [2025-03-17 10:43:51,895 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f87241a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 10:43:51, skipping insertion in model container [2025-03-17 10:43:51,895 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 10:43:51" (3/3) ... [2025-03-17 10:43:51,896 INFO L128 eAbstractionObserver]: Analyzing ICFG 09_fmaxsym-race.i [2025-03-17 10:43:51,905 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 10:43:51,907 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09_fmaxsym-race.i that has 2 procedures, 110 locations, 1 initial locations, 3 loop locations, and 5 error locations. [2025-03-17 10:43:51,907 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 10:43:51,966 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-17 10:43:51,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 116 transitions, 236 flow [2025-03-17 10:43:52,033 INFO L124 PetriNetUnfolderBase]: 6/123 cut-off events. [2025-03-17 10:43:52,037 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 10:43:52,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127 conditions, 123 events. 6/123 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 140 event pairs, 0 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 72. Up to 2 conditions per place. [2025-03-17 10:43:52,040 INFO L82 GeneralOperation]: Start removeDead. Operand has 113 places, 116 transitions, 236 flow [2025-03-17 10:43:52,046 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 113 places, 116 transitions, 236 flow [2025-03-17 10:43:52,053 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 10:43:52,064 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;@20fb211c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 10:43:52,065 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-03-17 10:43:52,075 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 10:43:52,075 INFO L124 PetriNetUnfolderBase]: 0/50 cut-off events. [2025-03-17 10:43:52,076 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 10:43:52,076 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:43:52,076 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:43:52,077 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-17 10:43:52,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:43:52,081 INFO L85 PathProgramCache]: Analyzing trace with hash -471891929, now seen corresponding path program 1 times [2025-03-17 10:43:52,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:43:52,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168095375] [2025-03-17 10:43:52,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:43:52,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:43:52,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-17 10:43:52,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-17 10:43:52,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:43:52,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:43:52,806 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:43:52,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:43:52,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168095375] [2025-03-17 10:43:52,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168095375] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:43:52,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:43:52,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 10:43:52,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370529103] [2025-03-17 10:43:52,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:43:52,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 10:43:52,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:43:52,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 10:43:52,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 10:43:53,003 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 116 [2025-03-17 10:43:53,006 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 116 transitions, 236 flow. Second operand has 6 states, 6 states have (on average 92.5) internal successors, (555), 6 states have internal predecessors, (555), 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:43:53,007 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:43:53,008 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 116 [2025-03-17 10:43:53,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:43:53,064 INFO L124 PetriNetUnfolderBase]: 3/109 cut-off events. [2025-03-17 10:43:53,064 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-17 10:43:53,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132 conditions, 109 events. 3/109 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 83 event pairs, 0 based on Foata normal form. 11/111 useless extension candidates. Maximal degree in co-relation 69. Up to 14 conditions per place. [2025-03-17 10:43:53,066 INFO L140 encePairwiseOnDemand]: 106/116 looper letters, 13 selfloop transitions, 5 changer transitions 0/106 dead transitions. [2025-03-17 10:43:53,066 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 106 transitions, 252 flow [2025-03-17 10:43:53,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 10:43:53,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 10:43:53,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 569 transitions. [2025-03-17 10:43:53,077 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8175287356321839 [2025-03-17 10:43:53,078 INFO L175 Difference]: Start difference. First operand has 113 places, 116 transitions, 236 flow. Second operand 6 states and 569 transitions. [2025-03-17 10:43:53,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 106 transitions, 252 flow [2025-03-17 10:43:53,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 106 transitions, 252 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 10:43:53,084 INFO L231 Difference]: Finished difference. Result has 111 places, 106 transitions, 226 flow [2025-03-17 10:43:53,086 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=226, PETRI_PLACES=111, PETRI_TRANSITIONS=106} [2025-03-17 10:43:53,090 INFO L279 CegarLoopForPetriNet]: 113 programPoint places, -2 predicate places. [2025-03-17 10:43:53,090 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 106 transitions, 226 flow [2025-03-17 10:43:53,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 92.5) internal successors, (555), 6 states have internal predecessors, (555), 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:43:53,091 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:43:53,091 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:43:53,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 10:43:53,091 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-17 10:43:53,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:43:53,092 INFO L85 PathProgramCache]: Analyzing trace with hash -852509319, now seen corresponding path program 1 times [2025-03-17 10:43:53,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:43:53,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856514183] [2025-03-17 10:43:53,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:43:53,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:43:53,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-17 10:43:53,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-17 10:43:53,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:43:53,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:43:53,144 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:43:53,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:43:53,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856514183] [2025-03-17 10:43:53,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856514183] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:43:53,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:43:53,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 10:43:53,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407416577] [2025-03-17 10:43:53,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:43:53,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:43:53,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:43:53,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:43:53,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:43:53,164 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 116 [2025-03-17 10:43:53,164 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 106 transitions, 226 flow. Second operand has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 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:43:53,164 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:43:53,164 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 116 [2025-03-17 10:43:53,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:43:53,196 INFO L124 PetriNetUnfolderBase]: 3/121 cut-off events. [2025-03-17 10:43:53,197 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-17 10:43:53,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 146 conditions, 121 events. 3/121 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 79 event pairs, 0 based on Foata normal form. 1/114 useless extension candidates. Maximal degree in co-relation 84. Up to 9 conditions per place. [2025-03-17 10:43:53,197 INFO L140 encePairwiseOnDemand]: 113/116 looper letters, 7 selfloop transitions, 2 changer transitions 0/107 dead transitions. [2025-03-17 10:43:53,197 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 107 transitions, 248 flow [2025-03-17 10:43:53,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:43:53,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 10:43:53,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 316 transitions. [2025-03-17 10:43:53,201 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9080459770114943 [2025-03-17 10:43:53,201 INFO L175 Difference]: Start difference. First operand has 111 places, 106 transitions, 226 flow. Second operand 3 states and 316 transitions. [2025-03-17 10:43:53,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 107 transitions, 248 flow [2025-03-17 10:43:53,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 107 transitions, 236 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 10:43:53,203 INFO L231 Difference]: Finished difference. Result has 109 places, 107 transitions, 228 flow [2025-03-17 10:43:53,205 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=228, PETRI_PLACES=109, PETRI_TRANSITIONS=107} [2025-03-17 10:43:53,205 INFO L279 CegarLoopForPetriNet]: 113 programPoint places, -4 predicate places. [2025-03-17 10:43:53,205 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 107 transitions, 228 flow [2025-03-17 10:43:53,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 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:43:53,206 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:43:53,207 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:43:53,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 10:43:53,207 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-17 10:43:53,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:43:53,211 INFO L85 PathProgramCache]: Analyzing trace with hash -556176793, now seen corresponding path program 1 times [2025-03-17 10:43:53,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:43:53,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256622203] [2025-03-17 10:43:53,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:43:53,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:43:53,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-17 10:43:53,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-17 10:43:53,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:43:53,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:43:53,305 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:43:53,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:43:53,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256622203] [2025-03-17 10:43:53,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256622203] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 10:43:53,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [71302239] [2025-03-17 10:43:53,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:43:53,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:43:53,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:43:53,309 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:43:53,311 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:43:53,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-17 10:43:53,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-17 10:43:53,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:43:53,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:43:53,374 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 10:43:53,376 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 10:43:53,437 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:43:53,437 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 10:43:53,480 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:43:53,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [71302239] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 10:43:53,480 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 10:43:53,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-17 10:43:53,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268193210] [2025-03-17 10:43:53,480 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 10:43:53,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 10:43:53,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:43:53,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 10:43:53,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-17 10:43:53,569 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 116 [2025-03-17 10:43:53,571 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 107 transitions, 228 flow. Second operand has 10 states, 10 states have (on average 100.9) internal successors, (1009), 10 states have internal predecessors, (1009), 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:43:53,571 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:43:53,571 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 116 [2025-03-17 10:43:53,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:43:53,640 INFO L124 PetriNetUnfolderBase]: 3/136 cut-off events. [2025-03-17 10:43:53,640 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-17 10:43:53,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 169 conditions, 136 events. 3/136 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 51 event pairs, 0 based on Foata normal form. 2/130 useless extension candidates. Maximal degree in co-relation 119. Up to 9 conditions per place. [2025-03-17 10:43:53,641 INFO L140 encePairwiseOnDemand]: 110/116 looper letters, 11 selfloop transitions, 9 changer transitions 0/115 dead transitions. [2025-03-17 10:43:53,641 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 115 transitions, 286 flow [2025-03-17 10:43:53,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 10:43:53,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-17 10:43:53,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 913 transitions. [2025-03-17 10:43:53,646 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8745210727969349 [2025-03-17 10:43:53,646 INFO L175 Difference]: Start difference. First operand has 109 places, 107 transitions, 228 flow. Second operand 9 states and 913 transitions. [2025-03-17 10:43:53,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 115 transitions, 286 flow [2025-03-17 10:43:53,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 115 transitions, 284 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 10:43:53,652 INFO L231 Difference]: Finished difference. Result has 119 places, 113 transitions, 276 flow [2025-03-17 10:43:53,652 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=276, PETRI_PLACES=119, PETRI_TRANSITIONS=113} [2025-03-17 10:43:53,652 INFO L279 CegarLoopForPetriNet]: 113 programPoint places, 6 predicate places. [2025-03-17 10:43:53,652 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 113 transitions, 276 flow [2025-03-17 10:43:53,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 100.9) internal successors, (1009), 10 states have internal predecessors, (1009), 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:43:53,653 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:43:53,653 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:43:53,663 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 10:43:53,859 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:43:53,861 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-17 10:43:53,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:43:53,862 INFO L85 PathProgramCache]: Analyzing trace with hash 679538599, now seen corresponding path program 2 times [2025-03-17 10:43:53,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:43:53,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447542394] [2025-03-17 10:43:53,862 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 10:43:53,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:43:53,879 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 77 statements into 2 equivalence classes. [2025-03-17 10:43:53,890 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 77 of 77 statements. [2025-03-17 10:43:53,890 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 10:43:53,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:43:54,030 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:43:54,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:43:54,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447542394] [2025-03-17 10:43:54,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447542394] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 10:43:54,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1311102080] [2025-03-17 10:43:54,030 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 10:43:54,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:43:54,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:43:54,032 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:43:54,034 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:43:54,086 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 77 statements into 2 equivalence classes. [2025-03-17 10:43:54,108 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 77 of 77 statements. [2025-03-17 10:43:54,108 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 10:43:54,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:43:54,109 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 10:43:54,110 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 10:43:54,174 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:43:54,174 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 10:43:54,294 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:43:54,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1311102080] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 10:43:54,295 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 10:43:54,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2025-03-17 10:43:54,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496979515] [2025-03-17 10:43:54,295 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 10:43:54,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 10:43:54,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:43:54,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 10:43:54,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-17 10:43:54,393 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 116 [2025-03-17 10:43:54,395 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 113 transitions, 276 flow. Second operand has 15 states, 15 states have (on average 101.06666666666666) internal successors, (1516), 15 states have internal predecessors, (1516), 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:43:54,395 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:43:54,395 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 116 [2025-03-17 10:43:54,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:43:54,535 INFO L124 PetriNetUnfolderBase]: 3/175 cut-off events. [2025-03-17 10:43:54,536 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2025-03-17 10:43:54,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 262 conditions, 175 events. 3/175 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 52 event pairs, 0 based on Foata normal form. 3/170 useless extension candidates. Maximal degree in co-relation 185. Up to 9 conditions per place. [2025-03-17 10:43:54,537 INFO L140 encePairwiseOnDemand]: 110/116 looper letters, 14 selfloop transitions, 18 changer transitions 0/127 dead transitions. [2025-03-17 10:43:54,537 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 127 transitions, 414 flow [2025-03-17 10:43:54,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-17 10:43:54,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-17 10:43:54,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1817 transitions. [2025-03-17 10:43:54,541 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8702107279693486 [2025-03-17 10:43:54,541 INFO L175 Difference]: Start difference. First operand has 119 places, 113 transitions, 276 flow. Second operand 18 states and 1817 transitions. [2025-03-17 10:43:54,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 127 transitions, 414 flow [2025-03-17 10:43:54,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 127 transitions, 402 flow, removed 5 selfloop flow, removed 1 redundant places. [2025-03-17 10:43:54,544 INFO L231 Difference]: Finished difference. Result has 139 places, 123 transitions, 376 flow [2025-03-17 10:43:54,544 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=376, PETRI_PLACES=139, PETRI_TRANSITIONS=123} [2025-03-17 10:43:54,545 INFO L279 CegarLoopForPetriNet]: 113 programPoint places, 26 predicate places. [2025-03-17 10:43:54,545 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 123 transitions, 376 flow [2025-03-17 10:43:54,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 101.06666666666666) internal successors, (1516), 15 states have internal predecessors, (1516), 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:43:54,546 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:43:54,546 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:43:54,554 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 10:43:54,746 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:43:54,747 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-17 10:43:54,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:43:54,748 INFO L85 PathProgramCache]: Analyzing trace with hash 612156857, now seen corresponding path program 3 times [2025-03-17 10:43:54,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:43:54,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940474206] [2025-03-17 10:43:54,748 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 10:43:54,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:43:54,764 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 116 statements into 8 equivalence classes. [2025-03-17 10:43:54,802 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 116 of 116 statements. [2025-03-17 10:43:54,802 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-03-17 10:43:54,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 10:43:54,803 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 10:43:54,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-17 10:43:54,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-17 10:43:54,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:43:54,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 10:43:54,840 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 10:43:54,840 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 10:43:54,841 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining) [2025-03-17 10:43:54,843 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (8 of 10 remaining) [2025-03-17 10:43:54,843 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (7 of 10 remaining) [2025-03-17 10:43:54,843 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (6 of 10 remaining) [2025-03-17 10:43:54,843 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (5 of 10 remaining) [2025-03-17 10:43:54,843 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (4 of 10 remaining) [2025-03-17 10:43:54,843 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (3 of 10 remaining) [2025-03-17 10:43:54,843 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (2 of 10 remaining) [2025-03-17 10:43:54,843 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 10 remaining) [2025-03-17 10:43:54,843 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 10 remaining) [2025-03-17 10:43:54,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 10:43:54,844 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1] [2025-03-17 10:43:54,845 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-17 10:43:54,845 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-17 10:43:54,872 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-17 10:43:54,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 174 places, 180 transitions, 370 flow [2025-03-17 10:43:54,905 INFO L124 PetriNetUnfolderBase]: 11/196 cut-off events. [2025-03-17 10:43:54,905 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-17 10:43:54,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 196 events. 11/196 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 370 event pairs, 0 based on Foata normal form. 0/173 useless extension candidates. Maximal degree in co-relation 135. Up to 3 conditions per place. [2025-03-17 10:43:54,907 INFO L82 GeneralOperation]: Start removeDead. Operand has 174 places, 180 transitions, 370 flow [2025-03-17 10:43:54,910 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 174 places, 180 transitions, 370 flow [2025-03-17 10:43:54,911 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 10:43:54,911 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;@20fb211c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 10:43:54,911 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2025-03-17 10:43:54,915 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 10:43:54,915 INFO L124 PetriNetUnfolderBase]: 0/50 cut-off events. [2025-03-17 10:43:54,915 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 10:43:54,915 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:43:54,915 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:43:54,915 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-17 10:43:54,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:43:54,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1654992293, now seen corresponding path program 1 times [2025-03-17 10:43:54,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:43:54,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507449848] [2025-03-17 10:43:54,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:43:54,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:43:54,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-17 10:43:54,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-17 10:43:54,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:43:54,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:43:55,087 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:43:55,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:43:55,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507449848] [2025-03-17 10:43:55,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507449848] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:43:55,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:43:55,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 10:43:55,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987066045] [2025-03-17 10:43:55,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:43:55,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 10:43:55,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:43:55,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 10:43:55,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 10:43:55,234 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 180 [2025-03-17 10:43:55,235 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 180 transitions, 370 flow. Second operand has 6 states, 6 states have (on average 145.5) internal successors, (873), 6 states have internal predecessors, (873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:43:55,236 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:43:55,236 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 180 [2025-03-17 10:43:55,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:43:55,322 INFO L124 PetriNetUnfolderBase]: 68/565 cut-off events. [2025-03-17 10:43:55,323 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2025-03-17 10:43:55,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 713 conditions, 565 events. 68/565 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 2629 event pairs, 42 based on Foata normal form. 90/566 useless extension candidates. Maximal degree in co-relation 461. Up to 117 conditions per place. [2025-03-17 10:43:55,330 INFO L140 encePairwiseOnDemand]: 167/180 looper letters, 20 selfloop transitions, 5 changer transitions 0/165 dead transitions. [2025-03-17 10:43:55,330 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 165 transitions, 390 flow [2025-03-17 10:43:55,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 10:43:55,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 10:43:55,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 897 transitions. [2025-03-17 10:43:55,332 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8305555555555556 [2025-03-17 10:43:55,333 INFO L175 Difference]: Start difference. First operand has 174 places, 180 transitions, 370 flow. Second operand 6 states and 897 transitions. [2025-03-17 10:43:55,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 165 transitions, 390 flow [2025-03-17 10:43:55,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 165 transitions, 390 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 10:43:55,336 INFO L231 Difference]: Finished difference. Result has 170 places, 165 transitions, 350 flow [2025-03-17 10:43:55,337 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=340, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=350, PETRI_PLACES=170, PETRI_TRANSITIONS=165} [2025-03-17 10:43:55,337 INFO L279 CegarLoopForPetriNet]: 174 programPoint places, -4 predicate places. [2025-03-17 10:43:55,338 INFO L471 AbstractCegarLoop]: Abstraction has has 170 places, 165 transitions, 350 flow [2025-03-17 10:43:55,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 145.5) internal successors, (873), 6 states have internal predecessors, (873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:43:55,339 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:43:55,339 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:43:55,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 10:43:55,339 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-17 10:43:55,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:43:55,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1623278664, now seen corresponding path program 1 times [2025-03-17 10:43:55,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:43:55,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399306422] [2025-03-17 10:43:55,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:43:55,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:43:55,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-17 10:43:55,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-17 10:43:55,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:43:55,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:43:55,365 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:43:55,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:43:55,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399306422] [2025-03-17 10:43:55,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399306422] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:43:55,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:43:55,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 10:43:55,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006675486] [2025-03-17 10:43:55,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:43:55,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:43:55,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:43:55,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:43:55,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:43:55,385 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 180 [2025-03-17 10:43:55,386 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 165 transitions, 350 flow. Second operand has 3 states, 3 states have (on average 161.0) internal successors, (483), 3 states have internal predecessors, (483), 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:43:55,386 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:43:55,386 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 180 [2025-03-17 10:43:55,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:43:55,423 INFO L124 PetriNetUnfolderBase]: 15/321 cut-off events. [2025-03-17 10:43:55,423 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-03-17 10:43:55,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 371 conditions, 321 events. 15/321 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 898 event pairs, 6 based on Foata normal form. 1/289 useless extension candidates. Maximal degree in co-relation 308. Up to 24 conditions per place. [2025-03-17 10:43:55,425 INFO L140 encePairwiseOnDemand]: 177/180 looper letters, 10 selfloop transitions, 2 changer transitions 0/166 dead transitions. [2025-03-17 10:43:55,425 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 166 transitions, 378 flow [2025-03-17 10:43:55,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:43:55,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 10:43:55,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 490 transitions. [2025-03-17 10:43:55,428 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9074074074074074 [2025-03-17 10:43:55,428 INFO L175 Difference]: Start difference. First operand has 170 places, 165 transitions, 350 flow. Second operand 3 states and 490 transitions. [2025-03-17 10:43:55,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 166 transitions, 378 flow [2025-03-17 10:43:55,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 166 transitions, 366 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 10:43:55,431 INFO L231 Difference]: Finished difference. Result has 168 places, 166 transitions, 352 flow [2025-03-17 10:43:55,432 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=340, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=352, PETRI_PLACES=168, PETRI_TRANSITIONS=166} [2025-03-17 10:43:55,432 INFO L279 CegarLoopForPetriNet]: 174 programPoint places, -6 predicate places. [2025-03-17 10:43:55,432 INFO L471 AbstractCegarLoop]: Abstraction has has 168 places, 166 transitions, 352 flow [2025-03-17 10:43:55,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 161.0) internal successors, (483), 3 states have internal predecessors, (483), 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:43:55,433 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:43:55,433 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:43:55,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 10:43:55,433 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-17 10:43:55,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:43:55,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1714652710, now seen corresponding path program 1 times [2025-03-17 10:43:55,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:43:55,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163773371] [2025-03-17 10:43:55,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:43:55,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:43:55,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-17 10:43:55,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-17 10:43:55,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:43:55,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:43:55,507 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:43:55,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:43:55,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163773371] [2025-03-17 10:43:55,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163773371] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 10:43:55,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [986259537] [2025-03-17 10:43:55,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:43:55,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:43:55,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:43:55,510 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:43:55,512 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:43:55,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-17 10:43:55,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-17 10:43:55,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:43:55,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:43:55,583 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 10:43:55,584 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 10:43:55,616 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:43:55,616 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 10:43:55,654 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:43:55,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [986259537] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 10:43:55,654 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 10:43:55,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-17 10:43:55,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403268508] [2025-03-17 10:43:55,655 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 10:43:55,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 10:43:55,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:43:55,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 10:43:55,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-17 10:43:55,702 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 180 [2025-03-17 10:43:55,704 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 166 transitions, 352 flow. Second operand has 10 states, 10 states have (on average 158.0) internal successors, (1580), 10 states have internal predecessors, (1580), 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:43:55,704 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:43:55,704 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 180 [2025-03-17 10:43:55,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:43:55,794 INFO L124 PetriNetUnfolderBase]: 15/336 cut-off events. [2025-03-17 10:43:55,794 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-03-17 10:43:55,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 394 conditions, 336 events. 15/336 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 869 event pairs, 6 based on Foata normal form. 2/305 useless extension candidates. Maximal degree in co-relation 343. Up to 24 conditions per place. [2025-03-17 10:43:55,796 INFO L140 encePairwiseOnDemand]: 174/180 looper letters, 14 selfloop transitions, 9 changer transitions 0/174 dead transitions. [2025-03-17 10:43:55,796 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 174 transitions, 416 flow [2025-03-17 10:43:55,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 10:43:55,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-17 10:43:55,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1429 transitions. [2025-03-17 10:43:55,799 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8820987654320988 [2025-03-17 10:43:55,799 INFO L175 Difference]: Start difference. First operand has 168 places, 166 transitions, 352 flow. Second operand 9 states and 1429 transitions. [2025-03-17 10:43:55,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 174 transitions, 416 flow [2025-03-17 10:43:55,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 174 transitions, 414 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 10:43:55,801 INFO L231 Difference]: Finished difference. Result has 178 places, 172 transitions, 400 flow [2025-03-17 10:43:55,801 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=350, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=400, PETRI_PLACES=178, PETRI_TRANSITIONS=172} [2025-03-17 10:43:55,803 INFO L279 CegarLoopForPetriNet]: 174 programPoint places, 4 predicate places. [2025-03-17 10:43:55,803 INFO L471 AbstractCegarLoop]: Abstraction has has 178 places, 172 transitions, 400 flow [2025-03-17 10:43:55,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 158.0) internal successors, (1580), 10 states have internal predecessors, (1580), 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:43:55,804 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:43:55,805 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:43:55,811 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:43:56,005 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:43:56,006 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-17 10:43:56,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:43:56,006 INFO L85 PathProgramCache]: Analyzing trace with hash 49855130, now seen corresponding path program 2 times [2025-03-17 10:43:56,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:43:56,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648749693] [2025-03-17 10:43:56,006 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 10:43:56,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:43:56,020 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 83 statements into 2 equivalence classes. [2025-03-17 10:43:56,025 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 83 of 83 statements. [2025-03-17 10:43:56,025 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 10:43:56,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:43:56,141 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:43:56,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:43:56,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648749693] [2025-03-17 10:43:56,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648749693] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 10:43:56,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [201626308] [2025-03-17 10:43:56,141 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 10:43:56,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:43:56,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:43:56,143 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:43:56,145 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:43:56,219 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 83 statements into 2 equivalence classes. [2025-03-17 10:43:56,241 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 83 of 83 statements. [2025-03-17 10:43:56,241 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 10:43:56,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:43:56,242 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 10:43:56,244 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 10:43:56,303 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:43:56,303 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 10:43:56,389 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:43:56,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [201626308] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 10:43:56,390 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 10:43:56,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2025-03-17 10:43:56,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723872812] [2025-03-17 10:43:56,390 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 10:43:56,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 10:43:56,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:43:56,391 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 10:43:56,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-17 10:43:56,468 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 180 [2025-03-17 10:43:56,470 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 172 transitions, 400 flow. Second operand has 15 states, 15 states have (on average 158.13333333333333) internal successors, (2372), 15 states have internal predecessors, (2372), 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:43:56,471 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:43:56,471 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 180 [2025-03-17 10:43:56,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:43:56,622 INFO L124 PetriNetUnfolderBase]: 15/375 cut-off events. [2025-03-17 10:43:56,623 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2025-03-17 10:43:56,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 487 conditions, 375 events. 15/375 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 871 event pairs, 6 based on Foata normal form. 3/345 useless extension candidates. Maximal degree in co-relation 305. Up to 24 conditions per place. [2025-03-17 10:43:56,625 INFO L140 encePairwiseOnDemand]: 174/180 looper letters, 17 selfloop transitions, 18 changer transitions 0/186 dead transitions. [2025-03-17 10:43:56,625 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 186 transitions, 544 flow [2025-03-17 10:43:56,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-17 10:43:56,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-17 10:43:56,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 2846 transitions. [2025-03-17 10:43:56,630 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8783950617283951 [2025-03-17 10:43:56,630 INFO L175 Difference]: Start difference. First operand has 178 places, 172 transitions, 400 flow. Second operand 18 states and 2846 transitions. [2025-03-17 10:43:56,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 186 transitions, 544 flow [2025-03-17 10:43:56,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 186 transitions, 532 flow, removed 5 selfloop flow, removed 1 redundant places. [2025-03-17 10:43:56,635 INFO L231 Difference]: Finished difference. Result has 198 places, 182 transitions, 500 flow [2025-03-17 10:43:56,636 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=394, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=500, PETRI_PLACES=198, PETRI_TRANSITIONS=182} [2025-03-17 10:43:56,636 INFO L279 CegarLoopForPetriNet]: 174 programPoint places, 24 predicate places. [2025-03-17 10:43:56,638 INFO L471 AbstractCegarLoop]: Abstraction has has 198 places, 182 transitions, 500 flow [2025-03-17 10:43:56,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 158.13333333333333) internal successors, (2372), 15 states have internal predecessors, (2372), 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:43:56,639 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:43:56,639 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:43:56,647 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:43:56,840 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:43:56,840 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-17 10:43:56,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:43:56,841 INFO L85 PathProgramCache]: Analyzing trace with hash -292839048, now seen corresponding path program 3 times [2025-03-17 10:43:56,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:43:56,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932026350] [2025-03-17 10:43:56,841 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 10:43:56,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:43:56,852 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 122 statements into 7 equivalence classes. [2025-03-17 10:43:56,874 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 122 of 122 statements. [2025-03-17 10:43:56,874 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-03-17 10:43:56,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 10:43:56,875 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 10:43:56,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-17 10:43:56,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-17 10:43:56,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:43:56,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 10:43:56,904 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 10:43:56,905 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 10:43:56,905 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 14 remaining) [2025-03-17 10:43:56,905 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (12 of 14 remaining) [2025-03-17 10:43:56,905 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (11 of 14 remaining) [2025-03-17 10:43:56,905 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (10 of 14 remaining) [2025-03-17 10:43:56,905 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (9 of 14 remaining) [2025-03-17 10:43:56,905 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (8 of 14 remaining) [2025-03-17 10:43:56,905 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (7 of 14 remaining) [2025-03-17 10:43:56,905 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (6 of 14 remaining) [2025-03-17 10:43:56,905 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (5 of 14 remaining) [2025-03-17 10:43:56,906 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (4 of 14 remaining) [2025-03-17 10:43:56,906 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (3 of 14 remaining) [2025-03-17 10:43:56,906 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (2 of 14 remaining) [2025-03-17 10:43:56,906 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 14 remaining) [2025-03-17 10:43:56,906 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 14 remaining) [2025-03-17 10:43:56,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 10:43:56,906 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1] [2025-03-17 10:43:56,906 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-17 10:43:56,906 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-17 10:43:56,928 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-17 10:43:56,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 235 places, 244 transitions, 506 flow [2025-03-17 10:43:56,954 INFO L124 PetriNetUnfolderBase]: 16/269 cut-off events. [2025-03-17 10:43:56,955 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-17 10:43:56,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 282 conditions, 269 events. 16/269 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 721 event pairs, 0 based on Foata normal form. 0/236 useless extension candidates. Maximal degree in co-relation 200. Up to 4 conditions per place. [2025-03-17 10:43:56,956 INFO L82 GeneralOperation]: Start removeDead. Operand has 235 places, 244 transitions, 506 flow [2025-03-17 10:43:56,958 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 235 places, 244 transitions, 506 flow [2025-03-17 10:43:56,958 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 10:43:56,959 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;@20fb211c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 10:43:56,959 INFO L334 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2025-03-17 10:43:56,961 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 10:43:56,961 INFO L124 PetriNetUnfolderBase]: 0/50 cut-off events. [2025-03-17 10:43:56,961 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 10:43:56,961 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:43:56,961 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:43:56,961 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-03-17 10:43:56,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:43:56,962 INFO L85 PathProgramCache]: Analyzing trace with hash 1895210191, now seen corresponding path program 1 times [2025-03-17 10:43:56,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:43:56,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929028659] [2025-03-17 10:43:56,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:43:56,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:43:56,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-17 10:43:56,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-17 10:43:56,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:43:56,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:43:57,091 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:43:57,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:43:57,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929028659] [2025-03-17 10:43:57,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929028659] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:43:57,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:43:57,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 10:43:57,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997269650] [2025-03-17 10:43:57,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:43:57,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 10:43:57,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:43:57,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 10:43:57,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 10:43:57,230 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 197 out of 244 [2025-03-17 10:43:57,232 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 244 transitions, 506 flow. Second operand has 6 states, 6 states have (on average 198.5) internal successors, (1191), 6 states have internal predecessors, (1191), 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:43:57,232 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:43:57,232 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 197 of 244 [2025-03-17 10:43:57,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:43:57,712 INFO L124 PetriNetUnfolderBase]: 870/4011 cut-off events. [2025-03-17 10:43:57,712 INFO L125 PetriNetUnfolderBase]: For 328/328 co-relation queries the response was YES. [2025-03-17 10:43:57,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5430 conditions, 4011 events. 870/4011 cut-off events. For 328/328 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 36546 event pairs, 630 based on Foata normal form. 755/4034 useless extension candidates. Maximal degree in co-relation 3233. Up to 1191 conditions per place. [2025-03-17 10:43:57,743 INFO L140 encePairwiseOnDemand]: 228/244 looper letters, 27 selfloop transitions, 5 changer transitions 0/224 dead transitions. [2025-03-17 10:43:57,744 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 224 transitions, 530 flow [2025-03-17 10:43:57,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 10:43:57,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 10:43:57,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1225 transitions. [2025-03-17 10:43:57,747 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8367486338797814 [2025-03-17 10:43:57,747 INFO L175 Difference]: Start difference. First operand has 235 places, 244 transitions, 506 flow. Second operand 6 states and 1225 transitions. [2025-03-17 10:43:57,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 224 transitions, 530 flow [2025-03-17 10:43:57,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 224 transitions, 528 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-03-17 10:43:57,750 INFO L231 Difference]: Finished difference. Result has 229 places, 224 transitions, 474 flow [2025-03-17 10:43:57,750 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=464, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=474, PETRI_PLACES=229, PETRI_TRANSITIONS=224} [2025-03-17 10:43:57,751 INFO L279 CegarLoopForPetriNet]: 235 programPoint places, -6 predicate places. [2025-03-17 10:43:57,751 INFO L471 AbstractCegarLoop]: Abstraction has has 229 places, 224 transitions, 474 flow [2025-03-17 10:43:57,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 198.5) internal successors, (1191), 6 states have internal predecessors, (1191), 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:43:57,751 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:43:57,751 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:43:57,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 10:43:57,752 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-03-17 10:43:57,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:43:57,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1210083254, now seen corresponding path program 1 times [2025-03-17 10:43:57,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:43:57,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322790836] [2025-03-17 10:43:57,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:43:57,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:43:57,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-17 10:43:57,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-17 10:43:57,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:43:57,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:43:57,771 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:43:57,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:43:57,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322790836] [2025-03-17 10:43:57,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322790836] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:43:57,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:43:57,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 10:43:57,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358404728] [2025-03-17 10:43:57,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:43:57,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:43:57,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:43:57,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:43:57,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:43:57,790 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 244 [2025-03-17 10:43:57,791 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 224 transitions, 474 flow. Second operand has 3 states, 3 states have (on average 218.33333333333334) internal successors, (655), 3 states have internal predecessors, (655), 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:43:57,791 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:43:57,791 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 244 [2025-03-17 10:43:57,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:43:57,893 INFO L124 PetriNetUnfolderBase]: 69/939 cut-off events. [2025-03-17 10:43:57,893 INFO L125 PetriNetUnfolderBase]: For 66/66 co-relation queries the response was YES. [2025-03-17 10:43:57,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1080 conditions, 939 events. 69/939 cut-off events. For 66/66 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 5329 event pairs, 42 based on Foata normal form. 1/831 useless extension candidates. Maximal degree in co-relation 1016. Up to 87 conditions per place. [2025-03-17 10:43:57,903 INFO L140 encePairwiseOnDemand]: 241/244 looper letters, 13 selfloop transitions, 2 changer transitions 0/225 dead transitions. [2025-03-17 10:43:57,903 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 225 transitions, 508 flow [2025-03-17 10:43:57,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:43:57,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 10:43:57,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 664 transitions. [2025-03-17 10:43:57,905 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.907103825136612 [2025-03-17 10:43:57,905 INFO L175 Difference]: Start difference. First operand has 229 places, 224 transitions, 474 flow. Second operand 3 states and 664 transitions. [2025-03-17 10:43:57,905 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 225 transitions, 508 flow [2025-03-17 10:43:57,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 225 transitions, 496 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 10:43:57,908 INFO L231 Difference]: Finished difference. Result has 227 places, 225 transitions, 476 flow [2025-03-17 10:43:57,909 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=464, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=222, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=476, PETRI_PLACES=227, PETRI_TRANSITIONS=225} [2025-03-17 10:43:57,910 INFO L279 CegarLoopForPetriNet]: 235 programPoint places, -8 predicate places. [2025-03-17 10:43:57,910 INFO L471 AbstractCegarLoop]: Abstraction has has 227 places, 225 transitions, 476 flow [2025-03-17 10:43:57,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 218.33333333333334) internal successors, (655), 3 states have internal predecessors, (655), 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:43:57,910 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:43:57,910 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:43:57,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 10:43:57,911 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-03-17 10:43:57,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:43:57,911 INFO L85 PathProgramCache]: Analyzing trace with hash 1563830604, now seen corresponding path program 1 times [2025-03-17 10:43:57,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:43:57,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872806150] [2025-03-17 10:43:57,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:43:57,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:43:57,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-17 10:43:57,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-17 10:43:57,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:43:57,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:43:57,987 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:43:57,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:43:57,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872806150] [2025-03-17 10:43:57,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872806150] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 10:43:57,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1620882022] [2025-03-17 10:43:57,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:43:57,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:43:57,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:43:57,990 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:43:57,992 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:43:58,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-17 10:43:58,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-17 10:43:58,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:43:58,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:43:58,063 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 10:43:58,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 10:43:58,093 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:43:58,093 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 10:43:58,121 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:43:58,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1620882022] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 10:43:58,122 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 10:43:58,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-17 10:43:58,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624571621] [2025-03-17 10:43:58,122 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 10:43:58,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 10:43:58,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:43:58,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 10:43:58,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-17 10:43:58,168 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 244 [2025-03-17 10:43:58,169 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 225 transitions, 476 flow. Second operand has 10 states, 10 states have (on average 215.1) internal successors, (2151), 10 states have internal predecessors, (2151), 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:43:58,169 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:43:58,170 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 244 [2025-03-17 10:43:58,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:43:58,304 INFO L124 PetriNetUnfolderBase]: 69/954 cut-off events. [2025-03-17 10:43:58,304 INFO L125 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2025-03-17 10:43:58,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1103 conditions, 954 events. 69/954 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 5305 event pairs, 42 based on Foata normal form. 2/847 useless extension candidates. Maximal degree in co-relation 1051. Up to 87 conditions per place. [2025-03-17 10:43:58,314 INFO L140 encePairwiseOnDemand]: 238/244 looper letters, 17 selfloop transitions, 9 changer transitions 0/233 dead transitions. [2025-03-17 10:43:58,314 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 233 transitions, 546 flow [2025-03-17 10:43:58,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 10:43:58,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-17 10:43:58,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1945 transitions. [2025-03-17 10:43:58,317 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8857012750455373 [2025-03-17 10:43:58,317 INFO L175 Difference]: Start difference. First operand has 227 places, 225 transitions, 476 flow. Second operand 9 states and 1945 transitions. [2025-03-17 10:43:58,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 233 transitions, 546 flow [2025-03-17 10:43:58,319 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 233 transitions, 544 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 10:43:58,321 INFO L231 Difference]: Finished difference. Result has 237 places, 231 transitions, 524 flow [2025-03-17 10:43:58,321 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=474, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=524, PETRI_PLACES=237, PETRI_TRANSITIONS=231} [2025-03-17 10:43:58,321 INFO L279 CegarLoopForPetriNet]: 235 programPoint places, 2 predicate places. [2025-03-17 10:43:58,322 INFO L471 AbstractCegarLoop]: Abstraction has has 237 places, 231 transitions, 524 flow [2025-03-17 10:43:58,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 215.1) internal successors, (2151), 10 states have internal predecessors, (2151), 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:43:58,322 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:43:58,323 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:43:58,332 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:43:58,527 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:43:58,527 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-03-17 10:43:58,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:43:58,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1730968972, now seen corresponding path program 2 times [2025-03-17 10:43:58,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:43:58,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029466583] [2025-03-17 10:43:58,528 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 10:43:58,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:43:58,539 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 89 statements into 2 equivalence classes. [2025-03-17 10:43:58,545 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 89 of 89 statements. [2025-03-17 10:43:58,545 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 10:43:58,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:43:58,640 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:43:58,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:43:58,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029466583] [2025-03-17 10:43:58,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029466583] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 10:43:58,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1326635479] [2025-03-17 10:43:58,640 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 10:43:58,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:43:58,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:43:58,642 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:43:58,644 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:43:58,702 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 89 statements into 2 equivalence classes. [2025-03-17 10:43:58,721 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 89 of 89 statements. [2025-03-17 10:43:58,721 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 10:43:58,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:43:58,722 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 10:43:58,723 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 10:43:58,784 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:43:58,785 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 10:43:58,861 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:43:58,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1326635479] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 10:43:58,861 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 10:43:58,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2025-03-17 10:43:58,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144648653] [2025-03-17 10:43:58,861 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 10:43:58,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 10:43:58,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:43:58,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 10:43:58,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-17 10:43:58,933 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 244 [2025-03-17 10:43:58,935 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 231 transitions, 524 flow. Second operand has 15 states, 15 states have (on average 215.2) internal successors, (3228), 15 states have internal predecessors, (3228), 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:43:58,935 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:43:58,935 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 244 [2025-03-17 10:43:58,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:43:59,150 INFO L124 PetriNetUnfolderBase]: 69/993 cut-off events. [2025-03-17 10:43:59,150 INFO L125 PetriNetUnfolderBase]: For 87/87 co-relation queries the response was YES. [2025-03-17 10:43:59,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1196 conditions, 993 events. 69/993 cut-off events. For 87/87 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 5309 event pairs, 42 based on Foata normal form. 3/887 useless extension candidates. Maximal degree in co-relation 1013. Up to 87 conditions per place. [2025-03-17 10:43:59,158 INFO L140 encePairwiseOnDemand]: 238/244 looper letters, 20 selfloop transitions, 18 changer transitions 0/245 dead transitions. [2025-03-17 10:43:59,158 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 245 transitions, 674 flow [2025-03-17 10:43:59,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-17 10:43:59,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-17 10:43:59,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 3875 transitions. [2025-03-17 10:43:59,165 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8822859744990893 [2025-03-17 10:43:59,165 INFO L175 Difference]: Start difference. First operand has 237 places, 231 transitions, 524 flow. Second operand 18 states and 3875 transitions. [2025-03-17 10:43:59,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 245 transitions, 674 flow [2025-03-17 10:43:59,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 245 transitions, 662 flow, removed 5 selfloop flow, removed 1 redundant places. [2025-03-17 10:43:59,169 INFO L231 Difference]: Finished difference. Result has 257 places, 241 transitions, 624 flow [2025-03-17 10:43:59,169 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=518, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=624, PETRI_PLACES=257, PETRI_TRANSITIONS=241} [2025-03-17 10:43:59,171 INFO L279 CegarLoopForPetriNet]: 235 programPoint places, 22 predicate places. [2025-03-17 10:43:59,171 INFO L471 AbstractCegarLoop]: Abstraction has has 257 places, 241 transitions, 624 flow [2025-03-17 10:43:59,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 215.2) internal successors, (3228), 15 states have internal predecessors, (3228), 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:43:59,172 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:43:59,172 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:43:59,178 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-17 10:43:59,372 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:43:59,372 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-03-17 10:43:59,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:43:59,374 INFO L85 PathProgramCache]: Analyzing trace with hash -93707530, now seen corresponding path program 3 times [2025-03-17 10:43:59,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:43:59,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275750260] [2025-03-17 10:43:59,374 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 10:43:59,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:43:59,387 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 128 statements into 7 equivalence classes. [2025-03-17 10:43:59,416 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 128 of 128 statements. [2025-03-17 10:43:59,418 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-03-17 10:43:59,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 10:43:59,419 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 10:43:59,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-17 10:43:59,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-17 10:43:59,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:43:59,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 10:43:59,453 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 10:43:59,453 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 10:43:59,453 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (17 of 18 remaining) [2025-03-17 10:43:59,453 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (16 of 18 remaining) [2025-03-17 10:43:59,453 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (15 of 18 remaining) [2025-03-17 10:43:59,453 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (14 of 18 remaining) [2025-03-17 10:43:59,453 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (13 of 18 remaining) [2025-03-17 10:43:59,453 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (12 of 18 remaining) [2025-03-17 10:43:59,453 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (11 of 18 remaining) [2025-03-17 10:43:59,453 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (10 of 18 remaining) [2025-03-17 10:43:59,453 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (9 of 18 remaining) [2025-03-17 10:43:59,453 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (8 of 18 remaining) [2025-03-17 10:43:59,453 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (7 of 18 remaining) [2025-03-17 10:43:59,454 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (6 of 18 remaining) [2025-03-17 10:43:59,454 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (5 of 18 remaining) [2025-03-17 10:43:59,454 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (4 of 18 remaining) [2025-03-17 10:43:59,454 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (3 of 18 remaining) [2025-03-17 10:43:59,454 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (2 of 18 remaining) [2025-03-17 10:43:59,454 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 18 remaining) [2025-03-17 10:43:59,454 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 18 remaining) [2025-03-17 10:43:59,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 10:43:59,454 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1] [2025-03-17 10:43:59,455 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-17 10:43:59,455 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-03-17 10:43:59,489 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-17 10:43:59,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 296 places, 308 transitions, 644 flow [2025-03-17 10:43:59,520 INFO L124 PetriNetUnfolderBase]: 21/342 cut-off events. [2025-03-17 10:43:59,520 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-17 10:43:59,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 361 conditions, 342 events. 21/342 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1106 event pairs, 0 based on Foata normal form. 0/299 useless extension candidates. Maximal degree in co-relation 277. Up to 5 conditions per place. [2025-03-17 10:43:59,523 INFO L82 GeneralOperation]: Start removeDead. Operand has 296 places, 308 transitions, 644 flow [2025-03-17 10:43:59,528 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 296 places, 308 transitions, 644 flow [2025-03-17 10:43:59,529 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 10:43:59,529 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;@20fb211c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 10:43:59,529 INFO L334 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2025-03-17 10:43:59,531 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 10:43:59,531 INFO L124 PetriNetUnfolderBase]: 0/50 cut-off events. [2025-03-17 10:43:59,531 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 10:43:59,531 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:43:59,531 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:43:59,531 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-03-17 10:43:59,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:43:59,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1588780931, now seen corresponding path program 1 times [2025-03-17 10:43:59,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:43:59,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65809070] [2025-03-17 10:43:59,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:43:59,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:43:59,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-17 10:43:59,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-17 10:43:59,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:43:59,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:43:59,686 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:43:59,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:43:59,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65809070] [2025-03-17 10:43:59,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65809070] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:43:59,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:43:59,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 10:43:59,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594520306] [2025-03-17 10:43:59,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:43:59,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 10:43:59,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:43:59,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 10:43:59,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 10:43:59,892 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 250 out of 308 [2025-03-17 10:43:59,894 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 296 places, 308 transitions, 644 flow. Second operand has 6 states, 6 states have (on average 251.5) internal successors, (1509), 6 states have internal predecessors, (1509), 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:43:59,894 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:43:59,894 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 250 of 308 [2025-03-17 10:43:59,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:44:03,103 INFO L124 PetriNetUnfolderBase]: 8893/30356 cut-off events. [2025-03-17 10:44:03,104 INFO L125 PetriNetUnfolderBase]: For 3794/3794 co-relation queries the response was YES. [2025-03-17 10:44:03,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43430 conditions, 30356 events. 8893/30356 cut-off events. For 3794/3794 co-relation queries the response was YES. Maximal size of possible extension queue 996. Compared 379910 event pairs, 6804 based on Foata normal form. 6319/31189 useless extension candidates. Maximal degree in co-relation 22385. Up to 11130 conditions per place. [2025-03-17 10:44:03,356 INFO L140 encePairwiseOnDemand]: 289/308 looper letters, 34 selfloop transitions, 5 changer transitions 0/283 dead transitions. [2025-03-17 10:44:03,356 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 283 transitions, 672 flow [2025-03-17 10:44:03,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 10:44:03,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 10:44:03,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1553 transitions. [2025-03-17 10:44:03,358 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8403679653679653 [2025-03-17 10:44:03,358 INFO L175 Difference]: Start difference. First operand has 296 places, 308 transitions, 644 flow. Second operand 6 states and 1553 transitions. [2025-03-17 10:44:03,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 283 transitions, 672 flow [2025-03-17 10:44:03,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 283 transitions, 666 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-03-17 10:44:03,364 INFO L231 Difference]: Finished difference. Result has 288 places, 283 transitions, 598 flow [2025-03-17 10:44:03,364 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=308, PETRI_DIFFERENCE_MINUEND_FLOW=588, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=278, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=598, PETRI_PLACES=288, PETRI_TRANSITIONS=283} [2025-03-17 10:44:03,365 INFO L279 CegarLoopForPetriNet]: 296 programPoint places, -8 predicate places. [2025-03-17 10:44:03,365 INFO L471 AbstractCegarLoop]: Abstraction has has 288 places, 283 transitions, 598 flow [2025-03-17 10:44:03,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 251.5) internal successors, (1509), 6 states have internal predecessors, (1509), 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:03,366 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:44:03,366 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:44:03,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 10:44:03,366 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-03-17 10:44:03,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:44:03,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1156825843, now seen corresponding path program 1 times [2025-03-17 10:44:03,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:44:03,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418362942] [2025-03-17 10:44:03,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:44:03,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:44:03,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-17 10:44:03,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-17 10:44:03,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:44:03,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:44:03,385 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:03,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:44:03,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418362942] [2025-03-17 10:44:03,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418362942] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:44:03,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:44:03,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 10:44:03,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849054104] [2025-03-17 10:44:03,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:44:03,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:44:03,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:44:03,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:44:03,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:44:03,406 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 273 out of 308 [2025-03-17 10:44:03,407 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 283 transitions, 598 flow. Second operand has 3 states, 3 states have (on average 275.6666666666667) internal successors, (827), 3 states have internal predecessors, (827), 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:03,407 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:44:03,407 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 273 of 308 [2025-03-17 10:44:03,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:44:03,745 INFO L124 PetriNetUnfolderBase]: 285/2847 cut-off events. [2025-03-17 10:44:03,745 INFO L125 PetriNetUnfolderBase]: For 282/282 co-relation queries the response was YES. [2025-03-17 10:44:03,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3313 conditions, 2847 events. 285/2847 cut-off events. For 282/282 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 23963 event pairs, 204 based on Foata normal form. 1/2510 useless extension candidates. Maximal degree in co-relation 3248. Up to 330 conditions per place. [2025-03-17 10:44:03,782 INFO L140 encePairwiseOnDemand]: 305/308 looper letters, 16 selfloop transitions, 2 changer transitions 0/284 dead transitions. [2025-03-17 10:44:03,782 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 284 transitions, 638 flow [2025-03-17 10:44:03,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:44:03,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 10:44:03,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 838 transitions. [2025-03-17 10:44:03,785 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9069264069264069 [2025-03-17 10:44:03,785 INFO L175 Difference]: Start difference. First operand has 288 places, 283 transitions, 598 flow. Second operand 3 states and 838 transitions. [2025-03-17 10:44:03,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 290 places, 284 transitions, 638 flow [2025-03-17 10:44:03,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 284 transitions, 626 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 10:44:03,790 INFO L231 Difference]: Finished difference. Result has 286 places, 284 transitions, 600 flow [2025-03-17 10:44:03,790 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=308, PETRI_DIFFERENCE_MINUEND_FLOW=588, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=281, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=600, PETRI_PLACES=286, PETRI_TRANSITIONS=284} [2025-03-17 10:44:03,792 INFO L279 CegarLoopForPetriNet]: 296 programPoint places, -10 predicate places. [2025-03-17 10:44:03,792 INFO L471 AbstractCegarLoop]: Abstraction has has 286 places, 284 transitions, 600 flow [2025-03-17 10:44:03,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 275.6666666666667) internal successors, (827), 3 states have internal predecessors, (827), 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:03,792 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:44:03,792 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:03,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 10:44:03,792 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-03-17 10:44:03,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:44:03,793 INFO L85 PathProgramCache]: Analyzing trace with hash 592554557, now seen corresponding path program 1 times [2025-03-17 10:44:03,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:44:03,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967302405] [2025-03-17 10:44:03,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:44:03,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:44:03,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-17 10:44:03,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-17 10:44:03,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:44:03,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:44:03,831 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:03,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:44:03,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967302405] [2025-03-17 10:44:03,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967302405] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 10:44:03,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1304392247] [2025-03-17 10:44:03,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:44:03,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:44:03,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:44:03,835 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:03,836 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:03,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-17 10:44:03,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-17 10:44:03,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:44:03,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:44:03,916 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 10:44:03,918 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 10:44:03,938 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:03,939 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 10:44:03,965 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:03,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1304392247] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 10:44:03,966 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 10:44:03,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-17 10:44:03,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535582726] [2025-03-17 10:44:03,966 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 10:44:03,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 10:44:03,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:44:03,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 10:44:03,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-17 10:44:04,010 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 270 out of 308 [2025-03-17 10:44:04,013 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 284 transitions, 600 flow. Second operand has 10 states, 10 states have (on average 272.2) internal successors, (2722), 10 states have internal predecessors, (2722), 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:04,013 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:44:04,013 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 270 of 308 [2025-03-17 10:44:04,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:44:04,374 INFO L124 PetriNetUnfolderBase]: 285/2862 cut-off events. [2025-03-17 10:44:04,374 INFO L125 PetriNetUnfolderBase]: For 281/281 co-relation queries the response was YES. [2025-03-17 10:44:04,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3336 conditions, 2862 events. 285/2862 cut-off events. For 281/281 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 23897 event pairs, 204 based on Foata normal form. 2/2526 useless extension candidates. Maximal degree in co-relation 3283. Up to 330 conditions per place. [2025-03-17 10:44:04,405 INFO L140 encePairwiseOnDemand]: 302/308 looper letters, 20 selfloop transitions, 9 changer transitions 0/292 dead transitions. [2025-03-17 10:44:04,405 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 292 transitions, 676 flow [2025-03-17 10:44:04,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 10:44:04,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-17 10:44:04,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2461 transitions. [2025-03-17 10:44:04,407 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8878066378066378 [2025-03-17 10:44:04,408 INFO L175 Difference]: Start difference. First operand has 286 places, 284 transitions, 600 flow. Second operand 9 states and 2461 transitions. [2025-03-17 10:44:04,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 292 transitions, 676 flow [2025-03-17 10:44:04,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 293 places, 292 transitions, 674 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 10:44:04,412 INFO L231 Difference]: Finished difference. Result has 296 places, 290 transitions, 648 flow [2025-03-17 10:44:04,412 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=308, PETRI_DIFFERENCE_MINUEND_FLOW=598, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=278, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=648, PETRI_PLACES=296, PETRI_TRANSITIONS=290} [2025-03-17 10:44:04,413 INFO L279 CegarLoopForPetriNet]: 296 programPoint places, 0 predicate places. [2025-03-17 10:44:04,413 INFO L471 AbstractCegarLoop]: Abstraction has has 296 places, 290 transitions, 648 flow [2025-03-17 10:44:04,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 272.2) internal successors, (2722), 10 states have internal predecessors, (2722), 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:04,414 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:44:04,414 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:04,420 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-17 10:44:04,614 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:04,615 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-03-17 10:44:04,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:44:04,615 INFO L85 PathProgramCache]: Analyzing trace with hash -624334339, now seen corresponding path program 2 times [2025-03-17 10:44:04,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:44:04,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611955938] [2025-03-17 10:44:04,616 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 10:44:04,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:44:04,629 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 95 statements into 2 equivalence classes. [2025-03-17 10:44:04,635 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:04,635 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 10:44:04,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:44:04,729 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:04,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:44:04,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611955938] [2025-03-17 10:44:04,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611955938] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 10:44:04,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1832026788] [2025-03-17 10:44:04,729 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 10:44:04,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:44:04,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:44:04,731 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:04,733 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:04,808 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 95 statements into 2 equivalence classes. [2025-03-17 10:44:04,832 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:04,832 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 10:44:04,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:44:04,834 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 10:44:04,835 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 10:44:04,888 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:04,888 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 10:44:04,972 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:04,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1832026788] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 10:44:04,972 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 10:44:04,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2025-03-17 10:44:04,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690078231] [2025-03-17 10:44:04,973 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 10:44:04,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 10:44:04,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:44:04,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 10:44:04,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-17 10:44:05,068 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 270 out of 308 [2025-03-17 10:44:05,072 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 296 places, 290 transitions, 648 flow. Second operand has 15 states, 15 states have (on average 272.26666666666665) internal successors, (4084), 15 states have internal predecessors, (4084), 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:05,072 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:44:05,072 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 270 of 308 [2025-03-17 10:44:05,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:44:05,665 INFO L124 PetriNetUnfolderBase]: 285/2901 cut-off events. [2025-03-17 10:44:05,665 INFO L125 PetriNetUnfolderBase]: For 303/303 co-relation queries the response was YES. [2025-03-17 10:44:05,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3429 conditions, 2901 events. 285/2901 cut-off events. For 303/303 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 23769 event pairs, 204 based on Foata normal form. 3/2566 useless extension candidates. Maximal degree in co-relation 3245. Up to 330 conditions per place. [2025-03-17 10:44:05,705 INFO L140 encePairwiseOnDemand]: 302/308 looper letters, 23 selfloop transitions, 18 changer transitions 0/304 dead transitions. [2025-03-17 10:44:05,705 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 304 transitions, 804 flow [2025-03-17 10:44:05,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-17 10:44:05,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-17 10:44:05,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 4904 transitions. [2025-03-17 10:44:05,710 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8845598845598845 [2025-03-17 10:44:05,710 INFO L175 Difference]: Start difference. First operand has 296 places, 290 transitions, 648 flow. Second operand 18 states and 4904 transitions. [2025-03-17 10:44:05,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 304 transitions, 804 flow [2025-03-17 10:44:05,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 304 transitions, 792 flow, removed 5 selfloop flow, removed 1 redundant places. [2025-03-17 10:44:05,715 INFO L231 Difference]: Finished difference. Result has 316 places, 300 transitions, 748 flow [2025-03-17 10:44:05,715 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=308, PETRI_DIFFERENCE_MINUEND_FLOW=642, PETRI_DIFFERENCE_MINUEND_PLACES=295, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=290, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=748, PETRI_PLACES=316, PETRI_TRANSITIONS=300} [2025-03-17 10:44:05,716 INFO L279 CegarLoopForPetriNet]: 296 programPoint places, 20 predicate places. [2025-03-17 10:44:05,716 INFO L471 AbstractCegarLoop]: Abstraction has has 316 places, 300 transitions, 748 flow [2025-03-17 10:44:05,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 272.26666666666665) internal successors, (4084), 15 states have internal predecessors, (4084), 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:05,717 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:44:05,718 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:05,724 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:05,918 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:05,918 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-03-17 10:44:05,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:44:05,919 INFO L85 PathProgramCache]: Analyzing trace with hash -22983757, now seen corresponding path program 3 times [2025-03-17 10:44:05,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:44:05,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323467472] [2025-03-17 10:44:05,919 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 10:44:05,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:44:05,933 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 134 statements into 8 equivalence classes. [2025-03-17 10:44:05,964 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:05,965 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-03-17 10:44:05,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 10:44:05,965 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 10:44:05,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-17 10:44:05,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-17 10:44:05,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:44:05,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 10:44:05,997 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 10:44:05,998 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 10:44:05,998 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (21 of 22 remaining) [2025-03-17 10:44:05,998 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (20 of 22 remaining) [2025-03-17 10:44:05,998 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (19 of 22 remaining) [2025-03-17 10:44:05,998 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (18 of 22 remaining) [2025-03-17 10:44:05,999 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (17 of 22 remaining) [2025-03-17 10:44:05,999 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (16 of 22 remaining) [2025-03-17 10:44:05,999 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (15 of 22 remaining) [2025-03-17 10:44:05,999 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (14 of 22 remaining) [2025-03-17 10:44:05,999 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (13 of 22 remaining) [2025-03-17 10:44:05,999 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (12 of 22 remaining) [2025-03-17 10:44:05,999 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (11 of 22 remaining) [2025-03-17 10:44:05,999 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (10 of 22 remaining) [2025-03-17 10:44:05,999 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (9 of 22 remaining) [2025-03-17 10:44:05,999 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (8 of 22 remaining) [2025-03-17 10:44:05,999 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (7 of 22 remaining) [2025-03-17 10:44:05,999 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (6 of 22 remaining) [2025-03-17 10:44:05,999 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (5 of 22 remaining) [2025-03-17 10:44:05,999 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (4 of 22 remaining) [2025-03-17 10:44:06,000 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (3 of 22 remaining) [2025-03-17 10:44:06,000 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (2 of 22 remaining) [2025-03-17 10:44:06,000 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 22 remaining) [2025-03-17 10:44:06,000 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 22 remaining) [2025-03-17 10:44:06,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-17 10:44:06,000 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1] [2025-03-17 10:44:06,000 WARN L246 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-17 10:44:06,001 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2025-03-17 10:44:06,043 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-17 10:44:06,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 357 places, 372 transitions, 784 flow [2025-03-17 10:44:06,105 INFO L124 PetriNetUnfolderBase]: 26/415 cut-off events. [2025-03-17 10:44:06,105 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-03-17 10:44:06,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 441 conditions, 415 events. 26/415 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1498 event pairs, 0 based on Foata normal form. 0/362 useless extension candidates. Maximal degree in co-relation 355. Up to 6 conditions per place. [2025-03-17 10:44:06,111 INFO L82 GeneralOperation]: Start removeDead. Operand has 357 places, 372 transitions, 784 flow [2025-03-17 10:44:06,114 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 357 places, 372 transitions, 784 flow [2025-03-17 10:44:06,115 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 10:44:06,115 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;@20fb211c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 10:44:06,115 INFO L334 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2025-03-17 10:44:06,118 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 10:44:06,118 INFO L124 PetriNetUnfolderBase]: 0/50 cut-off events. [2025-03-17 10:44:06,118 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 10:44:06,118 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:44:06,118 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:06,118 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-17 10:44:06,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:44:06,119 INFO L85 PathProgramCache]: Analyzing trace with hash 1720687223, now seen corresponding path program 1 times [2025-03-17 10:44:06,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:44:06,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965593954] [2025-03-17 10:44:06,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:44:06,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:44:06,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-17 10:44:06,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-17 10:44:06,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:44:06,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:44:06,263 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:06,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:44:06,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965593954] [2025-03-17 10:44:06,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965593954] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:44:06,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:44:06,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 10:44:06,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397868080] [2025-03-17 10:44:06,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:44:06,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 10:44:06,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:44:06,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 10:44:06,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 10:44:06,451 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 303 out of 372 [2025-03-17 10:44:06,453 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 357 places, 372 transitions, 784 flow. Second operand has 6 states, 6 states have (on average 304.5) internal successors, (1827), 6 states have internal predecessors, (1827), 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:06,453 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:44:06,453 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 303 of 372 [2025-03-17 10:44:06,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:44:34,276 INFO L124 PetriNetUnfolderBase]: 81869/231410 cut-off events. [2025-03-17 10:44:34,277 INFO L125 PetriNetUnfolderBase]: For 40121/40121 co-relation queries the response was YES. [2025-03-17 10:44:36,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 345291 conditions, 231410 events. 81869/231410 cut-off events. For 40121/40121 co-relation queries the response was YES. Maximal size of possible extension queue 6614. Compared 3528187 event pairs, 64428 based on Foata normal form. 52388/244848 useless extension candidates. Maximal degree in co-relation 43774. Up to 97530 conditions per place. [2025-03-17 10:44:38,291 INFO L140 encePairwiseOnDemand]: 350/372 looper letters, 41 selfloop transitions, 5 changer transitions 0/342 dead transitions. [2025-03-17 10:44:38,291 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 347 places, 342 transitions, 816 flow [2025-03-17 10:44:38,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 10:44:38,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 10:44:38,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1881 transitions. [2025-03-17 10:44:38,293 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.842741935483871 [2025-03-17 10:44:38,293 INFO L175 Difference]: Start difference. First operand has 357 places, 372 transitions, 784 flow. Second operand 6 states and 1881 transitions. [2025-03-17 10:44:38,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 347 places, 342 transitions, 816 flow [2025-03-17 10:44:38,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 347 places, 342 transitions, 804 flow, removed 6 selfloop flow, removed 0 redundant places. [2025-03-17 10:44:38,304 INFO L231 Difference]: Finished difference. Result has 347 places, 342 transitions, 722 flow [2025-03-17 10:44:38,305 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=372, PETRI_DIFFERENCE_MINUEND_FLOW=712, PETRI_DIFFERENCE_MINUEND_PLACES=342, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=342, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=337, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=722, PETRI_PLACES=347, PETRI_TRANSITIONS=342} [2025-03-17 10:44:38,305 INFO L279 CegarLoopForPetriNet]: 357 programPoint places, -10 predicate places. [2025-03-17 10:44:38,305 INFO L471 AbstractCegarLoop]: Abstraction has has 347 places, 342 transitions, 722 flow [2025-03-17 10:44:38,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 304.5) internal successors, (1827), 6 states have internal predecessors, (1827), 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:38,306 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:44:38,306 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] [2025-03-17 10:44:38,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-17 10:44:38,306 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err3ASSERT_VIOLATIONDATA_RACE === [thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-17 10:44:38,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:44:38,307 INFO L85 PathProgramCache]: Analyzing trace with hash -175046203, now seen corresponding path program 1 times [2025-03-17 10:44:38,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:44:38,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132640660] [2025-03-17 10:44:38,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:44:38,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:44:38,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-17 10:44:38,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-17 10:44:38,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:44:38,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:44:38,356 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:38,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:44:38,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132640660] [2025-03-17 10:44:38,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132640660] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:44:38,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:44:38,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 10:44:38,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962227445] [2025-03-17 10:44:38,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:44:38,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:44:38,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:44:38,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:44:38,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:44:38,372 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 330 out of 372 [2025-03-17 10:44:38,373 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 347 places, 342 transitions, 722 flow. Second operand has 3 states, 3 states have (on average 331.6666666666667) internal successors, (995), 3 states have internal predecessors, (995), 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:38,373 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:44:38,373 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 330 of 372 [2025-03-17 10:44:38,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand