./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-ext/11_fmaxsymopt-race.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 735b3cc8 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-ext/11_fmaxsymopt-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 c885fc256284ed3b5456c69b30daa307e14001acfa6c144983451f9519cbd1fd --- Real Ultimate output --- This is Ultimate 0.3.0-?-735b3cc-m [2025-03-14 01:17:51,138 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 01:17:51,191 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-14 01:17:51,194 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-14 01:17:51,196 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-14 01:17:51,219 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 01:17:51,219 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-14 01:17:51,220 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-14 01:17:51,220 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 01:17:51,220 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 01:17:51,221 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 01:17:51,221 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 01:17:51,221 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 01:17:51,221 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 01:17:51,221 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 01:17:51,222 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 01:17:51,222 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 01:17:51,222 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 01:17:51,222 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 01:17:51,222 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 01:17:51,222 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 01:17:51,222 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 01:17:51,222 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-14 01:17:51,222 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-14 01:17:51,222 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 01:17:51,223 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 01:17:51,223 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-14 01:17:51,223 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 01:17:51,223 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-14 01:17:51,223 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 01:17:51,223 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 01:17:51,223 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:17:51,223 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 01:17:51,223 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 01:17:51,224 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-14 01:17:51,224 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-14 01:17:51,224 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 01:17:51,224 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 01:17:51,224 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 01:17:51,224 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 01:17:51,224 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-14 01:17:51,224 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-14 01:17:51,224 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 -> c885fc256284ed3b5456c69b30daa307e14001acfa6c144983451f9519cbd1fd [2025-03-14 01:17:51,458 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 01:17:51,468 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 01:17:51,469 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 01:17:51,470 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 01:17:51,470 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 01:17:51,472 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/11_fmaxsymopt-race.i [2025-03-14 01:17:52,586 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b82aecf68/d213e807db7b4acda92fc8a79794d3a0/FLAG066a02c96 [2025-03-14 01:17:52,841 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 01:17:52,843 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/11_fmaxsymopt-race.i [2025-03-14 01:17:52,857 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b82aecf68/d213e807db7b4acda92fc8a79794d3a0/FLAG066a02c96 [2025-03-14 01:17:53,144 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b82aecf68/d213e807db7b4acda92fc8a79794d3a0 [2025-03-14 01:17:53,146 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 01:17:53,148 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-14 01:17:53,149 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 01:17:53,149 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 01:17:53,152 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 01:17:53,152 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:17:53" (1/1) ... [2025-03-14 01:17:53,153 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ab0f382 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:17:53, skipping insertion in model container [2025-03-14 01:17:53,153 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:17:53" (1/1) ... [2025-03-14 01:17:53,177 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 01:17:53,436 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:17:53,449 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 01:17:53,493 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:17:53,530 INFO L204 MainTranslator]: Completed translation [2025-03-14 01:17:53,532 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:17:53 WrapperNode [2025-03-14 01:17:53,533 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 01:17:53,534 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 01:17:53,534 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 01:17:53,534 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 01:17:53,539 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:17:53" (1/1) ... [2025-03-14 01:17:53,549 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:17:53" (1/1) ... [2025-03-14 01:17:53,566 INFO L138 Inliner]: procedures = 164, calls = 27, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 102 [2025-03-14 01:17:53,568 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 01:17:53,569 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 01:17:53,569 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 01:17:53,570 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 01:17:53,574 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:17:53" (1/1) ... [2025-03-14 01:17:53,574 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:17:53" (1/1) ... [2025-03-14 01:17:53,582 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:17:53" (1/1) ... [2025-03-14 01:17:53,582 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:17:53" (1/1) ... [2025-03-14 01:17:53,590 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:17:53" (1/1) ... [2025-03-14 01:17:53,592 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:17:53" (1/1) ... [2025-03-14 01:17:53,593 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:17:53" (1/1) ... [2025-03-14 01:17:53,594 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:17:53" (1/1) ... [2025-03-14 01:17:53,595 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 01:17:53,596 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-14 01:17:53,596 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-14 01:17:53,596 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-14 01:17:53,596 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:17:53" (1/1) ... [2025-03-14 01:17:53,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:17:53,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:17:53,627 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-14 01:17:53,629 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-14 01:17:53,644 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-14 01:17:53,644 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-03-14 01:17:53,644 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-03-14 01:17:53,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-14 01:17:53,644 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-14 01:17:53,644 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 01:17:53,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-14 01:17:53,644 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-14 01:17:53,645 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 01:17:53,645 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 01:17:53,645 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-14 01:17:53,748 INFO L256 CfgBuilder]: Building ICFG [2025-03-14 01:17:53,749 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 01:17:53,957 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 01:17:53,958 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 01:17:53,958 INFO L318 CfgBuilder]: Performing block encoding [2025-03-14 01:17:53,975 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 01:17:53,976 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:17:53 BoogieIcfgContainer [2025-03-14 01:17:53,976 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-14 01:17:53,978 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 01:17:53,978 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 01:17:53,981 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 01:17:53,982 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 01:17:53" (1/3) ... [2025-03-14 01:17:53,982 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66fcbdf8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:17:53, skipping insertion in model container [2025-03-14 01:17:53,982 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:17:53" (2/3) ... [2025-03-14 01:17:53,982 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66fcbdf8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:17:53, skipping insertion in model container [2025-03-14 01:17:53,982 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:17:53" (3/3) ... [2025-03-14 01:17:53,983 INFO L128 eAbstractionObserver]: Analyzing ICFG 11_fmaxsymopt-race.i [2025-03-14 01:17:53,994 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 01:17:53,996 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 11_fmaxsymopt-race.i that has 2 procedures, 114 locations, 1 initial locations, 3 loop locations, and 5 error locations. [2025-03-14 01:17:53,996 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 01:17:54,063 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-14 01:17:54,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 122 transitions, 248 flow [2025-03-14 01:17:54,127 INFO L124 PetriNetUnfolderBase]: 8/129 cut-off events. [2025-03-14 01:17:54,128 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:17:54,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133 conditions, 129 events. 8/129 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 194 event pairs, 0 based on Foata normal form. 0/114 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2025-03-14 01:17:54,132 INFO L82 GeneralOperation]: Start removeDead. Operand has 117 places, 122 transitions, 248 flow [2025-03-14 01:17:54,137 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 117 places, 122 transitions, 248 flow [2025-03-14 01:17:54,147 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:17:54,156 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;@1e16a559, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:17:54,157 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-03-14 01:17:54,168 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:17:54,168 INFO L124 PetriNetUnfolderBase]: 0/50 cut-off events. [2025-03-14 01:17:54,168 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:17:54,168 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:17:54,169 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-14 01:17:54,170 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-14 01:17:54,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:17:54,175 INFO L85 PathProgramCache]: Analyzing trace with hash 242270650, now seen corresponding path program 1 times [2025-03-14 01:17:54,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:17:54,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979578643] [2025-03-14 01:17:54,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:17:54,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:17:54,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-14 01:17:54,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-14 01:17:54,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:17:54,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:17:54,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:17:54,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:17:54,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979578643] [2025-03-14 01:17:54,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979578643] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:17:54,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:17:54,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:17:54,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50923282] [2025-03-14 01:17:54,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:17:54,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:17:54,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:17:54,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:17:54,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:17:55,009 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 122 [2025-03-14 01:17:55,011 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 122 transitions, 248 flow. Second operand has 6 states, 6 states have (on average 98.5) internal successors, (591), 6 states have internal predecessors, (591), 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-14 01:17:55,012 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:17:55,012 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 122 [2025-03-14 01:17:55,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:17:55,048 INFO L124 PetriNetUnfolderBase]: 5/115 cut-off events. [2025-03-14 01:17:55,049 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-14 01:17:55,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 115 events. 5/115 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 133 event pairs, 0 based on Foata normal form. 11/115 useless extension candidates. Maximal degree in co-relation 75. Up to 14 conditions per place. [2025-03-14 01:17:55,050 INFO L140 encePairwiseOnDemand]: 112/122 looper letters, 13 selfloop transitions, 5 changer transitions 0/112 dead transitions. [2025-03-14 01:17:55,050 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 112 transitions, 264 flow [2025-03-14 01:17:55,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:17:55,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:17:55,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 605 transitions. [2025-03-14 01:17:55,062 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8265027322404371 [2025-03-14 01:17:55,063 INFO L175 Difference]: Start difference. First operand has 117 places, 122 transitions, 248 flow. Second operand 6 states and 605 transitions. [2025-03-14 01:17:55,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 112 transitions, 264 flow [2025-03-14 01:17:55,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 112 transitions, 264 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:17:55,069 INFO L231 Difference]: Finished difference. Result has 115 places, 112 transitions, 238 flow [2025-03-14 01:17:55,071 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=238, PETRI_PLACES=115, PETRI_TRANSITIONS=112} [2025-03-14 01:17:55,074 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, -2 predicate places. [2025-03-14 01:17:55,074 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 112 transitions, 238 flow [2025-03-14 01:17:55,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 98.5) internal successors, (591), 6 states have internal predecessors, (591), 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-14 01:17:55,075 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:17:55,075 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-14 01:17:55,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 01:17:55,076 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-14 01:17:55,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:17:55,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1896431640, now seen corresponding path program 1 times [2025-03-14 01:17:55,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:17:55,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883021163] [2025-03-14 01:17:55,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:17:55,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:17:55,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-14 01:17:55,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-14 01:17:55,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:17:55,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:17:55,121 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-14 01:17:55,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:17:55,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883021163] [2025-03-14 01:17:55,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883021163] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:17:55,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:17:55,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 01:17:55,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294564726] [2025-03-14 01:17:55,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:17:55,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:17:55,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:17:55,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:17:55,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:17:55,142 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 122 [2025-03-14 01:17:55,143 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 112 transitions, 238 flow. Second operand has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 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-14 01:17:55,143 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:17:55,143 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 122 [2025-03-14 01:17:55,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:17:55,168 INFO L124 PetriNetUnfolderBase]: 5/127 cut-off events. [2025-03-14 01:17:55,169 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-14 01:17:55,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152 conditions, 127 events. 5/127 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 130 event pairs, 0 based on Foata normal form. 1/118 useless extension candidates. Maximal degree in co-relation 90. Up to 9 conditions per place. [2025-03-14 01:17:55,170 INFO L140 encePairwiseOnDemand]: 119/122 looper letters, 7 selfloop transitions, 2 changer transitions 0/113 dead transitions. [2025-03-14 01:17:55,170 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 113 transitions, 260 flow [2025-03-14 01:17:55,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:17:55,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:17:55,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 334 transitions. [2025-03-14 01:17:55,171 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.912568306010929 [2025-03-14 01:17:55,171 INFO L175 Difference]: Start difference. First operand has 115 places, 112 transitions, 238 flow. Second operand 3 states and 334 transitions. [2025-03-14 01:17:55,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 113 transitions, 260 flow [2025-03-14 01:17:55,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 113 transitions, 248 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:17:55,174 INFO L231 Difference]: Finished difference. Result has 113 places, 113 transitions, 240 flow [2025-03-14 01:17:55,174 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=240, PETRI_PLACES=113, PETRI_TRANSITIONS=113} [2025-03-14 01:17:55,175 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, -4 predicate places. [2025-03-14 01:17:55,175 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 113 transitions, 240 flow [2025-03-14 01:17:55,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 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-14 01:17:55,175 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:17:55,176 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-14 01:17:55,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-14 01:17:55,176 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-14 01:17:55,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:17:55,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1800088938, now seen corresponding path program 1 times [2025-03-14 01:17:55,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:17:55,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555881789] [2025-03-14 01:17:55,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:17:55,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:17:55,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-14 01:17:55,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-14 01:17:55,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:17:55,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:17:55,268 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-14 01:17:55,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:17:55,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555881789] [2025-03-14 01:17:55,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555881789] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:17:55,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1822801957] [2025-03-14 01:17:55,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:17:55,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:17:55,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:17:55,271 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-14 01:17:55,273 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-14 01:17:55,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-14 01:17:55,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-14 01:17:55,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:17:55,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:17:55,336 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-14 01:17:55,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:17:55,380 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:17:55,381 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:17:55,440 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-14 01:17:55,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1822801957] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:17:55,440 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:17:55,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-14 01:17:55,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680341699] [2025-03-14 01:17:55,441 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:17:55,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 01:17:55,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:17:55,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 01:17:55,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-14 01:17:55,526 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 122 [2025-03-14 01:17:55,527 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 113 transitions, 240 flow. Second operand has 10 states, 10 states have (on average 106.9) internal successors, (1069), 10 states have internal predecessors, (1069), 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-14 01:17:55,527 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:17:55,527 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 122 [2025-03-14 01:17:55,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:17:55,600 INFO L124 PetriNetUnfolderBase]: 5/142 cut-off events. [2025-03-14 01:17:55,601 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-14 01:17:55,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 175 conditions, 142 events. 5/142 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 102 event pairs, 0 based on Foata normal form. 2/134 useless extension candidates. Maximal degree in co-relation 125. Up to 9 conditions per place. [2025-03-14 01:17:55,602 INFO L140 encePairwiseOnDemand]: 116/122 looper letters, 11 selfloop transitions, 9 changer transitions 0/121 dead transitions. [2025-03-14 01:17:55,602 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 121 transitions, 298 flow [2025-03-14 01:17:55,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-14 01:17:55,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-14 01:17:55,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 967 transitions. [2025-03-14 01:17:55,607 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8806921675774135 [2025-03-14 01:17:55,607 INFO L175 Difference]: Start difference. First operand has 113 places, 113 transitions, 240 flow. Second operand 9 states and 967 transitions. [2025-03-14 01:17:55,607 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 121 transitions, 298 flow [2025-03-14 01:17:55,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 121 transitions, 296 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:17:55,610 INFO L231 Difference]: Finished difference. Result has 123 places, 119 transitions, 288 flow [2025-03-14 01:17:55,610 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=288, PETRI_PLACES=123, PETRI_TRANSITIONS=119} [2025-03-14 01:17:55,611 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, 6 predicate places. [2025-03-14 01:17:55,611 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 119 transitions, 288 flow [2025-03-14 01:17:55,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 106.9) internal successors, (1069), 10 states have internal predecessors, (1069), 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-14 01:17:55,612 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:17:55,612 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-14 01:17:55,619 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-14 01:17:55,816 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-14 01:17:55,816 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-14 01:17:55,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:17:55,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1402008106, now seen corresponding path program 2 times [2025-03-14 01:17:55,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:17:55,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220935466] [2025-03-14 01:17:55,817 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:17:55,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:17:55,828 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 77 statements into 2 equivalence classes. [2025-03-14 01:17:55,839 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 77 of 77 statements. [2025-03-14 01:17:55,839 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:17:55,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:17:55,987 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-14 01:17:55,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:17:55,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220935466] [2025-03-14 01:17:55,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220935466] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:17:55,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [193605439] [2025-03-14 01:17:55,988 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:17:55,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:17:55,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:17:55,990 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-14 01:17:55,991 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-14 01:17:56,034 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 77 statements into 2 equivalence classes. [2025-03-14 01:17:56,056 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 77 of 77 statements. [2025-03-14 01:17:56,057 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:17:56,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:17:56,058 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-14 01:17:56,059 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:17:56,127 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-14 01:17:56,128 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:17:56,246 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-14 01:17:56,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [193605439] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:17:56,246 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:17:56,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2025-03-14 01:17:56,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754003138] [2025-03-14 01:17:56,247 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:17:56,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-14 01:17:56,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:17:56,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-14 01:17:56,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-14 01:17:56,377 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 122 [2025-03-14 01:17:56,379 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 119 transitions, 288 flow. Second operand has 15 states, 15 states have (on average 107.06666666666666) internal successors, (1606), 15 states have internal predecessors, (1606), 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-14 01:17:56,379 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:17:56,379 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 122 [2025-03-14 01:17:56,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:17:56,532 INFO L124 PetriNetUnfolderBase]: 5/181 cut-off events. [2025-03-14 01:17:56,532 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2025-03-14 01:17:56,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 268 conditions, 181 events. 5/181 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 103 event pairs, 0 based on Foata normal form. 3/174 useless extension candidates. Maximal degree in co-relation 185. Up to 9 conditions per place. [2025-03-14 01:17:56,533 INFO L140 encePairwiseOnDemand]: 116/122 looper letters, 14 selfloop transitions, 18 changer transitions 0/133 dead transitions. [2025-03-14 01:17:56,533 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 133 transitions, 426 flow [2025-03-14 01:17:56,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-14 01:17:56,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-14 01:17:56,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1925 transitions. [2025-03-14 01:17:56,541 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8765938069216758 [2025-03-14 01:17:56,541 INFO L175 Difference]: Start difference. First operand has 123 places, 119 transitions, 288 flow. Second operand 18 states and 1925 transitions. [2025-03-14 01:17:56,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 133 transitions, 426 flow [2025-03-14 01:17:56,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 133 transitions, 414 flow, removed 5 selfloop flow, removed 1 redundant places. [2025-03-14 01:17:56,546 INFO L231 Difference]: Finished difference. Result has 143 places, 129 transitions, 388 flow [2025-03-14 01:17:56,546 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=282, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=388, PETRI_PLACES=143, PETRI_TRANSITIONS=129} [2025-03-14 01:17:56,547 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, 26 predicate places. [2025-03-14 01:17:56,547 INFO L471 AbstractCegarLoop]: Abstraction has has 143 places, 129 transitions, 388 flow [2025-03-14 01:17:56,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 107.06666666666666) internal successors, (1606), 15 states have internal predecessors, (1606), 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-14 01:17:56,548 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:17:56,549 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-14 01:17:56,559 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-14 01:17:56,753 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-14 01:17:56,753 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-14 01:17:56,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:17:56,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1148885416, now seen corresponding path program 3 times [2025-03-14 01:17:56,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:17:56,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493857822] [2025-03-14 01:17:56,754 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 01:17:56,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:17:56,777 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 116 statements into 7 equivalence classes. [2025-03-14 01:17:56,817 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 116 of 116 statements. [2025-03-14 01:17:56,817 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-03-14 01:17:56,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 01:17:56,818 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-14 01:17:56,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-14 01:17:56,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-14 01:17:56,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:17:56,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 01:17:56,856 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-14 01:17:56,857 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-14 01:17:56,858 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining) [2025-03-14 01:17:56,860 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (8 of 10 remaining) [2025-03-14 01:17:56,860 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (7 of 10 remaining) [2025-03-14 01:17:56,860 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (6 of 10 remaining) [2025-03-14 01:17:56,860 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (5 of 10 remaining) [2025-03-14 01:17:56,860 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (4 of 10 remaining) [2025-03-14 01:17:56,860 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (3 of 10 remaining) [2025-03-14 01:17:56,860 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (2 of 10 remaining) [2025-03-14 01:17:56,860 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 10 remaining) [2025-03-14 01:17:56,860 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 10 remaining) [2025-03-14 01:17:56,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-14 01:17:56,861 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1] [2025-03-14 01:17:56,863 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-14 01:17:56,863 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-14 01:17:56,890 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-14 01:17:56,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 182 places, 192 transitions, 394 flow [2025-03-14 01:17:56,907 INFO L124 PetriNetUnfolderBase]: 15/208 cut-off events. [2025-03-14 01:17:56,908 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-14 01:17:56,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 216 conditions, 208 events. 15/208 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 526 event pairs, 0 based on Foata normal form. 0/181 useless extension candidates. Maximal degree in co-relation 147. Up to 3 conditions per place. [2025-03-14 01:17:56,909 INFO L82 GeneralOperation]: Start removeDead. Operand has 182 places, 192 transitions, 394 flow [2025-03-14 01:17:56,911 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 182 places, 192 transitions, 394 flow [2025-03-14 01:17:56,912 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:17:56,912 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;@1e16a559, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:17:56,912 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2025-03-14 01:17:56,916 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:17:56,916 INFO L124 PetriNetUnfolderBase]: 0/50 cut-off events. [2025-03-14 01:17:56,916 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:17:56,916 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:17:56,916 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-14 01:17:56,916 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-14 01:17:56,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:17:56,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1557277306, now seen corresponding path program 1 times [2025-03-14 01:17:56,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:17:56,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405237535] [2025-03-14 01:17:56,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:17:56,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:17:56,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-14 01:17:56,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-14 01:17:56,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:17:56,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:17:57,107 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-14 01:17:57,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:17:57,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405237535] [2025-03-14 01:17:57,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405237535] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:17:57,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:17:57,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:17:57,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486078101] [2025-03-14 01:17:57,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:17:57,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:17:57,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:17:57,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:17:57,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:17:57,237 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 192 [2025-03-14 01:17:57,238 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 192 transitions, 394 flow. Second operand has 6 states, 6 states have (on average 157.5) internal successors, (945), 6 states have internal predecessors, (945), 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-14 01:17:57,238 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:17:57,238 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 192 [2025-03-14 01:17:57,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:17:57,333 INFO L124 PetriNetUnfolderBase]: 90/600 cut-off events. [2025-03-14 01:17:57,334 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2025-03-14 01:17:57,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 756 conditions, 600 events. 90/600 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 3394 event pairs, 42 based on Foata normal form. 91/595 useless extension candidates. Maximal degree in co-relation 312. Up to 125 conditions per place. [2025-03-14 01:17:57,342 INFO L140 encePairwiseOnDemand]: 179/192 looper letters, 20 selfloop transitions, 5 changer transitions 0/177 dead transitions. [2025-03-14 01:17:57,342 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 177 transitions, 414 flow [2025-03-14 01:17:57,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:17:57,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:17:57,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 969 transitions. [2025-03-14 01:17:57,345 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8411458333333334 [2025-03-14 01:17:57,345 INFO L175 Difference]: Start difference. First operand has 182 places, 192 transitions, 394 flow. Second operand 6 states and 969 transitions. [2025-03-14 01:17:57,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 177 transitions, 414 flow [2025-03-14 01:17:57,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 177 transitions, 414 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:17:57,349 INFO L231 Difference]: Finished difference. Result has 178 places, 177 transitions, 374 flow [2025-03-14 01:17:57,349 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=364, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=374, PETRI_PLACES=178, PETRI_TRANSITIONS=177} [2025-03-14 01:17:57,351 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, -4 predicate places. [2025-03-14 01:17:57,352 INFO L471 AbstractCegarLoop]: Abstraction has has 178 places, 177 transitions, 374 flow [2025-03-14 01:17:57,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 157.5) internal successors, (945), 6 states have internal predecessors, (945), 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-14 01:17:57,352 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:17:57,353 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-14 01:17:57,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-14 01:17:57,353 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-14 01:17:57,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:17:57,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1159655658, now seen corresponding path program 1 times [2025-03-14 01:17:57,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:17:57,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753732574] [2025-03-14 01:17:57,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:17:57,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:17:57,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-14 01:17:57,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-14 01:17:57,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:17:57,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:17:57,386 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-14 01:17:57,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:17:57,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753732574] [2025-03-14 01:17:57,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753732574] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:17:57,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:17:57,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 01:17:57,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908796497] [2025-03-14 01:17:57,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:17:57,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:17:57,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:17:57,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:17:57,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:17:57,404 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 192 [2025-03-14 01:17:57,405 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 177 transitions, 374 flow. Second operand has 3 states, 3 states have (on average 173.0) internal successors, (519), 3 states have internal predecessors, (519), 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-14 01:17:57,405 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:17:57,405 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 192 [2025-03-14 01:17:57,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:17:57,448 INFO L124 PetriNetUnfolderBase]: 23/345 cut-off events. [2025-03-14 01:17:57,449 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-03-14 01:17:57,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 395 conditions, 345 events. 23/345 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1168 event pairs, 6 based on Foata normal form. 1/305 useless extension candidates. Maximal degree in co-relation 332. Up to 24 conditions per place. [2025-03-14 01:17:57,451 INFO L140 encePairwiseOnDemand]: 189/192 looper letters, 10 selfloop transitions, 2 changer transitions 0/178 dead transitions. [2025-03-14 01:17:57,451 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 178 transitions, 402 flow [2025-03-14 01:17:57,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:17:57,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:17:57,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 526 transitions. [2025-03-14 01:17:57,453 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9131944444444444 [2025-03-14 01:17:57,453 INFO L175 Difference]: Start difference. First operand has 178 places, 177 transitions, 374 flow. Second operand 3 states and 526 transitions. [2025-03-14 01:17:57,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 178 transitions, 402 flow [2025-03-14 01:17:57,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 178 transitions, 390 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:17:57,457 INFO L231 Difference]: Finished difference. Result has 176 places, 178 transitions, 376 flow [2025-03-14 01:17:57,457 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=364, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=376, PETRI_PLACES=176, PETRI_TRANSITIONS=178} [2025-03-14 01:17:57,458 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, -6 predicate places. [2025-03-14 01:17:57,459 INFO L471 AbstractCegarLoop]: Abstraction has has 176 places, 178 transitions, 376 flow [2025-03-14 01:17:57,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 173.0) internal successors, (519), 3 states have internal predecessors, (519), 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-14 01:17:57,460 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:17:57,460 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-14 01:17:57,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-14 01:17:57,460 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-14 01:17:57,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:17:57,461 INFO L85 PathProgramCache]: Analyzing trace with hash -2058549844, now seen corresponding path program 1 times [2025-03-14 01:17:57,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:17:57,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091760528] [2025-03-14 01:17:57,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:17:57,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:17:57,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-14 01:17:57,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-14 01:17:57,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:17:57,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:17:57,527 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-14 01:17:57,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:17:57,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091760528] [2025-03-14 01:17:57,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091760528] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:17:57,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [855177139] [2025-03-14 01:17:57,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:17:57,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:17:57,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:17:57,529 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-14 01:17:57,532 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-14 01:17:57,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-14 01:17:57,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-14 01:17:57,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:17:57,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:17:57,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-14 01:17:57,598 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:17:57,624 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-14 01:17:57,624 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:17:57,680 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-14 01:17:57,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [855177139] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:17:57,680 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:17:57,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-14 01:17:57,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386066209] [2025-03-14 01:17:57,680 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:17:57,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 01:17:57,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:17:57,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 01:17:57,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-14 01:17:57,741 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 192 [2025-03-14 01:17:57,743 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 178 transitions, 376 flow. Second operand has 10 states, 10 states have (on average 170.0) internal successors, (1700), 10 states have internal predecessors, (1700), 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-14 01:17:57,743 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:17:57,743 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 192 [2025-03-14 01:17:57,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:17:57,813 INFO L124 PetriNetUnfolderBase]: 23/360 cut-off events. [2025-03-14 01:17:57,813 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-03-14 01:17:57,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 418 conditions, 360 events. 23/360 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1137 event pairs, 6 based on Foata normal form. 2/321 useless extension candidates. Maximal degree in co-relation 367. Up to 24 conditions per place. [2025-03-14 01:17:57,815 INFO L140 encePairwiseOnDemand]: 186/192 looper letters, 14 selfloop transitions, 9 changer transitions 0/186 dead transitions. [2025-03-14 01:17:57,815 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 186 transitions, 440 flow [2025-03-14 01:17:57,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-14 01:17:57,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-14 01:17:57,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1537 transitions. [2025-03-14 01:17:57,818 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8894675925925926 [2025-03-14 01:17:57,818 INFO L175 Difference]: Start difference. First operand has 176 places, 178 transitions, 376 flow. Second operand 9 states and 1537 transitions. [2025-03-14 01:17:57,818 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 186 transitions, 440 flow [2025-03-14 01:17:57,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 186 transitions, 438 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:17:57,821 INFO L231 Difference]: Finished difference. Result has 186 places, 184 transitions, 424 flow [2025-03-14 01:17:57,821 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=374, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=424, PETRI_PLACES=186, PETRI_TRANSITIONS=184} [2025-03-14 01:17:57,822 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, 4 predicate places. [2025-03-14 01:17:57,822 INFO L471 AbstractCegarLoop]: Abstraction has has 186 places, 184 transitions, 424 flow [2025-03-14 01:17:57,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 170.0) internal successors, (1700), 10 states have internal predecessors, (1700), 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-14 01:17:57,824 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:17:57,824 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-14 01:17:57,830 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-14 01:17:58,024 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-14 01:17:58,025 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-14 01:17:58,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:17:58,025 INFO L85 PathProgramCache]: Analyzing trace with hash 85852780, now seen corresponding path program 2 times [2025-03-14 01:17:58,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:17:58,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026486467] [2025-03-14 01:17:58,025 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:17:58,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:17:58,034 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 83 statements into 2 equivalence classes. [2025-03-14 01:17:58,041 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 83 of 83 statements. [2025-03-14 01:17:58,041 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:17:58,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:17:58,144 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-14 01:17:58,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:17:58,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026486467] [2025-03-14 01:17:58,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026486467] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:17:58,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1907959166] [2025-03-14 01:17:58,145 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:17:58,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:17:58,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:17:58,147 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-14 01:17:58,149 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-14 01:17:58,199 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 83 statements into 2 equivalence classes. [2025-03-14 01:17:58,224 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 83 of 83 statements. [2025-03-14 01:17:58,225 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:17:58,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:17:58,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-14 01:17:58,227 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:17:58,282 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-14 01:17:58,282 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:17:58,368 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-14 01:17:58,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1907959166] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:17:58,368 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:17:58,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2025-03-14 01:17:58,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870062082] [2025-03-14 01:17:58,368 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:17:58,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-14 01:17:58,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:17:58,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-14 01:17:58,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-14 01:17:58,447 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 192 [2025-03-14 01:17:58,449 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 184 transitions, 424 flow. Second operand has 15 states, 15 states have (on average 170.13333333333333) internal successors, (2552), 15 states have internal predecessors, (2552), 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-14 01:17:58,449 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:17:58,449 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 192 [2025-03-14 01:17:58,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:17:58,602 INFO L124 PetriNetUnfolderBase]: 23/399 cut-off events. [2025-03-14 01:17:58,602 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2025-03-14 01:17:58,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 511 conditions, 399 events. 23/399 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1139 event pairs, 6 based on Foata normal form. 3/361 useless extension candidates. Maximal degree in co-relation 329. Up to 24 conditions per place. [2025-03-14 01:17:58,605 INFO L140 encePairwiseOnDemand]: 186/192 looper letters, 17 selfloop transitions, 18 changer transitions 0/198 dead transitions. [2025-03-14 01:17:58,605 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 198 transitions, 568 flow [2025-03-14 01:17:58,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-14 01:17:58,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-14 01:17:58,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 3062 transitions. [2025-03-14 01:17:58,610 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8859953703703703 [2025-03-14 01:17:58,610 INFO L175 Difference]: Start difference. First operand has 186 places, 184 transitions, 424 flow. Second operand 18 states and 3062 transitions. [2025-03-14 01:17:58,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 198 transitions, 568 flow [2025-03-14 01:17:58,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 198 transitions, 556 flow, removed 5 selfloop flow, removed 1 redundant places. [2025-03-14 01:17:58,613 INFO L231 Difference]: Finished difference. Result has 206 places, 194 transitions, 524 flow [2025-03-14 01:17:58,613 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=418, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=524, PETRI_PLACES=206, PETRI_TRANSITIONS=194} [2025-03-14 01:17:58,614 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, 24 predicate places. [2025-03-14 01:17:58,614 INFO L471 AbstractCegarLoop]: Abstraction has has 206 places, 194 transitions, 524 flow [2025-03-14 01:17:58,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 170.13333333333333) internal successors, (2552), 15 states have internal predecessors, (2552), 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-14 01:17:58,614 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:17:58,615 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-14 01:17:58,621 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-14 01:17:58,819 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-14 01:17:58,819 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-14 01:17:58,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:17:58,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1905122646, now seen corresponding path program 3 times [2025-03-14 01:17:58,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:17:58,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036488855] [2025-03-14 01:17:58,820 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 01:17:58,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:17:58,832 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 122 statements into 8 equivalence classes. [2025-03-14 01:17:58,865 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 122 of 122 statements. [2025-03-14 01:17:58,865 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-03-14 01:17:58,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 01:17:58,865 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-14 01:17:58,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-14 01:17:58,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-14 01:17:58,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:17:58,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 01:17:58,889 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-14 01:17:58,890 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-14 01:17:58,890 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 14 remaining) [2025-03-14 01:17:58,890 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (12 of 14 remaining) [2025-03-14 01:17:58,890 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (11 of 14 remaining) [2025-03-14 01:17:58,890 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (10 of 14 remaining) [2025-03-14 01:17:58,890 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (9 of 14 remaining) [2025-03-14 01:17:58,890 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (8 of 14 remaining) [2025-03-14 01:17:58,890 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (7 of 14 remaining) [2025-03-14 01:17:58,890 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (6 of 14 remaining) [2025-03-14 01:17:58,890 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (5 of 14 remaining) [2025-03-14 01:17:58,890 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (4 of 14 remaining) [2025-03-14 01:17:58,891 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (3 of 14 remaining) [2025-03-14 01:17:58,891 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (2 of 14 remaining) [2025-03-14 01:17:58,891 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 14 remaining) [2025-03-14 01:17:58,891 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 14 remaining) [2025-03-14 01:17:58,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-14 01:17:58,891 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1] [2025-03-14 01:17:58,891 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-14 01:17:58,891 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-14 01:17:58,921 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-14 01:17:58,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 247 places, 262 transitions, 542 flow [2025-03-14 01:17:58,943 INFO L124 PetriNetUnfolderBase]: 22/287 cut-off events. [2025-03-14 01:17:58,944 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-14 01:17:58,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 300 conditions, 287 events. 22/287 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 916 event pairs, 0 based on Foata normal form. 0/248 useless extension candidates. Maximal degree in co-relation 216. Up to 4 conditions per place. [2025-03-14 01:17:58,946 INFO L82 GeneralOperation]: Start removeDead. Operand has 247 places, 262 transitions, 542 flow [2025-03-14 01:17:58,948 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 247 places, 262 transitions, 542 flow [2025-03-14 01:17:58,949 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:17:58,950 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;@1e16a559, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:17:58,950 INFO L334 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2025-03-14 01:17:58,952 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:17:58,952 INFO L124 PetriNetUnfolderBase]: 0/50 cut-off events. [2025-03-14 01:17:58,952 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:17:58,952 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:17:58,952 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-14 01:17:58,952 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-03-14 01:17:58,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:17:58,953 INFO L85 PathProgramCache]: Analyzing trace with hash 264705728, now seen corresponding path program 1 times [2025-03-14 01:17:58,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:17:58,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338775747] [2025-03-14 01:17:58,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:17:58,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:17:58,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-14 01:17:58,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-14 01:17:58,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:17:58,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:17:59,146 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-14 01:17:59,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:17:59,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338775747] [2025-03-14 01:17:59,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338775747] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:17:59,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:17:59,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:17:59,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133458647] [2025-03-14 01:17:59,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:17:59,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:17:59,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:17:59,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:17:59,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:17:59,289 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 262 [2025-03-14 01:17:59,290 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 262 transitions, 542 flow. Second operand has 6 states, 6 states have (on average 216.5) internal successors, (1299), 6 states have internal predecessors, (1299), 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-14 01:17:59,291 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:17:59,291 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 262 [2025-03-14 01:17:59,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:17:59,733 INFO L124 PetriNetUnfolderBase]: 1081/4122 cut-off events. [2025-03-14 01:17:59,733 INFO L125 PetriNetUnfolderBase]: For 364/364 co-relation queries the response was YES. [2025-03-14 01:17:59,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5668 conditions, 4122 events. 1081/4122 cut-off events. For 364/364 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 38989 event pairs, 630 based on Foata normal form. 720/4055 useless extension candidates. Maximal degree in co-relation 1470. Up to 1318 conditions per place. [2025-03-14 01:17:59,764 INFO L140 encePairwiseOnDemand]: 246/262 looper letters, 27 selfloop transitions, 5 changer transitions 0/242 dead transitions. [2025-03-14 01:17:59,764 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 242 transitions, 566 flow [2025-03-14 01:17:59,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:17:59,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:17:59,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1333 transitions. [2025-03-14 01:17:59,767 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8479643765903307 [2025-03-14 01:17:59,767 INFO L175 Difference]: Start difference. First operand has 247 places, 262 transitions, 542 flow. Second operand 6 states and 1333 transitions. [2025-03-14 01:17:59,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 242 transitions, 566 flow [2025-03-14 01:17:59,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 242 transitions, 564 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-03-14 01:17:59,770 INFO L231 Difference]: Finished difference. Result has 241 places, 242 transitions, 510 flow [2025-03-14 01:17:59,770 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=500, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=237, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=510, PETRI_PLACES=241, PETRI_TRANSITIONS=242} [2025-03-14 01:17:59,771 INFO L279 CegarLoopForPetriNet]: 247 programPoint places, -6 predicate places. [2025-03-14 01:17:59,771 INFO L471 AbstractCegarLoop]: Abstraction has has 241 places, 242 transitions, 510 flow [2025-03-14 01:17:59,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 216.5) internal successors, (1299), 6 states have internal predecessors, (1299), 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-14 01:17:59,771 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:17:59,771 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-14 01:17:59,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-14 01:17:59,772 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-03-14 01:17:59,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:17:59,772 INFO L85 PathProgramCache]: Analyzing trace with hash -481126473, now seen corresponding path program 1 times [2025-03-14 01:17:59,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:17:59,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844596151] [2025-03-14 01:17:59,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:17:59,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:17:59,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-14 01:17:59,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-14 01:17:59,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:17:59,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:17:59,791 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-14 01:17:59,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:17:59,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844596151] [2025-03-14 01:17:59,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844596151] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:17:59,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:17:59,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 01:17:59,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570861316] [2025-03-14 01:17:59,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:17:59,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:17:59,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:17:59,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:17:59,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:17:59,813 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 234 out of 262 [2025-03-14 01:17:59,813 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 242 transitions, 510 flow. Second operand has 3 states, 3 states have (on average 236.33333333333334) internal successors, (709), 3 states have internal predecessors, (709), 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-14 01:17:59,813 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:17:59,813 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 262 [2025-03-14 01:17:59,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:17:59,903 INFO L124 PetriNetUnfolderBase]: 95/1017 cut-off events. [2025-03-14 01:17:59,903 INFO L125 PetriNetUnfolderBase]: For 66/66 co-relation queries the response was YES. [2025-03-14 01:17:59,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1158 conditions, 1017 events. 95/1017 cut-off events. For 66/66 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 6163 event pairs, 42 based on Foata normal form. 1/883 useless extension candidates. Maximal degree in co-relation 1094. Up to 87 conditions per place. [2025-03-14 01:17:59,917 INFO L140 encePairwiseOnDemand]: 259/262 looper letters, 13 selfloop transitions, 2 changer transitions 0/243 dead transitions. [2025-03-14 01:17:59,917 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 243 transitions, 544 flow [2025-03-14 01:17:59,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:17:59,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:17:59,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 718 transitions. [2025-03-14 01:17:59,919 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9134860050890585 [2025-03-14 01:17:59,919 INFO L175 Difference]: Start difference. First operand has 241 places, 242 transitions, 510 flow. Second operand 3 states and 718 transitions. [2025-03-14 01:17:59,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 243 transitions, 544 flow [2025-03-14 01:17:59,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 243 transitions, 532 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:17:59,923 INFO L231 Difference]: Finished difference. Result has 239 places, 243 transitions, 512 flow [2025-03-14 01:17:59,923 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=500, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=512, PETRI_PLACES=239, PETRI_TRANSITIONS=243} [2025-03-14 01:17:59,925 INFO L279 CegarLoopForPetriNet]: 247 programPoint places, -8 predicate places. [2025-03-14 01:17:59,925 INFO L471 AbstractCegarLoop]: Abstraction has has 239 places, 243 transitions, 512 flow [2025-03-14 01:17:59,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 236.33333333333334) internal successors, (709), 3 states have internal predecessors, (709), 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-14 01:17:59,926 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:17:59,926 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-14 01:17:59,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-14 01:17:59,926 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-03-14 01:17:59,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:17:59,927 INFO L85 PathProgramCache]: Analyzing trace with hash 2005451263, now seen corresponding path program 1 times [2025-03-14 01:17:59,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:17:59,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4911181] [2025-03-14 01:17:59,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:17:59,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:17:59,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-14 01:17:59,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-14 01:17:59,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:17:59,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:17:59,982 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-14 01:17:59,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:17:59,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4911181] [2025-03-14 01:17:59,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4911181] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:17:59,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [896384729] [2025-03-14 01:17:59,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:17:59,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:17:59,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:17:59,985 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-14 01:17:59,987 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-14 01:18:00,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-14 01:18:00,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-14 01:18:00,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:18:00,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:18:00,059 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-14 01:18:00,061 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:18:00,087 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-14 01:18:00,087 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:18:00,121 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:18:00,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [896384729] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:18:00,122 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:18:00,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-14 01:18:00,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604343765] [2025-03-14 01:18:00,123 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:18:00,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 01:18:00,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:18:00,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 01:18:00,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-14 01:18:00,180 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 262 [2025-03-14 01:18:00,181 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 243 transitions, 512 flow. Second operand has 10 states, 10 states have (on average 233.1) internal successors, (2331), 10 states have internal predecessors, (2331), 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-14 01:18:00,181 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:18:00,181 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 262 [2025-03-14 01:18:00,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:18:00,320 INFO L124 PetriNetUnfolderBase]: 95/1032 cut-off events. [2025-03-14 01:18:00,320 INFO L125 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2025-03-14 01:18:00,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1181 conditions, 1032 events. 95/1032 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 6134 event pairs, 42 based on Foata normal form. 2/899 useless extension candidates. Maximal degree in co-relation 1129. Up to 87 conditions per place. [2025-03-14 01:18:00,332 INFO L140 encePairwiseOnDemand]: 256/262 looper letters, 17 selfloop transitions, 9 changer transitions 0/251 dead transitions. [2025-03-14 01:18:00,332 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 251 transitions, 582 flow [2025-03-14 01:18:00,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-14 01:18:00,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-14 01:18:00,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2107 transitions. [2025-03-14 01:18:00,336 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8935538592027141 [2025-03-14 01:18:00,336 INFO L175 Difference]: Start difference. First operand has 239 places, 243 transitions, 512 flow. Second operand 9 states and 2107 transitions. [2025-03-14 01:18:00,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 251 transitions, 582 flow [2025-03-14 01:18:00,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 251 transitions, 580 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:18:00,341 INFO L231 Difference]: Finished difference. Result has 249 places, 249 transitions, 560 flow [2025-03-14 01:18:00,341 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=510, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=237, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=560, PETRI_PLACES=249, PETRI_TRANSITIONS=249} [2025-03-14 01:18:00,342 INFO L279 CegarLoopForPetriNet]: 247 programPoint places, 2 predicate places. [2025-03-14 01:18:00,342 INFO L471 AbstractCegarLoop]: Abstraction has has 249 places, 249 transitions, 560 flow [2025-03-14 01:18:00,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 233.1) internal successors, (2331), 10 states have internal predecessors, (2331), 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-14 01:18:00,343 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:18:00,343 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-14 01:18:00,350 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-14 01:18:00,544 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-14 01:18:00,544 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-03-14 01:18:00,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:18:00,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1556737279, now seen corresponding path program 2 times [2025-03-14 01:18:00,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:18:00,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567702701] [2025-03-14 01:18:00,545 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:18:00,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:18:00,553 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 89 statements into 2 equivalence classes. [2025-03-14 01:18:00,558 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 89 of 89 statements. [2025-03-14 01:18:00,558 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:18:00,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:18:00,687 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-14 01:18:00,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:18:00,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567702701] [2025-03-14 01:18:00,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567702701] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:18:00,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [901834929] [2025-03-14 01:18:00,687 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:18:00,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:18:00,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:18:00,689 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-14 01:18:00,691 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-14 01:18:00,748 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 89 statements into 2 equivalence classes. [2025-03-14 01:18:00,769 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 89 of 89 statements. [2025-03-14 01:18:00,769 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:18:00,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:18:00,770 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-14 01:18:00,773 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:18:00,839 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-14 01:18:00,839 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:18:00,922 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-14 01:18:00,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [901834929] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:18:00,922 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:18:00,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2025-03-14 01:18:00,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229475943] [2025-03-14 01:18:00,923 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:18:00,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-14 01:18:00,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:18:00,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-14 01:18:00,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-14 01:18:01,014 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 262 [2025-03-14 01:18:01,017 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 249 transitions, 560 flow. Second operand has 15 states, 15 states have (on average 233.2) internal successors, (3498), 15 states have internal predecessors, (3498), 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-14 01:18:01,017 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:18:01,017 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 262 [2025-03-14 01:18:01,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:18:01,236 INFO L124 PetriNetUnfolderBase]: 95/1071 cut-off events. [2025-03-14 01:18:01,237 INFO L125 PetriNetUnfolderBase]: For 87/87 co-relation queries the response was YES. [2025-03-14 01:18:01,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1274 conditions, 1071 events. 95/1071 cut-off events. For 87/87 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 6167 event pairs, 42 based on Foata normal form. 3/939 useless extension candidates. Maximal degree in co-relation 1091. Up to 87 conditions per place. [2025-03-14 01:18:01,248 INFO L140 encePairwiseOnDemand]: 256/262 looper letters, 20 selfloop transitions, 18 changer transitions 0/263 dead transitions. [2025-03-14 01:18:01,248 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 263 transitions, 710 flow [2025-03-14 01:18:01,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-14 01:18:01,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-14 01:18:01,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 4199 transitions. [2025-03-14 01:18:01,256 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.890373197625106 [2025-03-14 01:18:01,256 INFO L175 Difference]: Start difference. First operand has 249 places, 249 transitions, 560 flow. Second operand 18 states and 4199 transitions. [2025-03-14 01:18:01,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 263 transitions, 710 flow [2025-03-14 01:18:01,258 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 263 transitions, 698 flow, removed 5 selfloop flow, removed 1 redundant places. [2025-03-14 01:18:01,260 INFO L231 Difference]: Finished difference. Result has 269 places, 259 transitions, 660 flow [2025-03-14 01:18:01,260 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=554, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=660, PETRI_PLACES=269, PETRI_TRANSITIONS=259} [2025-03-14 01:18:01,261 INFO L279 CegarLoopForPetriNet]: 247 programPoint places, 22 predicate places. [2025-03-14 01:18:01,261 INFO L471 AbstractCegarLoop]: Abstraction has has 269 places, 259 transitions, 660 flow [2025-03-14 01:18:01,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 233.2) internal successors, (3498), 15 states have internal predecessors, (3498), 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-14 01:18:01,262 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:18:01,262 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-14 01:18:01,269 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-14 01:18:01,463 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-14 01:18:01,463 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-03-14 01:18:01,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:18:01,464 INFO L85 PathProgramCache]: Analyzing trace with hash 752400055, now seen corresponding path program 3 times [2025-03-14 01:18:01,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:18:01,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910782610] [2025-03-14 01:18:01,464 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 01:18:01,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:18:01,476 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 128 statements into 7 equivalence classes. [2025-03-14 01:18:01,499 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 128 of 128 statements. [2025-03-14 01:18:01,499 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-03-14 01:18:01,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 01:18:01,499 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-14 01:18:01,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-14 01:18:01,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-14 01:18:01,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:18:01,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 01:18:01,528 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-14 01:18:01,529 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-14 01:18:01,529 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (17 of 18 remaining) [2025-03-14 01:18:01,529 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (16 of 18 remaining) [2025-03-14 01:18:01,529 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (15 of 18 remaining) [2025-03-14 01:18:01,529 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (14 of 18 remaining) [2025-03-14 01:18:01,529 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (13 of 18 remaining) [2025-03-14 01:18:01,529 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (12 of 18 remaining) [2025-03-14 01:18:01,529 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (11 of 18 remaining) [2025-03-14 01:18:01,529 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (10 of 18 remaining) [2025-03-14 01:18:01,529 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (9 of 18 remaining) [2025-03-14 01:18:01,529 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (8 of 18 remaining) [2025-03-14 01:18:01,529 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (7 of 18 remaining) [2025-03-14 01:18:01,529 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (6 of 18 remaining) [2025-03-14 01:18:01,529 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (5 of 18 remaining) [2025-03-14 01:18:01,529 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (4 of 18 remaining) [2025-03-14 01:18:01,529 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (3 of 18 remaining) [2025-03-14 01:18:01,529 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (2 of 18 remaining) [2025-03-14 01:18:01,529 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 18 remaining) [2025-03-14 01:18:01,529 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 18 remaining) [2025-03-14 01:18:01,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-14 01:18:01,530 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1] [2025-03-14 01:18:01,530 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-14 01:18:01,530 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-03-14 01:18:01,562 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-14 01:18:01,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 312 places, 332 transitions, 692 flow [2025-03-14 01:18:01,595 INFO L124 PetriNetUnfolderBase]: 29/366 cut-off events. [2025-03-14 01:18:01,595 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-14 01:18:01,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 385 conditions, 366 events. 29/366 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1328 event pairs, 0 based on Foata normal form. 0/315 useless extension candidates. Maximal degree in co-relation 295. Up to 5 conditions per place. [2025-03-14 01:18:01,600 INFO L82 GeneralOperation]: Start removeDead. Operand has 312 places, 332 transitions, 692 flow [2025-03-14 01:18:01,603 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 312 places, 332 transitions, 692 flow [2025-03-14 01:18:01,603 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:18:01,603 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;@1e16a559, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:18:01,603 INFO L334 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2025-03-14 01:18:01,606 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:18:01,606 INFO L124 PetriNetUnfolderBase]: 0/50 cut-off events. [2025-03-14 01:18:01,606 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:18:01,606 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:18:01,606 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-14 01:18:01,606 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-03-14 01:18:01,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:18:01,606 INFO L85 PathProgramCache]: Analyzing trace with hash 659523212, now seen corresponding path program 1 times [2025-03-14 01:18:01,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:18:01,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410771946] [2025-03-14 01:18:01,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:18:01,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:18:01,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-14 01:18:01,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-14 01:18:01,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:18:01,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:18:01,742 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-14 01:18:01,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:18:01,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410771946] [2025-03-14 01:18:01,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410771946] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:18:01,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:18:01,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:18:01,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476465995] [2025-03-14 01:18:01,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:18:01,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:18:01,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:18:01,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:18:01,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:18:01,923 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 274 out of 332 [2025-03-14 01:18:01,924 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 332 transitions, 692 flow. Second operand has 6 states, 6 states have (on average 275.5) internal successors, (1653), 6 states have internal predecessors, (1653), 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-14 01:18:01,924 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:18:01,924 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 274 of 332 [2025-03-14 01:18:01,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:18:05,200 INFO L124 PetriNetUnfolderBase]: 10778/30460 cut-off events. [2025-03-14 01:18:05,200 INFO L125 PetriNetUnfolderBase]: For 4130/4130 co-relation queries the response was YES. [2025-03-14 01:18:05,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44913 conditions, 30460 events. 10778/30460 cut-off events. For 4130/4130 co-relation queries the response was YES. Maximal size of possible extension queue 1434. Compared 371221 event pairs, 6804 based on Foata normal form. 6397/30591 useless extension candidates. Maximal degree in co-relation 6942. Up to 12509 conditions per place. [2025-03-14 01:18:05,601 INFO L140 encePairwiseOnDemand]: 313/332 looper letters, 34 selfloop transitions, 5 changer transitions 0/307 dead transitions. [2025-03-14 01:18:05,601 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 307 transitions, 720 flow [2025-03-14 01:18:05,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:18:05,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:18:05,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1697 transitions. [2025-03-14 01:18:05,603 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8519076305220884 [2025-03-14 01:18:05,603 INFO L175 Difference]: Start difference. First operand has 312 places, 332 transitions, 692 flow. Second operand 6 states and 1697 transitions. [2025-03-14 01:18:05,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 307 transitions, 720 flow [2025-03-14 01:18:05,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 307 transitions, 714 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-03-14 01:18:05,609 INFO L231 Difference]: Finished difference. Result has 304 places, 307 transitions, 646 flow [2025-03-14 01:18:05,609 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=636, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=307, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=302, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=646, PETRI_PLACES=304, PETRI_TRANSITIONS=307} [2025-03-14 01:18:05,610 INFO L279 CegarLoopForPetriNet]: 312 programPoint places, -8 predicate places. [2025-03-14 01:18:05,610 INFO L471 AbstractCegarLoop]: Abstraction has has 304 places, 307 transitions, 646 flow [2025-03-14 01:18:05,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 275.5) internal successors, (1653), 6 states have internal predecessors, (1653), 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-14 01:18:05,612 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:18:05,612 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:18:05,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-14 01:18:05,612 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-03-14 01:18:05,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:18:05,614 INFO L85 PathProgramCache]: Analyzing trace with hash -2020750175, now seen corresponding path program 1 times [2025-03-14 01:18:05,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:18:05,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689089779] [2025-03-14 01:18:05,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:18:05,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:18:05,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-14 01:18:05,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-14 01:18:05,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:18:05,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:18:05,655 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-14 01:18:05,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:18:05,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689089779] [2025-03-14 01:18:05,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689089779] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:18:05,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:18:05,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 01:18:05,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600773263] [2025-03-14 01:18:05,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:18:05,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:18:05,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:18:05,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:18:05,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:18:05,679 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 297 out of 332 [2025-03-14 01:18:05,680 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 307 transitions, 646 flow. Second operand has 3 states, 3 states have (on average 299.0) internal successors, (897), 3 states have internal predecessors, (897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:18:05,680 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:18:05,680 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 297 of 332 [2025-03-14 01:18:05,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:18:06,195 INFO L124 PetriNetUnfolderBase]: 365/3087 cut-off events. [2025-03-14 01:18:06,195 INFO L125 PetriNetUnfolderBase]: For 282/282 co-relation queries the response was YES. [2025-03-14 01:18:06,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3553 conditions, 3087 events. 365/3087 cut-off events. For 282/282 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 26986 event pairs, 204 based on Foata normal form. 1/2670 useless extension candidates. Maximal degree in co-relation 3488. Up to 330 conditions per place. [2025-03-14 01:18:06,222 INFO L140 encePairwiseOnDemand]: 329/332 looper letters, 16 selfloop transitions, 2 changer transitions 0/308 dead transitions. [2025-03-14 01:18:06,222 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 308 transitions, 686 flow [2025-03-14 01:18:06,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:18:06,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:18:06,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 910 transitions. [2025-03-14 01:18:06,224 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9136546184738956 [2025-03-14 01:18:06,224 INFO L175 Difference]: Start difference. First operand has 304 places, 307 transitions, 646 flow. Second operand 3 states and 910 transitions. [2025-03-14 01:18:06,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 308 transitions, 686 flow [2025-03-14 01:18:06,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 308 transitions, 674 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:18:06,227 INFO L231 Difference]: Finished difference. Result has 302 places, 308 transitions, 648 flow [2025-03-14 01:18:06,228 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=636, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=307, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=305, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=648, PETRI_PLACES=302, PETRI_TRANSITIONS=308} [2025-03-14 01:18:06,228 INFO L279 CegarLoopForPetriNet]: 312 programPoint places, -10 predicate places. [2025-03-14 01:18:06,228 INFO L471 AbstractCegarLoop]: Abstraction has has 302 places, 308 transitions, 648 flow [2025-03-14 01:18:06,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 299.0) internal successors, (897), 3 states have internal predecessors, (897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:18:06,229 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:18:06,229 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:18:06,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-14 01:18:06,229 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-03-14 01:18:06,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:18:06,229 INFO L85 PathProgramCache]: Analyzing trace with hash 319988109, now seen corresponding path program 1 times [2025-03-14 01:18:06,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:18:06,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67138068] [2025-03-14 01:18:06,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:18:06,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:18:06,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-14 01:18:06,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-14 01:18:06,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:18:06,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:18:06,273 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:18:06,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:18:06,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67138068] [2025-03-14 01:18:06,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67138068] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:18:06,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [575709746] [2025-03-14 01:18:06,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:18:06,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:18:06,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:18:06,276 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-14 01:18:06,278 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-14 01:18:06,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-14 01:18:06,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-14 01:18:06,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:18:06,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:18:06,354 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-14 01:18:06,355 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:18:06,364 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:18:06,364 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-14 01:18:06,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [575709746] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:18:06,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-14 01:18:06,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-14 01:18:06,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9519732] [2025-03-14 01:18:06,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:18:06,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:18:06,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:18:06,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:18:06,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:18:06,385 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 296 out of 332 [2025-03-14 01:18:06,385 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 308 transitions, 648 flow. Second operand has 3 states, 3 states have (on average 298.3333333333333) internal successors, (895), 3 states have internal predecessors, (895), 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-14 01:18:06,385 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:18:06,385 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 296 of 332 [2025-03-14 01:18:06,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:18:07,015 INFO L124 PetriNetUnfolderBase]: 1136/6735 cut-off events. [2025-03-14 01:18:07,015 INFO L125 PetriNetUnfolderBase]: For 644/644 co-relation queries the response was YES. [2025-03-14 01:18:07,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8351 conditions, 6735 events. 1136/6735 cut-off events. For 644/644 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 70769 event pairs, 690 based on Foata normal form. 40/5788 useless extension candidates. Maximal degree in co-relation 8303. Up to 1091 conditions per place. [2025-03-14 01:18:07,105 INFO L140 encePairwiseOnDemand]: 329/332 looper letters, 27 selfloop transitions, 2 changer transitions 0/318 dead transitions. [2025-03-14 01:18:07,105 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 318 transitions, 741 flow [2025-03-14 01:18:07,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:18:07,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:18:07,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 918 transitions. [2025-03-14 01:18:07,106 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9216867469879518 [2025-03-14 01:18:07,106 INFO L175 Difference]: Start difference. First operand has 302 places, 308 transitions, 648 flow. Second operand 3 states and 918 transitions. [2025-03-14 01:18:07,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 318 transitions, 741 flow [2025-03-14 01:18:07,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 318 transitions, 739 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:18:07,111 INFO L231 Difference]: Finished difference. Result has 304 places, 309 transitions, 658 flow [2025-03-14 01:18:07,111 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=646, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=308, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=306, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=658, PETRI_PLACES=304, PETRI_TRANSITIONS=309} [2025-03-14 01:18:07,111 INFO L279 CegarLoopForPetriNet]: 312 programPoint places, -8 predicate places. [2025-03-14 01:18:07,111 INFO L471 AbstractCegarLoop]: Abstraction has has 304 places, 309 transitions, 658 flow [2025-03-14 01:18:07,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 298.3333333333333) internal successors, (895), 3 states have internal predecessors, (895), 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-14 01:18:07,112 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:18:07,112 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-14 01:18:07,118 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-14 01:18:07,312 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-14 01:18:07,313 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-03-14 01:18:07,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:18:07,313 INFO L85 PathProgramCache]: Analyzing trace with hash -2076401757, now seen corresponding path program 1 times [2025-03-14 01:18:07,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:18:07,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116948898] [2025-03-14 01:18:07,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:18:07,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:18:07,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-14 01:18:07,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-14 01:18:07,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:18:07,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:18:07,441 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-14 01:18:07,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:18:07,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116948898] [2025-03-14 01:18:07,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116948898] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:18:07,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1317107985] [2025-03-14 01:18:07,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:18:07,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:18:07,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:18:07,444 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-14 01:18:07,446 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-14 01:18:07,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-14 01:18:07,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-14 01:18:07,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:18:07,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:18:07,533 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-14 01:18:07,534 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:18:07,554 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-14 01:18:07,554 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:18:07,583 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-14 01:18:07,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1317107985] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:18:07,584 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:18:07,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-14 01:18:07,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393909340] [2025-03-14 01:18:07,585 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:18:07,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 01:18:07,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:18:07,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 01:18:07,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-14 01:18:07,632 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 294 out of 332 [2025-03-14 01:18:07,634 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 309 transitions, 658 flow. Second operand has 10 states, 10 states have (on average 296.2) internal successors, (2962), 10 states have internal predecessors, (2962), 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-14 01:18:07,634 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:18:07,634 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 294 of 332 [2025-03-14 01:18:07,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:18:07,993 INFO L124 PetriNetUnfolderBase]: 366/3121 cut-off events. [2025-03-14 01:18:07,993 INFO L125 PetriNetUnfolderBase]: For 281/281 co-relation queries the response was YES. [2025-03-14 01:18:08,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3600 conditions, 3121 events. 366/3121 cut-off events. For 281/281 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 26782 event pairs, 204 based on Foata normal form. 2/2699 useless extension candidates. Maximal degree in co-relation 3504. Up to 330 conditions per place. [2025-03-14 01:18:08,035 INFO L140 encePairwiseOnDemand]: 326/332 looper letters, 20 selfloop transitions, 9 changer transitions 0/317 dead transitions. [2025-03-14 01:18:08,035 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 317 transitions, 734 flow [2025-03-14 01:18:08,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-14 01:18:08,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-14 01:18:08,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2677 transitions. [2025-03-14 01:18:08,040 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8959170013386881 [2025-03-14 01:18:08,040 INFO L175 Difference]: Start difference. First operand has 304 places, 309 transitions, 658 flow. Second operand 9 states and 2677 transitions. [2025-03-14 01:18:08,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 317 transitions, 734 flow [2025-03-14 01:18:08,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 311 places, 317 transitions, 732 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:18:08,045 INFO L231 Difference]: Finished difference. Result has 314 places, 315 transitions, 706 flow [2025-03-14 01:18:08,045 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=656, PETRI_DIFFERENCE_MINUEND_PLACES=303, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=309, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=303, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=706, PETRI_PLACES=314, PETRI_TRANSITIONS=315} [2025-03-14 01:18:08,046 INFO L279 CegarLoopForPetriNet]: 312 programPoint places, 2 predicate places. [2025-03-14 01:18:08,046 INFO L471 AbstractCegarLoop]: Abstraction has has 314 places, 315 transitions, 706 flow [2025-03-14 01:18:08,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 296.2) internal successors, (2962), 10 states have internal predecessors, (2962), 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-14 01:18:08,047 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:18:08,047 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-14 01:18:08,053 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-14 01:18:08,248 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-14 01:18:08,248 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-03-14 01:18:08,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:18:08,249 INFO L85 PathProgramCache]: Analyzing trace with hash -1613897949, now seen corresponding path program 2 times [2025-03-14 01:18:08,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:18:08,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172942218] [2025-03-14 01:18:08,249 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:18:08,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:18:08,256 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 95 statements into 2 equivalence classes. [2025-03-14 01:18:08,261 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 95 of 95 statements. [2025-03-14 01:18:08,261 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:18:08,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:18:08,333 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-14 01:18:08,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:18:08,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172942218] [2025-03-14 01:18:08,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172942218] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:18:08,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1968454550] [2025-03-14 01:18:08,333 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:18:08,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:18:08,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:18:08,335 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-14 01:18:08,336 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-14 01:18:08,406 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 95 statements into 2 equivalence classes. [2025-03-14 01:18:08,426 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 95 of 95 statements. [2025-03-14 01:18:08,427 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:18:08,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:18:08,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-14 01:18:08,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:18:08,481 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-14 01:18:08,481 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:18:08,557 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-14 01:18:08,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1968454550] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:18:08,558 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:18:08,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2025-03-14 01:18:08,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370945408] [2025-03-14 01:18:08,558 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:18:08,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-14 01:18:08,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:18:08,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-14 01:18:08,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-14 01:18:08,643 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 294 out of 332 [2025-03-14 01:18:08,646 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 314 places, 315 transitions, 706 flow. Second operand has 15 states, 15 states have (on average 296.26666666666665) internal successors, (4444), 15 states have internal predecessors, (4444), 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-14 01:18:08,646 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:18:08,646 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 294 of 332 [2025-03-14 01:18:08,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:18:09,119 INFO L124 PetriNetUnfolderBase]: 366/3160 cut-off events. [2025-03-14 01:18:09,119 INFO L125 PetriNetUnfolderBase]: For 303/303 co-relation queries the response was YES. [2025-03-14 01:18:09,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3693 conditions, 3160 events. 366/3160 cut-off events. For 303/303 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 26710 event pairs, 204 based on Foata normal form. 3/2739 useless extension candidates. Maximal degree in co-relation 3508. Up to 330 conditions per place. [2025-03-14 01:18:09,150 INFO L140 encePairwiseOnDemand]: 326/332 looper letters, 23 selfloop transitions, 18 changer transitions 0/329 dead transitions. [2025-03-14 01:18:09,150 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 331 places, 329 transitions, 862 flow [2025-03-14 01:18:09,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-14 01:18:09,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-14 01:18:09,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 5336 transitions. [2025-03-14 01:18:09,153 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.892904953145917 [2025-03-14 01:18:09,153 INFO L175 Difference]: Start difference. First operand has 314 places, 315 transitions, 706 flow. Second operand 18 states and 5336 transitions. [2025-03-14 01:18:09,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 331 places, 329 transitions, 862 flow [2025-03-14 01:18:09,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 330 places, 329 transitions, 850 flow, removed 5 selfloop flow, removed 1 redundant places. [2025-03-14 01:18:09,157 INFO L231 Difference]: Finished difference. Result has 334 places, 325 transitions, 806 flow [2025-03-14 01:18:09,158 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=700, PETRI_DIFFERENCE_MINUEND_PLACES=313, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=315, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=304, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=806, PETRI_PLACES=334, PETRI_TRANSITIONS=325} [2025-03-14 01:18:09,158 INFO L279 CegarLoopForPetriNet]: 312 programPoint places, 22 predicate places. [2025-03-14 01:18:09,158 INFO L471 AbstractCegarLoop]: Abstraction has has 334 places, 325 transitions, 806 flow [2025-03-14 01:18:09,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 296.26666666666665) internal successors, (4444), 15 states have internal predecessors, (4444), 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-14 01:18:09,159 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:18:09,159 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-14 01:18:09,166 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-14 01:18:09,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:18:09,361 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-03-14 01:18:09,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:18:09,361 INFO L85 PathProgramCache]: Analyzing trace with hash 2133108879, now seen corresponding path program 3 times [2025-03-14 01:18:09,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:18:09,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305976981] [2025-03-14 01:18:09,362 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 01:18:09,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:18:09,378 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 134 statements into 7 equivalence classes. [2025-03-14 01:18:09,401 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 134 of 134 statements. [2025-03-14 01:18:09,401 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-03-14 01:18:09,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 01:18:09,401 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-14 01:18:09,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-14 01:18:09,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-14 01:18:09,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:18:09,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 01:18:09,427 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-14 01:18:09,428 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-14 01:18:09,428 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (21 of 22 remaining) [2025-03-14 01:18:09,428 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (20 of 22 remaining) [2025-03-14 01:18:09,428 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (19 of 22 remaining) [2025-03-14 01:18:09,428 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (18 of 22 remaining) [2025-03-14 01:18:09,428 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (17 of 22 remaining) [2025-03-14 01:18:09,428 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (16 of 22 remaining) [2025-03-14 01:18:09,428 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (15 of 22 remaining) [2025-03-14 01:18:09,428 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (14 of 22 remaining) [2025-03-14 01:18:09,428 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (13 of 22 remaining) [2025-03-14 01:18:09,428 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (12 of 22 remaining) [2025-03-14 01:18:09,428 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (11 of 22 remaining) [2025-03-14 01:18:09,428 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (10 of 22 remaining) [2025-03-14 01:18:09,428 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (9 of 22 remaining) [2025-03-14 01:18:09,428 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (8 of 22 remaining) [2025-03-14 01:18:09,428 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (7 of 22 remaining) [2025-03-14 01:18:09,428 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (6 of 22 remaining) [2025-03-14 01:18:09,428 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (5 of 22 remaining) [2025-03-14 01:18:09,428 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (4 of 22 remaining) [2025-03-14 01:18:09,428 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (3 of 22 remaining) [2025-03-14 01:18:09,428 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (2 of 22 remaining) [2025-03-14 01:18:09,428 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 22 remaining) [2025-03-14 01:18:09,428 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 22 remaining) [2025-03-14 01:18:09,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-14 01:18:09,429 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1] [2025-03-14 01:18:09,429 WARN L246 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-14 01:18:09,429 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2025-03-14 01:18:09,463 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-14 01:18:09,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 377 places, 402 transitions, 844 flow [2025-03-14 01:18:09,503 INFO L124 PetriNetUnfolderBase]: 36/445 cut-off events. [2025-03-14 01:18:09,503 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-03-14 01:18:09,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 471 conditions, 445 events. 36/445 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1784 event pairs, 0 based on Foata normal form. 0/382 useless extension candidates. Maximal degree in co-relation 379. Up to 6 conditions per place. [2025-03-14 01:18:09,508 INFO L82 GeneralOperation]: Start removeDead. Operand has 377 places, 402 transitions, 844 flow [2025-03-14 01:18:09,511 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 377 places, 402 transitions, 844 flow [2025-03-14 01:18:09,512 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:18:09,512 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;@1e16a559, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:18:09,512 INFO L334 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2025-03-14 01:18:09,514 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:18:09,514 INFO L124 PetriNetUnfolderBase]: 0/50 cut-off events. [2025-03-14 01:18:09,514 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:18:09,514 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:18:09,514 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-14 01:18:09,514 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-14 01:18:09,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:18:09,514 INFO L85 PathProgramCache]: Analyzing trace with hash -1553237538, now seen corresponding path program 1 times [2025-03-14 01:18:09,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:18:09,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563629562] [2025-03-14 01:18:09,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:18:09,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:18:09,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-14 01:18:09,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-14 01:18:09,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:18:09,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:18:09,627 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-14 01:18:09,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:18:09,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563629562] [2025-03-14 01:18:09,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563629562] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:18:09,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:18:09,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:18:09,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597034559] [2025-03-14 01:18:09,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:18:09,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:18:09,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:18:09,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:18:09,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:18:09,831 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 333 out of 402 [2025-03-14 01:18:09,833 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 377 places, 402 transitions, 844 flow. Second operand has 6 states, 6 states have (on average 334.5) internal successors, (2007), 6 states have internal predecessors, (2007), 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-14 01:18:09,833 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:18:09,833 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 333 of 402 [2025-03-14 01:18:09,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:18:39,272 INFO L124 PetriNetUnfolderBase]: 98025/234114 cut-off events. [2025-03-14 01:18:39,272 INFO L125 PetriNetUnfolderBase]: For 43281/43281 co-relation queries the response was YES. [2025-03-14 01:18:41,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 360711 conditions, 234114 events. 98025/234114 cut-off events. For 43281/43281 co-relation queries the response was YES. Maximal size of possible extension queue 9651. Compared 3370967 event pairs, 64428 based on Foata normal form. 43303/227901 useless extension candidates. Maximal degree in co-relation 45257. Up to 110246 conditions per place.