./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-divine/condvar.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-divine/condvar.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 08550a9d023a2de1ac334a3445fa7327c26092d061f764efe50453540d837a7a --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 11:02:23,130 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 11:02:23,192 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-17 11:02:23,198 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 11:02:23,198 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 11:02:23,216 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 11:02:23,218 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 11:02:23,218 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 11:02:23,219 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 11:02:23,219 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 11:02:23,220 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 11:02:23,220 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 11:02:23,220 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 11:02:23,220 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 11:02:23,221 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 11:02:23,221 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 11:02:23,221 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 11:02:23,221 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 11:02:23,221 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 11:02:23,221 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 11:02:23,221 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 11:02:23,221 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 11:02:23,221 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-17 11:02:23,221 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 11:02:23,221 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 11:02:23,221 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 11:02:23,221 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 11:02:23,221 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 11:02:23,221 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 11:02:23,221 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 11:02:23,222 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 11:02:23,222 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:02:23,222 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 11:02:23,222 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 11:02:23,222 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 11:02:23,222 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 11:02:23,222 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 11:02:23,222 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 11:02:23,222 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 11:02:23,222 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 11:02:23,222 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 11:02:23,222 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 11:02:23,222 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 -> 08550a9d023a2de1ac334a3445fa7327c26092d061f764efe50453540d837a7a [2025-03-17 11:02:23,443 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 11:02:23,448 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 11:02:23,450 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 11:02:23,451 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 11:02:23,451 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 11:02:23,453 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-divine/condvar.i [2025-03-17 11:02:24,604 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60a894943/0f32d576e5fb4e5195204ce46f9f7aa0/FLAG8e8c311be [2025-03-17 11:02:24,846 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 11:02:24,848 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-divine/condvar.i [2025-03-17 11:02:24,856 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60a894943/0f32d576e5fb4e5195204ce46f9f7aa0/FLAG8e8c311be [2025-03-17 11:02:25,181 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60a894943/0f32d576e5fb4e5195204ce46f9f7aa0 [2025-03-17 11:02:25,183 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 11:02:25,184 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 11:02:25,185 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 11:02:25,185 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 11:02:25,188 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 11:02:25,189 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:02:25" (1/1) ... [2025-03-17 11:02:25,189 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53338b93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:02:25, skipping insertion in model container [2025-03-17 11:02:25,190 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:02:25" (1/1) ... [2025-03-17 11:02:25,217 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 11:02:25,411 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:02:25,422 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 11:02:25,451 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:02:25,482 INFO L204 MainTranslator]: Completed translation [2025-03-17 11:02:25,484 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:02:25 WrapperNode [2025-03-17 11:02:25,484 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 11:02:25,485 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 11:02:25,485 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 11:02:25,486 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 11:02:25,490 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:02:25" (1/1) ... [2025-03-17 11:02:25,499 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:02:25" (1/1) ... [2025-03-17 11:02:25,513 INFO L138 Inliner]: procedures = 168, calls = 24, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 176 [2025-03-17 11:02:25,514 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 11:02:25,514 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 11:02:25,514 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 11:02:25,514 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 11:02:25,519 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:02:25" (1/1) ... [2025-03-17 11:02:25,519 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:02:25" (1/1) ... [2025-03-17 11:02:25,522 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:02:25" (1/1) ... [2025-03-17 11:02:25,522 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:02:25" (1/1) ... [2025-03-17 11:02:25,526 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:02:25" (1/1) ... [2025-03-17 11:02:25,527 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:02:25" (1/1) ... [2025-03-17 11:02:25,528 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:02:25" (1/1) ... [2025-03-17 11:02:25,529 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:02:25" (1/1) ... [2025-03-17 11:02:25,531 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 11:02:25,532 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 11:02:25,532 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 11:02:25,532 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 11:02:25,533 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:02:25" (1/1) ... [2025-03-17 11:02:25,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:02:25,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:02:25,561 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 11:02:25,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 11:02:25,580 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-17 11:02:25,580 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 11:02:25,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-17 11:02:25,580 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2025-03-17 11:02:25,580 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2025-03-17 11:02:25,580 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-17 11:02:25,580 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 11:02:25,580 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 11:02:25,581 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 11:02:25,690 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 11:02:25,693 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 11:02:25,936 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 11:02:25,936 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 11:02:25,963 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 11:02:25,963 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 11:02:25,963 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:02:25 BoogieIcfgContainer [2025-03-17 11:02:25,964 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 11:02:25,965 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 11:02:25,965 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 11:02:25,969 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 11:02:25,969 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 11:02:25" (1/3) ... [2025-03-17 11:02:25,970 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6760d0ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:02:25, skipping insertion in model container [2025-03-17 11:02:25,970 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:02:25" (2/3) ... [2025-03-17 11:02:25,970 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6760d0ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:02:25, skipping insertion in model container [2025-03-17 11:02:25,970 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:02:25" (3/3) ... [2025-03-17 11:02:25,971 INFO L128 eAbstractionObserver]: Analyzing ICFG condvar.i [2025-03-17 11:02:25,981 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 11:02:25,983 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG condvar.i that has 2 procedures, 182 locations, 1 initial locations, 2 loop locations, and 4 error locations. [2025-03-17 11:02:25,983 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 11:02:26,029 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-17 11:02:26,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 185 places, 186 transitions, 379 flow [2025-03-17 11:02:26,134 INFO L124 PetriNetUnfolderBase]: 5/185 cut-off events. [2025-03-17 11:02:26,137 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-17 11:02:26,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 190 conditions, 185 events. 5/185 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 131 event pairs, 0 based on Foata normal form. 0/176 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. [2025-03-17 11:02:26,142 INFO L82 GeneralOperation]: Start removeDead. Operand has 185 places, 186 transitions, 379 flow [2025-03-17 11:02:26,147 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 180 places, 181 transitions, 365 flow [2025-03-17 11:02:26,154 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 11:02:26,164 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;@4099c288, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 11:02:26,164 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-03-17 11:02:26,210 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 11:02:26,210 INFO L124 PetriNetUnfolderBase]: 1/150 cut-off events. [2025-03-17 11:02:26,210 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 11:02:26,210 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:02:26,214 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:02:26,214 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-17 11:02:26,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:02:26,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1175084950, now seen corresponding path program 1 times [2025-03-17 11:02:26,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:02:26,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436775706] [2025-03-17 11:02:26,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:02:26,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:02:26,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-17 11:02:26,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-17 11:02:26,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:02:26,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:02:26,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:02:26,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:02:26,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436775706] [2025-03-17 11:02:26,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436775706] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:02:26,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:02:26,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:02:26,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361457708] [2025-03-17 11:02:26,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:02:26,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:02:26,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:02:26,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:02:26,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:02:26,608 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 186 [2025-03-17 11:02:26,613 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 181 transitions, 365 flow. Second operand has 3 states, 3 states have (on average 174.33333333333334) internal successors, (523), 3 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:02:26,613 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:02:26,613 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 186 [2025-03-17 11:02:26,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:02:26,693 INFO L124 PetriNetUnfolderBase]: 9/220 cut-off events. [2025-03-17 11:02:26,693 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-17 11:02:26,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 252 conditions, 220 events. 9/220 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 301 event pairs, 1 based on Foata normal form. 6/210 useless extension candidates. Maximal degree in co-relation 110. Up to 15 conditions per place. [2025-03-17 11:02:26,699 INFO L140 encePairwiseOnDemand]: 179/186 looper letters, 12 selfloop transitions, 3 changer transitions 0/183 dead transitions. [2025-03-17 11:02:26,699 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 183 transitions, 399 flow [2025-03-17 11:02:26,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:02:26,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:02:26,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 541 transitions. [2025-03-17 11:02:26,712 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9695340501792115 [2025-03-17 11:02:26,714 INFO L175 Difference]: Start difference. First operand has 180 places, 181 transitions, 365 flow. Second operand 3 states and 541 transitions. [2025-03-17 11:02:26,714 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 183 transitions, 399 flow [2025-03-17 11:02:26,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 183 transitions, 398 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:02:26,722 INFO L231 Difference]: Finished difference. Result has 182 places, 180 transitions, 382 flow [2025-03-17 11:02:26,724 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=186, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=382, PETRI_PLACES=182, PETRI_TRANSITIONS=180} [2025-03-17 11:02:26,727 INFO L279 CegarLoopForPetriNet]: 180 programPoint places, 2 predicate places. [2025-03-17 11:02:26,729 INFO L471 AbstractCegarLoop]: Abstraction has has 182 places, 180 transitions, 382 flow [2025-03-17 11:02:26,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 174.33333333333334) internal successors, (523), 3 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:02:26,729 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:02:26,729 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:02:26,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 11:02:26,730 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-17 11:02:26,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:02:26,731 INFO L85 PathProgramCache]: Analyzing trace with hash -1135141403, now seen corresponding path program 1 times [2025-03-17 11:02:26,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:02:26,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886605928] [2025-03-17 11:02:26,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:02:26,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:02:26,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-17 11:02:26,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-17 11:02:26,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:02:26,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:02:26,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:02:26,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:02:26,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886605928] [2025-03-17 11:02:26,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886605928] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:02:26,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:02:26,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:02:26,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083773072] [2025-03-17 11:02:26,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:02:26,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:02:26,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:02:26,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:02:26,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:02:26,891 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 186 [2025-03-17 11:02:26,892 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 180 transitions, 382 flow. Second operand has 3 states, 3 states have (on average 171.66666666666666) internal successors, (515), 3 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:02:26,892 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:02:26,892 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 186 [2025-03-17 11:02:26,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:02:26,974 INFO L124 PetriNetUnfolderBase]: 33/377 cut-off events. [2025-03-17 11:02:26,974 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2025-03-17 11:02:26,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 490 conditions, 377 events. 33/377 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1311 event pairs, 6 based on Foata normal form. 0/336 useless extension candidates. Maximal degree in co-relation 346. Up to 39 conditions per place. [2025-03-17 11:02:26,979 INFO L140 encePairwiseOnDemand]: 181/186 looper letters, 14 selfloop transitions, 4 changer transitions 0/187 dead transitions. [2025-03-17 11:02:26,979 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 187 transitions, 432 flow [2025-03-17 11:02:26,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:02:26,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:02:26,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 529 transitions. [2025-03-17 11:02:26,985 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9480286738351255 [2025-03-17 11:02:26,985 INFO L175 Difference]: Start difference. First operand has 182 places, 180 transitions, 382 flow. Second operand 3 states and 529 transitions. [2025-03-17 11:02:26,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 187 transitions, 432 flow [2025-03-17 11:02:26,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 187 transitions, 426 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:02:26,992 INFO L231 Difference]: Finished difference. Result has 184 places, 183 transitions, 406 flow [2025-03-17 11:02:26,993 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=186, PETRI_DIFFERENCE_MINUEND_FLOW=376, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=406, PETRI_PLACES=184, PETRI_TRANSITIONS=183} [2025-03-17 11:02:26,993 INFO L279 CegarLoopForPetriNet]: 180 programPoint places, 4 predicate places. [2025-03-17 11:02:26,993 INFO L471 AbstractCegarLoop]: Abstraction has has 184 places, 183 transitions, 406 flow [2025-03-17 11:02:26,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 171.66666666666666) internal successors, (515), 3 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:02:26,994 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:02:26,994 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:02:26,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 11:02:26,994 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-17 11:02:26,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:02:26,995 INFO L85 PathProgramCache]: Analyzing trace with hash -1322321862, now seen corresponding path program 1 times [2025-03-17 11:02:26,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:02:26,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662168479] [2025-03-17 11:02:26,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:02:26,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:02:27,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-17 11:02:27,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-17 11:02:27,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:02:27,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:02:27,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:02:27,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:02:27,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662168479] [2025-03-17 11:02:27,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662168479] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:02:27,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:02:27,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:02:27,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674692684] [2025-03-17 11:02:27,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:02:27,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:02:27,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:02:27,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:02:27,124 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:02:27,132 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 186 [2025-03-17 11:02:27,133 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 183 transitions, 406 flow. Second operand has 3 states, 3 states have (on average 174.33333333333334) internal successors, (523), 3 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:02:27,133 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:02:27,133 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 186 [2025-03-17 11:02:27,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:02:27,177 INFO L124 PetriNetUnfolderBase]: 23/349 cut-off events. [2025-03-17 11:02:27,177 INFO L125 PetriNetUnfolderBase]: For 28/30 co-relation queries the response was YES. [2025-03-17 11:02:27,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 481 conditions, 349 events. 23/349 cut-off events. For 28/30 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1129 event pairs, 4 based on Foata normal form. 0/312 useless extension candidates. Maximal degree in co-relation 337. Up to 27 conditions per place. [2025-03-17 11:02:27,180 INFO L140 encePairwiseOnDemand]: 182/186 looper letters, 9 selfloop transitions, 4 changer transitions 0/186 dead transitions. [2025-03-17 11:02:27,180 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 186 transitions, 442 flow [2025-03-17 11:02:27,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:02:27,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:02:27,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 532 transitions. [2025-03-17 11:02:27,182 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.953405017921147 [2025-03-17 11:02:27,182 INFO L175 Difference]: Start difference. First operand has 184 places, 183 transitions, 406 flow. Second operand 3 states and 532 transitions. [2025-03-17 11:02:27,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 186 transitions, 442 flow [2025-03-17 11:02:27,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 186 transitions, 432 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:02:27,187 INFO L231 Difference]: Finished difference. Result has 186 places, 185 transitions, 426 flow [2025-03-17 11:02:27,188 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=186, PETRI_DIFFERENCE_MINUEND_FLOW=398, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=426, PETRI_PLACES=186, PETRI_TRANSITIONS=185} [2025-03-17 11:02:27,188 INFO L279 CegarLoopForPetriNet]: 180 programPoint places, 6 predicate places. [2025-03-17 11:02:27,189 INFO L471 AbstractCegarLoop]: Abstraction has has 186 places, 185 transitions, 426 flow [2025-03-17 11:02:27,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 174.33333333333334) internal successors, (523), 3 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:02:27,189 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:02:27,189 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:02:27,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 11:02:27,190 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-17 11:02:27,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:02:27,190 INFO L85 PathProgramCache]: Analyzing trace with hash -769679592, now seen corresponding path program 1 times [2025-03-17 11:02:27,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:02:27,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898042001] [2025-03-17 11:02:27,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:02:27,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:02:27,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-17 11:02:27,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-17 11:02:27,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:02:27,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:02:27,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:02:27,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:02:27,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898042001] [2025-03-17 11:02:27,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898042001] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:02:27,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:02:27,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 11:02:27,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914225606] [2025-03-17 11:02:27,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:02:27,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:02:27,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:02:27,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:02:27,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:02:27,310 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 186 [2025-03-17 11:02:27,310 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 185 transitions, 426 flow. Second operand has 3 states, 3 states have (on average 172.66666666666666) internal successors, (518), 3 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:02:27,310 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:02:27,310 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 186 [2025-03-17 11:02:27,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:02:27,376 INFO L124 PetriNetUnfolderBase]: 58/501 cut-off events. [2025-03-17 11:02:27,376 INFO L125 PetriNetUnfolderBase]: For 54/61 co-relation queries the response was YES. [2025-03-17 11:02:27,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 744 conditions, 501 events. 58/501 cut-off events. For 54/61 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2324 event pairs, 6 based on Foata normal form. 5/460 useless extension candidates. Maximal degree in co-relation 598. Up to 76 conditions per place. [2025-03-17 11:02:27,379 INFO L140 encePairwiseOnDemand]: 183/186 looper letters, 13 selfloop transitions, 2 changer transitions 0/190 dead transitions. [2025-03-17 11:02:27,380 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 190 transitions, 466 flow [2025-03-17 11:02:27,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:02:27,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:02:27,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 529 transitions. [2025-03-17 11:02:27,381 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9480286738351255 [2025-03-17 11:02:27,381 INFO L175 Difference]: Start difference. First operand has 186 places, 185 transitions, 426 flow. Second operand 3 states and 529 transitions. [2025-03-17 11:02:27,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 190 transitions, 466 flow [2025-03-17 11:02:27,385 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 190 transitions, 458 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:02:27,386 INFO L231 Difference]: Finished difference. Result has 187 places, 186 transitions, 430 flow [2025-03-17 11:02:27,387 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=186, PETRI_DIFFERENCE_MINUEND_FLOW=418, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=430, PETRI_PLACES=187, PETRI_TRANSITIONS=186} [2025-03-17 11:02:27,388 INFO L279 CegarLoopForPetriNet]: 180 programPoint places, 7 predicate places. [2025-03-17 11:02:27,388 INFO L471 AbstractCegarLoop]: Abstraction has has 187 places, 186 transitions, 430 flow [2025-03-17 11:02:27,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 172.66666666666666) internal successors, (518), 3 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:02:27,388 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:02:27,388 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:02:27,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 11:02:27,388 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-17 11:02:27,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:02:27,389 INFO L85 PathProgramCache]: Analyzing trace with hash -2067140162, now seen corresponding path program 1 times [2025-03-17 11:02:27,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:02:27,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143649863] [2025-03-17 11:02:27,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:02:27,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:02:27,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-17 11:02:27,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-17 11:02:27,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:02:27,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:02:27,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:02:27,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:02:27,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143649863] [2025-03-17 11:02:27,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143649863] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:02:27,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:02:27,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 11:02:27,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276415986] [2025-03-17 11:02:27,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:02:27,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:02:27,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:02:27,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:02:27,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:02:27,552 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 186 [2025-03-17 11:02:27,553 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 186 transitions, 430 flow. Second operand has 3 states, 3 states have (on average 175.33333333333334) internal successors, (526), 3 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:02:27,553 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:02:27,553 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 186 [2025-03-17 11:02:27,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:02:27,588 INFO L124 PetriNetUnfolderBase]: 8/231 cut-off events. [2025-03-17 11:02:27,588 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-17 11:02:27,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 292 conditions, 231 events. 8/231 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 304 event pairs, 0 based on Foata normal form. 1/219 useless extension candidates. Maximal degree in co-relation 185. Up to 14 conditions per place. [2025-03-17 11:02:27,589 INFO L140 encePairwiseOnDemand]: 183/186 looper letters, 9 selfloop transitions, 2 changer transitions 0/183 dead transitions. [2025-03-17 11:02:27,589 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 183 transitions, 430 flow [2025-03-17 11:02:27,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:02:27,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:02:27,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 534 transitions. [2025-03-17 11:02:27,590 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.956989247311828 [2025-03-17 11:02:27,590 INFO L175 Difference]: Start difference. First operand has 187 places, 186 transitions, 430 flow. Second operand 3 states and 534 transitions. [2025-03-17 11:02:27,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 183 transitions, 430 flow [2025-03-17 11:02:27,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 183 transitions, 420 flow, removed 3 selfloop flow, removed 3 redundant places. [2025-03-17 11:02:27,595 INFO L231 Difference]: Finished difference. Result has 185 places, 180 transitions, 400 flow [2025-03-17 11:02:27,596 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=186, PETRI_DIFFERENCE_MINUEND_FLOW=392, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=400, PETRI_PLACES=185, PETRI_TRANSITIONS=180} [2025-03-17 11:02:27,597 INFO L279 CegarLoopForPetriNet]: 180 programPoint places, 5 predicate places. [2025-03-17 11:02:27,597 INFO L471 AbstractCegarLoop]: Abstraction has has 185 places, 180 transitions, 400 flow [2025-03-17 11:02:27,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 175.33333333333334) internal successors, (526), 3 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:02:27,597 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:02:27,597 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:02:27,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 11:02:27,598 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-17 11:02:27,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:02:27,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1006516928, now seen corresponding path program 1 times [2025-03-17 11:02:27,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:02:27,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360825859] [2025-03-17 11:02:27,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:02:27,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:02:27,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-17 11:02:27,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-17 11:02:27,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:02:27,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:02:27,735 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:02:27,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:02:27,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360825859] [2025-03-17 11:02:27,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360825859] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:02:27,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1533337572] [2025-03-17 11:02:27,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:02:27,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:02:27,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:02:27,738 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:02:27,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 11:02:27,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-17 11:02:27,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-17 11:02:27,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:02:27,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:02:27,856 INFO L256 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 11:02:27,860 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:02:27,889 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:02:27,889 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 11:02:27,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1533337572] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:02:27,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 11:02:27,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-17 11:02:27,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879068695] [2025-03-17 11:02:27,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:02:27,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:02:27,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:02:27,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:02:27,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:02:27,903 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 186 [2025-03-17 11:02:27,904 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 180 transitions, 400 flow. Second operand has 3 states, 3 states have (on average 170.66666666666666) internal successors, (512), 3 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:02:27,904 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:02:27,904 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 186 [2025-03-17 11:02:27,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:02:27,943 INFO L124 PetriNetUnfolderBase]: 50/337 cut-off events. [2025-03-17 11:02:27,944 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2025-03-17 11:02:27,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 505 conditions, 337 events. 50/337 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 917 event pairs, 15 based on Foata normal form. 0/316 useless extension candidates. Maximal degree in co-relation 357. Up to 70 conditions per place. [2025-03-17 11:02:27,945 INFO L140 encePairwiseOnDemand]: 181/186 looper letters, 14 selfloop transitions, 5 changer transitions 3/188 dead transitions. [2025-03-17 11:02:27,945 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 188 transitions, 464 flow [2025-03-17 11:02:27,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:02:27,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:02:27,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 527 transitions. [2025-03-17 11:02:27,947 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9444444444444444 [2025-03-17 11:02:27,947 INFO L175 Difference]: Start difference. First operand has 185 places, 180 transitions, 400 flow. Second operand 3 states and 527 transitions. [2025-03-17 11:02:27,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 188 transitions, 464 flow [2025-03-17 11:02:27,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 188 transitions, 460 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:02:27,949 INFO L231 Difference]: Finished difference. Result has 187 places, 182 transitions, 432 flow [2025-03-17 11:02:27,950 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=186, PETRI_DIFFERENCE_MINUEND_FLOW=396, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=432, PETRI_PLACES=187, PETRI_TRANSITIONS=182} [2025-03-17 11:02:27,950 INFO L279 CegarLoopForPetriNet]: 180 programPoint places, 7 predicate places. [2025-03-17 11:02:27,950 INFO L471 AbstractCegarLoop]: Abstraction has has 187 places, 182 transitions, 432 flow [2025-03-17 11:02:27,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 170.66666666666666) internal successors, (512), 3 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:02:27,951 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:02:27,951 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:02:27,958 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 11:02:28,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-17 11:02:28,152 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-17 11:02:28,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:02:28,153 INFO L85 PathProgramCache]: Analyzing trace with hash -2103104400, now seen corresponding path program 1 times [2025-03-17 11:02:28,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:02:28,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94299245] [2025-03-17 11:02:28,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:02:28,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:02:28,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-17 11:02:28,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-17 11:02:28,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:02:28,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:02:28,251 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:02:28,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:02:28,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94299245] [2025-03-17 11:02:28,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94299245] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:02:28,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [923804546] [2025-03-17 11:02:28,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:02:28,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:02:28,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:02:28,253 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:02:28,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 11:02:28,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-17 11:02:28,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-17 11:02:28,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:02:28,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:02:28,376 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 11:02:28,391 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:02:28,446 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:02:28,447 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:02:28,489 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:02:28,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [923804546] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:02:28,494 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:02:28,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-17 11:02:28,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332954633] [2025-03-17 11:02:28,494 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:02:28,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 11:02:28,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:02:28,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 11:02:28,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-17 11:02:28,524 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 186 [2025-03-17 11:02:28,526 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 182 transitions, 432 flow. Second operand has 10 states, 10 states have (on average 170.0) internal successors, (1700), 10 states have internal predecessors, (1700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:02:28,526 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:02:28,526 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 186 [2025-03-17 11:02:28,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:02:28,695 INFO L124 PetriNetUnfolderBase]: 72/434 cut-off events. [2025-03-17 11:02:28,696 INFO L125 PetriNetUnfolderBase]: For 47/50 co-relation queries the response was YES. [2025-03-17 11:02:28,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 728 conditions, 434 events. 72/434 cut-off events. For 47/50 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1193 event pairs, 9 based on Foata normal form. 8/428 useless extension candidates. Maximal degree in co-relation 580. Up to 47 conditions per place. [2025-03-17 11:02:28,698 INFO L140 encePairwiseOnDemand]: 180/186 looper letters, 34 selfloop transitions, 9 changer transitions 0/211 dead transitions. [2025-03-17 11:02:28,698 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 211 transitions, 578 flow [2025-03-17 11:02:28,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 11:02:28,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-17 11:02:28,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1557 transitions. [2025-03-17 11:02:28,701 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9301075268817204 [2025-03-17 11:02:28,701 INFO L175 Difference]: Start difference. First operand has 187 places, 182 transitions, 432 flow. Second operand 9 states and 1557 transitions. [2025-03-17 11:02:28,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 211 transitions, 578 flow [2025-03-17 11:02:28,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 211 transitions, 568 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:02:28,706 INFO L231 Difference]: Finished difference. Result has 196 places, 188 transitions, 472 flow [2025-03-17 11:02:28,706 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=186, PETRI_DIFFERENCE_MINUEND_FLOW=422, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=472, PETRI_PLACES=196, PETRI_TRANSITIONS=188} [2025-03-17 11:02:28,707 INFO L279 CegarLoopForPetriNet]: 180 programPoint places, 16 predicate places. [2025-03-17 11:02:28,707 INFO L471 AbstractCegarLoop]: Abstraction has has 196 places, 188 transitions, 472 flow [2025-03-17 11:02:28,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 170.0) internal successors, (1700), 10 states have internal predecessors, (1700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:02:28,709 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:02:28,709 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:02:28,716 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 11:02:28,910 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,SelfDestructingSolverStorable6 [2025-03-17 11:02:28,910 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-17 11:02:28,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:02:28,911 INFO L85 PathProgramCache]: Analyzing trace with hash -1052123106, now seen corresponding path program 2 times [2025-03-17 11:02:28,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:02:28,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137549743] [2025-03-17 11:02:28,911 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:02:28,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:02:28,935 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 173 statements into 2 equivalence classes. [2025-03-17 11:02:28,952 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 173 of 173 statements. [2025-03-17 11:02:28,954 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 11:02:28,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:02:29,119 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:02:29,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:02:29,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137549743] [2025-03-17 11:02:29,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137549743] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:02:29,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [908045321] [2025-03-17 11:02:29,121 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:02:29,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:02:29,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:02:29,123 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:02:29,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 11:02:29,207 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 173 statements into 2 equivalence classes. [2025-03-17 11:02:29,255 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 173 of 173 statements. [2025-03-17 11:02:29,256 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 11:02:29,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:02:29,257 INFO L256 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 11:02:29,260 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:02:29,338 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:02:29,338 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:02:29,447 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:02:29,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [908045321] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:02:29,451 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:02:29,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-03-17 11:02:29,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440334683] [2025-03-17 11:02:29,451 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:02:29,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-17 11:02:29,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:02:29,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-17 11:02:29,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-03-17 11:02:29,488 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 186 [2025-03-17 11:02:29,491 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 188 transitions, 472 flow. Second operand has 18 states, 18 states have (on average 170.05555555555554) internal successors, (3061), 18 states have internal predecessors, (3061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:02:29,491 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:02:29,491 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 186 [2025-03-17 11:02:29,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:02:29,790 INFO L124 PetriNetUnfolderBase]: 109/597 cut-off events. [2025-03-17 11:02:29,791 INFO L125 PetriNetUnfolderBase]: For 144/147 co-relation queries the response was YES. [2025-03-17 11:02:29,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1196 conditions, 597 events. 109/597 cut-off events. For 144/147 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1787 event pairs, 12 based on Foata normal form. 16/600 useless extension candidates. Maximal degree in co-relation 1046. Up to 47 conditions per place. [2025-03-17 11:02:29,793 INFO L140 encePairwiseOnDemand]: 180/186 looper letters, 74 selfloop transitions, 21 changer transitions 0/263 dead transitions. [2025-03-17 11:02:29,793 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 263 transitions, 872 flow [2025-03-17 11:02:29,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-17 11:02:29,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-17 11:02:29,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 3627 transitions. [2025-03-17 11:02:29,799 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9285714285714286 [2025-03-17 11:02:29,799 INFO L175 Difference]: Start difference. First operand has 196 places, 188 transitions, 472 flow. Second operand 21 states and 3627 transitions. [2025-03-17 11:02:29,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 263 transitions, 872 flow [2025-03-17 11:02:29,801 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 263 transitions, 858 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-03-17 11:02:29,803 INFO L231 Difference]: Finished difference. Result has 220 places, 201 transitions, 596 flow [2025-03-17 11:02:29,803 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=186, PETRI_DIFFERENCE_MINUEND_FLOW=466, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=596, PETRI_PLACES=220, PETRI_TRANSITIONS=201} [2025-03-17 11:02:29,804 INFO L279 CegarLoopForPetriNet]: 180 programPoint places, 40 predicate places. [2025-03-17 11:02:29,804 INFO L471 AbstractCegarLoop]: Abstraction has has 220 places, 201 transitions, 596 flow [2025-03-17 11:02:29,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 170.05555555555554) internal successors, (3061), 18 states have internal predecessors, (3061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:02:29,806 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:02:29,806 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:02:29,813 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-17 11:02:30,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:02:30,007 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-17 11:02:30,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:02:30,009 INFO L85 PathProgramCache]: Analyzing trace with hash -80408036, now seen corresponding path program 3 times [2025-03-17 11:02:30,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:02:30,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401643905] [2025-03-17 11:02:30,009 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 11:02:30,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:02:30,029 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 205 statements into 7 equivalence classes. [2025-03-17 11:02:30,058 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 205 of 205 statements. [2025-03-17 11:02:30,058 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-03-17 11:02:30,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:02:30,488 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 168 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:02:30,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:02:30,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401643905] [2025-03-17 11:02:30,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401643905] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:02:30,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [507101743] [2025-03-17 11:02:30,489 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 11:02:30,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:02:30,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:02:30,491 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:02:30,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 11:02:30,576 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 205 statements into 7 equivalence classes. [2025-03-17 11:02:30,690 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 205 of 205 statements. [2025-03-17 11:02:30,690 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-03-17 11:02:30,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:02:30,692 INFO L256 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-17 11:02:30,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:02:30,802 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 168 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:02:30,802 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:02:31,120 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 168 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:02:31,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [507101743] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:02:31,120 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:02:31,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2025-03-17 11:02:31,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911743723] [2025-03-17 11:02:31,120 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:02:31,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-17 11:02:31,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:02:31,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-17 11:02:31,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2025-03-17 11:02:31,165 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 186 [2025-03-17 11:02:31,170 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 201 transitions, 596 flow. Second operand has 34 states, 34 states have (on average 170.02941176470588) internal successors, (5781), 34 states have internal predecessors, (5781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:02:31,171 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:02:31,171 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 186 [2025-03-17 11:02:31,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:02:31,932 INFO L124 PetriNetUnfolderBase]: 264/1010 cut-off events. [2025-03-17 11:02:31,932 INFO L125 PetriNetUnfolderBase]: For 1079/1082 co-relation queries the response was YES. [2025-03-17 11:02:31,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2469 conditions, 1010 events. 264/1010 cut-off events. For 1079/1082 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 3144 event pairs, 9 based on Foata normal form. 32/1028 useless extension candidates. Maximal degree in co-relation 2314. Up to 127 conditions per place. [2025-03-17 11:02:31,939 INFO L140 encePairwiseOnDemand]: 180/186 looper letters, 154 selfloop transitions, 45 changer transitions 0/367 dead transitions. [2025-03-17 11:02:31,939 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 367 transitions, 1540 flow [2025-03-17 11:02:31,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-03-17 11:02:31,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2025-03-17 11:02:31,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 7767 transitions. [2025-03-17 11:02:31,951 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9279569892473118 [2025-03-17 11:02:31,951 INFO L175 Difference]: Start difference. First operand has 220 places, 201 transitions, 596 flow. Second operand 45 states and 7767 transitions. [2025-03-17 11:02:31,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 264 places, 367 transitions, 1540 flow [2025-03-17 11:02:31,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 367 transitions, 1500 flow, removed 14 selfloop flow, removed 6 redundant places. [2025-03-17 11:02:31,959 INFO L231 Difference]: Finished difference. Result has 267 places, 226 transitions, 874 flow [2025-03-17 11:02:31,959 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=186, PETRI_DIFFERENCE_MINUEND_FLOW=572, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=45, PETRI_FLOW=874, PETRI_PLACES=267, PETRI_TRANSITIONS=226} [2025-03-17 11:02:31,961 INFO L279 CegarLoopForPetriNet]: 180 programPoint places, 87 predicate places. [2025-03-17 11:02:31,961 INFO L471 AbstractCegarLoop]: Abstraction has has 267 places, 226 transitions, 874 flow [2025-03-17 11:02:31,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 170.02941176470588) internal successors, (5781), 34 states have internal predecessors, (5781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:02:31,963 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:02:31,963 INFO L206 CegarLoopForPetriNet]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:02:31,970 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-17 11:02:32,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:02:32,164 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-17 11:02:32,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:02:32,165 INFO L85 PathProgramCache]: Analyzing trace with hash 1391734620, now seen corresponding path program 4 times [2025-03-17 11:02:32,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:02:32,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219263711] [2025-03-17 11:02:32,166 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 11:02:32,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:02:32,183 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 269 statements into 2 equivalence classes. [2025-03-17 11:02:32,197 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 269 of 269 statements. [2025-03-17 11:02:32,197 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 11:02:32,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:02:32,922 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 840 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:02:32,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:02:32,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219263711] [2025-03-17 11:02:32,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219263711] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:02:32,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1607717686] [2025-03-17 11:02:32,923 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 11:02:32,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:02:32,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:02:32,925 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:02:32,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 11:02:33,006 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 269 statements into 2 equivalence classes. [2025-03-17 11:02:33,048 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 269 of 269 statements. [2025-03-17 11:02:33,049 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 11:02:33,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:02:33,051 INFO L256 TraceCheckSpWp]: Trace formula consists of 509 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-17 11:02:33,054 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:02:33,207 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 840 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:02:33,207 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:02:34,046 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 840 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:02:34,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1607717686] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:02:34,046 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:02:34,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 66 [2025-03-17 11:02:34,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346708032] [2025-03-17 11:02:34,046 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:02:34,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2025-03-17 11:02:34,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:02:34,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2025-03-17 11:02:34,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1122, Invalid=3168, Unknown=0, NotChecked=0, Total=4290 [2025-03-17 11:02:34,110 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 186 [2025-03-17 11:02:34,116 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 226 transitions, 874 flow. Second operand has 66 states, 66 states have (on average 170.0151515151515) internal successors, (11221), 66 states have internal predecessors, (11221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:02:34,117 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:02:34,117 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 186 [2025-03-17 11:02:34,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:02:36,306 INFO L124 PetriNetUnfolderBase]: 520/1778 cut-off events. [2025-03-17 11:02:36,306 INFO L125 PetriNetUnfolderBase]: For 8807/8810 co-relation queries the response was YES. [2025-03-17 11:02:36,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5186 conditions, 1778 events. 520/1778 cut-off events. For 8807/8810 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 5824 event pairs, 9 based on Foata normal form. 64/1828 useless extension candidates. Maximal degree in co-relation 5022. Up to 255 conditions per place. [2025-03-17 11:02:36,316 INFO L140 encePairwiseOnDemand]: 180/186 looper letters, 314 selfloop transitions, 93 changer transitions 0/575 dead transitions. [2025-03-17 11:02:36,316 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 359 places, 575 transitions, 3022 flow [2025-03-17 11:02:36,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2025-03-17 11:02:36,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2025-03-17 11:02:36,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 16047 transitions. [2025-03-17 11:02:36,330 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9276795005202914 [2025-03-17 11:02:36,330 INFO L175 Difference]: Start difference. First operand has 267 places, 226 transitions, 874 flow. Second operand 93 states and 16047 transitions. [2025-03-17 11:02:36,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 359 places, 575 transitions, 3022 flow [2025-03-17 11:02:36,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 341 places, 575 transitions, 2934 flow, removed 26 selfloop flow, removed 18 redundant places. [2025-03-17 11:02:36,346 INFO L231 Difference]: Finished difference. Result has 358 places, 275 transitions, 1508 flow [2025-03-17 11:02:36,347 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=186, PETRI_DIFFERENCE_MINUEND_FLOW=818, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=93, PETRI_FLOW=1508, PETRI_PLACES=358, PETRI_TRANSITIONS=275} [2025-03-17 11:02:36,348 INFO L279 CegarLoopForPetriNet]: 180 programPoint places, 178 predicate places. [2025-03-17 11:02:36,348 INFO L471 AbstractCegarLoop]: Abstraction has has 358 places, 275 transitions, 1508 flow [2025-03-17 11:02:36,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 170.0151515151515) internal successors, (11221), 66 states have internal predecessors, (11221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:02:36,353 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:02:36,353 INFO L206 CegarLoopForPetriNet]: trace histogram [31, 31, 31, 31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:02:36,360 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-17 11:02:36,557 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,SelfDestructingSolverStorable9 [2025-03-17 11:02:36,557 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-17 11:02:36,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:02:36,558 INFO L85 PathProgramCache]: Analyzing trace with hash 315404554, now seen corresponding path program 5 times [2025-03-17 11:02:36,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:02:36,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53398319] [2025-03-17 11:02:36,558 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 11:02:36,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:02:36,573 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 397 statements into 31 equivalence classes. [2025-03-17 11:02:36,611 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 31 check-sat command(s) and asserted 397 of 397 statements. [2025-03-17 11:02:36,611 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 31 check-sat command(s) [2025-03-17 11:02:36,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:02:38,468 INFO L134 CoverageAnalysis]: Checked inductivity of 3720 backedges. 0 proven. 3720 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:02:38,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:02:38,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53398319] [2025-03-17 11:02:38,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53398319] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:02:38,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2011802385] [2025-03-17 11:02:38,469 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 11:02:38,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:02:38,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:02:38,473 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:02:38,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-17 11:02:38,567 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 397 statements into 31 equivalence classes. [2025-03-17 11:02:38,636 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 31 check-sat command(s) and asserted 397 of 397 statements. [2025-03-17 11:02:38,636 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 31 check-sat command(s) [2025-03-17 11:02:38,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:02:38,639 INFO L256 TraceCheckSpWp]: Trace formula consists of 717 conjuncts, 64 conjuncts are in the unsatisfiable core [2025-03-17 11:02:38,644 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:02:38,900 INFO L134 CoverageAnalysis]: Checked inductivity of 3720 backedges. 0 proven. 3720 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:02:38,901 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:02:40,618 INFO L134 CoverageAnalysis]: Checked inductivity of 3720 backedges. 0 proven. 3720 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:02:40,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2011802385] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:02:40,618 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:02:40,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 87 [2025-03-17 11:02:40,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718421870] [2025-03-17 11:02:40,619 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:02:40,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 87 states [2025-03-17 11:02:40,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:02:40,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2025-03-17 11:02:40,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1935, Invalid=5547, Unknown=0, NotChecked=0, Total=7482 [2025-03-17 11:02:40,688 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 186 [2025-03-17 11:02:40,698 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 358 places, 275 transitions, 1508 flow. Second operand has 87 states, 87 states have (on average 170.0344827586207) internal successors, (14793), 87 states have internal predecessors, (14793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:02:40,698 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:02:40,698 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 186 [2025-03-17 11:02:40,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:02:44,298 INFO L124 PetriNetUnfolderBase]: 712/2354 cut-off events. [2025-03-17 11:02:44,299 INFO L125 PetriNetUnfolderBase]: For 28499/28502 co-relation queries the response was YES. [2025-03-17 11:02:44,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7719 conditions, 2354 events. 712/2354 cut-off events. For 28499/28502 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 7655 event pairs, 9 based on Foata normal form. 48/2388 useless extension candidates. Maximal degree in co-relation 7538. Up to 351 conditions per place. [2025-03-17 11:02:44,312 INFO L140 encePairwiseOnDemand]: 180/186 looper letters, 434 selfloop transitions, 129 changer transitions 0/731 dead transitions. [2025-03-17 11:02:44,312 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 486 places, 731 transitions, 4376 flow [2025-03-17 11:02:44,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2025-03-17 11:02:44,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2025-03-17 11:02:44,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 22247 transitions. [2025-03-17 11:02:44,328 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9271901308660498 [2025-03-17 11:02:44,329 INFO L175 Difference]: Start difference. First operand has 358 places, 275 transitions, 1508 flow. Second operand 129 states and 22247 transitions. [2025-03-17 11:02:44,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 486 places, 731 transitions, 4376 flow [2025-03-17 11:02:44,352 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 444 places, 731 transitions, 4232 flow, removed 30 selfloop flow, removed 42 redundant places. [2025-03-17 11:02:44,357 INFO L231 Difference]: Finished difference. Result has 457 places, 312 transitions, 2106 flow [2025-03-17 11:02:44,358 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=186, PETRI_DIFFERENCE_MINUEND_FLOW=1388, PETRI_DIFFERENCE_MINUEND_PLACES=316, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=275, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=94, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=129, PETRI_FLOW=2106, PETRI_PLACES=457, PETRI_TRANSITIONS=312} [2025-03-17 11:02:44,359 INFO L279 CegarLoopForPetriNet]: 180 programPoint places, 277 predicate places. [2025-03-17 11:02:44,359 INFO L471 AbstractCegarLoop]: Abstraction has has 457 places, 312 transitions, 2106 flow [2025-03-17 11:02:44,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 87 states, 87 states have (on average 170.0344827586207) internal successors, (14793), 87 states have internal predecessors, (14793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:02:44,365 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:02:44,365 INFO L206 CegarLoopForPetriNet]: trace histogram [43, 43, 43, 43, 43, 43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:02:44,373 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-17 11:02:44,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:02:44,567 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-17 11:02:44,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:02:44,568 INFO L85 PathProgramCache]: Analyzing trace with hash 817017130, now seen corresponding path program 6 times [2025-03-17 11:02:44,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:02:44,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465715992] [2025-03-17 11:02:44,569 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 11:02:44,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:02:44,585 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 493 statements into 43 equivalence classes. [2025-03-17 11:02:44,701 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) and asserted 493 of 493 statements. [2025-03-17 11:02:44,701 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) [2025-03-17 11:02:44,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 11:02:44,701 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 11:02:44,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 493 statements into 1 equivalence classes. [2025-03-17 11:02:44,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 493 of 493 statements. [2025-03-17 11:02:44,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:02:44,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 11:02:44,906 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 11:02:44,907 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 11:02:44,907 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location threadErr1ASSERT_VIOLATIONDATA_RACE (6 of 7 remaining) [2025-03-17 11:02:44,909 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining) [2025-03-17 11:02:44,909 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining) [2025-03-17 11:02:44,909 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2025-03-17 11:02:44,909 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining) [2025-03-17 11:02:44,909 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining) [2025-03-17 11:02:44,909 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 7 remaining) [2025-03-17 11:02:44,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 11:02:44,910 INFO L422 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1, 1, 1] [2025-03-17 11:02:45,043 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-17 11:02:45,043 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 11:02:45,049 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 11:02:45 BasicIcfg [2025-03-17 11:02:45,050 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 11:02:45,050 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 11:02:45,050 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 11:02:45,050 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 11:02:45,051 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:02:25" (3/4) ... [2025-03-17 11:02:45,051 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-17 11:02:45,170 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 46. [2025-03-17 11:02:45,239 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 11:02:45,240 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 11:02:45,241 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 11:02:45,241 INFO L158 Benchmark]: Toolchain (without parser) took 20056.78ms. Allocated memory was 167.8MB in the beginning and 503.3MB in the end (delta: 335.5MB). Free memory was 130.9MB in the beginning and 264.6MB in the end (delta: -133.7MB). Peak memory consumption was 202.7MB. Max. memory is 16.1GB. [2025-03-17 11:02:45,241 INFO L158 Benchmark]: CDTParser took 0.41ms. Allocated memory is still 201.3MB. Free memory is still 126.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 11:02:45,241 INFO L158 Benchmark]: CACSL2BoogieTranslator took 299.39ms. Allocated memory is still 167.8MB. Free memory was 130.9MB in the beginning and 110.4MB in the end (delta: 20.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-17 11:02:45,242 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.53ms. Allocated memory is still 167.8MB. Free memory was 110.4MB in the beginning and 108.2MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 11:02:45,242 INFO L158 Benchmark]: Boogie Preprocessor took 17.04ms. Allocated memory is still 167.8MB. Free memory was 108.2MB in the beginning and 106.9MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 11:02:45,242 INFO L158 Benchmark]: IcfgBuilder took 431.84ms. Allocated memory is still 167.8MB. Free memory was 106.9MB in the beginning and 87.6MB in the end (delta: 19.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 11:02:45,243 INFO L158 Benchmark]: TraceAbstraction took 19084.77ms. Allocated memory was 167.8MB in the beginning and 503.3MB in the end (delta: 335.5MB). Free memory was 87.1MB in the beginning and 323.4MB in the end (delta: -236.2MB). Peak memory consumption was 328.5MB. Max. memory is 16.1GB. [2025-03-17 11:02:45,243 INFO L158 Benchmark]: Witness Printer took 190.38ms. Allocated memory is still 503.3MB. Free memory was 323.4MB in the beginning and 264.6MB in the end (delta: 58.7MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-03-17 11:02:45,244 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.41ms. Allocated memory is still 201.3MB. Free memory is still 126.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 299.39ms. Allocated memory is still 167.8MB. Free memory was 130.9MB in the beginning and 110.4MB in the end (delta: 20.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.53ms. Allocated memory is still 167.8MB. Free memory was 110.4MB in the beginning and 108.2MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 17.04ms. Allocated memory is still 167.8MB. Free memory was 108.2MB in the beginning and 106.9MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 431.84ms. Allocated memory is still 167.8MB. Free memory was 106.9MB in the beginning and 87.6MB in the end (delta: 19.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 19084.77ms. Allocated memory was 167.8MB in the beginning and 503.3MB in the end (delta: 335.5MB). Free memory was 87.1MB in the beginning and 323.4MB in the end (delta: -236.2MB). Peak memory consumption was 328.5MB. Max. memory is 16.1GB. * Witness Printer took 190.38ms. Allocated memory is still 503.3MB. Free memory was 323.4MB in the beginning and 264.6MB in the end (delta: 58.7MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 704]: Data race detected Data race detected The following path leads to a data race: [L697] 0 pthread_mutex_t lock; VAL [lock={3:0}] [L698] 0 pthread_cond_t cond; VAL [lock={3:0}] [L699] 0 int x; VAL [lock={3:0}, x=0] [L700] 0 _Bool x_set = 0; VAL [lock={3:0}, x=0, x_set=0] [L711] 0 pthread_t t; VAL [lock={3:0}, x=0, x_set=0] [L712] FCALL, FORK 0 pthread_create( &t, ((void *)0), thread, ((void *)0) ) VAL [lock={3:0}, t=-1, x=0, x_set=0] [L713] 0 int i = 0; VAL [i=0, lock={3:0}, t=-1, x=0, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=0, lock={3:0}, t=-1, x=0, x_set=0] [L714] 0 x = i VAL [i=0, lock={3:0}, t=-1, x=0, x_set=0] [L713] 0 i++ VAL [i=1, lock={3:0}, t=-1, x=0, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=1, lock={3:0}, t=-1, x=0, x_set=0] [L714] 0 x = i VAL [i=1, lock={3:0}, t=-1, x=1, x_set=0] [L713] 0 i++ VAL [i=2, lock={3:0}, t=-1, x=1, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=2, lock={3:0}, t=-1, x=1, x_set=0] [L714] 0 x = i VAL [i=2, lock={3:0}, t=-1, x=2, x_set=0] [L713] 0 i++ VAL [i=3, lock={3:0}, t=-1, x=2, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=3, lock={3:0}, t=-1, x=2, x_set=0] [L714] 0 x = i VAL [i=3, lock={3:0}, t=-1, x=3, x_set=0] [L713] 0 i++ VAL [i=4, lock={3:0}, t=-1, x=3, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=4, lock={3:0}, t=-1, x=3, x_set=0] [L714] 0 x = i VAL [i=4, lock={3:0}, t=-1, x=4, x_set=0] [L713] 0 i++ VAL [i=5, lock={3:0}, t=-1, x=4, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=5, lock={3:0}, t=-1, x=4, x_set=0] [L714] 0 x = i VAL [i=5, lock={3:0}, t=-1, x=5, x_set=0] [L713] 0 i++ VAL [i=6, lock={3:0}, t=-1, x=5, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=6, lock={3:0}, t=-1, x=5, x_set=0] [L714] 0 x = i VAL [i=6, lock={3:0}, t=-1, x=6, x_set=0] [L713] 0 i++ VAL [i=7, lock={3:0}, t=-1, x=6, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=7, lock={3:0}, t=-1, x=6, x_set=0] [L714] 0 x = i VAL [i=7, lock={3:0}, t=-1, x=7, x_set=0] [L713] 0 i++ VAL [i=8, lock={3:0}, t=-1, x=7, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=8, lock={3:0}, t=-1, x=7, x_set=0] [L714] 0 x = i VAL [i=8, lock={3:0}, t=-1, x=8, x_set=0] [L713] 0 i++ VAL [i=9, lock={3:0}, t=-1, x=8, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=9, lock={3:0}, t=-1, x=8, x_set=0] [L714] 0 x = i VAL [i=9, lock={3:0}, t=-1, x=9, x_set=0] [L713] 0 i++ VAL [i=10, lock={3:0}, t=-1, x=9, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=10, lock={3:0}, t=-1, x=9, x_set=0] [L714] 0 x = i VAL [i=10, lock={3:0}, t=-1, x=10, x_set=0] [L713] 0 i++ VAL [i=11, lock={3:0}, t=-1, x=10, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=11, lock={3:0}, t=-1, x=10, x_set=0] [L714] 0 x = i VAL [i=11, lock={3:0}, t=-1, x=11, x_set=0] [L713] 0 i++ VAL [i=12, lock={3:0}, t=-1, x=11, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=12, lock={3:0}, t=-1, x=11, x_set=0] [L714] 0 x = i VAL [i=12, lock={3:0}, t=-1, x=12, x_set=0] [L713] 0 i++ VAL [i=13, lock={3:0}, t=-1, x=12, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=13, lock={3:0}, t=-1, x=12, x_set=0] [L714] 0 x = i VAL [i=13, lock={3:0}, t=-1, x=13, x_set=0] [L713] 0 i++ VAL [i=14, lock={3:0}, t=-1, x=13, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=14, lock={3:0}, t=-1, x=13, x_set=0] [L714] 0 x = i VAL [i=14, lock={3:0}, t=-1, x=14, x_set=0] [L713] 0 i++ VAL [i=15, lock={3:0}, t=-1, x=14, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=15, lock={3:0}, t=-1, x=14, x_set=0] [L714] 0 x = i VAL [i=15, lock={3:0}, t=-1, x=15, x_set=0] [L713] 0 i++ VAL [i=16, lock={3:0}, t=-1, x=15, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=16, lock={3:0}, t=-1, x=15, x_set=0] [L714] 0 x = i VAL [i=16, lock={3:0}, t=-1, x=16, x_set=0] [L713] 0 i++ VAL [i=17, lock={3:0}, t=-1, x=16, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=17, lock={3:0}, t=-1, x=16, x_set=0] [L714] 0 x = i VAL [i=17, lock={3:0}, t=-1, x=17, x_set=0] [L713] 0 i++ VAL [i=18, lock={3:0}, t=-1, x=17, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=18, lock={3:0}, t=-1, x=17, x_set=0] [L714] 0 x = i VAL [i=18, lock={3:0}, t=-1, x=18, x_set=0] [L713] 0 i++ VAL [i=19, lock={3:0}, t=-1, x=18, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=19, lock={3:0}, t=-1, x=18, x_set=0] [L714] 0 x = i VAL [i=19, lock={3:0}, t=-1, x=19, x_set=0] [L713] 0 i++ VAL [i=20, lock={3:0}, t=-1, x=19, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=20, lock={3:0}, t=-1, x=19, x_set=0] [L714] 0 x = i VAL [i=20, lock={3:0}, t=-1, x=20, x_set=0] [L713] 0 i++ VAL [i=21, lock={3:0}, t=-1, x=20, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=21, lock={3:0}, t=-1, x=20, x_set=0] [L714] 0 x = i VAL [i=21, lock={3:0}, t=-1, x=21, x_set=0] [L713] 0 i++ VAL [i=22, lock={3:0}, t=-1, x=21, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=22, lock={3:0}, t=-1, x=21, x_set=0] [L714] 0 x = i VAL [i=22, lock={3:0}, t=-1, x=22, x_set=0] [L713] 0 i++ VAL [i=23, lock={3:0}, t=-1, x=22, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=23, lock={3:0}, t=-1, x=22, x_set=0] [L714] 0 x = i VAL [i=23, lock={3:0}, t=-1, x=23, x_set=0] [L713] 0 i++ VAL [i=24, lock={3:0}, t=-1, x=23, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=24, lock={3:0}, t=-1, x=23, x_set=0] [L714] 0 x = i VAL [i=24, lock={3:0}, t=-1, x=24, x_set=0] [L713] 0 i++ VAL [i=25, lock={3:0}, t=-1, x=24, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=25, lock={3:0}, t=-1, x=24, x_set=0] [L714] 0 x = i VAL [i=25, lock={3:0}, t=-1, x=25, x_set=0] [L713] 0 i++ VAL [i=26, lock={3:0}, t=-1, x=25, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=26, lock={3:0}, t=-1, x=25, x_set=0] [L714] 0 x = i VAL [i=26, lock={3:0}, t=-1, x=26, x_set=0] [L713] 0 i++ VAL [i=27, lock={3:0}, t=-1, x=26, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=27, lock={3:0}, t=-1, x=26, x_set=0] [L714] 0 x = i VAL [i=27, lock={3:0}, t=-1, x=27, x_set=0] [L713] 0 i++ VAL [i=28, lock={3:0}, t=-1, x=27, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=28, lock={3:0}, t=-1, x=27, x_set=0] [L714] 0 x = i VAL [i=28, lock={3:0}, t=-1, x=28, x_set=0] [L713] 0 i++ VAL [i=29, lock={3:0}, t=-1, x=28, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=29, lock={3:0}, t=-1, x=28, x_set=0] [L714] 0 x = i VAL [i=29, lock={3:0}, t=-1, x=29, x_set=0] [L713] 0 i++ VAL [i=30, lock={3:0}, t=-1, x=29, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=30, lock={3:0}, t=-1, x=29, x_set=0] [L714] 0 x = i VAL [i=30, lock={3:0}, t=-1, x=30, x_set=0] [L713] 0 i++ VAL [i=31, lock={3:0}, t=-1, x=30, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=31, lock={3:0}, t=-1, x=30, x_set=0] [L714] 0 x = i VAL [i=31, lock={3:0}, t=-1, x=31, x_set=0] [L713] 0 i++ VAL [i=32, lock={3:0}, t=-1, x=31, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=32, lock={3:0}, t=-1, x=31, x_set=0] [L714] 0 x = i VAL [i=32, lock={3:0}, t=-1, x=32, x_set=0] [L713] 0 i++ VAL [i=33, lock={3:0}, t=-1, x=32, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=33, lock={3:0}, t=-1, x=32, x_set=0] [L714] 0 x = i VAL [i=33, lock={3:0}, t=-1, x=33, x_set=0] [L713] 0 i++ VAL [i=34, lock={3:0}, t=-1, x=33, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=34, lock={3:0}, t=-1, x=33, x_set=0] [L714] 0 x = i VAL [i=34, lock={3:0}, t=-1, x=34, x_set=0] [L713] 0 i++ VAL [i=35, lock={3:0}, t=-1, x=34, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=35, lock={3:0}, t=-1, x=34, x_set=0] [L714] 0 x = i VAL [i=35, lock={3:0}, t=-1, x=35, x_set=0] [L713] 0 i++ VAL [i=36, lock={3:0}, t=-1, x=35, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=36, lock={3:0}, t=-1, x=35, x_set=0] [L714] 0 x = i VAL [i=36, lock={3:0}, t=-1, x=36, x_set=0] [L713] 0 i++ VAL [i=37, lock={3:0}, t=-1, x=36, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=37, lock={3:0}, t=-1, x=36, x_set=0] [L714] 0 x = i VAL [i=37, lock={3:0}, t=-1, x=37, x_set=0] [L713] 0 i++ VAL [i=38, lock={3:0}, t=-1, x=37, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=38, lock={3:0}, t=-1, x=37, x_set=0] [L714] 0 x = i VAL [i=38, lock={3:0}, t=-1, x=38, x_set=0] [L713] 0 i++ VAL [i=39, lock={3:0}, t=-1, x=38, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=39, lock={3:0}, t=-1, x=38, x_set=0] [L714] 0 x = i VAL [i=39, lock={3:0}, t=-1, x=39, x_set=0] [L713] 0 i++ VAL [i=40, lock={3:0}, t=-1, x=39, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=40, lock={3:0}, t=-1, x=39, x_set=0] [L714] 0 x = i VAL [i=40, lock={3:0}, t=-1, x=40, x_set=0] [L713] 0 i++ VAL [i=41, lock={3:0}, t=-1, x=40, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=41, lock={3:0}, t=-1, x=40, x_set=0] [L714] 0 x = i VAL [i=41, lock={3:0}, t=-1, x=41, x_set=0] [L713] 0 i++ VAL [i=42, lock={3:0}, t=-1, x=41, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=42, lock={3:0}, t=-1, x=41, x_set=0] [L714] 0 x = i VAL [i=42, lock={3:0}, t=-1, x=42, x_set=0] [L713] 0 i++ VAL [i=43, lock={3:0}, t=-1, x=42, x_set=0] [L704] COND TRUE 1 !x_set [L704] 1 !x_set VAL [\old(arg)={0:0}, arg={0:0}, lock={3:0}, x=42, x_set=0] [L713] COND FALSE 0 !(i <= 42) VAL [i=43, lock={3:0}, t=-1, x=42, x_set=0] [L715] 0 x_set = 1 VAL [lock={3:0}, t=-1, x=42, x_set=1] [L704] 1 !x_set VAL [\old(arg)={0:0}, arg={0:0}, lock={3:0}, x=42, x_set=1] Now there is a data race on ~x_set~0 between C: x_set = 1 [715] and C: !x_set [704] - UnprovableResult [Line: 714]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 715]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 712]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 706]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 205 locations, 213 edges, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 18.9s, OverallIterations: 12, TraceHistogramMax: 43, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 8.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3908 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3846 mSDsluCounter, 406 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 375 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1987 IncrementalHoareTripleChecker+Invalid, 2001 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 31 mSDtfsCounter, 1987 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2878 GetRequests, 2435 SyntacticMatches, 41 SemanticMatches, 402 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12630 ImplicationChecksByTransitivity, 7.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2106occurred in iteration=11, InterpolantAutomatonStates: 315, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 7.7s InterpolantComputationTime, 3926 NumberOfCodeBlocks, 3926 NumberOfCodeBlocksAsserted, 136 NumberOfCheckSat, 4612 ConstructedInterpolants, 0 QuantifiedInterpolants, 7526 SizeOfPredicates, 114 NumberOfNonLiveVariables, 2623 ConjunctsInSsa, 127 ConjunctsInUnsatCore, 22 InterpolantComputations, 6 PerfectInterpolantSequences, 1/14261 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-03-17 11:02:45,261 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(DATA-RACE)