./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 e2fb8bed 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-?-e2fb8be-m [2025-03-08 21:55:24,163 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 21:55:24,219 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-08 21:55:24,224 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 21:55:24,224 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 21:55:24,241 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 21:55:24,242 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 21:55:24,242 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 21:55:24,242 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 21:55:24,242 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 21:55:24,243 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 21:55:24,243 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 21:55:24,243 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 21:55:24,243 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 21:55:24,243 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 21:55:24,243 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 21:55:24,243 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 21:55:24,243 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 21:55:24,243 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 21:55:24,243 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 21:55:24,243 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 21:55:24,243 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 21:55:24,244 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-08 21:55:24,244 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-08 21:55:24,244 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 21:55:24,244 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 21:55:24,244 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 21:55:24,244 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 21:55:24,244 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 21:55:24,244 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 21:55:24,244 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 21:55:24,244 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 21:55:24,245 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 21:55:24,245 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 21:55:24,245 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 21:55:24,245 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 21:55:24,245 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 21:55:24,245 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 21:55:24,245 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 21:55:24,245 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 21:55:24,245 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 21:55:24,245 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 21:55:24,246 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-08 21:55:24,444 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 21:55:24,451 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 21:55:24,453 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 21:55:24,454 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 21:55:24,454 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 21:55:24,455 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-08 21:55:25,665 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68951653c/db2010edaa0c491e9c7051991393f206/FLAG5f4c0130c [2025-03-08 21:55:25,893 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 21:55:25,893 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-divine/condvar.i [2025-03-08 21:55:25,902 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68951653c/db2010edaa0c491e9c7051991393f206/FLAG5f4c0130c [2025-03-08 21:55:25,914 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68951653c/db2010edaa0c491e9c7051991393f206 [2025-03-08 21:55:25,915 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 21:55:25,916 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 21:55:25,918 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 21:55:25,919 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 21:55:25,922 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 21:55:25,922 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:55:25" (1/1) ... [2025-03-08 21:55:25,923 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@340f9b2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:55:25, skipping insertion in model container [2025-03-08 21:55:25,923 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:55:25" (1/1) ... [2025-03-08 21:55:25,948 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 21:55:26,174 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 21:55:26,190 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 21:55:26,214 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 21:55:26,244 INFO L204 MainTranslator]: Completed translation [2025-03-08 21:55:26,244 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:55:26 WrapperNode [2025-03-08 21:55:26,245 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 21:55:26,245 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 21:55:26,245 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 21:55:26,245 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 21:55:26,249 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:55:26" (1/1) ... [2025-03-08 21:55:26,258 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:55:26" (1/1) ... [2025-03-08 21:55:26,270 INFO L138 Inliner]: procedures = 168, calls = 24, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 176 [2025-03-08 21:55:26,271 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 21:55:26,271 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 21:55:26,272 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 21:55:26,272 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 21:55:26,276 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:55:26" (1/1) ... [2025-03-08 21:55:26,276 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:55:26" (1/1) ... [2025-03-08 21:55:26,278 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:55:26" (1/1) ... [2025-03-08 21:55:26,278 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:55:26" (1/1) ... [2025-03-08 21:55:26,282 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:55:26" (1/1) ... [2025-03-08 21:55:26,283 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:55:26" (1/1) ... [2025-03-08 21:55:26,283 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:55:26" (1/1) ... [2025-03-08 21:55:26,284 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:55:26" (1/1) ... [2025-03-08 21:55:26,285 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 21:55:26,286 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 21:55:26,286 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 21:55:26,286 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 21:55:26,287 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:55:26" (1/1) ... [2025-03-08 21:55:26,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 21:55:26,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:55:26,317 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-08 21:55:26,320 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-08 21:55:26,334 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-08 21:55:26,334 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 21:55:26,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-08 21:55:26,334 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2025-03-08 21:55:26,334 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2025-03-08 21:55:26,335 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-08 21:55:26,335 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 21:55:26,335 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 21:55:26,335 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-08 21:55:26,423 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 21:55:26,424 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 21:55:26,642 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-08 21:55:26,642 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 21:55:26,658 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 21:55:26,658 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 21:55:26,658 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:55:26 BoogieIcfgContainer [2025-03-08 21:55:26,658 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 21:55:26,659 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 21:55:26,659 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 21:55:26,662 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 21:55:26,663 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 09:55:25" (1/3) ... [2025-03-08 21:55:26,663 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58e3e360 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:55:26, skipping insertion in model container [2025-03-08 21:55:26,663 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:55:26" (2/3) ... [2025-03-08 21:55:26,663 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58e3e360 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:55:26, skipping insertion in model container [2025-03-08 21:55:26,663 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:55:26" (3/3) ... [2025-03-08 21:55:26,664 INFO L128 eAbstractionObserver]: Analyzing ICFG condvar.i [2025-03-08 21:55:26,674 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 21:55:26,676 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-08 21:55:26,676 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-08 21:55:26,736 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-08 21:55:26,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 185 places, 186 transitions, 379 flow [2025-03-08 21:55:26,828 INFO L124 PetriNetUnfolderBase]: 5/185 cut-off events. [2025-03-08 21:55:26,829 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-08 21:55:26,834 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 126 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-08 21:55:26,834 INFO L82 GeneralOperation]: Start removeDead. Operand has 185 places, 186 transitions, 379 flow [2025-03-08 21:55:26,839 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 180 places, 181 transitions, 365 flow [2025-03-08 21:55:26,848 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 21:55:26,858 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;@4ff3e4b2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 21:55:26,858 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-03-08 21:55:26,890 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 21:55:26,890 INFO L124 PetriNetUnfolderBase]: 1/150 cut-off events. [2025-03-08 21:55:26,891 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 21:55:26,891 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:55:26,891 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-08 21:55:26,892 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-08 21:55:26,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:55:26,897 INFO L85 PathProgramCache]: Analyzing trace with hash -41689420, now seen corresponding path program 1 times [2025-03-08 21:55:26,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:55:26,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126435571] [2025-03-08 21:55:26,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:55:26,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:55:27,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-08 21:55:27,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-08 21:55:27,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:55:27,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:55:27,226 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-08 21:55:27,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:55:27,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126435571] [2025-03-08 21:55:27,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126435571] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:55:27,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:55:27,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 21:55:27,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994566768] [2025-03-08 21:55:27,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:55:27,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:55:27,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:55:27,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:55:27,255 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:55:27,266 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 186 [2025-03-08 21:55:27,268 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-08 21:55:27,268 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:55:27,268 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 186 [2025-03-08 21:55:27,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:55:27,334 INFO L124 PetriNetUnfolderBase]: 9/220 cut-off events. [2025-03-08 21:55:27,334 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-08 21:55:27,335 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 303 event pairs, 1 based on Foata normal form. 6/209 useless extension candidates. Maximal degree in co-relation 110. Up to 15 conditions per place. [2025-03-08 21:55:27,336 INFO L140 encePairwiseOnDemand]: 179/186 looper letters, 12 selfloop transitions, 3 changer transitions 0/183 dead transitions. [2025-03-08 21:55:27,336 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 183 transitions, 399 flow [2025-03-08 21:55:27,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:55:27,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:55:27,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 541 transitions. [2025-03-08 21:55:27,350 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9695340501792115 [2025-03-08 21:55:27,351 INFO L175 Difference]: Start difference. First operand has 180 places, 181 transitions, 365 flow. Second operand 3 states and 541 transitions. [2025-03-08 21:55:27,351 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 183 transitions, 399 flow [2025-03-08 21:55:27,354 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 183 transitions, 398 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 21:55:27,358 INFO L231 Difference]: Finished difference. Result has 182 places, 180 transitions, 382 flow [2025-03-08 21:55:27,359 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-08 21:55:27,361 INFO L279 CegarLoopForPetriNet]: 180 programPoint places, 2 predicate places. [2025-03-08 21:55:27,362 INFO L471 AbstractCegarLoop]: Abstraction has has 182 places, 180 transitions, 382 flow [2025-03-08 21:55:27,362 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-08 21:55:27,362 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:55:27,363 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-08 21:55:27,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 21:55:27,363 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-08 21:55:27,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:55:27,364 INFO L85 PathProgramCache]: Analyzing trace with hash -723600292, now seen corresponding path program 1 times [2025-03-08 21:55:27,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:55:27,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613126615] [2025-03-08 21:55:27,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:55:27,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:55:27,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-08 21:55:27,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-08 21:55:27,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:55:27,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:55:27,482 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-08 21:55:27,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:55:27,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613126615] [2025-03-08 21:55:27,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613126615] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:55:27,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:55:27,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 21:55:27,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578332747] [2025-03-08 21:55:27,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:55:27,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:55:27,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:55:27,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:55:27,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:55:27,494 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 186 [2025-03-08 21:55:27,494 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 180 transitions, 382 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-08 21:55:27,495 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:55:27,495 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 186 [2025-03-08 21:55:27,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:55:27,549 INFO L124 PetriNetUnfolderBase]: 15/284 cut-off events. [2025-03-08 21:55:27,549 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-03-08 21:55:27,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 350 conditions, 284 events. 15/284 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 629 event pairs, 3 based on Foata normal form. 0/260 useless extension candidates. Maximal degree in co-relation 207. Up to 23 conditions per place. [2025-03-08 21:55:27,552 INFO L140 encePairwiseOnDemand]: 182/186 looper letters, 9 selfloop transitions, 3 changer transitions 0/183 dead transitions. [2025-03-08 21:55:27,552 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 183 transitions, 412 flow [2025-03-08 21:55:27,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:55:27,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:55:27,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 532 transitions. [2025-03-08 21:55:27,554 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.953405017921147 [2025-03-08 21:55:27,554 INFO L175 Difference]: Start difference. First operand has 182 places, 180 transitions, 382 flow. Second operand 3 states and 532 transitions. [2025-03-08 21:55:27,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 183 transitions, 412 flow [2025-03-08 21:55:27,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 183 transitions, 406 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 21:55:27,559 INFO L231 Difference]: Finished difference. Result has 184 places, 182 transitions, 398 flow [2025-03-08 21:55:27,559 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=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=398, PETRI_PLACES=184, PETRI_TRANSITIONS=182} [2025-03-08 21:55:27,560 INFO L279 CegarLoopForPetriNet]: 180 programPoint places, 4 predicate places. [2025-03-08 21:55:27,560 INFO L471 AbstractCegarLoop]: Abstraction has has 184 places, 182 transitions, 398 flow [2025-03-08 21:55:27,561 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-08 21:55:27,561 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:55:27,561 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-08 21:55:27,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 21:55:27,561 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-08 21:55:27,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:55:27,563 INFO L85 PathProgramCache]: Analyzing trace with hash 431089898, now seen corresponding path program 1 times [2025-03-08 21:55:27,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:55:27,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190070091] [2025-03-08 21:55:27,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:55:27,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:55:27,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-08 21:55:27,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-08 21:55:27,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:55:27,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:55:27,679 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-08 21:55:27,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:55:27,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190070091] [2025-03-08 21:55:27,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190070091] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:55:27,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:55:27,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 21:55:27,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27186361] [2025-03-08 21:55:27,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:55:27,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:55:27,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:55:27,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:55:27,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:55:27,695 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 186 [2025-03-08 21:55:27,696 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 182 transitions, 398 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-08 21:55:27,696 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:55:27,696 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 186 [2025-03-08 21:55:27,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:55:27,765 INFO L124 PetriNetUnfolderBase]: 41/436 cut-off events. [2025-03-08 21:55:27,765 INFO L125 PetriNetUnfolderBase]: For 28/31 co-relation queries the response was YES. [2025-03-08 21:55:27,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 589 conditions, 436 events. 41/436 cut-off events. For 28/31 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1781 event pairs, 8 based on Foata normal form. 0/390 useless extension candidates. Maximal degree in co-relation 444. Up to 44 conditions per place. [2025-03-08 21:55:27,768 INFO L140 encePairwiseOnDemand]: 181/186 looper letters, 14 selfloop transitions, 5 changer transitions 0/189 dead transitions. [2025-03-08 21:55:27,768 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 189 transitions, 454 flow [2025-03-08 21:55:27,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:55:27,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:55:27,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 529 transitions. [2025-03-08 21:55:27,771 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9480286738351255 [2025-03-08 21:55:27,771 INFO L175 Difference]: Start difference. First operand has 184 places, 182 transitions, 398 flow. Second operand 3 states and 529 transitions. [2025-03-08 21:55:27,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 189 transitions, 454 flow [2025-03-08 21:55:27,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 189 transitions, 446 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 21:55:27,775 INFO L231 Difference]: Finished difference. Result has 186 places, 185 transitions, 428 flow [2025-03-08 21:55:27,775 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=186, PETRI_DIFFERENCE_MINUEND_FLOW=392, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=428, PETRI_PLACES=186, PETRI_TRANSITIONS=185} [2025-03-08 21:55:27,776 INFO L279 CegarLoopForPetriNet]: 180 programPoint places, 6 predicate places. [2025-03-08 21:55:27,776 INFO L471 AbstractCegarLoop]: Abstraction has has 186 places, 185 transitions, 428 flow [2025-03-08 21:55:27,776 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-08 21:55:27,776 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:55:27,776 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-08 21:55:27,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 21:55:27,777 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-08 21:55:27,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:55:27,777 INFO L85 PathProgramCache]: Analyzing trace with hash 539774966, now seen corresponding path program 1 times [2025-03-08 21:55:27,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:55:27,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27000139] [2025-03-08 21:55:27,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:55:27,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:55:27,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-08 21:55:27,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-08 21:55:27,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:55:27,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:55:27,913 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-08 21:55:27,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:55:27,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27000139] [2025-03-08 21:55:27,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27000139] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:55:27,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:55:27,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 21:55:27,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924510177] [2025-03-08 21:55:27,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:55:27,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:55:27,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:55:27,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:55:27,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:55:27,925 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 186 [2025-03-08 21:55:27,926 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 185 transitions, 428 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-08 21:55:27,926 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:55:27,926 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 186 [2025-03-08 21:55:27,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:55:27,981 INFO L124 PetriNetUnfolderBase]: 58/501 cut-off events. [2025-03-08 21:55:27,981 INFO L125 PetriNetUnfolderBase]: For 43/52 co-relation queries the response was YES. [2025-03-08 21:55:27,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 754 conditions, 501 events. 58/501 cut-off events. For 43/52 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2318 event pairs, 6 based on Foata normal form. 5/459 useless extension candidates. Maximal degree in co-relation 608. Up to 76 conditions per place. [2025-03-08 21:55:27,983 INFO L140 encePairwiseOnDemand]: 183/186 looper letters, 13 selfloop transitions, 2 changer transitions 0/190 dead transitions. [2025-03-08 21:55:27,983 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 190 transitions, 468 flow [2025-03-08 21:55:27,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:55:27,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:55:27,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 529 transitions. [2025-03-08 21:55:27,985 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9480286738351255 [2025-03-08 21:55:27,985 INFO L175 Difference]: Start difference. First operand has 186 places, 185 transitions, 428 flow. Second operand 3 states and 529 transitions. [2025-03-08 21:55:27,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 190 transitions, 468 flow [2025-03-08 21:55:27,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 190 transitions, 458 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 21:55:27,988 INFO L231 Difference]: Finished difference. Result has 187 places, 186 transitions, 430 flow [2025-03-08 21:55:27,988 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-08 21:55:27,988 INFO L279 CegarLoopForPetriNet]: 180 programPoint places, 7 predicate places. [2025-03-08 21:55:27,988 INFO L471 AbstractCegarLoop]: Abstraction has has 187 places, 186 transitions, 430 flow [2025-03-08 21:55:27,989 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-08 21:55:27,989 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:55:27,989 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-08 21:55:27,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 21:55:27,989 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-08 21:55:27,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:55:27,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1179813854, now seen corresponding path program 1 times [2025-03-08 21:55:27,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:55:27,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807396515] [2025-03-08 21:55:27,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:55:27,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:55:28,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-08 21:55:28,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-08 21:55:28,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:55:28,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:55:28,137 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-08 21:55:28,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:55:28,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807396515] [2025-03-08 21:55:28,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807396515] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:55:28,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:55:28,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 21:55:28,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633492784] [2025-03-08 21:55:28,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:55:28,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:55:28,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:55:28,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:55:28,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:55:28,145 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 186 [2025-03-08 21:55:28,145 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-08 21:55:28,146 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:55:28,146 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 186 [2025-03-08 21:55:28,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:55:28,178 INFO L124 PetriNetUnfolderBase]: 8/231 cut-off events. [2025-03-08 21:55:28,178 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-08 21:55:28,179 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 303 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-08 21:55:28,179 INFO L140 encePairwiseOnDemand]: 183/186 looper letters, 9 selfloop transitions, 2 changer transitions 0/183 dead transitions. [2025-03-08 21:55:28,179 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 183 transitions, 430 flow [2025-03-08 21:55:28,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:55:28,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:55:28,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 534 transitions. [2025-03-08 21:55:28,181 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.956989247311828 [2025-03-08 21:55:28,181 INFO L175 Difference]: Start difference. First operand has 187 places, 186 transitions, 430 flow. Second operand 3 states and 534 transitions. [2025-03-08 21:55:28,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 183 transitions, 430 flow [2025-03-08 21:55:28,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 183 transitions, 420 flow, removed 3 selfloop flow, removed 3 redundant places. [2025-03-08 21:55:28,185 INFO L231 Difference]: Finished difference. Result has 185 places, 180 transitions, 400 flow [2025-03-08 21:55:28,185 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-08 21:55:28,187 INFO L279 CegarLoopForPetriNet]: 180 programPoint places, 5 predicate places. [2025-03-08 21:55:28,188 INFO L471 AbstractCegarLoop]: Abstraction has has 185 places, 180 transitions, 400 flow [2025-03-08 21:55:28,189 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-08 21:55:28,189 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:55:28,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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:55:28,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 21:55:28,189 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-08 21:55:28,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:55:28,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1136017342, now seen corresponding path program 1 times [2025-03-08 21:55:28,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:55:28,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047486935] [2025-03-08 21:55:28,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:55:28,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:55:28,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-08 21:55:28,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-08 21:55:28,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:55:28,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:55:28,342 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-08 21:55:28,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:55:28,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047486935] [2025-03-08 21:55:28,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047486935] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 21:55:28,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1138494489] [2025-03-08 21:55:28,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:55:28,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:55:28,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:55:28,345 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-08 21:55:28,348 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-08 21:55:28,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-08 21:55:28,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-08 21:55:28,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:55:28,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:55:28,466 INFO L256 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 21:55:28,473 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 21:55:28,509 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-08 21:55:28,509 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 21:55:28,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1138494489] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:55:28,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 21:55:28,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-08 21:55:28,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374162339] [2025-03-08 21:55:28,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:55:28,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:55:28,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:55:28,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:55:28,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:55:28,522 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 186 [2025-03-08 21:55:28,523 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-08 21:55:28,523 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:55:28,523 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 186 [2025-03-08 21:55:28,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:55:28,577 INFO L124 PetriNetUnfolderBase]: 50/337 cut-off events. [2025-03-08 21:55:28,578 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2025-03-08 21:55:28,578 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 916 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-08 21:55:28,579 INFO L140 encePairwiseOnDemand]: 181/186 looper letters, 14 selfloop transitions, 5 changer transitions 3/188 dead transitions. [2025-03-08 21:55:28,579 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 188 transitions, 464 flow [2025-03-08 21:55:28,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:55:28,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:55:28,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 527 transitions. [2025-03-08 21:55:28,581 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9444444444444444 [2025-03-08 21:55:28,581 INFO L175 Difference]: Start difference. First operand has 185 places, 180 transitions, 400 flow. Second operand 3 states and 527 transitions. [2025-03-08 21:55:28,581 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 188 transitions, 464 flow [2025-03-08 21:55:28,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 188 transitions, 460 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 21:55:28,585 INFO L231 Difference]: Finished difference. Result has 187 places, 182 transitions, 432 flow [2025-03-08 21:55:28,586 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-08 21:55:28,586 INFO L279 CegarLoopForPetriNet]: 180 programPoint places, 7 predicate places. [2025-03-08 21:55:28,587 INFO L471 AbstractCegarLoop]: Abstraction has has 187 places, 182 transitions, 432 flow [2025-03-08 21:55:28,587 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-08 21:55:28,588 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:55:28,588 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-08 21:55:28,599 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-08 21:55:28,788 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-08 21:55:28,789 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-08 21:55:28,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:55:28,789 INFO L85 PathProgramCache]: Analyzing trace with hash 883452653, now seen corresponding path program 1 times [2025-03-08 21:55:28,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:55:28,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418880027] [2025-03-08 21:55:28,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:55:28,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:55:28,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-08 21:55:28,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-08 21:55:28,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:55:28,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:55:28,911 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-08 21:55:28,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:55:28,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418880027] [2025-03-08 21:55:28,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418880027] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 21:55:28,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1758736812] [2025-03-08 21:55:28,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:55:28,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:55:28,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:55:28,914 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-08 21:55:28,916 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-08 21:55:29,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-08 21:55:29,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-08 21:55:29,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:55:29,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:55:29,045 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 21:55:29,048 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 21:55:29,107 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-08 21:55:29,107 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 21:55:29,149 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-08 21:55:29,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1758736812] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 21:55:29,149 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 21:55:29,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-08 21:55:29,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77589026] [2025-03-08 21:55:29,150 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 21:55:29,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 21:55:29,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:55:29,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 21:55:29,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-08 21:55:29,175 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 186 [2025-03-08 21:55:29,177 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-08 21:55:29,177 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:55:29,177 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 186 [2025-03-08 21:55:29,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:55:29,346 INFO L124 PetriNetUnfolderBase]: 72/434 cut-off events. [2025-03-08 21:55:29,346 INFO L125 PetriNetUnfolderBase]: For 47/50 co-relation queries the response was YES. [2025-03-08 21:55:29,347 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 1197 event pairs, 9 based on Foata normal form. 8/427 useless extension candidates. Maximal degree in co-relation 580. Up to 47 conditions per place. [2025-03-08 21:55:29,348 INFO L140 encePairwiseOnDemand]: 180/186 looper letters, 34 selfloop transitions, 9 changer transitions 0/211 dead transitions. [2025-03-08 21:55:29,348 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 211 transitions, 578 flow [2025-03-08 21:55:29,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 21:55:29,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-08 21:55:29,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1557 transitions. [2025-03-08 21:55:29,351 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9301075268817204 [2025-03-08 21:55:29,351 INFO L175 Difference]: Start difference. First operand has 187 places, 182 transitions, 432 flow. Second operand 9 states and 1557 transitions. [2025-03-08 21:55:29,351 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 211 transitions, 578 flow [2025-03-08 21:55:29,354 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 211 transitions, 568 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 21:55:29,355 INFO L231 Difference]: Finished difference. Result has 196 places, 188 transitions, 472 flow [2025-03-08 21:55:29,355 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-08 21:55:29,356 INFO L279 CegarLoopForPetriNet]: 180 programPoint places, 16 predicate places. [2025-03-08 21:55:29,357 INFO L471 AbstractCegarLoop]: Abstraction has has 196 places, 188 transitions, 472 flow [2025-03-08 21:55:29,358 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-08 21:55:29,358 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:55:29,359 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-08 21:55:29,365 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-08 21:55:29,559 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-08 21:55:29,559 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-08 21:55:29,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:55:29,560 INFO L85 PathProgramCache]: Analyzing trace with hash 492507931, now seen corresponding path program 2 times [2025-03-08 21:55:29,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:55:29,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912617698] [2025-03-08 21:55:29,560 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 21:55:29,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:55:29,585 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 173 statements into 2 equivalence classes. [2025-03-08 21:55:29,595 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 173 of 173 statements. [2025-03-08 21:55:29,595 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 21:55:29,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:55:29,749 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-08 21:55:29,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:55:29,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912617698] [2025-03-08 21:55:29,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912617698] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 21:55:29,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1880506046] [2025-03-08 21:55:29,749 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 21:55:29,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:55:29,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:55:29,751 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-08 21:55:29,753 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-08 21:55:29,834 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 173 statements into 2 equivalence classes. [2025-03-08 21:55:29,881 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 173 of 173 statements. [2025-03-08 21:55:29,881 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 21:55:29,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:55:29,883 INFO L256 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 21:55:29,885 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 21:55:29,960 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-08 21:55:29,960 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 21:55:30,071 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-08 21:55:30,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1880506046] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 21:55:30,074 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 21:55:30,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-03-08 21:55:30,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432592712] [2025-03-08 21:55:30,074 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 21:55:30,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-08 21:55:30,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:55:30,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-08 21:55:30,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-03-08 21:55:30,110 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 186 [2025-03-08 21:55:30,112 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-08 21:55:30,112 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:55:30,112 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 186 [2025-03-08 21:55:30,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:55:30,402 INFO L124 PetriNetUnfolderBase]: 109/597 cut-off events. [2025-03-08 21:55:30,402 INFO L125 PetriNetUnfolderBase]: For 144/147 co-relation queries the response was YES. [2025-03-08 21:55:30,404 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 1850 event pairs, 12 based on Foata normal form. 16/599 useless extension candidates. Maximal degree in co-relation 1046. Up to 47 conditions per place. [2025-03-08 21:55:30,406 INFO L140 encePairwiseOnDemand]: 180/186 looper letters, 74 selfloop transitions, 21 changer transitions 0/263 dead transitions. [2025-03-08 21:55:30,406 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 263 transitions, 872 flow [2025-03-08 21:55:30,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-08 21:55:30,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-08 21:55:30,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 3627 transitions. [2025-03-08 21:55:30,411 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9285714285714286 [2025-03-08 21:55:30,411 INFO L175 Difference]: Start difference. First operand has 196 places, 188 transitions, 472 flow. Second operand 21 states and 3627 transitions. [2025-03-08 21:55:30,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 263 transitions, 872 flow [2025-03-08 21:55:30,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 263 transitions, 858 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-03-08 21:55:30,417 INFO L231 Difference]: Finished difference. Result has 220 places, 201 transitions, 596 flow [2025-03-08 21:55:30,418 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-08 21:55:30,419 INFO L279 CegarLoopForPetriNet]: 180 programPoint places, 40 predicate places. [2025-03-08 21:55:30,419 INFO L471 AbstractCegarLoop]: Abstraction has has 220 places, 201 transitions, 596 flow [2025-03-08 21:55:30,421 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-08 21:55:30,421 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:55:30,421 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-08 21:55:30,428 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-08 21:55:30,621 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-08 21:55:30,622 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-08 21:55:30,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:55:30,622 INFO L85 PathProgramCache]: Analyzing trace with hash -1017712167, now seen corresponding path program 3 times [2025-03-08 21:55:30,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:55:30,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247368077] [2025-03-08 21:55:30,622 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 21:55:30,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:55:30,639 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 205 statements into 7 equivalence classes. [2025-03-08 21:55:30,669 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 205 of 205 statements. [2025-03-08 21:55:30,669 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-03-08 21:55:30,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:55:31,034 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-08 21:55:31,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:55:31,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247368077] [2025-03-08 21:55:31,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247368077] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 21:55:31,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1394531130] [2025-03-08 21:55:31,035 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 21:55:31,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:55:31,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:55:31,037 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-08 21:55:31,038 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-08 21:55:31,117 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 205 statements into 7 equivalence classes. [2025-03-08 21:55:31,223 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 205 of 205 statements. [2025-03-08 21:55:31,223 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-03-08 21:55:31,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:55:31,225 INFO L256 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-08 21:55:31,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 21:55:31,326 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-08 21:55:31,326 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 21:55:31,612 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-08 21:55:31,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1394531130] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 21:55:31,612 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 21:55:31,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2025-03-08 21:55:31,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111236102] [2025-03-08 21:55:31,612 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 21:55:31,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-08 21:55:31,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:55:31,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-08 21:55:31,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2025-03-08 21:55:31,651 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 186 [2025-03-08 21:55:31,655 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-08 21:55:31,656 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:55:31,656 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 186 [2025-03-08 21:55:31,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:55:32,341 INFO L124 PetriNetUnfolderBase]: 264/1010 cut-off events. [2025-03-08 21:55:32,342 INFO L125 PetriNetUnfolderBase]: For 1079/1082 co-relation queries the response was YES. [2025-03-08 21:55:32,345 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 3148 event pairs, 9 based on Foata normal form. 32/1027 useless extension candidates. Maximal degree in co-relation 2314. Up to 127 conditions per place. [2025-03-08 21:55:32,348 INFO L140 encePairwiseOnDemand]: 180/186 looper letters, 154 selfloop transitions, 45 changer transitions 0/367 dead transitions. [2025-03-08 21:55:32,348 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 367 transitions, 1540 flow [2025-03-08 21:55:32,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-03-08 21:55:32,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2025-03-08 21:55:32,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 7767 transitions. [2025-03-08 21:55:32,358 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9279569892473118 [2025-03-08 21:55:32,358 INFO L175 Difference]: Start difference. First operand has 220 places, 201 transitions, 596 flow. Second operand 45 states and 7767 transitions. [2025-03-08 21:55:32,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 264 places, 367 transitions, 1540 flow [2025-03-08 21:55:32,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 367 transitions, 1500 flow, removed 14 selfloop flow, removed 6 redundant places. [2025-03-08 21:55:32,365 INFO L231 Difference]: Finished difference. Result has 267 places, 226 transitions, 874 flow [2025-03-08 21:55:32,365 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-08 21:55:32,366 INFO L279 CegarLoopForPetriNet]: 180 programPoint places, 87 predicate places. [2025-03-08 21:55:32,366 INFO L471 AbstractCegarLoop]: Abstraction has has 267 places, 226 transitions, 874 flow [2025-03-08 21:55:32,367 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-08 21:55:32,367 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:55:32,368 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-08 21:55:32,374 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 21:55:32,568 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-08 21:55:32,568 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-08 21:55:32,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:55:32,569 INFO L85 PathProgramCache]: Analyzing trace with hash 717274187, now seen corresponding path program 4 times [2025-03-08 21:55:32,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:55:32,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976291745] [2025-03-08 21:55:32,570 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 21:55:32,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:55:32,585 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 269 statements into 2 equivalence classes. [2025-03-08 21:55:32,601 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 269 of 269 statements. [2025-03-08 21:55:32,601 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 21:55:32,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:55:33,311 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-08 21:55:33,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:55:33,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976291745] [2025-03-08 21:55:33,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976291745] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 21:55:33,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [112991499] [2025-03-08 21:55:33,312 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 21:55:33,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:55:33,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:55:33,314 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-08 21:55:33,315 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-08 21:55:33,394 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 269 statements into 2 equivalence classes. [2025-03-08 21:55:33,433 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 269 of 269 statements. [2025-03-08 21:55:33,433 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 21:55:33,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:55:33,435 INFO L256 TraceCheckSpWp]: Trace formula consists of 509 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-08 21:55:33,438 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 21:55:33,585 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-08 21:55:33,585 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 21:55:34,420 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-08 21:55:34,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [112991499] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 21:55:34,421 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 21:55:34,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 66 [2025-03-08 21:55:34,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489668305] [2025-03-08 21:55:34,421 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 21:55:34,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2025-03-08 21:55:34,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:55:34,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2025-03-08 21:55:34,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1122, Invalid=3168, Unknown=0, NotChecked=0, Total=4290 [2025-03-08 21:55:34,482 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 186 [2025-03-08 21:55:34,491 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-08 21:55:34,492 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:55:34,492 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 186 [2025-03-08 21:55:34,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:55:36,704 INFO L124 PetriNetUnfolderBase]: 520/1778 cut-off events. [2025-03-08 21:55:36,705 INFO L125 PetriNetUnfolderBase]: For 8807/8810 co-relation queries the response was YES. [2025-03-08 21:55:36,712 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 5841 event pairs, 9 based on Foata normal form. 64/1827 useless extension candidates. Maximal degree in co-relation 5022. Up to 255 conditions per place. [2025-03-08 21:55:36,717 INFO L140 encePairwiseOnDemand]: 180/186 looper letters, 314 selfloop transitions, 93 changer transitions 0/575 dead transitions. [2025-03-08 21:55:36,718 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 359 places, 575 transitions, 3022 flow [2025-03-08 21:55:36,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2025-03-08 21:55:36,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2025-03-08 21:55:36,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 16047 transitions. [2025-03-08 21:55:36,730 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9276795005202914 [2025-03-08 21:55:36,730 INFO L175 Difference]: Start difference. First operand has 267 places, 226 transitions, 874 flow. Second operand 93 states and 16047 transitions. [2025-03-08 21:55:36,730 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 359 places, 575 transitions, 3022 flow [2025-03-08 21:55:36,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 341 places, 575 transitions, 2934 flow, removed 26 selfloop flow, removed 18 redundant places. [2025-03-08 21:55:36,747 INFO L231 Difference]: Finished difference. Result has 358 places, 275 transitions, 1508 flow [2025-03-08 21:55:36,748 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-08 21:55:36,748 INFO L279 CegarLoopForPetriNet]: 180 programPoint places, 178 predicate places. [2025-03-08 21:55:36,748 INFO L471 AbstractCegarLoop]: Abstraction has has 358 places, 275 transitions, 1508 flow [2025-03-08 21:55:36,752 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-08 21:55:36,752 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:55:36,752 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-08 21:55:36,759 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-08 21:55:36,958 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-08 21:55:36,959 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-08 21:55:36,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:55:36,960 INFO L85 PathProgramCache]: Analyzing trace with hash 929550283, now seen corresponding path program 5 times [2025-03-08 21:55:36,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:55:36,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307481374] [2025-03-08 21:55:36,960 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 21:55:36,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:55:36,976 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 397 statements into 31 equivalence classes. [2025-03-08 21:55:37,013 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 31 check-sat command(s) and asserted 397 of 397 statements. [2025-03-08 21:55:37,014 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 31 check-sat command(s) [2025-03-08 21:55:37,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:55:38,777 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-08 21:55:38,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:55:38,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307481374] [2025-03-08 21:55:38,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307481374] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 21:55:38,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1361690138] [2025-03-08 21:55:38,777 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 21:55:38,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:55:38,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:55:38,779 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-08 21:55:38,781 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-08 21:55:38,869 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 397 statements into 31 equivalence classes. [2025-03-08 21:55:38,942 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 31 check-sat command(s) and asserted 397 of 397 statements. [2025-03-08 21:55:38,943 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 31 check-sat command(s) [2025-03-08 21:55:38,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:55:38,949 INFO L256 TraceCheckSpWp]: Trace formula consists of 717 conjuncts, 64 conjuncts are in the unsatisfiable core [2025-03-08 21:55:38,956 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 21:55:39,221 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-08 21:55:39,221 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 21:55:40,837 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-08 21:55:40,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1361690138] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 21:55:40,837 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 21:55:40,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 87 [2025-03-08 21:55:40,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595692407] [2025-03-08 21:55:40,837 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 21:55:40,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 87 states [2025-03-08 21:55:40,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:55:40,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2025-03-08 21:55:40,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1935, Invalid=5547, Unknown=0, NotChecked=0, Total=7482 [2025-03-08 21:55:40,911 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 186 [2025-03-08 21:55:40,918 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-08 21:55:40,918 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:55:40,918 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 186 [2025-03-08 21:55:40,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:55:44,207 INFO L124 PetriNetUnfolderBase]: 712/2354 cut-off events. [2025-03-08 21:55:44,208 INFO L125 PetriNetUnfolderBase]: For 28499/28502 co-relation queries the response was YES. [2025-03-08 21:55:44,216 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 7836 event pairs, 9 based on Foata normal form. 48/2387 useless extension candidates. Maximal degree in co-relation 7538. Up to 351 conditions per place. [2025-03-08 21:55:44,221 INFO L140 encePairwiseOnDemand]: 180/186 looper letters, 434 selfloop transitions, 129 changer transitions 0/731 dead transitions. [2025-03-08 21:55:44,222 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 486 places, 731 transitions, 4376 flow [2025-03-08 21:55:44,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2025-03-08 21:55:44,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2025-03-08 21:55:44,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 22247 transitions. [2025-03-08 21:55:44,234 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9271901308660498 [2025-03-08 21:55:44,235 INFO L175 Difference]: Start difference. First operand has 358 places, 275 transitions, 1508 flow. Second operand 129 states and 22247 transitions. [2025-03-08 21:55:44,235 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 486 places, 731 transitions, 4376 flow [2025-03-08 21:55:44,258 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 444 places, 731 transitions, 4232 flow, removed 30 selfloop flow, removed 42 redundant places. [2025-03-08 21:55:44,263 INFO L231 Difference]: Finished difference. Result has 457 places, 312 transitions, 2106 flow [2025-03-08 21:55:44,264 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-08 21:55:44,265 INFO L279 CegarLoopForPetriNet]: 180 programPoint places, 277 predicate places. [2025-03-08 21:55:44,265 INFO L471 AbstractCegarLoop]: Abstraction has has 457 places, 312 transitions, 2106 flow [2025-03-08 21:55:44,271 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-08 21:55:44,271 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:55:44,271 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-08 21:55:44,279 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-08 21:55:44,472 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-08 21:55:44,472 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-08 21:55:44,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:55:44,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1305239147, now seen corresponding path program 6 times [2025-03-08 21:55:44,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:55:44,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136721804] [2025-03-08 21:55:44,474 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 21:55:44,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:55:44,489 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 493 statements into 43 equivalence classes. [2025-03-08 21:55:44,573 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) and asserted 493 of 493 statements. [2025-03-08 21:55:44,574 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) [2025-03-08 21:55:44,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 21:55:44,574 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 21:55:44,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 493 statements into 1 equivalence classes. [2025-03-08 21:55:44,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 493 of 493 statements. [2025-03-08 21:55:44,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:55:44,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 21:55:44,731 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 21:55:44,731 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 21:55:44,732 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location threadErr1ASSERT_VIOLATIONDATA_RACE (6 of 7 remaining) [2025-03-08 21:55:44,733 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining) [2025-03-08 21:55:44,733 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining) [2025-03-08 21:55:44,733 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2025-03-08 21:55:44,733 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining) [2025-03-08 21:55:44,733 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining) [2025-03-08 21:55:44,733 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 7 remaining) [2025-03-08 21:55:44,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 21:55:44,734 INFO L422 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1, 1, 1] [2025-03-08 21:55:44,895 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-08 21:55:44,895 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 21:55:44,899 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 09:55:44 BasicIcfg [2025-03-08 21:55:44,900 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 21:55:44,900 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 21:55:44,901 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 21:55:44,901 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 21:55:44,901 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:55:26" (3/4) ... [2025-03-08 21:55:44,902 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-08 21:55:45,023 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 46. [2025-03-08 21:55:45,087 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 21:55:45,087 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 21:55:45,087 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 21:55:45,088 INFO L158 Benchmark]: Toolchain (without parser) took 19171.60ms. Allocated memory was 142.6MB in the beginning and 478.2MB in the end (delta: 335.5MB). Free memory was 105.4MB in the beginning and 160.6MB in the end (delta: -55.2MB). Peak memory consumption was 280.9MB. Max. memory is 16.1GB. [2025-03-08 21:55:45,088 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory was 126.6MB in the beginning and 126.3MB in the end (delta: 307.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 21:55:45,088 INFO L158 Benchmark]: CACSL2BoogieTranslator took 326.50ms. Allocated memory is still 142.6MB. Free memory was 105.4MB in the beginning and 85.0MB in the end (delta: 20.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 21:55:45,088 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.32ms. Allocated memory is still 142.6MB. Free memory was 83.9MB in the beginning and 82.8MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 21:55:45,091 INFO L158 Benchmark]: Boogie Preprocessor took 14.43ms. Allocated memory is still 142.6MB. Free memory was 82.8MB in the beginning and 80.7MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 21:55:45,091 INFO L158 Benchmark]: IcfgBuilder took 372.29ms. Allocated memory is still 142.6MB. Free memory was 80.7MB in the beginning and 62.8MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 21:55:45,091 INFO L158 Benchmark]: TraceAbstraction took 18240.74ms. Allocated memory was 142.6MB in the beginning and 478.2MB in the end (delta: 335.5MB). Free memory was 61.7MB in the beginning and 219.3MB in the end (delta: -157.6MB). Peak memory consumption was 180.3MB. Max. memory is 16.1GB. [2025-03-08 21:55:45,092 INFO L158 Benchmark]: Witness Printer took 186.98ms. Allocated memory is still 478.2MB. Free memory was 219.3MB in the beginning and 160.6MB in the end (delta: 58.7MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-03-08 21:55:45,093 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.21ms. Allocated memory is still 201.3MB. Free memory was 126.6MB in the beginning and 126.3MB in the end (delta: 307.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 326.50ms. Allocated memory is still 142.6MB. Free memory was 105.4MB in the beginning and 85.0MB in the end (delta: 20.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.32ms. Allocated memory is still 142.6MB. Free memory was 83.9MB in the beginning and 82.8MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 14.43ms. Allocated memory is still 142.6MB. Free memory was 82.8MB in the beginning and 80.7MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 372.29ms. Allocated memory is still 142.6MB. Free memory was 80.7MB in the beginning and 62.8MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 18240.74ms. Allocated memory was 142.6MB in the beginning and 478.2MB in the end (delta: 335.5MB). Free memory was 61.7MB in the beginning and 219.3MB in the end (delta: -157.6MB). Peak memory consumption was 180.3MB. Max. memory is 16.1GB. * Witness Printer took 186.98ms. Allocated memory is still 478.2MB. Free memory was 219.3MB in the beginning and 160.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.0s, OverallIterations: 12, TraceHistogramMax: 43, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 7.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3898 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3842 mSDsluCounter, 381 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 356 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1988 IncrementalHoareTripleChecker+Invalid, 2002 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 25 mSDtfsCounter, 1988 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.5s 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.3s InterpolantComputationTime, 3926 NumberOfCodeBlocks, 3926 NumberOfCodeBlocksAsserted, 136 NumberOfCheckSat, 4612 ConstructedInterpolants, 0 QuantifiedInterpolants, 7506 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-08 21:55:45,109 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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)