./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 f8ab0bd5 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-?-f8ab0bd-m [2025-03-13 21:58:36,176 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 21:58:36,225 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-13 21:58:36,229 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 21:58:36,229 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 21:58:36,245 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 21:58:36,246 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 21:58:36,246 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 21:58:36,246 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 21:58:36,246 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 21:58:36,246 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 21:58:36,246 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 21:58:36,246 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 21:58:36,246 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 21:58:36,246 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 21:58:36,246 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 21:58:36,247 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 21:58:36,247 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 21:58:36,247 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 21:58:36,247 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 21:58:36,247 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 21:58:36,247 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 21:58:36,247 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-13 21:58:36,247 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-13 21:58:36,247 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 21:58:36,247 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 21:58:36,247 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 21:58:36,247 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 21:58:36,247 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 21:58:36,247 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 21:58:36,247 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 21:58:36,247 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:58:36,247 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 21:58:36,247 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 21:58:36,247 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 21:58:36,248 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 21:58:36,248 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 21:58:36,248 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 21:58:36,248 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 21:58:36,248 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 21:58:36,248 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 21:58:36,248 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 21:58:36,248 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-13 21:58:36,488 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 21:58:36,493 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 21:58:36,495 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 21:58:36,498 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 21:58:36,499 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 21:58:36,500 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-13 21:58:37,663 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8bd15e98/f8817b64d11643a8bf0ba147ecb4460b/FLAGfd3067d12 [2025-03-13 21:58:37,964 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 21:58:37,964 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/09_fmaxsym-race.i [2025-03-13 21:58:37,978 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8bd15e98/f8817b64d11643a8bf0ba147ecb4460b/FLAGfd3067d12 [2025-03-13 21:58:38,243 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8bd15e98/f8817b64d11643a8bf0ba147ecb4460b [2025-03-13 21:58:38,246 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 21:58:38,247 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 21:58:38,248 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 21:58:38,249 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 21:58:38,252 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 21:58:38,253 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:58:38" (1/1) ... [2025-03-13 21:58:38,254 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a0ad208 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:58:38, skipping insertion in model container [2025-03-13 21:58:38,254 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:58:38" (1/1) ... [2025-03-13 21:58:38,284 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 21:58:38,498 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:58:38,508 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 21:58:38,534 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:58:38,559 INFO L204 MainTranslator]: Completed translation [2025-03-13 21:58:38,559 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:58:38 WrapperNode [2025-03-13 21:58:38,559 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 21:58:38,560 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 21:58:38,560 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 21:58:38,560 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 21:58:38,564 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:58:38" (1/1) ... [2025-03-13 21:58:38,571 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:58:38" (1/1) ... [2025-03-13 21:58:38,587 INFO L138 Inliner]: procedures = 164, calls = 27, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 97 [2025-03-13 21:58:38,587 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 21:58:38,588 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 21:58:38,588 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 21:58:38,588 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 21:58:38,592 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:58:38" (1/1) ... [2025-03-13 21:58:38,593 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:58:38" (1/1) ... [2025-03-13 21:58:38,595 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:58:38" (1/1) ... [2025-03-13 21:58:38,595 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:58:38" (1/1) ... [2025-03-13 21:58:38,599 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:58:38" (1/1) ... [2025-03-13 21:58:38,600 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:58:38" (1/1) ... [2025-03-13 21:58:38,601 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:58:38" (1/1) ... [2025-03-13 21:58:38,602 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:58:38" (1/1) ... [2025-03-13 21:58:38,606 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 21:58:38,607 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 21:58:38,607 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 21:58:38,607 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 21:58:38,608 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:58:38" (1/1) ... [2025-03-13 21:58:38,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:58:38,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:58:38,635 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-13 21:58:38,638 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-13 21:58:38,655 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-13 21:58:38,655 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-03-13 21:58:38,655 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-03-13 21:58:38,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-13 21:58:38,655 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-13 21:58:38,655 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-13 21:58:38,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-13 21:58:38,656 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-13 21:58:38,656 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 21:58:38,657 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 21:58:38,657 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-13 21:58:38,757 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 21:58:38,759 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 21:58:38,927 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 21:58:38,927 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 21:58:38,927 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 21:58:38,942 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 21:58:38,942 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:58:38 BoogieIcfgContainer [2025-03-13 21:58:38,942 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 21:58:38,944 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 21:58:38,945 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 21:58:38,948 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 21:58:38,949 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 09:58:38" (1/3) ... [2025-03-13 21:58:38,949 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f0a8dab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:58:38, skipping insertion in model container [2025-03-13 21:58:38,950 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:58:38" (2/3) ... [2025-03-13 21:58:38,950 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f0a8dab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:58:38, skipping insertion in model container [2025-03-13 21:58:38,950 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:58:38" (3/3) ... [2025-03-13 21:58:38,952 INFO L128 eAbstractionObserver]: Analyzing ICFG 09_fmaxsym-race.i [2025-03-13 21:58:38,964 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 21:58:38,966 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-13 21:58:38,966 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 21:58:39,035 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-13 21:58:39,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 116 transitions, 236 flow [2025-03-13 21:58:39,107 INFO L124 PetriNetUnfolderBase]: 6/123 cut-off events. [2025-03-13 21:58:39,109 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 21:58:39,114 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 139 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-13 21:58:39,114 INFO L82 GeneralOperation]: Start removeDead. Operand has 113 places, 116 transitions, 236 flow [2025-03-13 21:58:39,118 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 113 places, 116 transitions, 236 flow [2025-03-13 21:58:39,123 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 21:58:39,131 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;@32d439fa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 21:58:39,131 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-03-13 21:58:39,145 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 21:58:39,145 INFO L124 PetriNetUnfolderBase]: 0/50 cut-off events. [2025-03-13 21:58:39,146 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 21:58:39,148 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:58:39,149 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-13 21:58:39,150 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-13 21:58:39,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:58:39,158 INFO L85 PathProgramCache]: Analyzing trace with hash 174401161, now seen corresponding path program 1 times [2025-03-13 21:58:39,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:58:39,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067892616] [2025-03-13 21:58:39,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:58:39,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:58:39,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-13 21:58:39,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-13 21:58:39,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:58:39,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:58:39,805 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-13 21:58:39,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:58:39,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067892616] [2025-03-13 21:58:39,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067892616] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:58:39,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:58:39,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:58:39,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713231519] [2025-03-13 21:58:39,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:58:39,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 21:58:39,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:58:39,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 21:58:39,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 21:58:39,994 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 116 [2025-03-13 21:58:39,997 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-13 21:58:39,997 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:58:39,997 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 116 [2025-03-13 21:58:39,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:58:40,056 INFO L124 PetriNetUnfolderBase]: 3/109 cut-off events. [2025-03-13 21:58:40,056 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-13 21:58:40,056 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 84 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-13 21:58:40,060 INFO L140 encePairwiseOnDemand]: 106/116 looper letters, 13 selfloop transitions, 5 changer transitions 0/106 dead transitions. [2025-03-13 21:58:40,060 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 106 transitions, 252 flow [2025-03-13 21:58:40,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:58:40,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:58:40,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 569 transitions. [2025-03-13 21:58:40,073 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8175287356321839 [2025-03-13 21:58:40,076 INFO L175 Difference]: Start difference. First operand has 113 places, 116 transitions, 236 flow. Second operand 6 states and 569 transitions. [2025-03-13 21:58:40,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 106 transitions, 252 flow [2025-03-13 21:58:40,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 106 transitions, 252 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 21:58:40,084 INFO L231 Difference]: Finished difference. Result has 111 places, 106 transitions, 226 flow [2025-03-13 21:58:40,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-13 21:58:40,090 INFO L279 CegarLoopForPetriNet]: 113 programPoint places, -2 predicate places. [2025-03-13 21:58:40,090 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 106 transitions, 226 flow [2025-03-13 21:58:40,090 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-13 21:58:40,090 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:58:40,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-13 21:58:40,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 21:58:40,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-13 21:58:40,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:58:40,091 INFO L85 PathProgramCache]: Analyzing trace with hash -148451151, now seen corresponding path program 1 times [2025-03-13 21:58:40,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:58:40,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992176672] [2025-03-13 21:58:40,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:58:40,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:58:40,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-13 21:58:40,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-13 21:58:40,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:58:40,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:58:40,141 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-13 21:58:40,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:58:40,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992176672] [2025-03-13 21:58:40,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992176672] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:58:40,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:58:40,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 21:58:40,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344801613] [2025-03-13 21:58:40,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:58:40,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:58:40,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:58:40,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:58:40,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:58:40,160 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 116 [2025-03-13 21:58:40,161 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-13 21:58:40,161 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:58:40,161 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 116 [2025-03-13 21:58:40,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:58:40,194 INFO L124 PetriNetUnfolderBase]: 3/121 cut-off events. [2025-03-13 21:58:40,194 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-13 21:58:40,195 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 80 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-13 21:58:40,195 INFO L140 encePairwiseOnDemand]: 113/116 looper letters, 7 selfloop transitions, 2 changer transitions 0/107 dead transitions. [2025-03-13 21:58:40,195 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 107 transitions, 248 flow [2025-03-13 21:58:40,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:58:40,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:58:40,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 316 transitions. [2025-03-13 21:58:40,199 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9080459770114943 [2025-03-13 21:58:40,199 INFO L175 Difference]: Start difference. First operand has 111 places, 106 transitions, 226 flow. Second operand 3 states and 316 transitions. [2025-03-13 21:58:40,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 107 transitions, 248 flow [2025-03-13 21:58:40,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 107 transitions, 236 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 21:58:40,201 INFO L231 Difference]: Finished difference. Result has 109 places, 107 transitions, 228 flow [2025-03-13 21:58:40,203 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-13 21:58:40,204 INFO L279 CegarLoopForPetriNet]: 113 programPoint places, -4 predicate places. [2025-03-13 21:58:40,204 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 107 transitions, 228 flow [2025-03-13 21:58:40,204 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-13 21:58:40,204 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:58:40,205 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-13 21:58:40,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-13 21:58:40,205 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-13 21:58:40,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:58:40,206 INFO L85 PathProgramCache]: Analyzing trace with hash 381274216, now seen corresponding path program 1 times [2025-03-13 21:58:40,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:58:40,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468364714] [2025-03-13 21:58:40,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:58:40,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:58:40,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-13 21:58:40,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-13 21:58:40,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:58:40,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:58:40,322 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-13 21:58:40,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:58:40,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468364714] [2025-03-13 21:58:40,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468364714] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:58:40,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1844189573] [2025-03-13 21:58:40,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:58:40,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:58:40,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:58:40,326 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-13 21:58:40,331 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-13 21:58:40,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-13 21:58:40,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-13 21:58:40,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:58:40,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:58:40,396 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-13 21:58:40,399 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:58:40,471 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-13 21:58:40,474 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:58:40,517 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-13 21:58:40,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1844189573] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:58:40,518 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:58:40,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-13 21:58:40,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343402261] [2025-03-13 21:58:40,518 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:58:40,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-13 21:58:40,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:58:40,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-13 21:58:40,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-13 21:58:40,590 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 116 [2025-03-13 21:58:40,591 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-13 21:58:40,591 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:58:40,591 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 116 [2025-03-13 21:58:40,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:58:40,662 INFO L124 PetriNetUnfolderBase]: 3/136 cut-off events. [2025-03-13 21:58:40,662 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-13 21:58:40,662 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 52 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-13 21:58:40,663 INFO L140 encePairwiseOnDemand]: 110/116 looper letters, 11 selfloop transitions, 9 changer transitions 0/115 dead transitions. [2025-03-13 21:58:40,663 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 115 transitions, 286 flow [2025-03-13 21:58:40,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-13 21:58:40,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-13 21:58:40,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 913 transitions. [2025-03-13 21:58:40,665 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8745210727969349 [2025-03-13 21:58:40,665 INFO L175 Difference]: Start difference. First operand has 109 places, 107 transitions, 228 flow. Second operand 9 states and 913 transitions. [2025-03-13 21:58:40,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 115 transitions, 286 flow [2025-03-13 21:58:40,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 115 transitions, 284 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 21:58:40,668 INFO L231 Difference]: Finished difference. Result has 119 places, 113 transitions, 276 flow [2025-03-13 21:58:40,668 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-13 21:58:40,669 INFO L279 CegarLoopForPetriNet]: 113 programPoint places, 6 predicate places. [2025-03-13 21:58:40,669 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 113 transitions, 276 flow [2025-03-13 21:58:40,670 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-13 21:58:40,671 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:58:40,671 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-13 21:58:40,678 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-13 21:58:40,872 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-13 21:58:40,872 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-13 21:58:40,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:58:40,873 INFO L85 PathProgramCache]: Analyzing trace with hash -458587384, now seen corresponding path program 2 times [2025-03-13 21:58:40,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:58:40,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063366509] [2025-03-13 21:58:40,873 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:58:40,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:58:40,885 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 77 statements into 2 equivalence classes. [2025-03-13 21:58:40,900 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 77 of 77 statements. [2025-03-13 21:58:40,901 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:58:40,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:58:41,059 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-13 21:58:41,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:58:41,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063366509] [2025-03-13 21:58:41,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063366509] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:58:41,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1749982134] [2025-03-13 21:58:41,059 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:58:41,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:58:41,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:58:41,062 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-13 21:58:41,064 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-13 21:58:41,113 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 77 statements into 2 equivalence classes. [2025-03-13 21:58:41,138 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 77 of 77 statements. [2025-03-13 21:58:41,139 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:58:41,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:58:41,140 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-13 21:58:41,141 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:58:41,208 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-13 21:58:41,208 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:58:41,322 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-13 21:58:41,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1749982134] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:58:41,323 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:58:41,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2025-03-13 21:58:41,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689422791] [2025-03-13 21:58:41,324 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:58:41,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-13 21:58:41,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:58:41,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-13 21:58:41,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-13 21:58:41,423 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 116 [2025-03-13 21:58:41,425 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-13 21:58:41,425 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:58:41,425 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 116 [2025-03-13 21:58:41,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:58:41,571 INFO L124 PetriNetUnfolderBase]: 3/175 cut-off events. [2025-03-13 21:58:41,571 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2025-03-13 21:58:41,572 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 53 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-13 21:58:41,572 INFO L140 encePairwiseOnDemand]: 110/116 looper letters, 14 selfloop transitions, 18 changer transitions 0/127 dead transitions. [2025-03-13 21:58:41,572 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 127 transitions, 414 flow [2025-03-13 21:58:41,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-13 21:58:41,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-13 21:58:41,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1817 transitions. [2025-03-13 21:58:41,577 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8702107279693486 [2025-03-13 21:58:41,577 INFO L175 Difference]: Start difference. First operand has 119 places, 113 transitions, 276 flow. Second operand 18 states and 1817 transitions. [2025-03-13 21:58:41,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 127 transitions, 414 flow [2025-03-13 21:58:41,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 127 transitions, 402 flow, removed 5 selfloop flow, removed 1 redundant places. [2025-03-13 21:58:41,581 INFO L231 Difference]: Finished difference. Result has 139 places, 123 transitions, 376 flow [2025-03-13 21:58:41,582 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-13 21:58:41,583 INFO L279 CegarLoopForPetriNet]: 113 programPoint places, 26 predicate places. [2025-03-13 21:58:41,583 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 123 transitions, 376 flow [2025-03-13 21:58:41,583 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-13 21:58:41,583 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:58:41,584 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-13 21:58:41,591 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-13 21:58:41,784 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-13 21:58:41,785 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-13 21:58:41,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:58:41,786 INFO L85 PathProgramCache]: Analyzing trace with hash 107965649, now seen corresponding path program 3 times [2025-03-13 21:58:41,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:58:41,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044903791] [2025-03-13 21:58:41,786 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:58:41,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:58:41,805 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 116 statements into 8 equivalence classes. [2025-03-13 21:58:41,856 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 116 of 116 statements. [2025-03-13 21:58:41,856 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-03-13 21:58:41,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 21:58:41,857 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-13 21:58:41,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-13 21:58:41,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-13 21:58:41,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:58:41,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 21:58:41,906 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-13 21:58:41,908 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-13 21:58:41,908 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining) [2025-03-13 21:58:41,911 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (8 of 10 remaining) [2025-03-13 21:58:41,911 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (7 of 10 remaining) [2025-03-13 21:58:41,911 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (6 of 10 remaining) [2025-03-13 21:58:41,911 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (5 of 10 remaining) [2025-03-13 21:58:41,911 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (4 of 10 remaining) [2025-03-13 21:58:41,912 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (3 of 10 remaining) [2025-03-13 21:58:41,912 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (2 of 10 remaining) [2025-03-13 21:58:41,912 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 10 remaining) [2025-03-13 21:58:41,912 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 10 remaining) [2025-03-13 21:58:41,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-13 21:58:41,912 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1] [2025-03-13 21:58:41,914 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-13 21:58:41,914 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-13 21:58:41,938 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-13 21:58:41,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 174 places, 180 transitions, 370 flow [2025-03-13 21:58:41,956 INFO L124 PetriNetUnfolderBase]: 11/196 cut-off events. [2025-03-13 21:58:41,956 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-13 21:58:41,958 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 6. Compared 372 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-13 21:58:41,958 INFO L82 GeneralOperation]: Start removeDead. Operand has 174 places, 180 transitions, 370 flow [2025-03-13 21:58:41,959 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 174 places, 180 transitions, 370 flow [2025-03-13 21:58:41,959 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 21:58:41,960 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;@32d439fa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 21:58:41,960 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2025-03-13 21:58:41,962 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 21:58:41,962 INFO L124 PetriNetUnfolderBase]: 0/50 cut-off events. [2025-03-13 21:58:41,962 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 21:58:41,962 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:58:41,963 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-13 21:58:41,963 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-13 21:58:41,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:58:41,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1008699203, now seen corresponding path program 1 times [2025-03-13 21:58:41,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:58:41,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553177364] [2025-03-13 21:58:41,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:58:41,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:58:41,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-13 21:58:41,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-13 21:58:41,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:58:41,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:58:42,152 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-13 21:58:42,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:58:42,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553177364] [2025-03-13 21:58:42,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553177364] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:58:42,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:58:42,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:58:42,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583339661] [2025-03-13 21:58:42,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:58:42,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 21:58:42,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:58:42,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 21:58:42,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 21:58:42,290 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 180 [2025-03-13 21:58:42,291 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-13 21:58:42,291 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:58:42,291 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 180 [2025-03-13 21:58:42,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:58:42,354 INFO L124 PetriNetUnfolderBase]: 68/565 cut-off events. [2025-03-13 21:58:42,354 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2025-03-13 21:58:42,357 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 2649 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-13 21:58:42,358 INFO L140 encePairwiseOnDemand]: 167/180 looper letters, 20 selfloop transitions, 5 changer transitions 0/165 dead transitions. [2025-03-13 21:58:42,358 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 165 transitions, 390 flow [2025-03-13 21:58:42,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:58:42,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:58:42,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 897 transitions. [2025-03-13 21:58:42,361 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8305555555555556 [2025-03-13 21:58:42,361 INFO L175 Difference]: Start difference. First operand has 174 places, 180 transitions, 370 flow. Second operand 6 states and 897 transitions. [2025-03-13 21:58:42,361 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 165 transitions, 390 flow [2025-03-13 21:58:42,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 165 transitions, 390 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 21:58:42,365 INFO L231 Difference]: Finished difference. Result has 170 places, 165 transitions, 350 flow [2025-03-13 21:58:42,365 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-13 21:58:42,365 INFO L279 CegarLoopForPetriNet]: 174 programPoint places, -4 predicate places. [2025-03-13 21:58:42,365 INFO L471 AbstractCegarLoop]: Abstraction has has 170 places, 165 transitions, 350 flow [2025-03-13 21:58:42,366 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-13 21:58:42,366 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:58:42,366 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-13 21:58:42,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-13 21:58:42,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 10 more)] === [2025-03-13 21:58:42,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:58:42,366 INFO L85 PathProgramCache]: Analyzing trace with hash -619562928, now seen corresponding path program 1 times [2025-03-13 21:58:42,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:58:42,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146713932] [2025-03-13 21:58:42,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:58:42,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:58:42,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-13 21:58:42,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-13 21:58:42,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:58:42,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:58:42,387 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-13 21:58:42,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:58:42,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146713932] [2025-03-13 21:58:42,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146713932] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:58:42,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:58:42,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 21:58:42,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267685576] [2025-03-13 21:58:42,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:58:42,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:58:42,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:58:42,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:58:42,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:58:42,410 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 180 [2025-03-13 21:58:42,410 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-13 21:58:42,410 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:58:42,410 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 180 [2025-03-13 21:58:42,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:58:42,443 INFO L124 PetriNetUnfolderBase]: 15/321 cut-off events. [2025-03-13 21:58:42,443 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-03-13 21:58:42,444 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-13 21:58:42,445 INFO L140 encePairwiseOnDemand]: 177/180 looper letters, 10 selfloop transitions, 2 changer transitions 0/166 dead transitions. [2025-03-13 21:58:42,445 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 166 transitions, 378 flow [2025-03-13 21:58:42,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:58:42,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:58:42,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 490 transitions. [2025-03-13 21:58:42,447 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9074074074074074 [2025-03-13 21:58:42,447 INFO L175 Difference]: Start difference. First operand has 170 places, 165 transitions, 350 flow. Second operand 3 states and 490 transitions. [2025-03-13 21:58:42,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 166 transitions, 378 flow [2025-03-13 21:58:42,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 166 transitions, 366 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 21:58:42,449 INFO L231 Difference]: Finished difference. Result has 168 places, 166 transitions, 352 flow [2025-03-13 21:58:42,449 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-13 21:58:42,451 INFO L279 CegarLoopForPetriNet]: 174 programPoint places, -6 predicate places. [2025-03-13 21:58:42,451 INFO L471 AbstractCegarLoop]: Abstraction has has 168 places, 166 transitions, 352 flow [2025-03-13 21:58:42,452 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-13 21:58:42,452 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:58:42,452 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-13 21:58:42,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-13 21:58:42,452 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-13 21:58:42,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:58:42,452 INFO L85 PathProgramCache]: Analyzing trace with hash 648955515, now seen corresponding path program 1 times [2025-03-13 21:58:42,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:58:42,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326426906] [2025-03-13 21:58:42,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:58:42,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:58:42,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-13 21:58:42,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-13 21:58:42,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:58:42,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:58:42,506 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-13 21:58:42,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:58:42,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326426906] [2025-03-13 21:58:42,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326426906] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:58:42,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1164240634] [2025-03-13 21:58:42,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:58:42,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:58:42,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:58:42,508 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-13 21:58:42,510 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-13 21:58:42,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-13 21:58:42,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-13 21:58:42,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:58:42,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:58:42,564 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-13 21:58:42,565 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:58:42,585 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-13 21:58:42,586 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:58:42,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-13 21:58:42,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1164240634] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:58:42,616 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:58:42,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-13 21:58:42,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572122922] [2025-03-13 21:58:42,616 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:58:42,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-13 21:58:42,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:58:42,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-13 21:58:42,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-13 21:58:42,663 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 180 [2025-03-13 21:58:42,664 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-13 21:58:42,664 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:58:42,664 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 180 [2025-03-13 21:58:42,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:58:42,757 INFO L124 PetriNetUnfolderBase]: 15/336 cut-off events. [2025-03-13 21:58:42,757 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-03-13 21:58:42,758 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 871 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-13 21:58:42,759 INFO L140 encePairwiseOnDemand]: 174/180 looper letters, 14 selfloop transitions, 9 changer transitions 0/174 dead transitions. [2025-03-13 21:58:42,759 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 174 transitions, 416 flow [2025-03-13 21:58:42,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-13 21:58:42,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-13 21:58:42,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1429 transitions. [2025-03-13 21:58:42,762 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8820987654320988 [2025-03-13 21:58:42,762 INFO L175 Difference]: Start difference. First operand has 168 places, 166 transitions, 352 flow. Second operand 9 states and 1429 transitions. [2025-03-13 21:58:42,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 174 transitions, 416 flow [2025-03-13 21:58:42,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 174 transitions, 414 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 21:58:42,764 INFO L231 Difference]: Finished difference. Result has 178 places, 172 transitions, 400 flow [2025-03-13 21:58:42,764 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-13 21:58:42,765 INFO L279 CegarLoopForPetriNet]: 174 programPoint places, 4 predicate places. [2025-03-13 21:58:42,765 INFO L471 AbstractCegarLoop]: Abstraction has has 178 places, 172 transitions, 400 flow [2025-03-13 21:58:42,765 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-13 21:58:42,765 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:58:42,766 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-13 21:58:42,772 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-13 21:58:42,970 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-13 21:58:42,970 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-13 21:58:42,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:58:42,971 INFO L85 PathProgramCache]: Analyzing trace with hash 2046702747, now seen corresponding path program 2 times [2025-03-13 21:58:42,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:58:42,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291969131] [2025-03-13 21:58:42,971 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:58:42,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:58:42,980 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 83 statements into 2 equivalence classes. [2025-03-13 21:58:42,985 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 83 of 83 statements. [2025-03-13 21:58:42,986 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:58:42,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:58:43,090 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-13 21:58:43,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:58:43,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291969131] [2025-03-13 21:58:43,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291969131] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:58:43,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1640244643] [2025-03-13 21:58:43,091 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:58:43,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:58:43,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:58:43,094 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-13 21:58:43,096 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-13 21:58:43,144 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 83 statements into 2 equivalence classes. [2025-03-13 21:58:43,169 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 83 of 83 statements. [2025-03-13 21:58:43,169 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:58:43,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:58:43,171 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-13 21:58:43,172 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:58:43,226 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-13 21:58:43,226 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:58:43,305 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-13 21:58:43,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1640244643] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:58:43,306 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:58:43,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2025-03-13 21:58:43,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184898522] [2025-03-13 21:58:43,306 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:58:43,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-13 21:58:43,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:58:43,307 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-13 21:58:43,307 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-13 21:58:43,377 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 180 [2025-03-13 21:58:43,379 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-13 21:58:43,379 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:58:43,379 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 180 [2025-03-13 21:58:43,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:58:43,530 INFO L124 PetriNetUnfolderBase]: 15/375 cut-off events. [2025-03-13 21:58:43,530 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2025-03-13 21:58:43,531 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 873 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-13 21:58:43,532 INFO L140 encePairwiseOnDemand]: 174/180 looper letters, 17 selfloop transitions, 18 changer transitions 0/186 dead transitions. [2025-03-13 21:58:43,532 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 186 transitions, 544 flow [2025-03-13 21:58:43,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-13 21:58:43,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-13 21:58:43,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 2846 transitions. [2025-03-13 21:58:43,537 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8783950617283951 [2025-03-13 21:58:43,537 INFO L175 Difference]: Start difference. First operand has 178 places, 172 transitions, 400 flow. Second operand 18 states and 2846 transitions. [2025-03-13 21:58:43,537 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 186 transitions, 544 flow [2025-03-13 21:58:43,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 186 transitions, 532 flow, removed 5 selfloop flow, removed 1 redundant places. [2025-03-13 21:58:43,542 INFO L231 Difference]: Finished difference. Result has 198 places, 182 transitions, 500 flow [2025-03-13 21:58:43,544 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-13 21:58:43,545 INFO L279 CegarLoopForPetriNet]: 174 programPoint places, 24 predicate places. [2025-03-13 21:58:43,546 INFO L471 AbstractCegarLoop]: Abstraction has has 198 places, 182 transitions, 500 flow [2025-03-13 21:58:43,547 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-13 21:58:43,547 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:58:43,547 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-13 21:58:43,553 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-13 21:58:43,747 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-13 21:58:43,748 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-13 21:58:43,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:58:43,749 INFO L85 PathProgramCache]: Analyzing trace with hash 932465136, now seen corresponding path program 3 times [2025-03-13 21:58:43,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:58:43,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045097474] [2025-03-13 21:58:43,749 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:58:43,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:58:43,760 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 122 statements into 7 equivalence classes. [2025-03-13 21:58:43,787 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 122 of 122 statements. [2025-03-13 21:58:43,788 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-03-13 21:58:43,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 21:58:43,788 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-13 21:58:43,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-13 21:58:43,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-13 21:58:43,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:58:43,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 21:58:43,813 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-13 21:58:43,814 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-13 21:58:43,814 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 14 remaining) [2025-03-13 21:58:43,814 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (12 of 14 remaining) [2025-03-13 21:58:43,815 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (11 of 14 remaining) [2025-03-13 21:58:43,815 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (10 of 14 remaining) [2025-03-13 21:58:43,815 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (9 of 14 remaining) [2025-03-13 21:58:43,815 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (8 of 14 remaining) [2025-03-13 21:58:43,815 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (7 of 14 remaining) [2025-03-13 21:58:43,815 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (6 of 14 remaining) [2025-03-13 21:58:43,815 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (5 of 14 remaining) [2025-03-13 21:58:43,815 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (4 of 14 remaining) [2025-03-13 21:58:43,815 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (3 of 14 remaining) [2025-03-13 21:58:43,815 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (2 of 14 remaining) [2025-03-13 21:58:43,816 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 14 remaining) [2025-03-13 21:58:43,816 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 14 remaining) [2025-03-13 21:58:43,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-13 21:58:43,816 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1] [2025-03-13 21:58:43,816 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-13 21:58:43,816 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-13 21:58:43,850 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-13 21:58:43,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 235 places, 244 transitions, 506 flow [2025-03-13 21:58:43,873 INFO L124 PetriNetUnfolderBase]: 16/269 cut-off events. [2025-03-13 21:58:43,873 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-13 21:58:43,875 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 720 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-13 21:58:43,875 INFO L82 GeneralOperation]: Start removeDead. Operand has 235 places, 244 transitions, 506 flow [2025-03-13 21:58:43,877 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 235 places, 244 transitions, 506 flow [2025-03-13 21:58:43,877 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 21:58:43,878 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;@32d439fa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 21:58:43,879 INFO L334 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2025-03-13 21:58:43,882 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 21:58:43,882 INFO L124 PetriNetUnfolderBase]: 0/50 cut-off events. [2025-03-13 21:58:43,882 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 21:58:43,882 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:58:43,882 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-13 21:58:43,882 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-13 21:58:43,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:58:43,883 INFO L85 PathProgramCache]: Analyzing trace with hash -1753464015, now seen corresponding path program 1 times [2025-03-13 21:58:43,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:58:43,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952096516] [2025-03-13 21:58:43,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:58:43,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:58:43,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-13 21:58:43,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-13 21:58:43,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:58:43,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:58:44,029 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-13 21:58:44,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:58:44,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952096516] [2025-03-13 21:58:44,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952096516] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:58:44,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:58:44,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:58:44,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045699525] [2025-03-13 21:58:44,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:58:44,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 21:58:44,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:58:44,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 21:58:44,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 21:58:44,165 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 197 out of 244 [2025-03-13 21:58:44,166 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-13 21:58:44,167 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:58:44,167 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 197 of 244 [2025-03-13 21:58:44,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:58:44,636 INFO L124 PetriNetUnfolderBase]: 870/4011 cut-off events. [2025-03-13 21:58:44,636 INFO L125 PetriNetUnfolderBase]: For 328/328 co-relation queries the response was YES. [2025-03-13 21:58:44,648 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 36487 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-13 21:58:44,665 INFO L140 encePairwiseOnDemand]: 228/244 looper letters, 27 selfloop transitions, 5 changer transitions 0/224 dead transitions. [2025-03-13 21:58:44,665 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 224 transitions, 530 flow [2025-03-13 21:58:44,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:58:44,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:58:44,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1225 transitions. [2025-03-13 21:58:44,668 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8367486338797814 [2025-03-13 21:58:44,668 INFO L175 Difference]: Start difference. First operand has 235 places, 244 transitions, 506 flow. Second operand 6 states and 1225 transitions. [2025-03-13 21:58:44,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 224 transitions, 530 flow [2025-03-13 21:58:44,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 224 transitions, 528 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-03-13 21:58:44,671 INFO L231 Difference]: Finished difference. Result has 229 places, 224 transitions, 474 flow [2025-03-13 21:58:44,671 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-13 21:58:44,672 INFO L279 CegarLoopForPetriNet]: 235 programPoint places, -6 predicate places. [2025-03-13 21:58:44,672 INFO L471 AbstractCegarLoop]: Abstraction has has 229 places, 224 transitions, 474 flow [2025-03-13 21:58:44,672 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-13 21:58:44,672 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:58:44,672 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-13 21:58:44,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-13 21:58:44,673 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-13 21:58:44,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:58:44,673 INFO L85 PathProgramCache]: Analyzing trace with hash 91473326, now seen corresponding path program 1 times [2025-03-13 21:58:44,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:58:44,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208673139] [2025-03-13 21:58:44,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:58:44,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:58:44,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-13 21:58:44,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-13 21:58:44,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:58:44,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:58:44,697 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-13 21:58:44,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:58:44,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208673139] [2025-03-13 21:58:44,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208673139] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:58:44,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:58:44,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 21:58:44,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489259163] [2025-03-13 21:58:44,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:58:44,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:58:44,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:58:44,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:58:44,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:58:44,716 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 244 [2025-03-13 21:58:44,717 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-13 21:58:44,717 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:58:44,717 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 244 [2025-03-13 21:58:44,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:58:44,820 INFO L124 PetriNetUnfolderBase]: 69/939 cut-off events. [2025-03-13 21:58:44,820 INFO L125 PetriNetUnfolderBase]: For 66/66 co-relation queries the response was YES. [2025-03-13 21:58:44,826 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 5319 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-13 21:58:44,831 INFO L140 encePairwiseOnDemand]: 241/244 looper letters, 13 selfloop transitions, 2 changer transitions 0/225 dead transitions. [2025-03-13 21:58:44,831 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 225 transitions, 508 flow [2025-03-13 21:58:44,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:58:44,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:58:44,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 664 transitions. [2025-03-13 21:58:44,833 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.907103825136612 [2025-03-13 21:58:44,833 INFO L175 Difference]: Start difference. First operand has 229 places, 224 transitions, 474 flow. Second operand 3 states and 664 transitions. [2025-03-13 21:58:44,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 225 transitions, 508 flow [2025-03-13 21:58:44,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 225 transitions, 496 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 21:58:44,836 INFO L231 Difference]: Finished difference. Result has 227 places, 225 transitions, 476 flow [2025-03-13 21:58:44,837 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-13 21:58:44,838 INFO L279 CegarLoopForPetriNet]: 235 programPoint places, -8 predicate places. [2025-03-13 21:58:44,838 INFO L471 AbstractCegarLoop]: Abstraction has has 227 places, 225 transitions, 476 flow [2025-03-13 21:58:44,838 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-13 21:58:44,838 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:58:44,838 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-13 21:58:44,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-13 21:58:44,838 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-13 21:58:44,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:58:44,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1212945267, now seen corresponding path program 1 times [2025-03-13 21:58:44,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:58:44,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690110948] [2025-03-13 21:58:44,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:58:44,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:58:44,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-13 21:58:44,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-13 21:58:44,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:58:44,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:58:44,886 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-13 21:58:44,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:58:44,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690110948] [2025-03-13 21:58:44,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690110948] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:58:44,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2009131927] [2025-03-13 21:58:44,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:58:44,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:58:44,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:58:44,889 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-13 21:58:44,892 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-13 21:58:44,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-13 21:58:44,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-13 21:58:44,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:58:44,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:58:44,965 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-13 21:58:44,966 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:58:44,995 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-13 21:58:44,995 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:58:45,027 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:58:45,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2009131927] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:58:45,028 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:58:45,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-13 21:58:45,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768285336] [2025-03-13 21:58:45,028 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:58:45,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-13 21:58:45,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:58:45,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-13 21:58:45,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-13 21:58:45,093 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 244 [2025-03-13 21:58:45,094 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-13 21:58:45,094 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:58:45,094 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 244 [2025-03-13 21:58:45,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:58:45,219 INFO L124 PetriNetUnfolderBase]: 69/954 cut-off events. [2025-03-13 21:58:45,219 INFO L125 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2025-03-13 21:58:45,224 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 5295 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-13 21:58:45,227 INFO L140 encePairwiseOnDemand]: 238/244 looper letters, 17 selfloop transitions, 9 changer transitions 0/233 dead transitions. [2025-03-13 21:58:45,228 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 233 transitions, 546 flow [2025-03-13 21:58:45,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-13 21:58:45,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-13 21:58:45,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1945 transitions. [2025-03-13 21:58:45,231 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8857012750455373 [2025-03-13 21:58:45,231 INFO L175 Difference]: Start difference. First operand has 227 places, 225 transitions, 476 flow. Second operand 9 states and 1945 transitions. [2025-03-13 21:58:45,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 233 transitions, 546 flow [2025-03-13 21:58:45,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 233 transitions, 544 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 21:58:45,234 INFO L231 Difference]: Finished difference. Result has 237 places, 231 transitions, 524 flow [2025-03-13 21:58:45,234 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-13 21:58:45,235 INFO L279 CegarLoopForPetriNet]: 235 programPoint places, 2 predicate places. [2025-03-13 21:58:45,235 INFO L471 AbstractCegarLoop]: Abstraction has has 237 places, 231 transitions, 524 flow [2025-03-13 21:58:45,235 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-13 21:58:45,235 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:58:45,236 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-13 21:58:45,241 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-13 21:58:45,439 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-13 21:58:45,439 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-13 21:58:45,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:58:45,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1309776339, now seen corresponding path program 2 times [2025-03-13 21:58:45,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:58:45,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140915478] [2025-03-13 21:58:45,440 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:58:45,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:58:45,447 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 89 statements into 2 equivalence classes. [2025-03-13 21:58:45,452 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 89 of 89 statements. [2025-03-13 21:58:45,452 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:58:45,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:58:45,534 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-13 21:58:45,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:58:45,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140915478] [2025-03-13 21:58:45,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140915478] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:58:45,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1051816581] [2025-03-13 21:58:45,534 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:58:45,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:58:45,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:58:45,536 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-13 21:58:45,537 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-13 21:58:45,593 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 89 statements into 2 equivalence classes. [2025-03-13 21:58:45,615 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 89 of 89 statements. [2025-03-13 21:58:45,615 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:58:45,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:58:45,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-13 21:58:45,617 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:58:45,689 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-13 21:58:45,690 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:58:45,767 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-13 21:58:45,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1051816581] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:58:45,767 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:58:45,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2025-03-13 21:58:45,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456853574] [2025-03-13 21:58:45,768 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:58:45,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-13 21:58:45,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:58:45,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-13 21:58:45,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-13 21:58:45,839 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 244 [2025-03-13 21:58:45,841 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-13 21:58:45,841 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:58:45,841 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 244 [2025-03-13 21:58:45,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:58:46,045 INFO L124 PetriNetUnfolderBase]: 69/993 cut-off events. [2025-03-13 21:58:46,045 INFO L125 PetriNetUnfolderBase]: For 87/87 co-relation queries the response was YES. [2025-03-13 21:58:46,050 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 5301 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-13 21:58:46,054 INFO L140 encePairwiseOnDemand]: 238/244 looper letters, 20 selfloop transitions, 18 changer transitions 0/245 dead transitions. [2025-03-13 21:58:46,054 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 245 transitions, 674 flow [2025-03-13 21:58:46,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-13 21:58:46,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-13 21:58:46,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 3875 transitions. [2025-03-13 21:58:46,060 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8822859744990893 [2025-03-13 21:58:46,060 INFO L175 Difference]: Start difference. First operand has 237 places, 231 transitions, 524 flow. Second operand 18 states and 3875 transitions. [2025-03-13 21:58:46,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 245 transitions, 674 flow [2025-03-13 21:58:46,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 245 transitions, 662 flow, removed 5 selfloop flow, removed 1 redundant places. [2025-03-13 21:58:46,067 INFO L231 Difference]: Finished difference. Result has 257 places, 241 transitions, 624 flow [2025-03-13 21:58:46,067 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-13 21:58:46,067 INFO L279 CegarLoopForPetriNet]: 235 programPoint places, 22 predicate places. [2025-03-13 21:58:46,067 INFO L471 AbstractCegarLoop]: Abstraction has has 257 places, 241 transitions, 624 flow [2025-03-13 21:58:46,068 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-13 21:58:46,068 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:58:46,069 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-13 21:58:46,075 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-13 21:58:46,269 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-13 21:58:46,269 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-13 21:58:46,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:58:46,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1050297550, now seen corresponding path program 3 times [2025-03-13 21:58:46,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:58:46,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643961438] [2025-03-13 21:58:46,270 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:58:46,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:58:46,282 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 128 statements into 7 equivalence classes. [2025-03-13 21:58:46,304 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 128 of 128 statements. [2025-03-13 21:58:46,304 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-03-13 21:58:46,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 21:58:46,304 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-13 21:58:46,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-13 21:58:46,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-13 21:58:46,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:58:46,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 21:58:46,322 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-13 21:58:46,322 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-13 21:58:46,323 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (17 of 18 remaining) [2025-03-13 21:58:46,323 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (16 of 18 remaining) [2025-03-13 21:58:46,323 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (15 of 18 remaining) [2025-03-13 21:58:46,323 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (14 of 18 remaining) [2025-03-13 21:58:46,323 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (13 of 18 remaining) [2025-03-13 21:58:46,323 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (12 of 18 remaining) [2025-03-13 21:58:46,323 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (11 of 18 remaining) [2025-03-13 21:58:46,323 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (10 of 18 remaining) [2025-03-13 21:58:46,323 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (9 of 18 remaining) [2025-03-13 21:58:46,323 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (8 of 18 remaining) [2025-03-13 21:58:46,323 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (7 of 18 remaining) [2025-03-13 21:58:46,323 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (6 of 18 remaining) [2025-03-13 21:58:46,323 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (5 of 18 remaining) [2025-03-13 21:58:46,323 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (4 of 18 remaining) [2025-03-13 21:58:46,323 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (3 of 18 remaining) [2025-03-13 21:58:46,323 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (2 of 18 remaining) [2025-03-13 21:58:46,323 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 18 remaining) [2025-03-13 21:58:46,323 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 18 remaining) [2025-03-13 21:58:46,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-13 21:58:46,323 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1] [2025-03-13 21:58:46,324 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-13 21:58:46,324 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-03-13 21:58:46,347 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-13 21:58:46,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 296 places, 308 transitions, 644 flow [2025-03-13 21:58:46,392 INFO L124 PetriNetUnfolderBase]: 21/342 cut-off events. [2025-03-13 21:58:46,392 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-13 21:58:46,394 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 1104 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-13 21:58:46,394 INFO L82 GeneralOperation]: Start removeDead. Operand has 296 places, 308 transitions, 644 flow [2025-03-13 21:58:46,396 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 296 places, 308 transitions, 644 flow [2025-03-13 21:58:46,397 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 21:58:46,397 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;@32d439fa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 21:58:46,397 INFO L334 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2025-03-13 21:58:46,399 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 21:58:46,399 INFO L124 PetriNetUnfolderBase]: 0/50 cut-off events. [2025-03-13 21:58:46,399 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 21:58:46,399 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:58:46,399 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-13 21:58:46,399 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-13 21:58:46,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:58:46,399 INFO L85 PathProgramCache]: Analyzing trace with hash -2059893275, now seen corresponding path program 1 times [2025-03-13 21:58:46,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:58:46,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293892927] [2025-03-13 21:58:46,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:58:46,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:58:46,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-13 21:58:46,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-13 21:58:46,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:58:46,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:58:46,508 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-13 21:58:46,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:58:46,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293892927] [2025-03-13 21:58:46,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293892927] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:58:46,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:58:46,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:58:46,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200175593] [2025-03-13 21:58:46,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:58:46,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 21:58:46,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:58:46,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 21:58:46,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 21:58:46,697 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 250 out of 308 [2025-03-13 21:58:46,699 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-13 21:58:46,699 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:58:46,699 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 250 of 308 [2025-03-13 21:58:46,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:58:49,874 INFO L124 PetriNetUnfolderBase]: 8893/30356 cut-off events. [2025-03-13 21:58:49,874 INFO L125 PetriNetUnfolderBase]: For 3794/3794 co-relation queries the response was YES. [2025-03-13 21:58:49,980 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 380021 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-13 21:58:50,134 INFO L140 encePairwiseOnDemand]: 289/308 looper letters, 34 selfloop transitions, 5 changer transitions 0/283 dead transitions. [2025-03-13 21:58:50,134 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 283 transitions, 672 flow [2025-03-13 21:58:50,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:58:50,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:58:50,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1553 transitions. [2025-03-13 21:58:50,138 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8403679653679653 [2025-03-13 21:58:50,138 INFO L175 Difference]: Start difference. First operand has 296 places, 308 transitions, 644 flow. Second operand 6 states and 1553 transitions. [2025-03-13 21:58:50,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 283 transitions, 672 flow [2025-03-13 21:58:50,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 283 transitions, 666 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-03-13 21:58:50,144 INFO L231 Difference]: Finished difference. Result has 288 places, 283 transitions, 598 flow [2025-03-13 21:58:50,144 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-13 21:58:50,147 INFO L279 CegarLoopForPetriNet]: 296 programPoint places, -8 predicate places. [2025-03-13 21:58:50,147 INFO L471 AbstractCegarLoop]: Abstraction has has 288 places, 283 transitions, 598 flow [2025-03-13 21:58:50,147 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-13 21:58:50,147 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:58:50,148 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-13 21:58:50,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-13 21:58:50,148 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-13 21:58:50,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:58:50,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1492154955, now seen corresponding path program 1 times [2025-03-13 21:58:50,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:58:50,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95545588] [2025-03-13 21:58:50,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:58:50,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:58:50,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-13 21:58:50,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-13 21:58:50,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:58:50,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:58:50,176 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-13 21:58:50,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:58:50,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95545588] [2025-03-13 21:58:50,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95545588] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:58:50,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:58:50,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 21:58:50,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014635742] [2025-03-13 21:58:50,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:58:50,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:58:50,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:58:50,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:58:50,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:58:50,195 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 273 out of 308 [2025-03-13 21:58:50,196 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-13 21:58:50,196 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:58:50,196 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 273 of 308 [2025-03-13 21:58:50,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:58:50,694 INFO L124 PetriNetUnfolderBase]: 285/2847 cut-off events. [2025-03-13 21:58:50,695 INFO L125 PetriNetUnfolderBase]: For 282/282 co-relation queries the response was YES. [2025-03-13 21:58:50,721 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 23884 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-13 21:58:50,733 INFO L140 encePairwiseOnDemand]: 305/308 looper letters, 16 selfloop transitions, 2 changer transitions 0/284 dead transitions. [2025-03-13 21:58:50,733 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 284 transitions, 638 flow [2025-03-13 21:58:50,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:58:50,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:58:50,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 838 transitions. [2025-03-13 21:58:50,740 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9069264069264069 [2025-03-13 21:58:50,740 INFO L175 Difference]: Start difference. First operand has 288 places, 283 transitions, 598 flow. Second operand 3 states and 838 transitions. [2025-03-13 21:58:50,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 290 places, 284 transitions, 638 flow [2025-03-13 21:58:50,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 284 transitions, 626 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 21:58:50,749 INFO L231 Difference]: Finished difference. Result has 286 places, 284 transitions, 600 flow [2025-03-13 21:58:50,750 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-13 21:58:50,751 INFO L279 CegarLoopForPetriNet]: 296 programPoint places, -10 predicate places. [2025-03-13 21:58:50,751 INFO L471 AbstractCegarLoop]: Abstraction has has 286 places, 284 transitions, 600 flow [2025-03-13 21:58:50,755 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-13 21:58:50,755 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:58:50,756 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-13 21:58:50,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-13 21:58:50,756 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-13 21:58:50,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:58:50,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1207964642, now seen corresponding path program 1 times [2025-03-13 21:58:50,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:58:50,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013379409] [2025-03-13 21:58:50,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:58:50,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:58:50,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-13 21:58:50,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-13 21:58:50,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:58:50,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:58:50,843 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-13 21:58:50,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:58:50,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013379409] [2025-03-13 21:58:50,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013379409] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:58:50,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1336987981] [2025-03-13 21:58:50,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:58:50,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:58:50,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:58:50,847 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-13 21:58:50,848 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-13 21:58:50,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-13 21:58:51,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-13 21:58:51,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:58:51,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:58:51,007 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-13 21:58:51,009 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:58:51,050 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-13 21:58:51,053 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:58:51,091 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-13 21:58:51,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1336987981] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:58:51,092 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:58:51,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-13 21:58:51,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555903280] [2025-03-13 21:58:51,092 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:58:51,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-13 21:58:51,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:58:51,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-13 21:58:51,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-13 21:58:51,143 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 270 out of 308 [2025-03-13 21:58:51,145 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-13 21:58:51,145 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:58:51,145 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 270 of 308 [2025-03-13 21:58:51,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:58:51,591 INFO L124 PetriNetUnfolderBase]: 285/2862 cut-off events. [2025-03-13 21:58:51,592 INFO L125 PetriNetUnfolderBase]: For 281/281 co-relation queries the response was YES. [2025-03-13 21:58:51,613 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 23829 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-13 21:58:51,626 INFO L140 encePairwiseOnDemand]: 302/308 looper letters, 20 selfloop transitions, 9 changer transitions 0/292 dead transitions. [2025-03-13 21:58:51,626 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 292 transitions, 676 flow [2025-03-13 21:58:51,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-13 21:58:51,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-13 21:58:51,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2461 transitions. [2025-03-13 21:58:51,629 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8878066378066378 [2025-03-13 21:58:51,629 INFO L175 Difference]: Start difference. First operand has 286 places, 284 transitions, 600 flow. Second operand 9 states and 2461 transitions. [2025-03-13 21:58:51,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 292 transitions, 676 flow [2025-03-13 21:58:51,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 293 places, 292 transitions, 674 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 21:58:51,634 INFO L231 Difference]: Finished difference. Result has 296 places, 290 transitions, 648 flow [2025-03-13 21:58:51,635 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-13 21:58:51,635 INFO L279 CegarLoopForPetriNet]: 296 programPoint places, 0 predicate places. [2025-03-13 21:58:51,635 INFO L471 AbstractCegarLoop]: Abstraction has has 296 places, 290 transitions, 648 flow [2025-03-13 21:58:51,636 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-13 21:58:51,636 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:58:51,637 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-13 21:58:51,643 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-13 21:58:51,837 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-13 21:58:51,838 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-13 21:58:51,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:58:51,839 INFO L85 PathProgramCache]: Analyzing trace with hash 966936894, now seen corresponding path program 2 times [2025-03-13 21:58:51,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:58:51,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986394927] [2025-03-13 21:58:51,839 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:58:51,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:58:51,852 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 95 statements into 2 equivalence classes. [2025-03-13 21:58:51,862 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 95 of 95 statements. [2025-03-13 21:58:51,862 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:58:51,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:58:51,959 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-13 21:58:51,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:58:51,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986394927] [2025-03-13 21:58:51,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986394927] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:58:51,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1562447573] [2025-03-13 21:58:51,960 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:58:51,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:58:51,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:58:51,962 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-13 21:58:51,964 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-13 21:58:52,040 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 95 statements into 2 equivalence classes. [2025-03-13 21:58:52,064 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 95 of 95 statements. [2025-03-13 21:58:52,064 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:58:52,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:58:52,068 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-13 21:58:52,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:58:52,124 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-13 21:58:52,124 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:58:52,212 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-13 21:58:52,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1562447573] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:58:52,213 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:58:52,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2025-03-13 21:58:52,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453784538] [2025-03-13 21:58:52,213 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:58:52,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-13 21:58:52,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:58:52,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-13 21:58:52,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-13 21:58:52,313 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 270 out of 308 [2025-03-13 21:58:52,316 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-13 21:58:52,317 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:58:52,317 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 270 of 308 [2025-03-13 21:58:52,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:58:52,824 INFO L124 PetriNetUnfolderBase]: 285/2901 cut-off events. [2025-03-13 21:58:52,824 INFO L125 PetriNetUnfolderBase]: For 303/303 co-relation queries the response was YES. [2025-03-13 21:58:52,846 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 23926 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-13 21:58:52,856 INFO L140 encePairwiseOnDemand]: 302/308 looper letters, 23 selfloop transitions, 18 changer transitions 0/304 dead transitions. [2025-03-13 21:58:52,856 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 304 transitions, 804 flow [2025-03-13 21:58:52,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-13 21:58:52,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-13 21:58:52,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 4904 transitions. [2025-03-13 21:58:52,859 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8845598845598845 [2025-03-13 21:58:52,859 INFO L175 Difference]: Start difference. First operand has 296 places, 290 transitions, 648 flow. Second operand 18 states and 4904 transitions. [2025-03-13 21:58:52,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 304 transitions, 804 flow [2025-03-13 21:58:52,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 304 transitions, 792 flow, removed 5 selfloop flow, removed 1 redundant places. [2025-03-13 21:58:52,863 INFO L231 Difference]: Finished difference. Result has 316 places, 300 transitions, 748 flow [2025-03-13 21:58:52,863 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-13 21:58:52,864 INFO L279 CegarLoopForPetriNet]: 296 programPoint places, 20 predicate places. [2025-03-13 21:58:52,864 INFO L471 AbstractCegarLoop]: Abstraction has has 316 places, 300 transitions, 748 flow [2025-03-13 21:58:52,865 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-13 21:58:52,865 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:58:52,865 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-13 21:58:52,871 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-13 21:58:53,065 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-13 21:58:53,066 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-13 21:58:53,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:58:53,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1391436053, now seen corresponding path program 3 times [2025-03-13 21:58:53,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:58:53,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852334103] [2025-03-13 21:58:53,066 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:58:53,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:58:53,081 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 134 statements into 8 equivalence classes. [2025-03-13 21:58:53,110 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 134 of 134 statements. [2025-03-13 21:58:53,110 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-03-13 21:58:53,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 21:58:53,110 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-13 21:58:53,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-13 21:58:53,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-13 21:58:53,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:58:53,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 21:58:53,134 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-13 21:58:53,134 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-13 21:58:53,135 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (21 of 22 remaining) [2025-03-13 21:58:53,135 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (20 of 22 remaining) [2025-03-13 21:58:53,135 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (19 of 22 remaining) [2025-03-13 21:58:53,135 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (18 of 22 remaining) [2025-03-13 21:58:53,135 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (17 of 22 remaining) [2025-03-13 21:58:53,135 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (16 of 22 remaining) [2025-03-13 21:58:53,135 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (15 of 22 remaining) [2025-03-13 21:58:53,135 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (14 of 22 remaining) [2025-03-13 21:58:53,135 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (13 of 22 remaining) [2025-03-13 21:58:53,135 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (12 of 22 remaining) [2025-03-13 21:58:53,135 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (11 of 22 remaining) [2025-03-13 21:58:53,135 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (10 of 22 remaining) [2025-03-13 21:58:53,135 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (9 of 22 remaining) [2025-03-13 21:58:53,135 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (8 of 22 remaining) [2025-03-13 21:58:53,135 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (7 of 22 remaining) [2025-03-13 21:58:53,135 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (6 of 22 remaining) [2025-03-13 21:58:53,135 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (5 of 22 remaining) [2025-03-13 21:58:53,135 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (4 of 22 remaining) [2025-03-13 21:58:53,135 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (3 of 22 remaining) [2025-03-13 21:58:53,135 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (2 of 22 remaining) [2025-03-13 21:58:53,135 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 22 remaining) [2025-03-13 21:58:53,135 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 22 remaining) [2025-03-13 21:58:53,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-13 21:58:53,136 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1] [2025-03-13 21:58:53,136 WARN L246 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-13 21:58:53,136 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2025-03-13 21:58:53,170 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-13 21:58:53,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 357 places, 372 transitions, 784 flow [2025-03-13 21:58:53,205 INFO L124 PetriNetUnfolderBase]: 26/415 cut-off events. [2025-03-13 21:58:53,205 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-03-13 21:58:53,210 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 1492 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-13 21:58:53,210 INFO L82 GeneralOperation]: Start removeDead. Operand has 357 places, 372 transitions, 784 flow [2025-03-13 21:58:53,213 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 357 places, 372 transitions, 784 flow [2025-03-13 21:58:53,214 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 21:58:53,214 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;@32d439fa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 21:58:53,214 INFO L334 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2025-03-13 21:58:53,216 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 21:58:53,216 INFO L124 PetriNetUnfolderBase]: 0/50 cut-off events. [2025-03-13 21:58:53,216 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 21:58:53,216 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:58:53,216 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-13 21:58:53,216 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-13 21:58:53,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:58:53,216 INFO L85 PathProgramCache]: Analyzing trace with hash -1927986983, now seen corresponding path program 1 times [2025-03-13 21:58:53,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:58:53,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083315333] [2025-03-13 21:58:53,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:58:53,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:58:53,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-13 21:58:53,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-13 21:58:53,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:58:53,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:58:53,341 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-13 21:58:53,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:58:53,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083315333] [2025-03-13 21:58:53,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083315333] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:58:53,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:58:53,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:58:53,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44055632] [2025-03-13 21:58:53,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:58:53,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 21:58:53,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:58:53,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 21:58:53,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 21:58:53,501 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 303 out of 372 [2025-03-13 21:58:53,502 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-13 21:58:53,502 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:58:53,502 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 303 of 372 [2025-03-13 21:58:53,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:59:20,228 INFO L124 PetriNetUnfolderBase]: 81869/231410 cut-off events. [2025-03-13 21:59:20,228 INFO L125 PetriNetUnfolderBase]: For 40121/40121 co-relation queries the response was YES. [2025-03-13 21:59:22,544 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 3527804 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-13 21:59:24,175 INFO L140 encePairwiseOnDemand]: 350/372 looper letters, 41 selfloop transitions, 5 changer transitions 0/342 dead transitions. [2025-03-13 21:59:24,175 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 347 places, 342 transitions, 816 flow [2025-03-13 21:59:24,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:59:24,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:59:24,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1881 transitions. [2025-03-13 21:59:24,177 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.842741935483871 [2025-03-13 21:59:24,177 INFO L175 Difference]: Start difference. First operand has 357 places, 372 transitions, 784 flow. Second operand 6 states and 1881 transitions. [2025-03-13 21:59:24,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 347 places, 342 transitions, 816 flow [2025-03-13 21:59:24,186 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 347 places, 342 transitions, 804 flow, removed 6 selfloop flow, removed 0 redundant places. [2025-03-13 21:59:24,189 INFO L231 Difference]: Finished difference. Result has 347 places, 342 transitions, 722 flow [2025-03-13 21:59:24,189 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-13 21:59:24,190 INFO L279 CegarLoopForPetriNet]: 357 programPoint places, -10 predicate places. [2025-03-13 21:59:24,190 INFO L471 AbstractCegarLoop]: Abstraction has has 347 places, 342 transitions, 722 flow [2025-03-13 21:59:24,191 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-13 21:59:24,191 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:59:24,191 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-13 21:59:24,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-13 21:59:24,191 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-13 21:59:24,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:59:24,192 INFO L85 PathProgramCache]: Analyzing trace with hash 368515997, now seen corresponding path program 1 times [2025-03-13 21:59:24,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:59:24,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949779548] [2025-03-13 21:59:24,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:59:24,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:59:24,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-13 21:59:24,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-13 21:59:24,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:59:24,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:59:24,239 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-13 21:59:24,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:59:24,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949779548] [2025-03-13 21:59:24,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949779548] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:59:24,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:59:24,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 21:59:24,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712793759] [2025-03-13 21:59:24,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:59:24,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:59:24,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:59:24,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:59:24,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:59:24,256 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 330 out of 372 [2025-03-13 21:59:24,257 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-13 21:59:24,257 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:59:24,257 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 330 of 372 [2025-03-13 21:59:24,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:59:25,394 INFO L124 PetriNetUnfolderBase]: 1095/8733 cut-off events. [2025-03-13 21:59:25,395 INFO L125 PetriNetUnfolderBase]: For 1173/1173 co-relation queries the response was YES. [2025-03-13 21:59:25,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10334 conditions, 8733 events. 1095/8733 cut-off events. For 1173/1173 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 96169 event pairs, 852 based on Foata normal form. 1/7708 useless extension candidates. Maximal degree in co-relation 10268. Up to 1221 conditions per place. [2025-03-13 21:59:25,562 INFO L140 encePairwiseOnDemand]: 369/372 looper letters, 19 selfloop transitions, 2 changer transitions 0/343 dead transitions. [2025-03-13 21:59:25,562 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 349 places, 343 transitions, 768 flow [2025-03-13 21:59:25,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:59:25,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:59:25,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1012 transitions. [2025-03-13 21:59:25,563 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9068100358422939 [2025-03-13 21:59:25,563 INFO L175 Difference]: Start difference. First operand has 347 places, 342 transitions, 722 flow. Second operand 3 states and 1012 transitions. [2025-03-13 21:59:25,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 349 places, 343 transitions, 768 flow [2025-03-13 21:59:25,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 344 places, 343 transitions, 756 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 21:59:25,575 INFO L231 Difference]: Finished difference. Result has 345 places, 343 transitions, 724 flow [2025-03-13 21:59:25,576 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=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=340, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=724, PETRI_PLACES=345, PETRI_TRANSITIONS=343} [2025-03-13 21:59:25,576 INFO L279 CegarLoopForPetriNet]: 357 programPoint places, -12 predicate places. [2025-03-13 21:59:25,576 INFO L471 AbstractCegarLoop]: Abstraction has has 345 places, 343 transitions, 724 flow [2025-03-13 21:59:25,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has 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-13 21:59:25,577 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:59:25,577 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:59:25,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-13 21:59:25,577 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err3ASSERT_VIOLATIONDATA_RACE === [thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-13 21:59:25,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:59:25,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1683147748, now seen corresponding path program 1 times [2025-03-13 21:59:25,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:59:25,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565204218] [2025-03-13 21:59:25,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:59:25,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:59:25,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-13 21:59:25,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-13 21:59:25,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:59:25,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:59:25,631 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-13 21:59:25,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:59:25,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565204218] [2025-03-13 21:59:25,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565204218] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:59:25,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [662008179] [2025-03-13 21:59:25,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:59:25,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:59:25,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:59:25,634 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:59:25,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-13 21:59:25,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-13 21:59:25,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-13 21:59:25,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:59:25,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:59:25,735 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-13 21:59:25,736 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:59:25,759 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-13 21:59:25,760 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:59:25,790 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-13 21:59:25,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [662008179] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:59:25,791 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:59:25,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-13 21:59:25,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306899659] [2025-03-13 21:59:25,791 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:59:25,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-13 21:59:25,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:59:25,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-13 21:59:25,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-13 21:59:25,840 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 327 out of 372 [2025-03-13 21:59:25,842 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 345 places, 343 transitions, 724 flow. Second operand has 10 states, 10 states have (on average 328.9) internal successors, (3289), 10 states have internal predecessors, (3289), 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-13 21:59:25,842 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:59:25,843 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 327 of 372 [2025-03-13 21:59:25,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:59:27,030 INFO L124 PetriNetUnfolderBase]: 1095/8748 cut-off events. [2025-03-13 21:59:27,031 INFO L125 PetriNetUnfolderBase]: For 1172/1172 co-relation queries the response was YES. [2025-03-13 21:59:27,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10357 conditions, 8748 events. 1095/8748 cut-off events. For 1172/1172 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 96438 event pairs, 852 based on Foata normal form. 2/7724 useless extension candidates. Maximal degree in co-relation 10303. Up to 1221 conditions per place. [2025-03-13 21:59:27,161 INFO L140 encePairwiseOnDemand]: 366/372 looper letters, 23 selfloop transitions, 9 changer transitions 0/351 dead transitions. [2025-03-13 21:59:27,161 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 353 places, 351 transitions, 806 flow [2025-03-13 21:59:27,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-13 21:59:27,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-13 21:59:27,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2977 transitions. [2025-03-13 21:59:27,164 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8891875746714456 [2025-03-13 21:59:27,164 INFO L175 Difference]: Start difference. First operand has 345 places, 343 transitions, 724 flow. Second operand 9 states and 2977 transitions. [2025-03-13 21:59:27,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 353 places, 351 transitions, 806 flow [2025-03-13 21:59:27,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 352 places, 351 transitions, 804 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 21:59:27,169 INFO L231 Difference]: Finished difference. Result has 355 places, 349 transitions, 772 flow [2025-03-13 21:59:27,170 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=372, PETRI_DIFFERENCE_MINUEND_FLOW=722, PETRI_DIFFERENCE_MINUEND_PLACES=344, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=343, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=337, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=772, PETRI_PLACES=355, PETRI_TRANSITIONS=349} [2025-03-13 21:59:27,170 INFO L279 CegarLoopForPetriNet]: 357 programPoint places, -2 predicate places. [2025-03-13 21:59:27,170 INFO L471 AbstractCegarLoop]: Abstraction has has 355 places, 349 transitions, 772 flow [2025-03-13 21:59:27,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 328.9) internal successors, (3289), 10 states have internal predecessors, (3289), 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-13 21:59:27,171 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:59:27,171 INFO L206 CegarLoopForPetriNet]: trace histogram [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, 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-13 21:59:27,178 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-13 21:59:27,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:59:27,372 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err3ASSERT_VIOLATIONDATA_RACE === [thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-13 21:59:27,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:59:27,373 INFO L85 PathProgramCache]: Analyzing trace with hash 76766340, now seen corresponding path program 2 times [2025-03-13 21:59:27,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:59:27,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221567022] [2025-03-13 21:59:27,373 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:59:27,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:59:27,381 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 95 statements into 2 equivalence classes. [2025-03-13 21:59:27,386 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 56 of 95 statements. [2025-03-13 21:59:27,386 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 21:59:27,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:59:27,528 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-03-13 21:59:27,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:59:27,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221567022] [2025-03-13 21:59:27,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221567022] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:59:27,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:59:27,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:59:27,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689028573] [2025-03-13 21:59:27,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:59:27,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 21:59:27,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:59:27,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 21:59:27,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 21:59:27,833 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 320 out of 372 [2025-03-13 21:59:27,835 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 355 places, 349 transitions, 772 flow. Second operand has 6 states, 6 states have (on average 322.3333333333333) internal successors, (1934), 6 states have internal predecessors, (1934), 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-13 21:59:27,835 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:59:27,835 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 320 of 372 [2025-03-13 21:59:27,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:59:31,593 INFO L124 PetriNetUnfolderBase]: 4695/23348 cut-off events. [2025-03-13 21:59:31,593 INFO L125 PetriNetUnfolderBase]: For 3186/3186 co-relation queries the response was YES. [2025-03-13 21:59:31,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30624 conditions, 23348 events. 4695/23348 cut-off events. For 3186/3186 co-relation queries the response was YES. Maximal size of possible extension queue 605. Compared 300492 event pairs, 1824 based on Foata normal form. 0/20471 useless extension candidates. Maximal degree in co-relation 30513. Up to 2564 conditions per place. [2025-03-13 21:59:32,118 INFO L140 encePairwiseOnDemand]: 366/372 looper letters, 73 selfloop transitions, 5 changer transitions 0/396 dead transitions. [2025-03-13 21:59:32,118 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 359 places, 396 transitions, 1102 flow [2025-03-13 21:59:32,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:59:32,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:59:32,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1999 transitions. [2025-03-13 21:59:32,120 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8956093189964157 [2025-03-13 21:59:32,120 INFO L175 Difference]: Start difference. First operand has 355 places, 349 transitions, 772 flow. Second operand 6 states and 1999 transitions. [2025-03-13 21:59:32,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 359 places, 396 transitions, 1102 flow [2025-03-13 21:59:32,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 358 places, 396 transitions, 1096 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-13 21:59:32,128 INFO L231 Difference]: Finished difference. Result has 358 places, 348 transitions, 774 flow [2025-03-13 21:59:32,128 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=372, PETRI_DIFFERENCE_MINUEND_FLOW=764, PETRI_DIFFERENCE_MINUEND_PLACES=353, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=348, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=343, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=774, PETRI_PLACES=358, PETRI_TRANSITIONS=348} [2025-03-13 21:59:32,128 INFO L279 CegarLoopForPetriNet]: 357 programPoint places, 1 predicate places. [2025-03-13 21:59:32,128 INFO L471 AbstractCegarLoop]: Abstraction has has 358 places, 348 transitions, 774 flow [2025-03-13 21:59:32,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 322.3333333333333) internal successors, (1934), 6 states have internal predecessors, (1934), 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-13 21:59:32,129 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:59:32,129 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 5, 5, 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, 1] [2025-03-13 21:59:32,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-13 21:59:32,130 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-13 21:59:32,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:59:32,130 INFO L85 PathProgramCache]: Analyzing trace with hash -117088434, now seen corresponding path program 1 times [2025-03-13 21:59:32,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:59:32,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633780085] [2025-03-13 21:59:32,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:59:32,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:59:32,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-13 21:59:32,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-13 21:59:32,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:59:32,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:59:32,216 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-13 21:59:32,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:59:32,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633780085] [2025-03-13 21:59:32,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633780085] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:59:32,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [68555607] [2025-03-13 21:59:32,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:59:32,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:59:32,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:59:32,218 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:59:32,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-13 21:59:32,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-13 21:59:32,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-13 21:59:32,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:59:32,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:59:32,327 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-13 21:59:32,329 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:59:32,377 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-13 21:59:32,378 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:59:32,449 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-13 21:59:32,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [68555607] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:59:32,449 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:59:32,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2025-03-13 21:59:32,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20093243] [2025-03-13 21:59:32,450 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:59:32,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-13 21:59:32,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:59:32,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-13 21:59:32,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-13 21:59:32,522 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 327 out of 372 [2025-03-13 21:59:32,524 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 358 places, 348 transitions, 774 flow. Second operand has 15 states, 15 states have (on average 329.3333333333333) internal successors, (4940), 15 states have internal predecessors, (4940), 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-13 21:59:32,524 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:59:32,524 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 327 of 372 [2025-03-13 21:59:32,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand