./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-ext/11_fmaxsymopt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version f8ab0bd5 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-ext/11_fmaxsymopt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ec355916cf6ee76d4008e84bb2b3ecc632256e3b320d2f47b453f4ca1f46acbc --- Real Ultimate output --- This is Ultimate 0.3.0-?-f8ab0bd-m [2025-03-13 21:59:06,323 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 21:59:06,371 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-13 21:59:06,376 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 21:59:06,376 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 21:59:06,395 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 21:59:06,395 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 21:59:06,396 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 21:59:06,396 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 21:59:06,396 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 21:59:06,396 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 21:59:06,397 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 21:59:06,397 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 21:59:06,397 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 21:59:06,397 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 21:59:06,397 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 21:59:06,397 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 21:59:06,397 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 21:59:06,398 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 21:59:06,398 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 21:59:06,398 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 21:59:06,398 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 21:59:06,398 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-13 21:59:06,398 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-13 21:59:06,398 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 21:59:06,398 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 21:59:06,398 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 21:59:06,398 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 21:59:06,399 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 21:59:06,399 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 21:59:06,399 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 21:59:06,399 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:59:06,399 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 21:59:06,399 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 21:59:06,399 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 21:59:06,399 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 21:59:06,399 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 21:59:06,399 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 21:59:06,400 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 21:59:06,400 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 21:59:06,400 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 21:59:06,400 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 21:59:06,400 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ec355916cf6ee76d4008e84bb2b3ecc632256e3b320d2f47b453f4ca1f46acbc [2025-03-13 21:59:06,624 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 21:59:06,637 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 21:59:06,640 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 21:59:06,641 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 21:59:06,641 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 21:59:06,642 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/11_fmaxsymopt.i [2025-03-13 21:59:07,848 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c8708496/a01327a3d4ee4e2bb0d4ca936654667e/FLAG7393084a6 [2025-03-13 21:59:08,137 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 21:59:08,139 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/11_fmaxsymopt.i [2025-03-13 21:59:08,152 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c8708496/a01327a3d4ee4e2bb0d4ca936654667e/FLAG7393084a6 [2025-03-13 21:59:08,168 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c8708496/a01327a3d4ee4e2bb0d4ca936654667e [2025-03-13 21:59:08,170 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 21:59:08,171 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 21:59:08,173 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 21:59:08,174 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 21:59:08,177 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 21:59:08,178 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:59:08" (1/1) ... [2025-03-13 21:59:08,180 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37192fe8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:59:08, skipping insertion in model container [2025-03-13 21:59:08,180 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:59:08" (1/1) ... [2025-03-13 21:59:08,214 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 21:59:08,443 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:59:08,453 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 21:59:08,490 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:59:08,519 INFO L204 MainTranslator]: Completed translation [2025-03-13 21:59:08,520 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:59:08 WrapperNode [2025-03-13 21:59:08,520 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 21:59:08,521 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 21:59:08,521 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 21:59:08,521 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 21:59:08,526 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:59:08" (1/1) ... [2025-03-13 21:59:08,541 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:59:08" (1/1) ... [2025-03-13 21:59:08,560 INFO L138 Inliner]: procedures = 164, calls = 29, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 108 [2025-03-13 21:59:08,563 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 21:59:08,564 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 21:59:08,564 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 21:59:08,564 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 21:59:08,569 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:59:08" (1/1) ... [2025-03-13 21:59:08,569 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:59:08" (1/1) ... [2025-03-13 21:59:08,571 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:59:08" (1/1) ... [2025-03-13 21:59:08,574 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:59:08" (1/1) ... [2025-03-13 21:59:08,581 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:59:08" (1/1) ... [2025-03-13 21:59:08,586 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:59:08" (1/1) ... [2025-03-13 21:59:08,587 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:59:08" (1/1) ... [2025-03-13 21:59:08,588 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:59:08" (1/1) ... [2025-03-13 21:59:08,589 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 21:59:08,593 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 21:59:08,593 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 21:59:08,593 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 21:59:08,594 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:59:08" (1/1) ... [2025-03-13 21:59:08,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:59:08,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:59:08,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-13 21:59:08,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-13 21:59:08,660 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-13 21:59:08,660 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-03-13 21:59:08,661 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-03-13 21:59:08,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-13 21:59:08,661 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-13 21:59:08,661 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-13 21:59:08,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-13 21:59:08,661 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-13 21:59:08,661 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 21:59:08,661 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 21:59:08,663 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-13 21:59:08,812 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 21:59:08,814 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 21:59:09,041 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 21:59:09,044 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 21:59:09,045 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 21:59:09,070 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 21:59:09,070 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:59:09 BoogieIcfgContainer [2025-03-13 21:59:09,071 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 21:59:09,074 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 21:59:09,074 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 21:59:09,078 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 21:59:09,078 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 09:59:08" (1/3) ... [2025-03-13 21:59:09,078 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@104fd96e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:59:09, skipping insertion in model container [2025-03-13 21:59:09,079 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:59:08" (2/3) ... [2025-03-13 21:59:09,080 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@104fd96e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:59:09, skipping insertion in model container [2025-03-13 21:59:09,080 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:59:09" (3/3) ... [2025-03-13 21:59:09,081 INFO L128 eAbstractionObserver]: Analyzing ICFG 11_fmaxsymopt.i [2025-03-13 21:59:09,091 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 21:59:09,093 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 11_fmaxsymopt.i that has 2 procedures, 118 locations, 1 initial locations, 3 loop locations, and 5 error locations. [2025-03-13 21:59:09,094 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 21:59:09,156 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-13 21:59:09,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 121 places, 126 transitions, 256 flow [2025-03-13 21:59:09,239 INFO L124 PetriNetUnfolderBase]: 8/133 cut-off events. [2025-03-13 21:59:09,244 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 21:59:09,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 133 events. 8/133 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 185 event pairs, 0 based on Foata normal form. 0/118 useless extension candidates. Maximal degree in co-relation 82. Up to 2 conditions per place. [2025-03-13 21:59:09,247 INFO L82 GeneralOperation]: Start removeDead. Operand has 121 places, 126 transitions, 256 flow [2025-03-13 21:59:09,250 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 121 places, 126 transitions, 256 flow [2025-03-13 21:59:09,259 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 21:59:09,267 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;@41ce3d40, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 21:59:09,270 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-03-13 21:59:09,287 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 21:59:09,287 INFO L124 PetriNetUnfolderBase]: 0/50 cut-off events. [2025-03-13 21:59:09,287 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 21:59:09,287 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:59:09,291 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:59:09,291 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-13 21:59:09,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:59:09,296 INFO L85 PathProgramCache]: Analyzing trace with hash 783243572, now seen corresponding path program 1 times [2025-03-13 21:59:09,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:59:09,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361908084] [2025-03-13 21:59:09,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:59:09,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:59:09,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-13 21:59:09,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-13 21:59:09,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:59:09,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:59:10,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:59:10,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:59:10,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361908084] [2025-03-13 21:59:10,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361908084] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:59:10,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:59:10,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:59:10,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896455677] [2025-03-13 21:59:10,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:59:10,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 21:59:10,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:59:10,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 21:59:10,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 21:59:10,250 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 126 [2025-03-13 21:59:10,254 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 126 transitions, 256 flow. Second operand has 6 states, 6 states have (on average 100.5) internal successors, (603), 6 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:59:10,254 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:59:10,254 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 126 [2025-03-13 21:59:10,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:59:10,316 INFO L124 PetriNetUnfolderBase]: 5/119 cut-off events. [2025-03-13 21:59:10,316 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-13 21:59:10,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 144 conditions, 119 events. 5/119 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 134 event pairs, 0 based on Foata normal form. 13/121 useless extension candidates. Maximal degree in co-relation 81. Up to 16 conditions per place. [2025-03-13 21:59:10,318 INFO L140 encePairwiseOnDemand]: 116/126 looper letters, 15 selfloop transitions, 5 changer transitions 0/116 dead transitions. [2025-03-13 21:59:10,318 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 116 transitions, 276 flow [2025-03-13 21:59:10,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:59:10,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:59:10,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 619 transitions. [2025-03-13 21:59:10,336 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8187830687830688 [2025-03-13 21:59:10,337 INFO L175 Difference]: Start difference. First operand has 121 places, 126 transitions, 256 flow. Second operand 6 states and 619 transitions. [2025-03-13 21:59:10,338 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 116 transitions, 276 flow [2025-03-13 21:59:10,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 116 transitions, 276 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 21:59:10,344 INFO L231 Difference]: Finished difference. Result has 119 places, 116 transitions, 246 flow [2025-03-13 21:59:10,345 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=246, PETRI_PLACES=119, PETRI_TRANSITIONS=116} [2025-03-13 21:59:10,348 INFO L279 CegarLoopForPetriNet]: 121 programPoint places, -2 predicate places. [2025-03-13 21:59:10,348 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 116 transitions, 246 flow [2025-03-13 21:59:10,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 100.5) internal successors, (603), 6 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:59:10,348 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:59:10,348 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:59:10,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 21:59:10,349 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-13 21:59:10,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:59:10,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1601911108, now seen corresponding path program 1 times [2025-03-13 21:59:10,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:59:10,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623916833] [2025-03-13 21:59:10,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:59:10,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:59:10,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-13 21:59:10,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-13 21:59:10,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:59:10,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:59:10,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:59:10,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:59:10,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623916833] [2025-03-13 21:59:10,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623916833] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:59:10,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:59:10,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 21:59:10,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907959438] [2025-03-13 21:59:10,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:59:10,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:59:10,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:59:10,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:59:10,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:59:10,448 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 126 [2025-03-13 21:59:10,448 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 116 transitions, 246 flow. Second operand has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:59:10,448 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:59:10,449 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 126 [2025-03-13 21:59:10,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:59:10,475 INFO L124 PetriNetUnfolderBase]: 5/131 cut-off events. [2025-03-13 21:59:10,475 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-13 21:59:10,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158 conditions, 131 events. 5/131 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 128 event pairs, 0 based on Foata normal form. 1/122 useless extension candidates. Maximal degree in co-relation 96. Up to 11 conditions per place. [2025-03-13 21:59:10,476 INFO L140 encePairwiseOnDemand]: 123/126 looper letters, 9 selfloop transitions, 2 changer transitions 0/117 dead transitions. [2025-03-13 21:59:10,476 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 117 transitions, 272 flow [2025-03-13 21:59:10,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:59:10,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:59:10,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 342 transitions. [2025-03-13 21:59:10,477 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9047619047619048 [2025-03-13 21:59:10,477 INFO L175 Difference]: Start difference. First operand has 119 places, 116 transitions, 246 flow. Second operand 3 states and 342 transitions. [2025-03-13 21:59:10,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 117 transitions, 272 flow [2025-03-13 21:59:10,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 117 transitions, 260 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 21:59:10,481 INFO L231 Difference]: Finished difference. Result has 117 places, 117 transitions, 248 flow [2025-03-13 21:59:10,481 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=248, PETRI_PLACES=117, PETRI_TRANSITIONS=117} [2025-03-13 21:59:10,481 INFO L279 CegarLoopForPetriNet]: 121 programPoint places, -4 predicate places. [2025-03-13 21:59:10,482 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 117 transitions, 248 flow [2025-03-13 21:59:10,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:59:10,482 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:59:10,482 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:59:10,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-13 21:59:10,482 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-13 21:59:10,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:59:10,483 INFO L85 PathProgramCache]: Analyzing trace with hash 906211406, now seen corresponding path program 1 times [2025-03-13 21:59:10,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:59:10,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868660905] [2025-03-13 21:59:10,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:59:10,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:59:10,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-13 21:59:10,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-13 21:59:10,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:59:10,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:59:10,587 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:59:10,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:59:10,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868660905] [2025-03-13 21:59:10,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868660905] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:59:10,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [810690010] [2025-03-13 21:59:10,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:59:10,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:59:10,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:59:10,592 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:59:10,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-13 21:59:10,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-13 21:59:10,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-13 21:59:10,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:59:10,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:59:10,662 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-13 21:59:10,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:59:10,718 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:59:10,718 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:59:10,765 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:59:10,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [810690010] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:59:10,767 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:59:10,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-13 21:59:10,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34563605] [2025-03-13 21:59:10,767 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:59:10,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-13 21:59:10,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:59:10,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-13 21:59:10,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-13 21:59:10,857 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 126 [2025-03-13 21:59:10,858 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 117 transitions, 248 flow. Second operand has 10 states, 10 states have (on average 108.9) internal successors, (1089), 10 states have internal predecessors, (1089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:59:10,858 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:59:10,858 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 126 [2025-03-13 21:59:10,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:59:10,940 INFO L124 PetriNetUnfolderBase]: 5/146 cut-off events. [2025-03-13 21:59:10,941 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-13 21:59:10,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 181 conditions, 146 events. 5/146 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 100 event pairs, 0 based on Foata normal form. 2/138 useless extension candidates. Maximal degree in co-relation 131. Up to 11 conditions per place. [2025-03-13 21:59:10,942 INFO L140 encePairwiseOnDemand]: 120/126 looper letters, 13 selfloop transitions, 9 changer transitions 0/125 dead transitions. [2025-03-13 21:59:10,942 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 125 transitions, 310 flow [2025-03-13 21:59:10,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-13 21:59:10,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-13 21:59:10,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 987 transitions. [2025-03-13 21:59:10,944 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8703703703703703 [2025-03-13 21:59:10,944 INFO L175 Difference]: Start difference. First operand has 117 places, 117 transitions, 248 flow. Second operand 9 states and 987 transitions. [2025-03-13 21:59:10,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 125 transitions, 310 flow [2025-03-13 21:59:10,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 125 transitions, 308 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 21:59:10,948 INFO L231 Difference]: Finished difference. Result has 127 places, 123 transitions, 296 flow [2025-03-13 21:59:10,949 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=296, PETRI_PLACES=127, PETRI_TRANSITIONS=123} [2025-03-13 21:59:10,949 INFO L279 CegarLoopForPetriNet]: 121 programPoint places, 6 predicate places. [2025-03-13 21:59:10,949 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 123 transitions, 296 flow [2025-03-13 21:59:10,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 108.9) internal successors, (1089), 10 states have internal predecessors, (1089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:59:10,951 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:59:10,951 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:59:10,958 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-13 21:59:11,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:59:11,153 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-13 21:59:11,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:59:11,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1229087986, now seen corresponding path program 2 times [2025-03-13 21:59:11,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:59:11,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697614787] [2025-03-13 21:59:11,154 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:59:11,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:59:11,171 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 77 statements into 2 equivalence classes. [2025-03-13 21:59:11,180 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 77 of 77 statements. [2025-03-13 21:59:11,180 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:59:11,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:59:11,354 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-13 21:59:11,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:59:11,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697614787] [2025-03-13 21:59:11,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697614787] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:59:11,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1998201649] [2025-03-13 21:59:11,355 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:59:11,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:59:11,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:59:11,360 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:59:11,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-13 21:59:11,408 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 77 statements into 2 equivalence classes. [2025-03-13 21:59:11,429 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 77 of 77 statements. [2025-03-13 21:59:11,429 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:59:11,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:59:11,430 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-13 21:59:11,432 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:59:11,497 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-13 21:59:11,497 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:59:11,609 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-13 21:59:11,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1998201649] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:59:11,609 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:59:11,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2025-03-13 21:59:11,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446437812] [2025-03-13 21:59:11,609 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:59:11,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-13 21:59:11,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:59:11,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-13 21:59:11,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-13 21:59:11,695 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 126 [2025-03-13 21:59:11,696 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 123 transitions, 296 flow. Second operand has 15 states, 15 states have (on average 109.06666666666666) internal successors, (1636), 15 states have internal predecessors, (1636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:59:11,697 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:59:11,697 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 126 [2025-03-13 21:59:11,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:59:11,855 INFO L124 PetriNetUnfolderBase]: 5/185 cut-off events. [2025-03-13 21:59:11,855 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2025-03-13 21:59:11,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 274 conditions, 185 events. 5/185 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 101 event pairs, 0 based on Foata normal form. 3/178 useless extension candidates. Maximal degree in co-relation 185. Up to 11 conditions per place. [2025-03-13 21:59:11,856 INFO L140 encePairwiseOnDemand]: 120/126 looper letters, 16 selfloop transitions, 18 changer transitions 0/137 dead transitions. [2025-03-13 21:59:11,856 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 137 transitions, 438 flow [2025-03-13 21:59:11,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-13 21:59:11,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-13 21:59:11,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1963 transitions. [2025-03-13 21:59:11,861 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8655202821869489 [2025-03-13 21:59:11,861 INFO L175 Difference]: Start difference. First operand has 127 places, 123 transitions, 296 flow. Second operand 18 states and 1963 transitions. [2025-03-13 21:59:11,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 137 transitions, 438 flow [2025-03-13 21:59:11,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 137 transitions, 426 flow, removed 5 selfloop flow, removed 1 redundant places. [2025-03-13 21:59:11,867 INFO L231 Difference]: Finished difference. Result has 147 places, 133 transitions, 396 flow [2025-03-13 21:59:11,867 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=396, PETRI_PLACES=147, PETRI_TRANSITIONS=133} [2025-03-13 21:59:11,867 INFO L279 CegarLoopForPetriNet]: 121 programPoint places, 26 predicate places. [2025-03-13 21:59:11,868 INFO L471 AbstractCegarLoop]: Abstraction has has 147 places, 133 transitions, 396 flow [2025-03-13 21:59:11,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 109.06666666666666) internal successors, (1636), 15 states have internal predecessors, (1636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:59:11,871 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:59:11,871 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:59:11,878 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-13 21:59:12,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-13 21:59:12,072 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-13 21:59:12,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:59:12,073 INFO L85 PathProgramCache]: Analyzing trace with hash 1150643836, now seen corresponding path program 3 times [2025-03-13 21:59:12,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:59:12,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363937698] [2025-03-13 21:59:12,073 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:59:12,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:59:12,089 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 116 statements into 8 equivalence classes. [2025-03-13 21:59:12,131 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 116 of 116 statements. [2025-03-13 21:59:12,132 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-03-13 21:59:12,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 21:59:12,132 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-13 21:59:12,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-13 21:59:12,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-13 21:59:12,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:59:12,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 21:59:12,192 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-13 21:59:12,192 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-13 21:59:12,195 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining) [2025-03-13 21:59:12,196 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (8 of 10 remaining) [2025-03-13 21:59:12,196 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (7 of 10 remaining) [2025-03-13 21:59:12,196 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (6 of 10 remaining) [2025-03-13 21:59:12,196 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (5 of 10 remaining) [2025-03-13 21:59:12,196 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (4 of 10 remaining) [2025-03-13 21:59:12,197 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (3 of 10 remaining) [2025-03-13 21:59:12,197 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (2 of 10 remaining) [2025-03-13 21:59:12,197 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 10 remaining) [2025-03-13 21:59:12,197 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 10 remaining) [2025-03-13 21:59:12,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-13 21:59:12,197 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1] [2025-03-13 21:59:12,199 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-13 21:59:12,199 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-13 21:59:12,230 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-13 21:59:12,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 190 places, 200 transitions, 410 flow [2025-03-13 21:59:12,257 INFO L124 PetriNetUnfolderBase]: 15/216 cut-off events. [2025-03-13 21:59:12,257 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-13 21:59:12,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 224 conditions, 216 events. 15/216 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 531 event pairs, 0 based on Foata normal form. 0/189 useless extension candidates. Maximal degree in co-relation 155. Up to 3 conditions per place. [2025-03-13 21:59:12,259 INFO L82 GeneralOperation]: Start removeDead. Operand has 190 places, 200 transitions, 410 flow [2025-03-13 21:59:12,260 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 190 places, 200 transitions, 410 flow [2025-03-13 21:59:12,261 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 21:59:12,261 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;@41ce3d40, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 21:59:12,262 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2025-03-13 21:59:12,266 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 21:59:12,266 INFO L124 PetriNetUnfolderBase]: 0/50 cut-off events. [2025-03-13 21:59:12,266 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 21:59:12,267 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:59:12,267 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:59:12,267 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-13 21:59:12,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:59:12,267 INFO L85 PathProgramCache]: Analyzing trace with hash -531312388, now seen corresponding path program 1 times [2025-03-13 21:59:12,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:59:12,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873534376] [2025-03-13 21:59:12,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:59:12,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:59:12,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-13 21:59:12,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-13 21:59:12,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:59:12,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:59:12,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:59:12,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:59:12,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873534376] [2025-03-13 21:59:12,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873534376] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:59:12,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:59:12,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:59:12,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457713842] [2025-03-13 21:59:12,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:59:12,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 21:59:12,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:59:12,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 21:59:12,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 21:59:12,591 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 200 [2025-03-13 21:59:12,592 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 200 transitions, 410 flow. Second operand has 6 states, 6 states have (on average 161.5) internal successors, (969), 6 states have internal predecessors, (969), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:59:12,592 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:59:12,592 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 200 [2025-03-13 21:59:12,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:59:12,707 INFO L124 PetriNetUnfolderBase]: 134/844 cut-off events. [2025-03-13 21:59:12,707 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2025-03-13 21:59:12,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1074 conditions, 844 events. 134/844 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 5311 event pairs, 72 based on Foata normal form. 137/853 useless extension candidates. Maximal degree in co-relation 384. Up to 193 conditions per place. [2025-03-13 21:59:12,713 INFO L140 encePairwiseOnDemand]: 187/200 looper letters, 24 selfloop transitions, 5 changer transitions 0/185 dead transitions. [2025-03-13 21:59:12,714 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 185 transitions, 438 flow [2025-03-13 21:59:12,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:59:12,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:59:12,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 997 transitions. [2025-03-13 21:59:12,716 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8308333333333333 [2025-03-13 21:59:12,716 INFO L175 Difference]: Start difference. First operand has 190 places, 200 transitions, 410 flow. Second operand 6 states and 997 transitions. [2025-03-13 21:59:12,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 185 transitions, 438 flow [2025-03-13 21:59:12,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 185 transitions, 438 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 21:59:12,718 INFO L231 Difference]: Finished difference. Result has 186 places, 185 transitions, 390 flow [2025-03-13 21:59:12,718 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=380, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=390, PETRI_PLACES=186, PETRI_TRANSITIONS=185} [2025-03-13 21:59:12,719 INFO L279 CegarLoopForPetriNet]: 190 programPoint places, -4 predicate places. [2025-03-13 21:59:12,719 INFO L471 AbstractCegarLoop]: Abstraction has has 186 places, 185 transitions, 390 flow [2025-03-13 21:59:12,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 161.5) internal successors, (969), 6 states have internal predecessors, (969), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:59:12,719 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:59:12,719 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:59:12,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-13 21:59:12,720 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-13 21:59:12,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:59:12,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1086610975, now seen corresponding path program 1 times [2025-03-13 21:59:12,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:59:12,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926378742] [2025-03-13 21:59:12,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:59:12,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:59:12,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-13 21:59:12,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-13 21:59:12,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:59:12,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:59:12,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:59:12,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:59:12,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926378742] [2025-03-13 21:59:12,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926378742] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:59:12,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:59:12,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 21:59:12,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798781953] [2025-03-13 21:59:12,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:59:12,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:59:12,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:59:12,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:59:12,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:59:12,758 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 200 [2025-03-13 21:59:12,759 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 185 transitions, 390 flow. Second operand has 3 states, 3 states have (on average 177.0) internal successors, (531), 3 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:59:12,759 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:59:12,759 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 200 [2025-03-13 21:59:12,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:59:12,819 INFO L124 PetriNetUnfolderBase]: 45/525 cut-off events. [2025-03-13 21:59:12,819 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2025-03-13 21:59:12,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 613 conditions, 525 events. 45/525 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2385 event pairs, 20 based on Foata normal form. 1/465 useless extension candidates. Maximal degree in co-relation 550. Up to 56 conditions per place. [2025-03-13 21:59:12,823 INFO L140 encePairwiseOnDemand]: 197/200 looper letters, 14 selfloop transitions, 2 changer transitions 0/186 dead transitions. [2025-03-13 21:59:12,823 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 186 transitions, 426 flow [2025-03-13 21:59:12,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:59:12,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:59:12,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 542 transitions. [2025-03-13 21:59:12,824 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9033333333333333 [2025-03-13 21:59:12,824 INFO L175 Difference]: Start difference. First operand has 186 places, 185 transitions, 390 flow. Second operand 3 states and 542 transitions. [2025-03-13 21:59:12,824 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 186 transitions, 426 flow [2025-03-13 21:59:12,825 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 186 transitions, 414 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 21:59:12,827 INFO L231 Difference]: Finished difference. Result has 184 places, 186 transitions, 392 flow [2025-03-13 21:59:12,827 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=380, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=392, PETRI_PLACES=184, PETRI_TRANSITIONS=186} [2025-03-13 21:59:12,828 INFO L279 CegarLoopForPetriNet]: 190 programPoint places, -6 predicate places. [2025-03-13 21:59:12,828 INFO L471 AbstractCegarLoop]: Abstraction has has 184 places, 186 transitions, 392 flow [2025-03-13 21:59:12,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 177.0) internal successors, (531), 3 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:59:12,828 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:59:12,828 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:59:12,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-13 21:59:12,829 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-13 21:59:12,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:59:12,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1869771963, now seen corresponding path program 1 times [2025-03-13 21:59:12,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:59:12,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604840296] [2025-03-13 21:59:12,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:59:12,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:59:12,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-13 21:59:12,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-13 21:59:12,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:59:12,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:59:12,878 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:59:12,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:59:12,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604840296] [2025-03-13 21:59:12,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604840296] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:59:12,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [301445119] [2025-03-13 21:59:12,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:59:12,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:59:12,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:59:12,883 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:59:12,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-13 21:59:12,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-13 21:59:12,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-13 21:59:12,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:59:12,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:59:12,958 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-13 21:59:12,959 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:59:12,989 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:59:12,989 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:59:13,025 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:59:13,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [301445119] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:59:13,025 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:59:13,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-13 21:59:13,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461970021] [2025-03-13 21:59:13,025 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:59:13,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-13 21:59:13,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:59:13,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-13 21:59:13,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-13 21:59:13,078 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 200 [2025-03-13 21:59:13,080 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 186 transitions, 392 flow. Second operand has 10 states, 10 states have (on average 174.0) internal successors, (1740), 10 states have internal predecessors, (1740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:59:13,080 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:59:13,080 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 200 [2025-03-13 21:59:13,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:59:13,187 INFO L124 PetriNetUnfolderBase]: 45/540 cut-off events. [2025-03-13 21:59:13,188 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2025-03-13 21:59:13,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 636 conditions, 540 events. 45/540 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2356 event pairs, 20 based on Foata normal form. 2/481 useless extension candidates. Maximal degree in co-relation 585. Up to 56 conditions per place. [2025-03-13 21:59:13,190 INFO L140 encePairwiseOnDemand]: 194/200 looper letters, 18 selfloop transitions, 9 changer transitions 0/194 dead transitions. [2025-03-13 21:59:13,190 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 194 transitions, 464 flow [2025-03-13 21:59:13,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-13 21:59:13,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-13 21:59:13,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1577 transitions. [2025-03-13 21:59:13,193 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8761111111111111 [2025-03-13 21:59:13,194 INFO L175 Difference]: Start difference. First operand has 184 places, 186 transitions, 392 flow. Second operand 9 states and 1577 transitions. [2025-03-13 21:59:13,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 194 transitions, 464 flow [2025-03-13 21:59:13,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 194 transitions, 462 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 21:59:13,196 INFO L231 Difference]: Finished difference. Result has 194 places, 192 transitions, 440 flow [2025-03-13 21:59:13,196 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=390, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=440, PETRI_PLACES=194, PETRI_TRANSITIONS=192} [2025-03-13 21:59:13,197 INFO L279 CegarLoopForPetriNet]: 190 programPoint places, 4 predicate places. [2025-03-13 21:59:13,197 INFO L471 AbstractCegarLoop]: Abstraction has has 194 places, 192 transitions, 440 flow [2025-03-13 21:59:13,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 174.0) internal successors, (1740), 10 states have internal predecessors, (1740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:59:13,198 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:59:13,198 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:59:13,204 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-13 21:59:13,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:59:13,401 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-13 21:59:13,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:59:13,402 INFO L85 PathProgramCache]: Analyzing trace with hash 347810427, now seen corresponding path program 2 times [2025-03-13 21:59:13,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:59:13,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481701417] [2025-03-13 21:59:13,402 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:59:13,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:59:13,413 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 83 statements into 2 equivalence classes. [2025-03-13 21:59:13,429 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 83 of 83 statements. [2025-03-13 21:59:13,430 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:59:13,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:59:13,572 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-13 21:59:13,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:59:13,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481701417] [2025-03-13 21:59:13,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481701417] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:59:13,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [500213188] [2025-03-13 21:59:13,572 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:59:13,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:59:13,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:59:13,574 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:59:13,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-13 21:59:13,627 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 83 statements into 2 equivalence classes. [2025-03-13 21:59:13,647 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 83 of 83 statements. [2025-03-13 21:59:13,647 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:59:13,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:59:13,648 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-13 21:59:13,649 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:59:13,725 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-13 21:59:13,727 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:59:13,822 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-13 21:59:13,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [500213188] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:59:13,823 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:59:13,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2025-03-13 21:59:13,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382040463] [2025-03-13 21:59:13,823 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:59:13,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-13 21:59:13,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:59:13,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-13 21:59:13,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-13 21:59:13,945 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 200 [2025-03-13 21:59:13,948 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 192 transitions, 440 flow. Second operand has 15 states, 15 states have (on average 174.13333333333333) internal successors, (2612), 15 states have internal predecessors, (2612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:59:13,948 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:59:13,948 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 200 [2025-03-13 21:59:13,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:59:14,181 INFO L124 PetriNetUnfolderBase]: 45/579 cut-off events. [2025-03-13 21:59:14,182 INFO L125 PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES. [2025-03-13 21:59:14,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 729 conditions, 579 events. 45/579 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2331 event pairs, 20 based on Foata normal form. 3/521 useless extension candidates. Maximal degree in co-relation 547. Up to 56 conditions per place. [2025-03-13 21:59:14,186 INFO L140 encePairwiseOnDemand]: 194/200 looper letters, 21 selfloop transitions, 18 changer transitions 0/206 dead transitions. [2025-03-13 21:59:14,186 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 206 transitions, 592 flow [2025-03-13 21:59:14,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-13 21:59:14,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-13 21:59:14,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 3138 transitions. [2025-03-13 21:59:14,195 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8716666666666667 [2025-03-13 21:59:14,195 INFO L175 Difference]: Start difference. First operand has 194 places, 192 transitions, 440 flow. Second operand 18 states and 3138 transitions. [2025-03-13 21:59:14,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 206 transitions, 592 flow [2025-03-13 21:59:14,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 206 transitions, 580 flow, removed 5 selfloop flow, removed 1 redundant places. [2025-03-13 21:59:14,201 INFO L231 Difference]: Finished difference. Result has 214 places, 202 transitions, 540 flow [2025-03-13 21:59:14,202 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=434, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=540, PETRI_PLACES=214, PETRI_TRANSITIONS=202} [2025-03-13 21:59:14,203 INFO L279 CegarLoopForPetriNet]: 190 programPoint places, 24 predicate places. [2025-03-13 21:59:14,204 INFO L471 AbstractCegarLoop]: Abstraction has has 214 places, 202 transitions, 540 flow [2025-03-13 21:59:14,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 174.13333333333333) internal successors, (2612), 15 states have internal predecessors, (2612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:59:14,206 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:59:14,206 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:59:14,217 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-13 21:59:14,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:59:14,407 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-13 21:59:14,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:59:14,408 INFO L85 PathProgramCache]: Analyzing trace with hash -296384351, now seen corresponding path program 3 times [2025-03-13 21:59:14,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:59:14,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254482493] [2025-03-13 21:59:14,408 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:59:14,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:59:14,426 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 122 statements into 8 equivalence classes. [2025-03-13 21:59:14,466 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 122 of 122 statements. [2025-03-13 21:59:14,467 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-03-13 21:59:14,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 21:59:14,467 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-13 21:59:14,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-13 21:59:14,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-13 21:59:14,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:59:14,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 21:59:14,502 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-13 21:59:14,502 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-13 21:59:14,502 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 14 remaining) [2025-03-13 21:59:14,502 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (12 of 14 remaining) [2025-03-13 21:59:14,502 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (11 of 14 remaining) [2025-03-13 21:59:14,502 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (10 of 14 remaining) [2025-03-13 21:59:14,503 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (9 of 14 remaining) [2025-03-13 21:59:14,503 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (8 of 14 remaining) [2025-03-13 21:59:14,503 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (7 of 14 remaining) [2025-03-13 21:59:14,503 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (6 of 14 remaining) [2025-03-13 21:59:14,503 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (5 of 14 remaining) [2025-03-13 21:59:14,503 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (4 of 14 remaining) [2025-03-13 21:59:14,503 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (3 of 14 remaining) [2025-03-13 21:59:14,503 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (2 of 14 remaining) [2025-03-13 21:59:14,503 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 14 remaining) [2025-03-13 21:59:14,503 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 14 remaining) [2025-03-13 21:59:14,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-13 21:59:14,504 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1] [2025-03-13 21:59:14,504 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-13 21:59:14,504 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-13 21:59:14,536 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-13 21:59:14,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 259 places, 274 transitions, 566 flow [2025-03-13 21:59:14,558 INFO L124 PetriNetUnfolderBase]: 22/299 cut-off events. [2025-03-13 21:59:14,558 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-13 21:59:14,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 312 conditions, 299 events. 22/299 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 964 event pairs, 0 based on Foata normal form. 0/260 useless extension candidates. Maximal degree in co-relation 228. Up to 4 conditions per place. [2025-03-13 21:59:14,561 INFO L82 GeneralOperation]: Start removeDead. Operand has 259 places, 274 transitions, 566 flow [2025-03-13 21:59:14,563 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 259 places, 274 transitions, 566 flow [2025-03-13 21:59:14,564 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 21:59:14,564 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;@41ce3d40, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 21:59:14,564 INFO L334 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2025-03-13 21:59:14,566 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 21:59:14,567 INFO L124 PetriNetUnfolderBase]: 0/50 cut-off events. [2025-03-13 21:59:14,567 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 21:59:14,567 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:59:14,567 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:59:14,567 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-13 21:59:14,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:59:14,567 INFO L85 PathProgramCache]: Analyzing trace with hash 674223054, now seen corresponding path program 1 times [2025-03-13 21:59:14,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:59:14,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663730455] [2025-03-13 21:59:14,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:59:14,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:59:14,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-13 21:59:14,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-13 21:59:14,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:59:14,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:59:14,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:59:14,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:59:14,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663730455] [2025-03-13 21:59:14,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663730455] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:59:14,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:59:14,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:59:14,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51056459] [2025-03-13 21:59:14,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:59:14,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 21:59:14,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:59:14,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 21:59:14,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 21:59:14,931 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 221 out of 274 [2025-03-13 21:59:14,933 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 274 transitions, 566 flow. Second operand has 6 states, 6 states have (on average 222.5) internal successors, (1335), 6 states have internal predecessors, (1335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:59:14,933 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:59:14,933 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 221 of 274 [2025-03-13 21:59:14,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:59:15,741 INFO L124 PetriNetUnfolderBase]: 2123/7948 cut-off events. [2025-03-13 21:59:15,741 INFO L125 PetriNetUnfolderBase]: For 622/622 co-relation queries the response was YES. [2025-03-13 21:59:15,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10942 conditions, 7948 events. 2123/7948 cut-off events. For 622/622 co-relation queries the response was YES. Maximal size of possible extension queue 313. Compared 85146 event pairs, 1368 based on Foata normal form. 1386/7953 useless extension candidates. Maximal degree in co-relation 1866. Up to 2632 conditions per place. [2025-03-13 21:59:15,833 INFO L140 encePairwiseOnDemand]: 258/274 looper letters, 33 selfloop transitions, 5 changer transitions 0/254 dead transitions. [2025-03-13 21:59:15,833 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 254 transitions, 602 flow [2025-03-13 21:59:15,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:59:15,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:59:15,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1375 transitions. [2025-03-13 21:59:15,836 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8363746958637469 [2025-03-13 21:59:15,836 INFO L175 Difference]: Start difference. First operand has 259 places, 274 transitions, 566 flow. Second operand 6 states and 1375 transitions. [2025-03-13 21:59:15,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 254 transitions, 602 flow [2025-03-13 21:59:15,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 254 transitions, 600 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-03-13 21:59:15,840 INFO L231 Difference]: Finished difference. Result has 253 places, 254 transitions, 534 flow [2025-03-13 21:59:15,840 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=524, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=249, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=534, PETRI_PLACES=253, PETRI_TRANSITIONS=254} [2025-03-13 21:59:15,841 INFO L279 CegarLoopForPetriNet]: 259 programPoint places, -6 predicate places. [2025-03-13 21:59:15,841 INFO L471 AbstractCegarLoop]: Abstraction has has 253 places, 254 transitions, 534 flow [2025-03-13 21:59:15,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 222.5) internal successors, (1335), 6 states have internal predecessors, (1335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:59:15,841 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:59:15,842 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:59:15,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-13 21:59:15,842 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-13 21:59:15,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:59:15,842 INFO L85 PathProgramCache]: Analyzing trace with hash -978672103, now seen corresponding path program 1 times [2025-03-13 21:59:15,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:59:15,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681930548] [2025-03-13 21:59:15,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:59:15,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:59:15,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-13 21:59:15,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-13 21:59:15,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:59:15,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:59:15,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:59:15,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:59:15,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681930548] [2025-03-13 21:59:15,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681930548] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:59:15,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:59:15,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 21:59:15,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689388261] [2025-03-13 21:59:15,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:59:15,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:59:15,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:59:15,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:59:15,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:59:15,882 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 240 out of 274 [2025-03-13 21:59:15,882 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 254 transitions, 534 flow. Second operand has 3 states, 3 states have (on average 242.33333333333334) internal successors, (727), 3 states have internal predecessors, (727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:59:15,882 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:59:15,882 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 240 of 274 [2025-03-13 21:59:15,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:59:16,178 INFO L124 PetriNetUnfolderBase]: 345/2595 cut-off events. [2025-03-13 21:59:16,178 INFO L125 PetriNetUnfolderBase]: For 168/168 co-relation queries the response was YES. [2025-03-13 21:59:16,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3084 conditions, 2595 events. 345/2595 cut-off events. For 168/168 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 22039 event pairs, 220 based on Foata normal form. 1/2279 useless extension candidates. Maximal degree in co-relation 3020. Up to 381 conditions per place. [2025-03-13 21:59:16,208 INFO L140 encePairwiseOnDemand]: 271/274 looper letters, 19 selfloop transitions, 2 changer transitions 0/255 dead transitions. [2025-03-13 21:59:16,209 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 255 transitions, 580 flow [2025-03-13 21:59:16,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:59:16,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:59:16,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 742 transitions. [2025-03-13 21:59:16,211 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.902676399026764 [2025-03-13 21:59:16,211 INFO L175 Difference]: Start difference. First operand has 253 places, 254 transitions, 534 flow. Second operand 3 states and 742 transitions. [2025-03-13 21:59:16,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 255 transitions, 580 flow [2025-03-13 21:59:16,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 255 transitions, 568 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 21:59:16,216 INFO L231 Difference]: Finished difference. Result has 251 places, 255 transitions, 536 flow [2025-03-13 21:59:16,217 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=524, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=536, PETRI_PLACES=251, PETRI_TRANSITIONS=255} [2025-03-13 21:59:16,217 INFO L279 CegarLoopForPetriNet]: 259 programPoint places, -8 predicate places. [2025-03-13 21:59:16,217 INFO L471 AbstractCegarLoop]: Abstraction has has 251 places, 255 transitions, 536 flow [2025-03-13 21:59:16,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 242.33333333333334) internal successors, (727), 3 states have internal predecessors, (727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:59:16,218 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:59:16,218 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:59:16,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-13 21:59:16,218 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-13 21:59:16,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:59:16,218 INFO L85 PathProgramCache]: Analyzing trace with hash 714799237, now seen corresponding path program 1 times [2025-03-13 21:59:16,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:59:16,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842716744] [2025-03-13 21:59:16,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:59:16,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:59:16,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-13 21:59:16,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-13 21:59:16,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:59:16,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:59:16,284 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:59:16,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:59:16,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842716744] [2025-03-13 21:59:16,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842716744] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:59:16,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [664233923] [2025-03-13 21:59:16,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:59:16,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:59:16,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:59:16,290 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:59:16,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-13 21:59:16,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-13 21:59:16,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-13 21:59:16,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:59:16,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:59:16,368 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-13 21:59:16,370 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:59:16,401 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:59:16,401 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:59:16,435 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:59:16,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [664233923] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:59:16,436 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:59:16,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-13 21:59:16,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210374526] [2025-03-13 21:59:16,437 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:59:16,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-13 21:59:16,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:59:16,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-13 21:59:16,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-13 21:59:16,497 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 237 out of 274 [2025-03-13 21:59:16,499 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 255 transitions, 536 flow. Second operand has 10 states, 10 states have (on average 239.1) internal successors, (2391), 10 states have internal predecessors, (2391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:59:16,500 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:59:16,500 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 237 of 274 [2025-03-13 21:59:16,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:59:16,850 INFO L124 PetriNetUnfolderBase]: 345/2610 cut-off events. [2025-03-13 21:59:16,851 INFO L125 PetriNetUnfolderBase]: For 167/167 co-relation queries the response was YES. [2025-03-13 21:59:16,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3107 conditions, 2610 events. 345/2610 cut-off events. For 167/167 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 21985 event pairs, 220 based on Foata normal form. 2/2295 useless extension candidates. Maximal degree in co-relation 3055. Up to 381 conditions per place. [2025-03-13 21:59:16,874 INFO L140 encePairwiseOnDemand]: 268/274 looper letters, 23 selfloop transitions, 9 changer transitions 0/263 dead transitions. [2025-03-13 21:59:16,874 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 263 transitions, 618 flow [2025-03-13 21:59:16,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-13 21:59:16,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-13 21:59:16,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2167 transitions. [2025-03-13 21:59:16,880 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8787510137875101 [2025-03-13 21:59:16,880 INFO L175 Difference]: Start difference. First operand has 251 places, 255 transitions, 536 flow. Second operand 9 states and 2167 transitions. [2025-03-13 21:59:16,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 259 places, 263 transitions, 618 flow [2025-03-13 21:59:16,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 263 transitions, 616 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 21:59:16,884 INFO L231 Difference]: Finished difference. Result has 261 places, 261 transitions, 584 flow [2025-03-13 21:59:16,885 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=534, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=249, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=584, PETRI_PLACES=261, PETRI_TRANSITIONS=261} [2025-03-13 21:59:16,885 INFO L279 CegarLoopForPetriNet]: 259 programPoint places, 2 predicate places. [2025-03-13 21:59:16,886 INFO L471 AbstractCegarLoop]: Abstraction has has 261 places, 261 transitions, 584 flow [2025-03-13 21:59:16,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 239.1) internal successors, (2391), 10 states have internal predecessors, (2391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:59:16,886 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:59:16,886 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:59:16,893 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-13 21:59:17,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-13 21:59:17,088 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-13 21:59:17,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:59:17,089 INFO L85 PathProgramCache]: Analyzing trace with hash -565061371, now seen corresponding path program 2 times [2025-03-13 21:59:17,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:59:17,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951797473] [2025-03-13 21:59:17,089 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:59:17,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:59:17,099 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 89 statements into 2 equivalence classes. [2025-03-13 21:59:17,105 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 89 of 89 statements. [2025-03-13 21:59:17,105 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:59:17,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:59:17,193 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 21:59:17,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:59:17,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951797473] [2025-03-13 21:59:17,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951797473] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:59:17,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1179582214] [2025-03-13 21:59:17,194 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:59:17,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:59:17,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:59:17,196 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:59:17,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-13 21:59:17,264 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 89 statements into 2 equivalence classes. [2025-03-13 21:59:17,285 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 89 of 89 statements. [2025-03-13 21:59:17,286 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:59:17,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:59:17,287 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-13 21:59:17,288 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:59:17,342 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 21:59:17,342 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:59:17,432 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 21:59:17,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1179582214] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:59:17,432 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:59:17,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2025-03-13 21:59:17,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846565101] [2025-03-13 21:59:17,432 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:59:17,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-13 21:59:17,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:59:17,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-13 21:59:17,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-13 21:59:17,511 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 237 out of 274 [2025-03-13 21:59:17,513 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 261 transitions, 584 flow. Second operand has 15 states, 15 states have (on average 239.2) internal successors, (3588), 15 states have internal predecessors, (3588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:59:17,514 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:59:17,514 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 237 of 274 [2025-03-13 21:59:17,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:59:17,922 INFO L124 PetriNetUnfolderBase]: 345/2649 cut-off events. [2025-03-13 21:59:17,923 INFO L125 PetriNetUnfolderBase]: For 189/189 co-relation queries the response was YES. [2025-03-13 21:59:17,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3200 conditions, 2649 events. 345/2649 cut-off events. For 189/189 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 21967 event pairs, 220 based on Foata normal form. 3/2335 useless extension candidates. Maximal degree in co-relation 3017. Up to 381 conditions per place. [2025-03-13 21:59:17,958 INFO L140 encePairwiseOnDemand]: 268/274 looper letters, 26 selfloop transitions, 18 changer transitions 0/275 dead transitions. [2025-03-13 21:59:17,958 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 275 transitions, 746 flow [2025-03-13 21:59:17,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-13 21:59:17,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-13 21:59:17,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 4313 transitions. [2025-03-13 21:59:17,966 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.874493106244931 [2025-03-13 21:59:17,966 INFO L175 Difference]: Start difference. First operand has 261 places, 261 transitions, 584 flow. Second operand 18 states and 4313 transitions. [2025-03-13 21:59:17,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 275 transitions, 746 flow [2025-03-13 21:59:17,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 275 transitions, 734 flow, removed 5 selfloop flow, removed 1 redundant places. [2025-03-13 21:59:17,972 INFO L231 Difference]: Finished difference. Result has 281 places, 271 transitions, 684 flow [2025-03-13 21:59:17,972 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=578, PETRI_DIFFERENCE_MINUEND_PLACES=260, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=250, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=684, PETRI_PLACES=281, PETRI_TRANSITIONS=271} [2025-03-13 21:59:17,973 INFO L279 CegarLoopForPetriNet]: 259 programPoint places, 22 predicate places. [2025-03-13 21:59:17,973 INFO L471 AbstractCegarLoop]: Abstraction has has 281 places, 271 transitions, 684 flow [2025-03-13 21:59:17,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 239.2) internal successors, (3588), 15 states have internal predecessors, (3588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:59:17,974 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:59:17,974 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:59:17,985 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-13 21:59:18,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:59:18,175 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-13 21:59:18,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:59:18,176 INFO L85 PathProgramCache]: Analyzing trace with hash 275805337, now seen corresponding path program 3 times [2025-03-13 21:59:18,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:59:18,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822244245] [2025-03-13 21:59:18,176 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:59:18,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:59:18,192 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 128 statements into 8 equivalence classes. [2025-03-13 21:59:18,225 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 128 of 128 statements. [2025-03-13 21:59:18,225 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-03-13 21:59:18,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 21:59:18,225 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-13 21:59:18,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-13 21:59:18,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-13 21:59:18,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:59:18,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 21:59:18,255 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-13 21:59:18,256 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-13 21:59:18,256 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (17 of 18 remaining) [2025-03-13 21:59:18,256 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (16 of 18 remaining) [2025-03-13 21:59:18,256 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (15 of 18 remaining) [2025-03-13 21:59:18,256 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (14 of 18 remaining) [2025-03-13 21:59:18,256 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (13 of 18 remaining) [2025-03-13 21:59:18,257 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (12 of 18 remaining) [2025-03-13 21:59:18,257 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (11 of 18 remaining) [2025-03-13 21:59:18,257 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (10 of 18 remaining) [2025-03-13 21:59:18,257 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (9 of 18 remaining) [2025-03-13 21:59:18,257 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (8 of 18 remaining) [2025-03-13 21:59:18,257 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (7 of 18 remaining) [2025-03-13 21:59:18,257 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (6 of 18 remaining) [2025-03-13 21:59:18,257 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (5 of 18 remaining) [2025-03-13 21:59:18,257 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (4 of 18 remaining) [2025-03-13 21:59:18,257 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (3 of 18 remaining) [2025-03-13 21:59:18,257 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (2 of 18 remaining) [2025-03-13 21:59:18,257 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 18 remaining) [2025-03-13 21:59:18,258 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 18 remaining) [2025-03-13 21:59:18,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-13 21:59:18,258 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1] [2025-03-13 21:59:18,258 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-13 21:59:18,259 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-03-13 21:59:18,290 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-13 21:59:18,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 328 places, 348 transitions, 724 flow [2025-03-13 21:59:18,325 INFO L124 PetriNetUnfolderBase]: 29/382 cut-off events. [2025-03-13 21:59:18,325 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-13 21:59:18,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 401 conditions, 382 events. 29/382 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1415 event pairs, 0 based on Foata normal form. 0/331 useless extension candidates. Maximal degree in co-relation 307. Up to 5 conditions per place. [2025-03-13 21:59:18,329 INFO L82 GeneralOperation]: Start removeDead. Operand has 328 places, 348 transitions, 724 flow [2025-03-13 21:59:18,331 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 328 places, 348 transitions, 724 flow [2025-03-13 21:59:18,332 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 21:59:18,332 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;@41ce3d40, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 21:59:18,332 INFO L334 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2025-03-13 21:59:18,334 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 21:59:18,334 INFO L124 PetriNetUnfolderBase]: 0/50 cut-off events. [2025-03-13 21:59:18,334 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 21:59:18,334 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:59:18,334 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:59:18,334 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-13 21:59:18,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:59:18,335 INFO L85 PathProgramCache]: Analyzing trace with hash 104882602, now seen corresponding path program 1 times [2025-03-13 21:59:18,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:59:18,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739046806] [2025-03-13 21:59:18,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:59:18,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:59:18,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-13 21:59:18,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-13 21:59:18,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:59:18,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:59:18,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:59:18,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:59:18,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739046806] [2025-03-13 21:59:18,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739046806] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:59:18,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:59:18,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:59:18,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460887143] [2025-03-13 21:59:18,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:59:18,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 21:59:18,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:59:18,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 21:59:18,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 21:59:18,638 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 282 out of 348 [2025-03-13 21:59:18,639 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 328 places, 348 transitions, 724 flow. Second operand has 6 states, 6 states have (on average 283.5) internal successors, (1701), 6 states have internal predecessors, (1701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:59:18,640 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:59:18,640 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 282 of 348 [2025-03-13 21:59:18,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:59:26,348 INFO L124 PetriNetUnfolderBase]: 27422/77788 cut-off events. [2025-03-13 21:59:26,348 INFO L125 PetriNetUnfolderBase]: For 9100/9100 co-relation queries the response was YES. [2025-03-13 21:59:26,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113885 conditions, 77788 events. 27422/77788 cut-off events. For 9100/9100 co-relation queries the response was YES. Maximal size of possible extension queue 2935. Compared 1072619 event pairs, 18864 based on Foata normal form. 13732/77272 useless extension candidates. Maximal degree in co-relation 10978. Up to 32089 conditions per place. [2025-03-13 21:59:27,341 INFO L140 encePairwiseOnDemand]: 329/348 looper letters, 42 selfloop transitions, 5 changer transitions 0/323 dead transitions. [2025-03-13 21:59:27,341 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 323 transitions, 768 flow [2025-03-13 21:59:27,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:59:27,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:59:27,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1753 transitions. [2025-03-13 21:59:27,343 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8395593869731801 [2025-03-13 21:59:27,344 INFO L175 Difference]: Start difference. First operand has 328 places, 348 transitions, 724 flow. Second operand 6 states and 1753 transitions. [2025-03-13 21:59:27,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 320 places, 323 transitions, 768 flow [2025-03-13 21:59:27,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 320 places, 323 transitions, 762 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-03-13 21:59:27,353 INFO L231 Difference]: Finished difference. Result has 320 places, 323 transitions, 678 flow [2025-03-13 21:59:27,354 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=668, PETRI_DIFFERENCE_MINUEND_PLACES=315, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=323, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=318, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=678, PETRI_PLACES=320, PETRI_TRANSITIONS=323} [2025-03-13 21:59:27,355 INFO L279 CegarLoopForPetriNet]: 328 programPoint places, -8 predicate places. [2025-03-13 21:59:27,355 INFO L471 AbstractCegarLoop]: Abstraction has has 320 places, 323 transitions, 678 flow [2025-03-13 21:59:27,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 283.5) internal successors, (1701), 6 states have internal predecessors, (1701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:59:27,356 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:59:27,356 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-13 21:59:27,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-13 21:59:27,356 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-13 21:59:27,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:59:27,357 INFO L85 PathProgramCache]: Analyzing trace with hash 803683252, now seen corresponding path program 1 times [2025-03-13 21:59:27,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:59:27,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882993302] [2025-03-13 21:59:27,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:59:27,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:59:27,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-13 21:59:27,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-13 21:59:27,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:59:27,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:59:27,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:59:27,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:59:27,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882993302] [2025-03-13 21:59:27,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882993302] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:59:27,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:59:27,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 21:59:27,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584762420] [2025-03-13 21:59:27,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:59:27,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:59:27,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:59:27,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:59:27,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:59:27,409 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 305 out of 348 [2025-03-13 21:59:27,410 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 323 transitions, 678 flow. Second operand has 3 states, 3 states have (on average 307.0) internal successors, (921), 3 states have internal predecessors, (921), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:59:27,410 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:59:27,410 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 305 of 348 [2025-03-13 21:59:27,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:59:29,446 INFO L124 PetriNetUnfolderBase]: 2345/13445 cut-off events. [2025-03-13 21:59:29,446 INFO L125 PetriNetUnfolderBase]: For 1218/1218 co-relation queries the response was YES. [2025-03-13 21:59:29,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16435 conditions, 13445 events. 2345/13445 cut-off events. For 1218/1218 co-relation queries the response was YES. Maximal size of possible extension queue 355. Compared 161309 event pairs, 1720 based on Foata normal form. 1/11848 useless extension candidates. Maximal degree in co-relation 16370. Up to 2506 conditions per place. [2025-03-13 21:59:29,567 INFO L140 encePairwiseOnDemand]: 345/348 looper letters, 24 selfloop transitions, 2 changer transitions 0/324 dead transitions. [2025-03-13 21:59:29,567 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 322 places, 324 transitions, 734 flow [2025-03-13 21:59:29,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:59:29,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:59:29,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 942 transitions. [2025-03-13 21:59:29,569 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9022988505747126 [2025-03-13 21:59:29,569 INFO L175 Difference]: Start difference. First operand has 320 places, 323 transitions, 678 flow. Second operand 3 states and 942 transitions. [2025-03-13 21:59:29,569 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 322 places, 324 transitions, 734 flow [2025-03-13 21:59:29,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 317 places, 324 transitions, 722 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 21:59:29,574 INFO L231 Difference]: Finished difference. Result has 318 places, 324 transitions, 680 flow [2025-03-13 21:59:29,575 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=668, PETRI_DIFFERENCE_MINUEND_PLACES=315, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=323, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=321, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=680, PETRI_PLACES=318, PETRI_TRANSITIONS=324} [2025-03-13 21:59:29,575 INFO L279 CegarLoopForPetriNet]: 328 programPoint places, -10 predicate places. [2025-03-13 21:59:29,575 INFO L471 AbstractCegarLoop]: Abstraction has has 318 places, 324 transitions, 680 flow [2025-03-13 21:59:29,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 307.0) internal successors, (921), 3 states have internal predecessors, (921), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:59:29,576 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:59:29,576 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-13 21:59:29,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-13 21:59:29,576 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-13 21:59:29,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:59:29,576 INFO L85 PathProgramCache]: Analyzing trace with hash -2122639124, now seen corresponding path program 1 times [2025-03-13 21:59:29,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:59:29,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543800852] [2025-03-13 21:59:29,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:59:29,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:59:29,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-13 21:59:29,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-13 21:59:29,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:59:29,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:59:29,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-13 21:59:29,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:59:29,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543800852] [2025-03-13 21:59:29,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543800852] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:59:29,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [676585530] [2025-03-13 21:59:29,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:59:29,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:59:29,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:59:29,627 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:59:29,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-13 21:59:29,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-13 21:59:29,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-13 21:59:29,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:59:29,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:59:29,709 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-13 21:59:29,710 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:59:29,716 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-13 21:59:29,716 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-13 21:59:29,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [676585530] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:59:29,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-13 21:59:29,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-13 21:59:29,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399877072] [2025-03-13 21:59:29,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:59:29,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:59:29,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:59:29,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:59:29,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-13 21:59:29,733 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 304 out of 348 [2025-03-13 21:59:29,733 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 324 transitions, 680 flow. Second operand has 3 states, 3 states have (on average 306.3333333333333) internal successors, (919), 3 states have internal predecessors, (919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:59:29,733 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:59:29,734 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 304 of 348 [2025-03-13 21:59:29,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:59:32,379 INFO L124 PetriNetUnfolderBase]: 5494/24147 cut-off events. [2025-03-13 21:59:32,379 INFO L125 PetriNetUnfolderBase]: For 1898/1898 co-relation queries the response was YES. [2025-03-13 21:59:32,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31651 conditions, 24147 events. 5494/24147 cut-off events. For 1898/1898 co-relation queries the response was YES. Maximal size of possible extension queue 626. Compared 309416 event pairs, 3970 based on Foata normal form. 156/21149 useless extension candidates. Maximal degree in co-relation 31603. Up to 5843 conditions per place. [2025-03-13 21:59:32,656 INFO L140 encePairwiseOnDemand]: 345/348 looper letters, 41 selfloop transitions, 2 changer transitions 0/340 dead transitions. [2025-03-13 21:59:32,656 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 340 transitions, 813 flow [2025-03-13 21:59:32,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:59:32,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:59:32,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 956 transitions. [2025-03-13 21:59:32,658 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9157088122605364 [2025-03-13 21:59:32,658 INFO L175 Difference]: Start difference. First operand has 318 places, 324 transitions, 680 flow. Second operand 3 states and 956 transitions. [2025-03-13 21:59:32,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 320 places, 340 transitions, 813 flow [2025-03-13 21:59:32,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 319 places, 340 transitions, 811 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 21:59:32,668 INFO L231 Difference]: Finished difference. Result has 320 places, 325 transitions, 690 flow [2025-03-13 21:59:32,668 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=678, PETRI_DIFFERENCE_MINUEND_PLACES=317, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=324, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=322, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=690, PETRI_PLACES=320, PETRI_TRANSITIONS=325} [2025-03-13 21:59:32,669 INFO L279 CegarLoopForPetriNet]: 328 programPoint places, -8 predicate places. [2025-03-13 21:59:32,669 INFO L471 AbstractCegarLoop]: Abstraction has has 320 places, 325 transitions, 690 flow [2025-03-13 21:59:32,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 306.3333333333333) internal successors, (919), 3 states have internal predecessors, (919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:59:32,669 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:59:32,669 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:59:32,677 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-13 21:59:32,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:59:32,870 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-13 21:59:32,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:59:32,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1503085716, now seen corresponding path program 1 times [2025-03-13 21:59:32,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:59:32,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278937764] [2025-03-13 21:59:32,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:59:32,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:59:32,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-13 21:59:32,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-13 21:59:32,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:59:32,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:59:32,915 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:59:32,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:59:32,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278937764] [2025-03-13 21:59:32,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278937764] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:59:32,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1173544150] [2025-03-13 21:59:32,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:59:32,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:59:32,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:59:32,920 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:59:32,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-13 21:59:32,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-13 21:59:33,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-13 21:59:33,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:59:33,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:59:33,007 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-13 21:59:33,008 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:59:33,216 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:59:33,216 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:59:33,247 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:59:33,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1173544150] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:59:33,247 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:59:33,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-13 21:59:33,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415405573] [2025-03-13 21:59:33,247 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:59:33,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-13 21:59:33,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:59:33,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-13 21:59:33,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-13 21:59:33,297 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 348 [2025-03-13 21:59:33,300 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 325 transitions, 690 flow. Second operand has 10 states, 10 states have (on average 304.2) internal successors, (3042), 10 states have internal predecessors, (3042), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:59:33,300 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:59:33,300 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 348 [2025-03-13 21:59:33,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:59:35,412 INFO L124 PetriNetUnfolderBase]: 2346/13479 cut-off events. [2025-03-13 21:59:35,412 INFO L125 PetriNetUnfolderBase]: For 1217/1217 co-relation queries the response was YES. [2025-03-13 21:59:35,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16482 conditions, 13479 events. 2346/13479 cut-off events. For 1217/1217 co-relation queries the response was YES. Maximal size of possible extension queue 334. Compared 162013 event pairs, 1720 based on Foata normal form. 2/11876 useless extension candidates. Maximal degree in co-relation 16386. Up to 2506 conditions per place. [2025-03-13 21:59:35,567 INFO L140 encePairwiseOnDemand]: 342/348 looper letters, 28 selfloop transitions, 9 changer transitions 0/333 dead transitions. [2025-03-13 21:59:35,567 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 328 places, 333 transitions, 782 flow [2025-03-13 21:59:35,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-13 21:59:35,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-13 21:59:35,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2757 transitions. [2025-03-13 21:59:35,570 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8802681992337165 [2025-03-13 21:59:35,570 INFO L175 Difference]: Start difference. First operand has 320 places, 325 transitions, 690 flow. Second operand 9 states and 2757 transitions. [2025-03-13 21:59:35,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 328 places, 333 transitions, 782 flow [2025-03-13 21:59:35,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 327 places, 333 transitions, 780 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 21:59:35,578 INFO L231 Difference]: Finished difference. Result has 330 places, 331 transitions, 738 flow [2025-03-13 21:59:35,579 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=688, PETRI_DIFFERENCE_MINUEND_PLACES=319, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=325, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=319, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=738, PETRI_PLACES=330, PETRI_TRANSITIONS=331} [2025-03-13 21:59:35,580 INFO L279 CegarLoopForPetriNet]: 328 programPoint places, 2 predicate places. [2025-03-13 21:59:35,580 INFO L471 AbstractCegarLoop]: Abstraction has has 330 places, 331 transitions, 738 flow [2025-03-13 21:59:35,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 304.2) internal successors, (3042), 10 states have internal predecessors, (3042), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:59:35,581 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:59:35,581 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:59:35,588 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-13 21:59:35,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:59:35,783 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-13 21:59:35,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:59:35,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1189562772, now seen corresponding path program 2 times [2025-03-13 21:59:35,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:59:35,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701716686] [2025-03-13 21:59:35,784 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:59:35,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:59:35,793 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 95 statements into 2 equivalence classes. [2025-03-13 21:59:35,799 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 95 of 95 statements. [2025-03-13 21:59:35,799 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:59:35,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:59:35,884 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 21:59:35,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:59:35,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701716686] [2025-03-13 21:59:35,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701716686] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:59:35,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1490598945] [2025-03-13 21:59:35,885 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:59:35,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:59:35,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:59:35,887 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:59:35,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-13 21:59:35,960 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 95 statements into 2 equivalence classes. [2025-03-13 21:59:35,980 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 95 of 95 statements. [2025-03-13 21:59:35,980 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:59:35,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:59:35,982 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-13 21:59:35,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:59:36,034 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 21:59:36,034 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:59:36,116 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 21:59:36,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1490598945] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:59:36,117 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:59:36,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2025-03-13 21:59:36,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378274442] [2025-03-13 21:59:36,117 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:59:36,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-13 21:59:36,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:59:36,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-13 21:59:36,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-13 21:59:36,197 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 348 [2025-03-13 21:59:36,199 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 330 places, 331 transitions, 738 flow. Second operand has 15 states, 15 states have (on average 304.26666666666665) internal successors, (4564), 15 states have internal predecessors, (4564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:59:36,199 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:59:36,200 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 348 [2025-03-13 21:59:36,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:59:38,108 INFO L124 PetriNetUnfolderBase]: 2346/13518 cut-off events. [2025-03-13 21:59:38,109 INFO L125 PetriNetUnfolderBase]: For 1239/1239 co-relation queries the response was YES. [2025-03-13 21:59:38,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16575 conditions, 13518 events. 2346/13518 cut-off events. For 1239/1239 co-relation queries the response was YES. Maximal size of possible extension queue 334. Compared 161844 event pairs, 1720 based on Foata normal form. 3/11916 useless extension candidates. Maximal degree in co-relation 16390. Up to 2506 conditions per place. [2025-03-13 21:59:38,332 INFO L140 encePairwiseOnDemand]: 342/348 looper letters, 31 selfloop transitions, 18 changer transitions 0/345 dead transitions. [2025-03-13 21:59:38,332 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 347 places, 345 transitions, 910 flow [2025-03-13 21:59:38,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-13 21:59:38,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-13 21:59:38,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 5488 transitions. [2025-03-13 21:59:38,336 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.876117496807152 [2025-03-13 21:59:38,336 INFO L175 Difference]: Start difference. First operand has 330 places, 331 transitions, 738 flow. Second operand 18 states and 5488 transitions. [2025-03-13 21:59:38,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 347 places, 345 transitions, 910 flow [2025-03-13 21:59:38,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 346 places, 345 transitions, 898 flow, removed 5 selfloop flow, removed 1 redundant places. [2025-03-13 21:59:38,345 INFO L231 Difference]: Finished difference. Result has 350 places, 341 transitions, 838 flow [2025-03-13 21:59:38,345 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=732, PETRI_DIFFERENCE_MINUEND_PLACES=329, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=331, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=320, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=838, PETRI_PLACES=350, PETRI_TRANSITIONS=341} [2025-03-13 21:59:38,345 INFO L279 CegarLoopForPetriNet]: 328 programPoint places, 22 predicate places. [2025-03-13 21:59:38,346 INFO L471 AbstractCegarLoop]: Abstraction has has 350 places, 341 transitions, 838 flow [2025-03-13 21:59:38,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 304.26666666666665) internal successors, (4564), 15 states have internal predecessors, (4564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:59:38,347 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:59:38,347 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:59:38,382 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-13 21:59:38,547 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-13 21:59:38,548 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-13 21:59:38,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:59:38,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1970315428, now seen corresponding path program 3 times [2025-03-13 21:59:38,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:59:38,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285055462] [2025-03-13 21:59:38,548 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:59:38,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:59:38,559 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 134 statements into 8 equivalence classes. [2025-03-13 21:59:38,589 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 134 of 134 statements. [2025-03-13 21:59:38,589 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-03-13 21:59:38,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 21:59:38,589 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-13 21:59:38,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-13 21:59:38,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-13 21:59:38,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:59:38,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 21:59:38,617 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-13 21:59:38,618 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-13 21:59:38,618 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (21 of 22 remaining) [2025-03-13 21:59:38,618 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (20 of 22 remaining) [2025-03-13 21:59:38,618 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (19 of 22 remaining) [2025-03-13 21:59:38,618 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (18 of 22 remaining) [2025-03-13 21:59:38,618 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (17 of 22 remaining) [2025-03-13 21:59:38,618 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (16 of 22 remaining) [2025-03-13 21:59:38,618 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (15 of 22 remaining) [2025-03-13 21:59:38,618 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (14 of 22 remaining) [2025-03-13 21:59:38,618 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (13 of 22 remaining) [2025-03-13 21:59:38,618 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (12 of 22 remaining) [2025-03-13 21:59:38,619 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (11 of 22 remaining) [2025-03-13 21:59:38,619 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (10 of 22 remaining) [2025-03-13 21:59:38,619 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (9 of 22 remaining) [2025-03-13 21:59:38,619 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (8 of 22 remaining) [2025-03-13 21:59:38,619 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (7 of 22 remaining) [2025-03-13 21:59:38,619 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (6 of 22 remaining) [2025-03-13 21:59:38,619 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (5 of 22 remaining) [2025-03-13 21:59:38,619 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (4 of 22 remaining) [2025-03-13 21:59:38,619 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (3 of 22 remaining) [2025-03-13 21:59:38,619 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (2 of 22 remaining) [2025-03-13 21:59:38,619 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 22 remaining) [2025-03-13 21:59:38,619 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 22 remaining) [2025-03-13 21:59:38,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-13 21:59:38,619 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1] [2025-03-13 21:59:38,620 WARN L246 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-13 21:59:38,620 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2025-03-13 21:59:38,659 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-13 21:59:38,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 397 places, 422 transitions, 884 flow [2025-03-13 21:59:38,704 INFO L124 PetriNetUnfolderBase]: 36/465 cut-off events. [2025-03-13 21:59:38,704 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-03-13 21:59:38,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 491 conditions, 465 events. 36/465 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1913 event pairs, 0 based on Foata normal form. 0/402 useless extension candidates. Maximal degree in co-relation 395. Up to 6 conditions per place. [2025-03-13 21:59:38,712 INFO L82 GeneralOperation]: Start removeDead. Operand has 397 places, 422 transitions, 884 flow [2025-03-13 21:59:38,716 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 397 places, 422 transitions, 884 flow [2025-03-13 21:59:38,717 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 21:59:38,718 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;@41ce3d40, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 21:59:38,718 INFO L334 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2025-03-13 21:59:38,720 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 21:59:38,720 INFO L124 PetriNetUnfolderBase]: 0/50 cut-off events. [2025-03-13 21:59:38,720 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 21:59:38,720 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:59:38,720 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:59:38,720 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-13 21:59:38,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:59:38,721 INFO L85 PathProgramCache]: Analyzing trace with hash 2055633552, now seen corresponding path program 1 times [2025-03-13 21:59:38,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:59:38,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169769440] [2025-03-13 21:59:38,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:59:38,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:59:38,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-13 21:59:38,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-13 21:59:38,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:59:38,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:59:38,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:59:38,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:59:38,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169769440] [2025-03-13 21:59:38,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169769440] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:59:38,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:59:38,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:59:38,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290289831] [2025-03-13 21:59:38,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:59:38,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 21:59:38,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:59:38,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 21:59:38,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 21:59:39,057 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 343 out of 422 [2025-03-13 21:59:39,058 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 397 places, 422 transitions, 884 flow. Second operand has 6 states, 6 states have (on average 344.5) internal successors, (2067), 6 states have internal predecessors, (2067), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:59:39,058 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:59:39,058 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 343 of 422 [2025-03-13 21:59:39,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand