./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-ext/09_fmaxsym-race.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-ext/09_fmaxsym-race.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f225ad0ddd29038af28d51fbbac3525492e9437e240dca78f58919375937976a --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 06:24:37,161 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 06:24:37,211 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-04 06:24:37,217 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 06:24:37,217 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 06:24:37,237 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 06:24:37,238 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 06:24:37,238 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 06:24:37,238 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 06:24:37,238 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 06:24:37,240 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 06:24:37,240 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 06:24:37,240 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 06:24:37,240 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 06:24:37,240 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 06:24:37,240 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 06:24:37,240 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 06:24:37,240 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 06:24:37,240 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 06:24:37,240 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 06:24:37,240 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 06:24:37,240 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 06:24:37,240 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-04 06:24:37,240 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 06:24:37,241 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 06:24:37,241 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 06:24:37,241 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 06:24:37,241 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 06:24:37,241 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 06:24:37,241 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 06:24:37,241 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 06:24:37,241 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:24:37,241 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 06:24:37,241 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 06:24:37,241 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 06:24:37,241 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 06:24:37,241 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 06:24:37,241 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 06:24:37,241 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 06:24:37,241 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 06:24:37,241 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 06:24:37,241 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 06:24:37,242 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f225ad0ddd29038af28d51fbbac3525492e9437e240dca78f58919375937976a [2025-03-04 06:24:37,503 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 06:24:37,513 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 06:24:37,517 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 06:24:37,519 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 06:24:37,519 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 06:24:37,520 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/09_fmaxsym-race.i [2025-03-04 06:24:38,697 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81d051806/1ffd42f152914d22acd6b2bff7b06dde/FLAG479448abb [2025-03-04 06:24:38,974 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 06:24:38,974 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/09_fmaxsym-race.i [2025-03-04 06:24:38,984 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81d051806/1ffd42f152914d22acd6b2bff7b06dde/FLAG479448abb [2025-03-04 06:24:39,280 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81d051806/1ffd42f152914d22acd6b2bff7b06dde [2025-03-04 06:24:39,282 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 06:24:39,283 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 06:24:39,285 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 06:24:39,285 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 06:24:39,287 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 06:24:39,288 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:24:39" (1/1) ... [2025-03-04 06:24:39,290 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31ab76b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:24:39, skipping insertion in model container [2025-03-04 06:24:39,290 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:24:39" (1/1) ... [2025-03-04 06:24:39,317 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 06:24:39,535 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:24:39,544 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 06:24:39,582 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:24:39,607 INFO L204 MainTranslator]: Completed translation [2025-03-04 06:24:39,608 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:24:39 WrapperNode [2025-03-04 06:24:39,608 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 06:24:39,609 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 06:24:39,609 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 06:24:39,609 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 06:24:39,614 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:24:39" (1/1) ... [2025-03-04 06:24:39,624 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:24:39" (1/1) ... [2025-03-04 06:24:39,638 INFO L138 Inliner]: procedures = 164, calls = 27, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 97 [2025-03-04 06:24:39,640 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 06:24:39,640 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 06:24:39,641 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 06:24:39,641 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 06:24:39,646 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:24:39" (1/1) ... [2025-03-04 06:24:39,646 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:24:39" (1/1) ... [2025-03-04 06:24:39,648 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:24:39" (1/1) ... [2025-03-04 06:24:39,648 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:24:39" (1/1) ... [2025-03-04 06:24:39,658 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:24:39" (1/1) ... [2025-03-04 06:24:39,659 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:24:39" (1/1) ... [2025-03-04 06:24:39,661 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:24:39" (1/1) ... [2025-03-04 06:24:39,662 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:24:39" (1/1) ... [2025-03-04 06:24:39,667 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 06:24:39,667 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 06:24:39,668 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 06:24:39,668 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 06:24:39,668 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:24:39" (1/1) ... [2025-03-04 06:24:39,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:24:39,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:24:39,703 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-04 06:24:39,706 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-04 06:24:39,725 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-04 06:24:39,725 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-03-04 06:24:39,725 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-03-04 06:24:39,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-04 06:24:39,725 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-04 06:24:39,725 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 06:24:39,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-04 06:24:39,725 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-04 06:24:39,725 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 06:24:39,726 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 06:24:39,726 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 06:24:39,872 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 06:24:39,874 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 06:24:40,079 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 06:24:40,080 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 06:24:40,100 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 06:24:40,101 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 06:24:40,102 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:24:40 BoogieIcfgContainer [2025-03-04 06:24:40,102 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 06:24:40,104 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 06:24:40,104 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 06:24:40,108 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 06:24:40,108 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 06:24:39" (1/3) ... [2025-03-04 06:24:40,109 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e661556 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:24:40, skipping insertion in model container [2025-03-04 06:24:40,109 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:24:39" (2/3) ... [2025-03-04 06:24:40,109 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e661556 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:24:40, skipping insertion in model container [2025-03-04 06:24:40,109 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:24:40" (3/3) ... [2025-03-04 06:24:40,110 INFO L128 eAbstractionObserver]: Analyzing ICFG 09_fmaxsym-race.i [2025-03-04 06:24:40,123 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 06:24:40,124 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09_fmaxsym-race.i that has 2 procedures, 110 locations, 1 initial locations, 3 loop locations, and 5 error locations. [2025-03-04 06:24:40,124 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 06:24:40,194 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 06:24:40,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 116 transitions, 236 flow [2025-03-04 06:24:40,267 INFO L124 PetriNetUnfolderBase]: 6/123 cut-off events. [2025-03-04 06:24:40,268 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:24:40,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127 conditions, 123 events. 6/123 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 139 event pairs, 0 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 72. Up to 2 conditions per place. [2025-03-04 06:24:40,275 INFO L82 GeneralOperation]: Start removeDead. Operand has 113 places, 116 transitions, 236 flow [2025-03-04 06:24:40,279 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 113 places, 116 transitions, 236 flow [2025-03-04 06:24:40,285 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:24:40,296 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;@157413cd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:24:40,297 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-03-04 06:24:40,307 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:24:40,307 INFO L124 PetriNetUnfolderBase]: 0/50 cut-off events. [2025-03-04 06:24:40,307 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:24:40,307 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:24:40,310 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-04 06:24:40,311 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-04 06:24:40,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:24:40,316 INFO L85 PathProgramCache]: Analyzing trace with hash 174401161, now seen corresponding path program 1 times [2025-03-04 06:24:40,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:24:40,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331156133] [2025-03-04 06:24:40,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:24:40,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:24:40,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 06:24:40,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 06:24:40,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:24:40,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:24:40,964 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-04 06:24:40,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:24:40,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331156133] [2025-03-04 06:24:40,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331156133] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:24:40,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:24:40,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:24:40,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872232110] [2025-03-04 06:24:40,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:24:40,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:24:40,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:24:40,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:24:40,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:24:41,156 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 116 [2025-03-04 06:24:41,159 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 116 transitions, 236 flow. Second operand has 6 states, 6 states have (on average 92.5) internal successors, (555), 6 states have internal predecessors, (555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:24:41,161 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:24:41,161 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 116 [2025-03-04 06:24:41,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:24:41,214 INFO L124 PetriNetUnfolderBase]: 3/109 cut-off events. [2025-03-04 06:24:41,214 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 06:24:41,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132 conditions, 109 events. 3/109 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 84 event pairs, 0 based on Foata normal form. 11/111 useless extension candidates. Maximal degree in co-relation 69. Up to 14 conditions per place. [2025-03-04 06:24:41,219 INFO L140 encePairwiseOnDemand]: 106/116 looper letters, 13 selfloop transitions, 5 changer transitions 0/106 dead transitions. [2025-03-04 06:24:41,219 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 106 transitions, 252 flow [2025-03-04 06:24:41,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:24:41,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:24:41,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 569 transitions. [2025-03-04 06:24:41,233 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8175287356321839 [2025-03-04 06:24:41,235 INFO L175 Difference]: Start difference. First operand has 113 places, 116 transitions, 236 flow. Second operand 6 states and 569 transitions. [2025-03-04 06:24:41,235 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 106 transitions, 252 flow [2025-03-04 06:24:41,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 106 transitions, 252 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:24:41,242 INFO L231 Difference]: Finished difference. Result has 111 places, 106 transitions, 226 flow [2025-03-04 06:24:41,245 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=226, PETRI_PLACES=111, PETRI_TRANSITIONS=106} [2025-03-04 06:24:41,249 INFO L279 CegarLoopForPetriNet]: 113 programPoint places, -2 predicate places. [2025-03-04 06:24:41,249 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 106 transitions, 226 flow [2025-03-04 06:24:41,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 92.5) internal successors, (555), 6 states have internal predecessors, (555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:24:41,250 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:24:41,250 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-04 06:24:41,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 06:24:41,251 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-04 06:24:41,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:24:41,252 INFO L85 PathProgramCache]: Analyzing trace with hash -148451151, now seen corresponding path program 1 times [2025-03-04 06:24:41,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:24:41,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118550991] [2025-03-04 06:24:41,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:24:41,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:24:41,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-04 06:24:41,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 06:24:41,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:24:41,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:24:41,314 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-04 06:24:41,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:24:41,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118550991] [2025-03-04 06:24:41,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118550991] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:24:41,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:24:41,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 06:24:41,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950951808] [2025-03-04 06:24:41,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:24:41,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:24:41,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:24:41,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:24:41,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:24:41,337 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 116 [2025-03-04 06:24:41,338 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 106 transitions, 226 flow. Second operand has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:24:41,338 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:24:41,338 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 116 [2025-03-04 06:24:41,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:24:41,369 INFO L124 PetriNetUnfolderBase]: 3/121 cut-off events. [2025-03-04 06:24:41,369 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 06:24:41,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 146 conditions, 121 events. 3/121 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 80 event pairs, 0 based on Foata normal form. 1/114 useless extension candidates. Maximal degree in co-relation 84. Up to 9 conditions per place. [2025-03-04 06:24:41,370 INFO L140 encePairwiseOnDemand]: 113/116 looper letters, 7 selfloop transitions, 2 changer transitions 0/107 dead transitions. [2025-03-04 06:24:41,370 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 107 transitions, 248 flow [2025-03-04 06:24:41,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:24:41,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:24:41,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 316 transitions. [2025-03-04 06:24:41,373 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9080459770114943 [2025-03-04 06:24:41,375 INFO L175 Difference]: Start difference. First operand has 111 places, 106 transitions, 226 flow. Second operand 3 states and 316 transitions. [2025-03-04 06:24:41,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 107 transitions, 248 flow [2025-03-04 06:24:41,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 107 transitions, 236 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:24:41,377 INFO L231 Difference]: Finished difference. Result has 109 places, 107 transitions, 228 flow [2025-03-04 06:24:41,378 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=228, PETRI_PLACES=109, PETRI_TRANSITIONS=107} [2025-03-04 06:24:41,379 INFO L279 CegarLoopForPetriNet]: 113 programPoint places, -4 predicate places. [2025-03-04 06:24:41,379 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 107 transitions, 228 flow [2025-03-04 06:24:41,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:24:41,379 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:24:41,381 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-04 06:24:41,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 06:24:41,381 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-04 06:24:41,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:24:41,382 INFO L85 PathProgramCache]: Analyzing trace with hash 381274216, now seen corresponding path program 1 times [2025-03-04 06:24:41,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:24:41,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742284026] [2025-03-04 06:24:41,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:24:41,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:24:41,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-04 06:24:41,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 06:24:41,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:24:41,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:24:41,505 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-04 06:24:41,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:24:41,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742284026] [2025-03-04 06:24:41,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742284026] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:24:41,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [598885899] [2025-03-04 06:24:41,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:24:41,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:24:41,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:24:41,510 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-04 06:24:41,512 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-04 06:24:41,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-04 06:24:41,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 06:24:41,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:24:41,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:24:41,583 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 06:24:41,586 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:24:41,638 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-04 06:24:41,638 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 06:24:41,678 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-04 06:24:41,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [598885899] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 06:24:41,679 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 06:24:41,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-04 06:24:41,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169972743] [2025-03-04 06:24:41,679 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 06:24:41,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 06:24:41,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:24:41,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 06:24:41,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-04 06:24:41,751 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 116 [2025-03-04 06:24:41,752 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 107 transitions, 228 flow. Second operand has 10 states, 10 states have (on average 100.9) internal successors, (1009), 10 states have internal predecessors, (1009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:24:41,753 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:24:41,753 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 116 [2025-03-04 06:24:41,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:24:41,828 INFO L124 PetriNetUnfolderBase]: 3/136 cut-off events. [2025-03-04 06:24:41,829 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 06:24:41,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 169 conditions, 136 events. 3/136 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 52 event pairs, 0 based on Foata normal form. 2/130 useless extension candidates. Maximal degree in co-relation 119. Up to 9 conditions per place. [2025-03-04 06:24:41,830 INFO L140 encePairwiseOnDemand]: 110/116 looper letters, 11 selfloop transitions, 9 changer transitions 0/115 dead transitions. [2025-03-04 06:24:41,831 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 115 transitions, 286 flow [2025-03-04 06:24:41,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 06:24:41,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 06:24:41,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 913 transitions. [2025-03-04 06:24:41,833 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8745210727969349 [2025-03-04 06:24:41,833 INFO L175 Difference]: Start difference. First operand has 109 places, 107 transitions, 228 flow. Second operand 9 states and 913 transitions. [2025-03-04 06:24:41,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 115 transitions, 286 flow [2025-03-04 06:24:41,834 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 115 transitions, 284 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:24:41,838 INFO L231 Difference]: Finished difference. Result has 119 places, 113 transitions, 276 flow [2025-03-04 06:24:41,838 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=276, PETRI_PLACES=119, PETRI_TRANSITIONS=113} [2025-03-04 06:24:41,838 INFO L279 CegarLoopForPetriNet]: 113 programPoint places, 6 predicate places. [2025-03-04 06:24:41,839 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 113 transitions, 276 flow [2025-03-04 06:24:41,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 100.9) internal successors, (1009), 10 states have internal predecessors, (1009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:24:41,840 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:24:41,840 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-04 06:24:41,847 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 06:24:42,044 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-04 06:24:42,044 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-04 06:24:42,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:24:42,045 INFO L85 PathProgramCache]: Analyzing trace with hash -458587384, now seen corresponding path program 2 times [2025-03-04 06:24:42,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:24:42,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145471195] [2025-03-04 06:24:42,045 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 06:24:42,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:24:42,057 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 77 statements into 2 equivalence classes. [2025-03-04 06:24:42,068 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 77 of 77 statements. [2025-03-04 06:24:42,068 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 06:24:42,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:24:42,220 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-04 06:24:42,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:24:42,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145471195] [2025-03-04 06:24:42,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145471195] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:24:42,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [427711939] [2025-03-04 06:24:42,221 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 06:24:42,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:24:42,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:24:42,225 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-04 06:24:42,226 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-04 06:24:42,276 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 77 statements into 2 equivalence classes. [2025-03-04 06:24:42,301 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 77 of 77 statements. [2025-03-04 06:24:42,302 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 06:24:42,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:24:42,303 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 06:24:42,304 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:24:42,364 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-04 06:24:42,365 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 06:24:42,468 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-04 06:24:42,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [427711939] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 06:24:42,469 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 06:24:42,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2025-03-04 06:24:42,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589000807] [2025-03-04 06:24:42,470 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 06:24:42,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 06:24:42,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:24:42,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 06:24:42,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-04 06:24:42,579 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 116 [2025-03-04 06:24:42,581 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 113 transitions, 276 flow. Second operand has 15 states, 15 states have (on average 101.06666666666666) internal successors, (1516), 15 states have internal predecessors, (1516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:24:42,581 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:24:42,581 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 116 [2025-03-04 06:24:42,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:24:42,719 INFO L124 PetriNetUnfolderBase]: 3/175 cut-off events. [2025-03-04 06:24:42,720 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2025-03-04 06:24:42,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 262 conditions, 175 events. 3/175 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 53 event pairs, 0 based on Foata normal form. 3/170 useless extension candidates. Maximal degree in co-relation 185. Up to 9 conditions per place. [2025-03-04 06:24:42,722 INFO L140 encePairwiseOnDemand]: 110/116 looper letters, 14 selfloop transitions, 18 changer transitions 0/127 dead transitions. [2025-03-04 06:24:42,722 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 127 transitions, 414 flow [2025-03-04 06:24:42,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-04 06:24:42,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-04 06:24:42,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1817 transitions. [2025-03-04 06:24:42,725 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8702107279693486 [2025-03-04 06:24:42,727 INFO L175 Difference]: Start difference. First operand has 119 places, 113 transitions, 276 flow. Second operand 18 states and 1817 transitions. [2025-03-04 06:24:42,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 127 transitions, 414 flow [2025-03-04 06:24:42,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 127 transitions, 402 flow, removed 5 selfloop flow, removed 1 redundant places. [2025-03-04 06:24:42,733 INFO L231 Difference]: Finished difference. Result has 139 places, 123 transitions, 376 flow [2025-03-04 06:24:42,734 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=376, PETRI_PLACES=139, PETRI_TRANSITIONS=123} [2025-03-04 06:24:42,735 INFO L279 CegarLoopForPetriNet]: 113 programPoint places, 26 predicate places. [2025-03-04 06:24:42,735 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 123 transitions, 376 flow [2025-03-04 06:24:42,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 101.06666666666666) internal successors, (1516), 15 states have internal predecessors, (1516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:24:42,737 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:24:42,737 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-04 06:24:42,744 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 06:24:42,937 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-04 06:24:42,938 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-04 06:24:42,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:24:42,939 INFO L85 PathProgramCache]: Analyzing trace with hash 107965649, now seen corresponding path program 3 times [2025-03-04 06:24:42,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:24:42,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927857376] [2025-03-04 06:24:42,940 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 06:24:42,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:24:42,966 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 116 statements into 8 equivalence classes. [2025-03-04 06:24:43,014 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 116 of 116 statements. [2025-03-04 06:24:43,014 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-03-04 06:24:43,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:24:43,014 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 06:24:43,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-04 06:24:43,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-04 06:24:43,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:24:43,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:24:43,051 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 06:24:43,054 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 06:24:43,054 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining) [2025-03-04 06:24:43,055 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (8 of 10 remaining) [2025-03-04 06:24:43,055 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (7 of 10 remaining) [2025-03-04 06:24:43,055 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (6 of 10 remaining) [2025-03-04 06:24:43,055 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (5 of 10 remaining) [2025-03-04 06:24:43,056 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (4 of 10 remaining) [2025-03-04 06:24:43,056 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (3 of 10 remaining) [2025-03-04 06:24:43,056 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (2 of 10 remaining) [2025-03-04 06:24:43,056 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 10 remaining) [2025-03-04 06:24:43,056 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 10 remaining) [2025-03-04 06:24:43,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 06:24:43,056 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1] [2025-03-04 06:24:43,058 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 06:24:43,058 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-04 06:24:43,091 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 06:24:43,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 174 places, 180 transitions, 370 flow [2025-03-04 06:24:43,111 INFO L124 PetriNetUnfolderBase]: 11/196 cut-off events. [2025-03-04 06:24:43,111 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 06:24:43,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 196 events. 11/196 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 372 event pairs, 0 based on Foata normal form. 0/173 useless extension candidates. Maximal degree in co-relation 135. Up to 3 conditions per place. [2025-03-04 06:24:43,113 INFO L82 GeneralOperation]: Start removeDead. Operand has 174 places, 180 transitions, 370 flow [2025-03-04 06:24:43,114 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 174 places, 180 transitions, 370 flow [2025-03-04 06:24:43,115 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:24:43,115 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@157413cd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:24:43,115 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2025-03-04 06:24:43,129 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:24:43,129 INFO L124 PetriNetUnfolderBase]: 0/50 cut-off events. [2025-03-04 06:24:43,129 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:24:43,129 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:24:43,129 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-04 06:24:43,130 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-04 06:24:43,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:24:43,130 INFO L85 PathProgramCache]: Analyzing trace with hash -1008699203, now seen corresponding path program 1 times [2025-03-04 06:24:43,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:24:43,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120204126] [2025-03-04 06:24:43,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:24:43,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:24:43,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 06:24:43,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 06:24:43,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:24:43,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:24:43,304 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-04 06:24:43,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:24:43,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120204126] [2025-03-04 06:24:43,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120204126] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:24:43,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:24:43,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:24:43,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154913551] [2025-03-04 06:24:43,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:24:43,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:24:43,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:24:43,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:24:43,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:24:43,458 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 180 [2025-03-04 06:24:43,459 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 180 transitions, 370 flow. Second operand has 6 states, 6 states have (on average 145.5) internal successors, (873), 6 states have internal predecessors, (873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:24:43,459 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:24:43,459 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 180 [2025-03-04 06:24:43,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:24:43,527 INFO L124 PetriNetUnfolderBase]: 68/565 cut-off events. [2025-03-04 06:24:43,527 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2025-03-04 06:24:43,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 713 conditions, 565 events. 68/565 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 2649 event pairs, 42 based on Foata normal form. 90/566 useless extension candidates. Maximal degree in co-relation 461. Up to 117 conditions per place. [2025-03-04 06:24:43,531 INFO L140 encePairwiseOnDemand]: 167/180 looper letters, 20 selfloop transitions, 5 changer transitions 0/165 dead transitions. [2025-03-04 06:24:43,531 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 165 transitions, 390 flow [2025-03-04 06:24:43,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:24:43,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:24:43,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 897 transitions. [2025-03-04 06:24:43,534 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8305555555555556 [2025-03-04 06:24:43,534 INFO L175 Difference]: Start difference. First operand has 174 places, 180 transitions, 370 flow. Second operand 6 states and 897 transitions. [2025-03-04 06:24:43,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 165 transitions, 390 flow [2025-03-04 06:24:43,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 165 transitions, 390 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:24:43,537 INFO L231 Difference]: Finished difference. Result has 170 places, 165 transitions, 350 flow [2025-03-04 06:24:43,537 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=340, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=350, PETRI_PLACES=170, PETRI_TRANSITIONS=165} [2025-03-04 06:24:43,538 INFO L279 CegarLoopForPetriNet]: 174 programPoint places, -4 predicate places. [2025-03-04 06:24:43,538 INFO L471 AbstractCegarLoop]: Abstraction has has 170 places, 165 transitions, 350 flow [2025-03-04 06:24:43,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 145.5) internal successors, (873), 6 states have internal predecessors, (873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:24:43,539 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:24:43,539 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-04 06:24:43,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 06:24:43,539 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-04 06:24:43,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:24:43,540 INFO L85 PathProgramCache]: Analyzing trace with hash -619562928, now seen corresponding path program 1 times [2025-03-04 06:24:43,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:24:43,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433439417] [2025-03-04 06:24:43,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:24:43,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:24:43,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-04 06:24:43,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 06:24:43,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:24:43,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:24:43,564 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-04 06:24:43,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:24:43,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433439417] [2025-03-04 06:24:43,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433439417] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:24:43,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:24:43,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 06:24:43,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988638133] [2025-03-04 06:24:43,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:24:43,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:24:43,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:24:43,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:24:43,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:24:43,589 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 180 [2025-03-04 06:24:43,590 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 165 transitions, 350 flow. Second operand has 3 states, 3 states have (on average 161.0) internal successors, (483), 3 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:24:43,590 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:24:43,590 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 180 [2025-03-04 06:24:43,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:24:43,630 INFO L124 PetriNetUnfolderBase]: 15/321 cut-off events. [2025-03-04 06:24:43,630 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-03-04 06:24:43,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 371 conditions, 321 events. 15/321 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 898 event pairs, 6 based on Foata normal form. 1/289 useless extension candidates. Maximal degree in co-relation 308. Up to 24 conditions per place. [2025-03-04 06:24:43,632 INFO L140 encePairwiseOnDemand]: 177/180 looper letters, 10 selfloop transitions, 2 changer transitions 0/166 dead transitions. [2025-03-04 06:24:43,632 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 166 transitions, 378 flow [2025-03-04 06:24:43,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:24:43,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:24:43,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 490 transitions. [2025-03-04 06:24:43,633 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9074074074074074 [2025-03-04 06:24:43,634 INFO L175 Difference]: Start difference. First operand has 170 places, 165 transitions, 350 flow. Second operand 3 states and 490 transitions. [2025-03-04 06:24:43,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 166 transitions, 378 flow [2025-03-04 06:24:43,634 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 166 transitions, 366 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:24:43,636 INFO L231 Difference]: Finished difference. Result has 168 places, 166 transitions, 352 flow [2025-03-04 06:24:43,636 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=340, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=352, PETRI_PLACES=168, PETRI_TRANSITIONS=166} [2025-03-04 06:24:43,639 INFO L279 CegarLoopForPetriNet]: 174 programPoint places, -6 predicate places. [2025-03-04 06:24:43,639 INFO L471 AbstractCegarLoop]: Abstraction has has 168 places, 166 transitions, 352 flow [2025-03-04 06:24:43,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 161.0) internal successors, (483), 3 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:24:43,639 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:24:43,640 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-04 06:24:43,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 06:24:43,640 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-04 06:24:43,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:24:43,641 INFO L85 PathProgramCache]: Analyzing trace with hash 648955515, now seen corresponding path program 1 times [2025-03-04 06:24:43,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:24:43,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464046767] [2025-03-04 06:24:43,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:24:43,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:24:43,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-04 06:24:43,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-04 06:24:43,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:24:43,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:24:43,698 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-04 06:24:43,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:24:43,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464046767] [2025-03-04 06:24:43,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464046767] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:24:43,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1331464817] [2025-03-04 06:24:43,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:24:43,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:24:43,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:24:43,701 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-04 06:24:43,703 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-04 06:24:43,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-04 06:24:43,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-04 06:24:43,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:24:43,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:24:43,761 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 06:24:43,762 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:24:43,799 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-04 06:24:43,799 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 06:24:43,830 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-04 06:24:43,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1331464817] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 06:24:43,830 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 06:24:43,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-04 06:24:43,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911521042] [2025-03-04 06:24:43,830 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 06:24:43,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 06:24:43,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:24:43,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 06:24:43,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-04 06:24:43,879 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 180 [2025-03-04 06:24:43,881 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 166 transitions, 352 flow. Second operand has 10 states, 10 states have (on average 158.0) internal successors, (1580), 10 states have internal predecessors, (1580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:24:43,881 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:24:43,881 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 180 [2025-03-04 06:24:43,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:24:43,997 INFO L124 PetriNetUnfolderBase]: 15/336 cut-off events. [2025-03-04 06:24:44,001 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-03-04 06:24:44,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 394 conditions, 336 events. 15/336 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 871 event pairs, 6 based on Foata normal form. 2/305 useless extension candidates. Maximal degree in co-relation 343. Up to 24 conditions per place. [2025-03-04 06:24:44,004 INFO L140 encePairwiseOnDemand]: 174/180 looper letters, 14 selfloop transitions, 9 changer transitions 0/174 dead transitions. [2025-03-04 06:24:44,004 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 174 transitions, 416 flow [2025-03-04 06:24:44,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 06:24:44,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 06:24:44,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1429 transitions. [2025-03-04 06:24:44,008 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8820987654320988 [2025-03-04 06:24:44,008 INFO L175 Difference]: Start difference. First operand has 168 places, 166 transitions, 352 flow. Second operand 9 states and 1429 transitions. [2025-03-04 06:24:44,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 174 transitions, 416 flow [2025-03-04 06:24:44,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 174 transitions, 414 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:24:44,011 INFO L231 Difference]: Finished difference. Result has 178 places, 172 transitions, 400 flow [2025-03-04 06:24:44,012 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=350, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=400, PETRI_PLACES=178, PETRI_TRANSITIONS=172} [2025-03-04 06:24:44,012 INFO L279 CegarLoopForPetriNet]: 174 programPoint places, 4 predicate places. [2025-03-04 06:24:44,013 INFO L471 AbstractCegarLoop]: Abstraction has has 178 places, 172 transitions, 400 flow [2025-03-04 06:24:44,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 158.0) internal successors, (1580), 10 states have internal predecessors, (1580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:24:44,014 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:24:44,014 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-04 06:24:44,021 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 06:24:44,219 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-04 06:24:44,219 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-04 06:24:44,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:24:44,220 INFO L85 PathProgramCache]: Analyzing trace with hash 2046702747, now seen corresponding path program 2 times [2025-03-04 06:24:44,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:24:44,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789458819] [2025-03-04 06:24:44,220 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 06:24:44,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:24:44,230 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 83 statements into 2 equivalence classes. [2025-03-04 06:24:44,240 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 83 of 83 statements. [2025-03-04 06:24:44,241 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 06:24:44,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:24:44,357 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:24:44,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:24:44,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789458819] [2025-03-04 06:24:44,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789458819] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:24:44,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [21831806] [2025-03-04 06:24:44,357 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 06:24:44,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:24:44,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:24:44,359 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-04 06:24:44,361 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-04 06:24:44,410 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 83 statements into 2 equivalence classes. [2025-03-04 06:24:44,436 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 83 of 83 statements. [2025-03-04 06:24:44,436 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 06:24:44,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:24:44,437 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 06:24:44,439 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:24:44,497 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:24:44,497 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 06:24:44,584 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:24:44,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [21831806] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 06:24:44,584 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 06:24:44,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2025-03-04 06:24:44,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649663848] [2025-03-04 06:24:44,584 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 06:24:44,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 06:24:44,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:24:44,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 06:24:44,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-04 06:24:44,662 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 180 [2025-03-04 06:24:44,665 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 172 transitions, 400 flow. Second operand has 15 states, 15 states have (on average 158.13333333333333) internal successors, (2372), 15 states have internal predecessors, (2372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:24:44,665 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:24:44,665 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 180 [2025-03-04 06:24:44,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:24:44,817 INFO L124 PetriNetUnfolderBase]: 15/375 cut-off events. [2025-03-04 06:24:44,818 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2025-03-04 06:24:44,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 487 conditions, 375 events. 15/375 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 873 event pairs, 6 based on Foata normal form. 3/345 useless extension candidates. Maximal degree in co-relation 305. Up to 24 conditions per place. [2025-03-04 06:24:44,820 INFO L140 encePairwiseOnDemand]: 174/180 looper letters, 17 selfloop transitions, 18 changer transitions 0/186 dead transitions. [2025-03-04 06:24:44,820 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 186 transitions, 544 flow [2025-03-04 06:24:44,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-04 06:24:44,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-04 06:24:44,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 2846 transitions. [2025-03-04 06:24:44,825 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8783950617283951 [2025-03-04 06:24:44,825 INFO L175 Difference]: Start difference. First operand has 178 places, 172 transitions, 400 flow. Second operand 18 states and 2846 transitions. [2025-03-04 06:24:44,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 186 transitions, 544 flow [2025-03-04 06:24:44,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 186 transitions, 532 flow, removed 5 selfloop flow, removed 1 redundant places. [2025-03-04 06:24:44,828 INFO L231 Difference]: Finished difference. Result has 198 places, 182 transitions, 500 flow [2025-03-04 06:24:44,829 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=394, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=500, PETRI_PLACES=198, PETRI_TRANSITIONS=182} [2025-03-04 06:24:44,829 INFO L279 CegarLoopForPetriNet]: 174 programPoint places, 24 predicate places. [2025-03-04 06:24:44,829 INFO L471 AbstractCegarLoop]: Abstraction has has 198 places, 182 transitions, 500 flow [2025-03-04 06:24:44,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 158.13333333333333) internal successors, (2372), 15 states have internal predecessors, (2372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:24:44,830 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:24:44,830 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-04 06:24:44,837 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 06:24:45,031 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-04 06:24:45,031 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-04 06:24:45,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:24:45,032 INFO L85 PathProgramCache]: Analyzing trace with hash 932465136, now seen corresponding path program 3 times [2025-03-04 06:24:45,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:24:45,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868023086] [2025-03-04 06:24:45,033 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 06:24:45,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:24:45,047 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 122 statements into 7 equivalence classes. [2025-03-04 06:24:45,088 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 122 of 122 statements. [2025-03-04 06:24:45,088 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-03-04 06:24:45,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:24:45,088 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 06:24:45,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-04 06:24:45,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-04 06:24:45,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:24:45,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:24:45,113 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 06:24:45,114 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 06:24:45,114 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 14 remaining) [2025-03-04 06:24:45,114 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (12 of 14 remaining) [2025-03-04 06:24:45,114 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (11 of 14 remaining) [2025-03-04 06:24:45,114 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (10 of 14 remaining) [2025-03-04 06:24:45,114 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (9 of 14 remaining) [2025-03-04 06:24:45,114 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (8 of 14 remaining) [2025-03-04 06:24:45,114 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (7 of 14 remaining) [2025-03-04 06:24:45,114 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (6 of 14 remaining) [2025-03-04 06:24:45,115 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (5 of 14 remaining) [2025-03-04 06:24:45,115 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (4 of 14 remaining) [2025-03-04 06:24:45,115 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (3 of 14 remaining) [2025-03-04 06:24:45,115 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (2 of 14 remaining) [2025-03-04 06:24:45,115 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 14 remaining) [2025-03-04 06:24:45,115 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 14 remaining) [2025-03-04 06:24:45,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 06:24:45,115 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1] [2025-03-04 06:24:45,116 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 06:24:45,116 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-04 06:24:45,150 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 06:24:45,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 235 places, 244 transitions, 506 flow [2025-03-04 06:24:45,183 INFO L124 PetriNetUnfolderBase]: 16/269 cut-off events. [2025-03-04 06:24:45,183 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-04 06:24:45,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 282 conditions, 269 events. 16/269 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 720 event pairs, 0 based on Foata normal form. 0/236 useless extension candidates. Maximal degree in co-relation 200. Up to 4 conditions per place. [2025-03-04 06:24:45,185 INFO L82 GeneralOperation]: Start removeDead. Operand has 235 places, 244 transitions, 506 flow [2025-03-04 06:24:45,187 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 235 places, 244 transitions, 506 flow [2025-03-04 06:24:45,188 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:24:45,188 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;@157413cd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:24:45,188 INFO L334 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2025-03-04 06:24:45,193 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:24:45,193 INFO L124 PetriNetUnfolderBase]: 0/50 cut-off events. [2025-03-04 06:24:45,193 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:24:45,193 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:24:45,193 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-04 06:24:45,193 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-03-04 06:24:45,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:24:45,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1753464015, now seen corresponding path program 1 times [2025-03-04 06:24:45,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:24:45,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772414777] [2025-03-04 06:24:45,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:24:45,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:24:45,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 06:24:45,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 06:24:45,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:24:45,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:24:45,368 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-04 06:24:45,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:24:45,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772414777] [2025-03-04 06:24:45,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772414777] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:24:45,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:24:45,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:24:45,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416519276] [2025-03-04 06:24:45,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:24:45,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:24:45,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:24:45,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:24:45,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:24:45,502 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 197 out of 244 [2025-03-04 06:24:45,503 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 244 transitions, 506 flow. Second operand has 6 states, 6 states have (on average 198.5) internal successors, (1191), 6 states have internal predecessors, (1191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:24:45,503 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:24:45,503 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 197 of 244 [2025-03-04 06:24:45,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:24:45,914 INFO L124 PetriNetUnfolderBase]: 870/4011 cut-off events. [2025-03-04 06:24:45,915 INFO L125 PetriNetUnfolderBase]: For 328/328 co-relation queries the response was YES. [2025-03-04 06:24:45,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5430 conditions, 4011 events. 870/4011 cut-off events. For 328/328 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 36487 event pairs, 630 based on Foata normal form. 755/4034 useless extension candidates. Maximal degree in co-relation 3233. Up to 1191 conditions per place. [2025-03-04 06:24:45,949 INFO L140 encePairwiseOnDemand]: 228/244 looper letters, 27 selfloop transitions, 5 changer transitions 0/224 dead transitions. [2025-03-04 06:24:45,949 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 224 transitions, 530 flow [2025-03-04 06:24:45,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:24:45,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:24:45,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1225 transitions. [2025-03-04 06:24:45,952 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8367486338797814 [2025-03-04 06:24:45,952 INFO L175 Difference]: Start difference. First operand has 235 places, 244 transitions, 506 flow. Second operand 6 states and 1225 transitions. [2025-03-04 06:24:45,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 224 transitions, 530 flow [2025-03-04 06:24:45,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 224 transitions, 528 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-03-04 06:24:45,955 INFO L231 Difference]: Finished difference. Result has 229 places, 224 transitions, 474 flow [2025-03-04 06:24:45,955 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=464, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=474, PETRI_PLACES=229, PETRI_TRANSITIONS=224} [2025-03-04 06:24:45,956 INFO L279 CegarLoopForPetriNet]: 235 programPoint places, -6 predicate places. [2025-03-04 06:24:45,956 INFO L471 AbstractCegarLoop]: Abstraction has has 229 places, 224 transitions, 474 flow [2025-03-04 06:24:45,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 198.5) internal successors, (1191), 6 states have internal predecessors, (1191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:24:45,956 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:24:45,956 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-04 06:24:45,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 06:24:45,957 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-03-04 06:24:45,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:24:45,957 INFO L85 PathProgramCache]: Analyzing trace with hash 91473326, now seen corresponding path program 1 times [2025-03-04 06:24:45,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:24:45,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490294870] [2025-03-04 06:24:45,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:24:45,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:24:45,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-04 06:24:45,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 06:24:45,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:24:45,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:24:45,976 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-04 06:24:45,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:24:45,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490294870] [2025-03-04 06:24:45,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490294870] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:24:45,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:24:45,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 06:24:45,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798720872] [2025-03-04 06:24:45,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:24:45,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:24:45,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:24:45,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:24:45,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:24:45,998 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 244 [2025-03-04 06:24:45,999 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 224 transitions, 474 flow. Second operand has 3 states, 3 states have (on average 218.33333333333334) internal successors, (655), 3 states have internal predecessors, (655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:24:45,999 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:24:45,999 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 244 [2025-03-04 06:24:45,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:24:46,082 INFO L124 PetriNetUnfolderBase]: 69/939 cut-off events. [2025-03-04 06:24:46,082 INFO L125 PetriNetUnfolderBase]: For 66/66 co-relation queries the response was YES. [2025-03-04 06:24:46,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1080 conditions, 939 events. 69/939 cut-off events. For 66/66 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 5319 event pairs, 42 based on Foata normal form. 1/831 useless extension candidates. Maximal degree in co-relation 1016. Up to 87 conditions per place. [2025-03-04 06:24:46,090 INFO L140 encePairwiseOnDemand]: 241/244 looper letters, 13 selfloop transitions, 2 changer transitions 0/225 dead transitions. [2025-03-04 06:24:46,090 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 225 transitions, 508 flow [2025-03-04 06:24:46,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:24:46,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:24:46,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 664 transitions. [2025-03-04 06:24:46,091 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.907103825136612 [2025-03-04 06:24:46,092 INFO L175 Difference]: Start difference. First operand has 229 places, 224 transitions, 474 flow. Second operand 3 states and 664 transitions. [2025-03-04 06:24:46,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 225 transitions, 508 flow [2025-03-04 06:24:46,093 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 225 transitions, 496 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:24:46,095 INFO L231 Difference]: Finished difference. Result has 227 places, 225 transitions, 476 flow [2025-03-04 06:24:46,095 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=464, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=222, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=476, PETRI_PLACES=227, PETRI_TRANSITIONS=225} [2025-03-04 06:24:46,095 INFO L279 CegarLoopForPetriNet]: 235 programPoint places, -8 predicate places. [2025-03-04 06:24:46,095 INFO L471 AbstractCegarLoop]: Abstraction has has 227 places, 225 transitions, 476 flow [2025-03-04 06:24:46,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 218.33333333333334) internal successors, (655), 3 states have internal predecessors, (655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:24:46,096 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:24:46,096 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-04 06:24:46,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 06:24:46,096 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-03-04 06:24:46,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:24:46,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1212945267, now seen corresponding path program 1 times [2025-03-04 06:24:46,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:24:46,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157322103] [2025-03-04 06:24:46,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:24:46,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:24:46,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-04 06:24:46,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-04 06:24:46,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:24:46,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:24:46,136 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-04 06:24:46,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:24:46,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157322103] [2025-03-04 06:24:46,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157322103] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:24:46,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [637412019] [2025-03-04 06:24:46,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:24:46,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:24:46,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:24:46,139 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-04 06:24:46,140 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-04 06:24:46,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-04 06:24:46,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-04 06:24:46,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:24:46,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:24:46,217 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 06:24:46,219 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:24:46,252 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-04 06:24:46,252 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 06:24:46,285 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-04 06:24:46,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [637412019] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 06:24:46,286 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 06:24:46,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-04 06:24:46,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173343571] [2025-03-04 06:24:46,286 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 06:24:46,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 06:24:46,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:24:46,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 06:24:46,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-04 06:24:46,334 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 244 [2025-03-04 06:24:46,336 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 225 transitions, 476 flow. Second operand has 10 states, 10 states have (on average 215.1) internal successors, (2151), 10 states have internal predecessors, (2151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:24:46,336 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:24:46,336 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 244 [2025-03-04 06:24:46,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:24:46,480 INFO L124 PetriNetUnfolderBase]: 69/954 cut-off events. [2025-03-04 06:24:46,481 INFO L125 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2025-03-04 06:24:46,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1103 conditions, 954 events. 69/954 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 5295 event pairs, 42 based on Foata normal form. 2/847 useless extension candidates. Maximal degree in co-relation 1051. Up to 87 conditions per place. [2025-03-04 06:24:46,489 INFO L140 encePairwiseOnDemand]: 238/244 looper letters, 17 selfloop transitions, 9 changer transitions 0/233 dead transitions. [2025-03-04 06:24:46,490 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 233 transitions, 546 flow [2025-03-04 06:24:46,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 06:24:46,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 06:24:46,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1945 transitions. [2025-03-04 06:24:46,493 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8857012750455373 [2025-03-04 06:24:46,493 INFO L175 Difference]: Start difference. First operand has 227 places, 225 transitions, 476 flow. Second operand 9 states and 1945 transitions. [2025-03-04 06:24:46,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 233 transitions, 546 flow [2025-03-04 06:24:46,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 233 transitions, 544 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:24:46,496 INFO L231 Difference]: Finished difference. Result has 237 places, 231 transitions, 524 flow [2025-03-04 06:24:46,497 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=474, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=524, PETRI_PLACES=237, PETRI_TRANSITIONS=231} [2025-03-04 06:24:46,497 INFO L279 CegarLoopForPetriNet]: 235 programPoint places, 2 predicate places. [2025-03-04 06:24:46,497 INFO L471 AbstractCegarLoop]: Abstraction has has 237 places, 231 transitions, 524 flow [2025-03-04 06:24:46,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 215.1) internal successors, (2151), 10 states have internal predecessors, (2151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:24:46,498 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:24:46,498 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-04 06:24:46,505 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 06:24:46,703 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-04 06:24:46,704 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-03-04 06:24:46,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:24:46,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1309776339, now seen corresponding path program 2 times [2025-03-04 06:24:46,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:24:46,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033782247] [2025-03-04 06:24:46,704 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 06:24:46,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:24:46,722 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 89 statements into 2 equivalence classes. [2025-03-04 06:24:46,729 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 89 of 89 statements. [2025-03-04 06:24:46,729 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 06:24:46,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:24:46,819 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:24:46,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:24:46,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033782247] [2025-03-04 06:24:46,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033782247] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:24:46,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1382622321] [2025-03-04 06:24:46,819 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 06:24:46,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:24:46,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:24:46,821 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-04 06:24:46,822 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-04 06:24:46,879 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 89 statements into 2 equivalence classes. [2025-03-04 06:24:46,900 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 89 of 89 statements. [2025-03-04 06:24:46,900 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 06:24:46,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:24:46,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 06:24:46,904 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:24:46,962 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:24:46,962 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 06:24:47,040 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:24:47,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1382622321] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 06:24:47,040 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 06:24:47,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2025-03-04 06:24:47,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878144777] [2025-03-04 06:24:47,041 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 06:24:47,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 06:24:47,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:24:47,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 06:24:47,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-04 06:24:47,112 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 244 [2025-03-04 06:24:47,115 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 231 transitions, 524 flow. Second operand has 15 states, 15 states have (on average 215.2) internal successors, (3228), 15 states have internal predecessors, (3228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:24:47,115 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:24:47,115 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 244 [2025-03-04 06:24:47,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:24:47,338 INFO L124 PetriNetUnfolderBase]: 69/993 cut-off events. [2025-03-04 06:24:47,338 INFO L125 PetriNetUnfolderBase]: For 87/87 co-relation queries the response was YES. [2025-03-04 06:24:47,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1196 conditions, 993 events. 69/993 cut-off events. For 87/87 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 5301 event pairs, 42 based on Foata normal form. 3/887 useless extension candidates. Maximal degree in co-relation 1013. Up to 87 conditions per place. [2025-03-04 06:24:47,345 INFO L140 encePairwiseOnDemand]: 238/244 looper letters, 20 selfloop transitions, 18 changer transitions 0/245 dead transitions. [2025-03-04 06:24:47,345 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 245 transitions, 674 flow [2025-03-04 06:24:47,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-04 06:24:47,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-04 06:24:47,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 3875 transitions. [2025-03-04 06:24:47,350 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8822859744990893 [2025-03-04 06:24:47,350 INFO L175 Difference]: Start difference. First operand has 237 places, 231 transitions, 524 flow. Second operand 18 states and 3875 transitions. [2025-03-04 06:24:47,351 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 245 transitions, 674 flow [2025-03-04 06:24:47,352 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 245 transitions, 662 flow, removed 5 selfloop flow, removed 1 redundant places. [2025-03-04 06:24:47,354 INFO L231 Difference]: Finished difference. Result has 257 places, 241 transitions, 624 flow [2025-03-04 06:24:47,354 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=518, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=624, PETRI_PLACES=257, PETRI_TRANSITIONS=241} [2025-03-04 06:24:47,354 INFO L279 CegarLoopForPetriNet]: 235 programPoint places, 22 predicate places. [2025-03-04 06:24:47,355 INFO L471 AbstractCegarLoop]: Abstraction has has 257 places, 241 transitions, 624 flow [2025-03-04 06:24:47,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 215.2) internal successors, (3228), 15 states have internal predecessors, (3228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:24:47,356 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:24:47,356 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-04 06:24:47,362 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 06:24:47,556 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-04 06:24:47,557 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-03-04 06:24:47,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:24:47,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1050297550, now seen corresponding path program 3 times [2025-03-04 06:24:47,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:24:47,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21653567] [2025-03-04 06:24:47,557 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 06:24:47,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:24:47,570 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 128 statements into 7 equivalence classes. [2025-03-04 06:24:47,607 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 128 of 128 statements. [2025-03-04 06:24:47,607 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-03-04 06:24:47,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:24:47,607 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 06:24:47,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-04 06:24:47,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-04 06:24:47,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:24:47,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:24:47,644 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 06:24:47,645 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 06:24:47,646 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (17 of 18 remaining) [2025-03-04 06:24:47,646 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (16 of 18 remaining) [2025-03-04 06:24:47,646 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (15 of 18 remaining) [2025-03-04 06:24:47,646 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (14 of 18 remaining) [2025-03-04 06:24:47,646 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (13 of 18 remaining) [2025-03-04 06:24:47,646 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (12 of 18 remaining) [2025-03-04 06:24:47,646 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (11 of 18 remaining) [2025-03-04 06:24:47,646 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (10 of 18 remaining) [2025-03-04 06:24:47,646 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (9 of 18 remaining) [2025-03-04 06:24:47,646 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (8 of 18 remaining) [2025-03-04 06:24:47,647 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (7 of 18 remaining) [2025-03-04 06:24:47,647 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (6 of 18 remaining) [2025-03-04 06:24:47,647 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (5 of 18 remaining) [2025-03-04 06:24:47,647 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (4 of 18 remaining) [2025-03-04 06:24:47,647 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (3 of 18 remaining) [2025-03-04 06:24:47,647 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (2 of 18 remaining) [2025-03-04 06:24:47,647 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 18 remaining) [2025-03-04 06:24:47,647 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 18 remaining) [2025-03-04 06:24:47,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 06:24:47,647 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1] [2025-03-04 06:24:47,648 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 06:24:47,648 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-03-04 06:24:47,682 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 06:24:47,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 296 places, 308 transitions, 644 flow [2025-03-04 06:24:47,711 INFO L124 PetriNetUnfolderBase]: 21/342 cut-off events. [2025-03-04 06:24:47,711 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-04 06:24:47,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 361 conditions, 342 events. 21/342 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1104 event pairs, 0 based on Foata normal form. 0/299 useless extension candidates. Maximal degree in co-relation 277. Up to 5 conditions per place. [2025-03-04 06:24:47,714 INFO L82 GeneralOperation]: Start removeDead. Operand has 296 places, 308 transitions, 644 flow [2025-03-04 06:24:47,717 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 296 places, 308 transitions, 644 flow [2025-03-04 06:24:47,718 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:24:47,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;@157413cd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:24:47,718 INFO L334 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2025-03-04 06:24:47,721 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:24:47,721 INFO L124 PetriNetUnfolderBase]: 0/50 cut-off events. [2025-03-04 06:24:47,721 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:24:47,721 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:24:47,721 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-04 06:24:47,721 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-03-04 06:24:47,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:24:47,722 INFO L85 PathProgramCache]: Analyzing trace with hash -2059893275, now seen corresponding path program 1 times [2025-03-04 06:24:47,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:24:47,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224192848] [2025-03-04 06:24:47,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:24:47,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:24:47,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 06:24:47,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 06:24:47,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:24:47,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:24:47,852 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-04 06:24:47,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:24:47,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224192848] [2025-03-04 06:24:47,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224192848] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:24:47,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:24:47,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:24:47,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878741172] [2025-03-04 06:24:47,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:24:47,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:24:47,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:24:47,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:24:47,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:24:48,041 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 250 out of 308 [2025-03-04 06:24:48,043 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 296 places, 308 transitions, 644 flow. Second operand has 6 states, 6 states have (on average 251.5) internal successors, (1509), 6 states have internal predecessors, (1509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:24:48,043 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:24:48,043 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 250 of 308 [2025-03-04 06:24:48,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:24:51,403 INFO L124 PetriNetUnfolderBase]: 8893/30356 cut-off events. [2025-03-04 06:24:51,403 INFO L125 PetriNetUnfolderBase]: For 3794/3794 co-relation queries the response was YES. [2025-03-04 06:24:51,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43430 conditions, 30356 events. 8893/30356 cut-off events. For 3794/3794 co-relation queries the response was YES. Maximal size of possible extension queue 996. Compared 380021 event pairs, 6804 based on Foata normal form. 6319/31189 useless extension candidates. Maximal degree in co-relation 22385. Up to 11130 conditions per place. [2025-03-04 06:24:51,684 INFO L140 encePairwiseOnDemand]: 289/308 looper letters, 34 selfloop transitions, 5 changer transitions 0/283 dead transitions. [2025-03-04 06:24:51,685 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 283 transitions, 672 flow [2025-03-04 06:24:51,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:24:51,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:24:51,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1553 transitions. [2025-03-04 06:24:51,687 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8403679653679653 [2025-03-04 06:24:51,687 INFO L175 Difference]: Start difference. First operand has 296 places, 308 transitions, 644 flow. Second operand 6 states and 1553 transitions. [2025-03-04 06:24:51,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 283 transitions, 672 flow [2025-03-04 06:24:51,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 283 transitions, 666 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-03-04 06:24:51,693 INFO L231 Difference]: Finished difference. Result has 288 places, 283 transitions, 598 flow [2025-03-04 06:24:51,695 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=308, PETRI_DIFFERENCE_MINUEND_FLOW=588, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=278, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=598, PETRI_PLACES=288, PETRI_TRANSITIONS=283} [2025-03-04 06:24:51,696 INFO L279 CegarLoopForPetriNet]: 296 programPoint places, -8 predicate places. [2025-03-04 06:24:51,696 INFO L471 AbstractCegarLoop]: Abstraction has has 288 places, 283 transitions, 598 flow [2025-03-04 06:24:51,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 251.5) internal successors, (1509), 6 states have internal predecessors, (1509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:24:51,697 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:24:51,697 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:24:51,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 06:24:51,698 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-03-04 06:24:51,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:24:51,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1492154955, now seen corresponding path program 1 times [2025-03-04 06:24:51,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:24:51,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712431623] [2025-03-04 06:24:51,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:24:51,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:24:51,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-04 06:24:51,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-04 06:24:51,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:24:51,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:24:51,718 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-04 06:24:51,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:24:51,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712431623] [2025-03-04 06:24:51,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712431623] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:24:51,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:24:51,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 06:24:51,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279774595] [2025-03-04 06:24:51,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:24:51,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:24:51,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:24:51,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:24:51,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:24:51,735 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 273 out of 308 [2025-03-04 06:24:51,737 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 283 transitions, 598 flow. Second operand has 3 states, 3 states have (on average 275.6666666666667) internal successors, (827), 3 states have internal predecessors, (827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:24:51,737 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:24:51,737 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 273 of 308 [2025-03-04 06:24:51,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:24:52,077 INFO L124 PetriNetUnfolderBase]: 285/2847 cut-off events. [2025-03-04 06:24:52,077 INFO L125 PetriNetUnfolderBase]: For 282/282 co-relation queries the response was YES. [2025-03-04 06:24:52,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3313 conditions, 2847 events. 285/2847 cut-off events. For 282/282 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 23884 event pairs, 204 based on Foata normal form. 1/2510 useless extension candidates. Maximal degree in co-relation 3248. Up to 330 conditions per place. [2025-03-04 06:24:52,103 INFO L140 encePairwiseOnDemand]: 305/308 looper letters, 16 selfloop transitions, 2 changer transitions 0/284 dead transitions. [2025-03-04 06:24:52,103 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 284 transitions, 638 flow [2025-03-04 06:24:52,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:24:52,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:24:52,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 838 transitions. [2025-03-04 06:24:52,104 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9069264069264069 [2025-03-04 06:24:52,104 INFO L175 Difference]: Start difference. First operand has 288 places, 283 transitions, 598 flow. Second operand 3 states and 838 transitions. [2025-03-04 06:24:52,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 290 places, 284 transitions, 638 flow [2025-03-04 06:24:52,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 284 transitions, 626 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:24:52,108 INFO L231 Difference]: Finished difference. Result has 286 places, 284 transitions, 600 flow [2025-03-04 06:24:52,109 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=308, PETRI_DIFFERENCE_MINUEND_FLOW=588, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=281, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=600, PETRI_PLACES=286, PETRI_TRANSITIONS=284} [2025-03-04 06:24:52,109 INFO L279 CegarLoopForPetriNet]: 296 programPoint places, -10 predicate places. [2025-03-04 06:24:52,109 INFO L471 AbstractCegarLoop]: Abstraction has has 286 places, 284 transitions, 600 flow [2025-03-04 06:24:52,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 275.6666666666667) internal successors, (827), 3 states have internal predecessors, (827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:24:52,110 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:24:52,110 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-04 06:24:52,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 06:24:52,110 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-03-04 06:24:52,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:24:52,111 INFO L85 PathProgramCache]: Analyzing trace with hash -1207964642, now seen corresponding path program 1 times [2025-03-04 06:24:52,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:24:52,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112666589] [2025-03-04 06:24:52,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:24:52,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:24:52,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-04 06:24:52,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-04 06:24:52,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:24:52,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:24:52,147 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-04 06:24:52,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:24:52,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112666589] [2025-03-04 06:24:52,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112666589] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:24:52,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [763666315] [2025-03-04 06:24:52,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:24:52,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:24:52,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:24:52,150 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-04 06:24:52,151 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-04 06:24:52,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-04 06:24:52,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-04 06:24:52,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:24:52,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:24:52,230 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 06:24:52,231 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:24:52,254 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-04 06:24:52,255 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 06:24:52,282 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-04 06:24:52,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [763666315] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 06:24:52,283 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 06:24:52,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-04 06:24:52,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612875296] [2025-03-04 06:24:52,283 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 06:24:52,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 06:24:52,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:24:52,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 06:24:52,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-04 06:24:52,332 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 270 out of 308 [2025-03-04 06:24:52,334 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 284 transitions, 600 flow. Second operand has 10 states, 10 states have (on average 272.2) internal successors, (2722), 10 states have internal predecessors, (2722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:24:52,334 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:24:52,334 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 270 of 308 [2025-03-04 06:24:52,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:24:52,732 INFO L124 PetriNetUnfolderBase]: 285/2862 cut-off events. [2025-03-04 06:24:52,732 INFO L125 PetriNetUnfolderBase]: For 281/281 co-relation queries the response was YES. [2025-03-04 06:24:52,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3336 conditions, 2862 events. 285/2862 cut-off events. For 281/281 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 23829 event pairs, 204 based on Foata normal form. 2/2526 useless extension candidates. Maximal degree in co-relation 3283. Up to 330 conditions per place. [2025-03-04 06:24:52,758 INFO L140 encePairwiseOnDemand]: 302/308 looper letters, 20 selfloop transitions, 9 changer transitions 0/292 dead transitions. [2025-03-04 06:24:52,758 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 292 transitions, 676 flow [2025-03-04 06:24:52,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 06:24:52,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 06:24:52,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2461 transitions. [2025-03-04 06:24:52,762 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8878066378066378 [2025-03-04 06:24:52,762 INFO L175 Difference]: Start difference. First operand has 286 places, 284 transitions, 600 flow. Second operand 9 states and 2461 transitions. [2025-03-04 06:24:52,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 292 transitions, 676 flow [2025-03-04 06:24:52,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 293 places, 292 transitions, 674 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:24:52,766 INFO L231 Difference]: Finished difference. Result has 296 places, 290 transitions, 648 flow [2025-03-04 06:24:52,767 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=308, PETRI_DIFFERENCE_MINUEND_FLOW=598, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=278, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=648, PETRI_PLACES=296, PETRI_TRANSITIONS=290} [2025-03-04 06:24:52,767 INFO L279 CegarLoopForPetriNet]: 296 programPoint places, 0 predicate places. [2025-03-04 06:24:52,767 INFO L471 AbstractCegarLoop]: Abstraction has has 296 places, 290 transitions, 648 flow [2025-03-04 06:24:52,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 272.2) internal successors, (2722), 10 states have internal predecessors, (2722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:24:52,768 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:24:52,768 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-04 06:24:52,775 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 06:24:52,974 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-04 06:24:52,974 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-03-04 06:24:52,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:24:52,978 INFO L85 PathProgramCache]: Analyzing trace with hash 966936894, now seen corresponding path program 2 times [2025-03-04 06:24:52,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:24:52,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102070939] [2025-03-04 06:24:52,978 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 06:24:52,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:24:52,991 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 95 statements into 2 equivalence classes. [2025-03-04 06:24:52,998 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 95 of 95 statements. [2025-03-04 06:24:52,998 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 06:24:52,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:24:53,092 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-04 06:24:53,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:24:53,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102070939] [2025-03-04 06:24:53,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102070939] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:24:53,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1070281037] [2025-03-04 06:24:53,093 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 06:24:53,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:24:53,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:24:53,095 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-04 06:24:53,097 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-04 06:24:53,175 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 95 statements into 2 equivalence classes. [2025-03-04 06:24:53,199 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 95 of 95 statements. [2025-03-04 06:24:53,199 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 06:24:53,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:24:53,201 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 06:24:53,203 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:24:53,257 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-04 06:24:53,257 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 06:24:53,350 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-04 06:24:53,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1070281037] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 06:24:53,351 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 06:24:53,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2025-03-04 06:24:53,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598661744] [2025-03-04 06:24:53,351 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 06:24:53,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 06:24:53,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:24:53,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 06:24:53,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-04 06:24:53,459 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 270 out of 308 [2025-03-04 06:24:53,463 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 296 places, 290 transitions, 648 flow. Second operand has 15 states, 15 states have (on average 272.26666666666665) internal successors, (4084), 15 states have internal predecessors, (4084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:24:53,463 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:24:53,463 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 270 of 308 [2025-03-04 06:24:53,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:24:54,023 INFO L124 PetriNetUnfolderBase]: 285/2901 cut-off events. [2025-03-04 06:24:54,023 INFO L125 PetriNetUnfolderBase]: For 303/303 co-relation queries the response was YES. [2025-03-04 06:24:54,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3429 conditions, 2901 events. 285/2901 cut-off events. For 303/303 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 23926 event pairs, 204 based on Foata normal form. 3/2566 useless extension candidates. Maximal degree in co-relation 3245. Up to 330 conditions per place. [2025-03-04 06:24:54,056 INFO L140 encePairwiseOnDemand]: 302/308 looper letters, 23 selfloop transitions, 18 changer transitions 0/304 dead transitions. [2025-03-04 06:24:54,056 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 304 transitions, 804 flow [2025-03-04 06:24:54,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-04 06:24:54,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-04 06:24:54,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 4904 transitions. [2025-03-04 06:24:54,061 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8845598845598845 [2025-03-04 06:24:54,061 INFO L175 Difference]: Start difference. First operand has 296 places, 290 transitions, 648 flow. Second operand 18 states and 4904 transitions. [2025-03-04 06:24:54,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 304 transitions, 804 flow [2025-03-04 06:24:54,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 304 transitions, 792 flow, removed 5 selfloop flow, removed 1 redundant places. [2025-03-04 06:24:54,065 INFO L231 Difference]: Finished difference. Result has 316 places, 300 transitions, 748 flow [2025-03-04 06:24:54,066 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=308, PETRI_DIFFERENCE_MINUEND_FLOW=642, PETRI_DIFFERENCE_MINUEND_PLACES=295, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=290, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=748, PETRI_PLACES=316, PETRI_TRANSITIONS=300} [2025-03-04 06:24:54,066 INFO L279 CegarLoopForPetriNet]: 296 programPoint places, 20 predicate places. [2025-03-04 06:24:54,066 INFO L471 AbstractCegarLoop]: Abstraction has has 316 places, 300 transitions, 748 flow [2025-03-04 06:24:54,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 272.26666666666665) internal successors, (4084), 15 states have internal predecessors, (4084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:24:54,068 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:24:54,068 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-04 06:24:54,074 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-04 06:24:54,268 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-04 06:24:54,269 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-03-04 06:24:54,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:24:54,270 INFO L85 PathProgramCache]: Analyzing trace with hash -1391436053, now seen corresponding path program 3 times [2025-03-04 06:24:54,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:24:54,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28202646] [2025-03-04 06:24:54,270 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 06:24:54,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:24:54,283 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 134 statements into 8 equivalence classes. [2025-03-04 06:24:54,306 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 134 of 134 statements. [2025-03-04 06:24:54,307 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-03-04 06:24:54,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:24:54,307 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 06:24:54,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-04 06:24:54,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-04 06:24:54,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:24:54,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:24:54,326 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 06:24:54,327 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 06:24:54,327 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (21 of 22 remaining) [2025-03-04 06:24:54,327 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (20 of 22 remaining) [2025-03-04 06:24:54,327 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (19 of 22 remaining) [2025-03-04 06:24:54,327 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (18 of 22 remaining) [2025-03-04 06:24:54,327 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (17 of 22 remaining) [2025-03-04 06:24:54,327 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (16 of 22 remaining) [2025-03-04 06:24:54,327 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (15 of 22 remaining) [2025-03-04 06:24:54,328 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (14 of 22 remaining) [2025-03-04 06:24:54,328 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (13 of 22 remaining) [2025-03-04 06:24:54,328 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (12 of 22 remaining) [2025-03-04 06:24:54,328 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (11 of 22 remaining) [2025-03-04 06:24:54,328 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (10 of 22 remaining) [2025-03-04 06:24:54,328 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (9 of 22 remaining) [2025-03-04 06:24:54,328 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (8 of 22 remaining) [2025-03-04 06:24:54,328 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (7 of 22 remaining) [2025-03-04 06:24:54,328 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (6 of 22 remaining) [2025-03-04 06:24:54,328 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (5 of 22 remaining) [2025-03-04 06:24:54,328 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (4 of 22 remaining) [2025-03-04 06:24:54,328 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (3 of 22 remaining) [2025-03-04 06:24:54,328 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (2 of 22 remaining) [2025-03-04 06:24:54,328 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 22 remaining) [2025-03-04 06:24:54,328 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 22 remaining) [2025-03-04 06:24:54,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 06:24:54,329 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1] [2025-03-04 06:24:54,329 WARN L246 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 06:24:54,329 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2025-03-04 06:24:54,369 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 06:24:54,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 357 places, 372 transitions, 784 flow [2025-03-04 06:24:54,427 INFO L124 PetriNetUnfolderBase]: 26/415 cut-off events. [2025-03-04 06:24:54,428 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-03-04 06:24:54,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 441 conditions, 415 events. 26/415 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1492 event pairs, 0 based on Foata normal form. 0/362 useless extension candidates. Maximal degree in co-relation 355. Up to 6 conditions per place. [2025-03-04 06:24:54,432 INFO L82 GeneralOperation]: Start removeDead. Operand has 357 places, 372 transitions, 784 flow [2025-03-04 06:24:54,435 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 357 places, 372 transitions, 784 flow [2025-03-04 06:24:54,436 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:24:54,436 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;@157413cd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:24:54,436 INFO L334 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2025-03-04 06:24:54,439 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:24:54,439 INFO L124 PetriNetUnfolderBase]: 0/50 cut-off events. [2025-03-04 06:24:54,439 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:24:54,439 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:24:54,439 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-04 06:24:54,439 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-04 06:24:54,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:24:54,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1927986983, now seen corresponding path program 1 times [2025-03-04 06:24:54,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:24:54,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57373793] [2025-03-04 06:24:54,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:24:54,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:24:54,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 06:24:54,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 06:24:54,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:24:54,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:24:54,586 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-04 06:24:54,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:24:54,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57373793] [2025-03-04 06:24:54,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57373793] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:24:54,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:24:54,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:24:54,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004392445] [2025-03-04 06:24:54,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:24:54,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:24:54,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:24:54,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:24:54,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:24:54,754 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 303 out of 372 [2025-03-04 06:24:54,755 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 357 places, 372 transitions, 784 flow. Second operand has 6 states, 6 states have (on average 304.5) internal successors, (1827), 6 states have internal predecessors, (1827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:24:54,755 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:24:54,755 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 303 of 372 [2025-03-04 06:24:54,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand