./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/04-mutex_44-malloc_sound.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/04-mutex_44-malloc_sound.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 8d85985769788fe03edac99b0e2515850ec4c864737a042b27bc3e336515bcde --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:22:15,106 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:22:15,180 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-01-09 21:22:15,186 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:22:15,186 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:22:15,211 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:22:15,212 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:22:15,212 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:22:15,213 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:22:15,213 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:22:15,213 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:22:15,214 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:22:15,214 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:22:15,214 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:22:15,214 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:22:15,214 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:22:15,215 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:22:15,215 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:22:15,215 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:22:15,215 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:22:15,215 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:22:15,215 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:22:15,216 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:22:15,216 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:22:15,216 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:22:15,216 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:22:15,216 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:22:15,216 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:22:15,216 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:22:15,216 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:22:15,216 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:22:15,217 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:22:15,217 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:22:15,217 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:22:15,217 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:22:15,217 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:22:15,218 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:22:15,218 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:22:15,218 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:22:15,218 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:22:15,218 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:22:15,218 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:22:15,218 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:22:15,218 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:22:15,218 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:22:15,218 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:22:15,219 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-jdk21/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 -> 8d85985769788fe03edac99b0e2515850ec4c864737a042b27bc3e336515bcde [2025-01-09 21:22:15,532 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:22:15,542 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:22:15,545 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:22:15,546 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:22:15,547 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:22:15,548 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/04-mutex_44-malloc_sound.i [2025-01-09 21:22:16,850 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/30fd788fe/a77c3a707780423b82ca2a9945aabda9/FLAGb820c6a0c [2025-01-09 21:22:17,220 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:22:17,222 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/04-mutex_44-malloc_sound.i [2025-01-09 21:22:17,242 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/30fd788fe/a77c3a707780423b82ca2a9945aabda9/FLAGb820c6a0c [2025-01-09 21:22:17,259 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/30fd788fe/a77c3a707780423b82ca2a9945aabda9 [2025-01-09 21:22:17,262 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:22:17,263 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:22:17,264 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:22:17,264 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:22:17,268 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:22:17,269 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:22:17" (1/1) ... [2025-01-09 21:22:17,269 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30c7e046 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:17, skipping insertion in model container [2025-01-09 21:22:17,270 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:22:17" (1/1) ... [2025-01-09 21:22:17,307 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:22:17,618 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:22:17,627 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:22:17,667 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:22:17,719 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:22:17,721 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:17 WrapperNode [2025-01-09 21:22:17,722 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:22:17,723 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:22:17,723 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:22:17,723 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:22:17,729 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:17" (1/1) ... [2025-01-09 21:22:17,750 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:17" (1/1) ... [2025-01-09 21:22:17,771 INFO L138 Inliner]: procedures = 261, calls = 8, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 57 [2025-01-09 21:22:17,771 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:22:17,773 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:22:17,773 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:22:17,773 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:22:17,778 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:17" (1/1) ... [2025-01-09 21:22:17,779 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:17" (1/1) ... [2025-01-09 21:22:17,786 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:17" (1/1) ... [2025-01-09 21:22:17,786 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:17" (1/1) ... [2025-01-09 21:22:17,792 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:17" (1/1) ... [2025-01-09 21:22:17,796 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:17" (1/1) ... [2025-01-09 21:22:17,802 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:17" (1/1) ... [2025-01-09 21:22:17,804 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:17" (1/1) ... [2025-01-09 21:22:17,804 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:17" (1/1) ... [2025-01-09 21:22:17,806 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:22:17,806 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:22:17,810 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:22:17,811 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:22:17,811 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:17" (1/1) ... [2025-01-09 21:22:17,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:22:17,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:22:17,842 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 21:22:17,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 21:22:17,866 INFO L130 BoogieDeclarations]: Found specification of procedure f [2025-01-09 21:22:17,866 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2025-01-09 21:22:17,866 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-09 21:22:17,866 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-09 21:22:17,867 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 21:22:17,867 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:22:17,867 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:22:17,868 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 21:22:18,000 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:22:18,002 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:22:18,183 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:22:18,183 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:22:18,206 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:22:18,206 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 21:22:18,207 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:22:18 BoogieIcfgContainer [2025-01-09 21:22:18,207 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:22:18,209 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:22:18,209 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:22:18,213 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:22:18,214 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:22:17" (1/3) ... [2025-01-09 21:22:18,215 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72faf0b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:22:18, skipping insertion in model container [2025-01-09 21:22:18,215 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:17" (2/3) ... [2025-01-09 21:22:18,216 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72faf0b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:22:18, skipping insertion in model container [2025-01-09 21:22:18,216 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:22:18" (3/3) ... [2025-01-09 21:22:18,217 INFO L128 eAbstractionObserver]: Analyzing ICFG 04-mutex_44-malloc_sound.i [2025-01-09 21:22:18,229 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:22:18,231 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 04-mutex_44-malloc_sound.i that has 2 procedures, 89 locations, 1 initial locations, 1 loop locations, and 10 error locations. [2025-01-09 21:22:18,232 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:22:18,280 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:22:18,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 92 places, 91 transitions, 186 flow [2025-01-09 21:22:18,353 INFO L124 PetriNetUnfolderBase]: 3/90 cut-off events. [2025-01-09 21:22:18,355 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:22:18,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94 conditions, 90 events. 3/90 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 162 event pairs, 0 based on Foata normal form. 0/77 useless extension candidates. Maximal degree in co-relation 38. Up to 2 conditions per place. [2025-01-09 21:22:18,359 INFO L82 GeneralOperation]: Start removeDead. Operand has 92 places, 91 transitions, 186 flow [2025-01-09 21:22:18,362 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 91 places, 90 transitions, 183 flow [2025-01-09 21:22:18,369 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:22:18,377 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;@73230b17, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:22:18,377 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2025-01-09 21:22:18,389 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:22:18,389 INFO L124 PetriNetUnfolderBase]: 0/31 cut-off events. [2025-01-09 21:22:18,390 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:22:18,390 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:22:18,390 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] [2025-01-09 21:22:18,391 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting fErr0ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-01-09 21:22:18,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:22:18,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1641359930, now seen corresponding path program 1 times [2025-01-09 21:22:18,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:22:18,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286191650] [2025-01-09 21:22:18,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:22:18,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:22:18,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 21:22:18,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 21:22:18,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:22:18,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:22:18,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:22:18,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:22:18,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286191650] [2025-01-09 21:22:18,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286191650] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:22:18,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:22:18,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:22:18,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598944092] [2025-01-09 21:22:18,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:22:18,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:22:18,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:22:18,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:22:18,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:22:18,617 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 91 [2025-01-09 21:22:18,619 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 90 transitions, 183 flow. Second operand has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 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-01-09 21:22:18,620 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:22:18,620 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 91 [2025-01-09 21:22:18,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:22:18,685 INFO L124 PetriNetUnfolderBase]: 9/165 cut-off events. [2025-01-09 21:22:18,685 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 21:22:18,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 196 conditions, 165 events. 9/165 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 385 event pairs, 6 based on Foata normal form. 3/148 useless extension candidates. Maximal degree in co-relation 134. Up to 26 conditions per place. [2025-01-09 21:22:18,688 INFO L140 encePairwiseOnDemand]: 86/91 looper letters, 12 selfloop transitions, 2 changer transitions 0/91 dead transitions. [2025-01-09 21:22:18,688 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 91 transitions, 213 flow [2025-01-09 21:22:18,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:22:18,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:22:18,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 251 transitions. [2025-01-09 21:22:18,701 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9194139194139194 [2025-01-09 21:22:18,701 INFO L175 Difference]: Start difference. First operand has 91 places, 90 transitions, 183 flow. Second operand 3 states and 251 transitions. [2025-01-09 21:22:18,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 91 transitions, 213 flow [2025-01-09 21:22:18,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 91 transitions, 212 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:22:18,710 INFO L231 Difference]: Finished difference. Result has 93 places, 91 transitions, 198 flow [2025-01-09 21:22:18,712 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=198, PETRI_PLACES=93, PETRI_TRANSITIONS=91} [2025-01-09 21:22:18,717 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 2 predicate places. [2025-01-09 21:22:18,718 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 91 transitions, 198 flow [2025-01-09 21:22:18,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 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-01-09 21:22:18,718 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:22:18,718 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] [2025-01-09 21:22:18,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:22:18,719 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting fErr0ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-01-09 21:22:18,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:22:18,719 INFO L85 PathProgramCache]: Analyzing trace with hash -504491126, now seen corresponding path program 1 times [2025-01-09 21:22:18,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:22:18,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912914822] [2025-01-09 21:22:18,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:22:18,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:22:18,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-09 21:22:18,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 21:22:18,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:22:18,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:22:18,894 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:22:18,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:22:18,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912914822] [2025-01-09 21:22:18,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912914822] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:22:18,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [352221423] [2025-01-09 21:22:18,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:22:18,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:22:18,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:22:18,896 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 21:22:18,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 21:22:18,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-09 21:22:18,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 21:22:18,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:22:18,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:22:18,978 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 21:22:18,981 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:22:18,993 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 21:22:18,993 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 21:22:18,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [352221423] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:22:18,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 21:22:18,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-01-09 21:22:18,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020024859] [2025-01-09 21:22:18,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:22:18,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:22:18,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:22:18,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:22:18,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:22:19,011 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 91 [2025-01-09 21:22:19,012 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 91 transitions, 198 flow. Second operand has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 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-01-09 21:22:19,013 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:22:19,013 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 91 [2025-01-09 21:22:19,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:22:19,060 INFO L124 PetriNetUnfolderBase]: 15/151 cut-off events. [2025-01-09 21:22:19,060 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 21:22:19,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 198 conditions, 151 events. 15/151 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 418 event pairs, 0 based on Foata normal form. 0/136 useless extension candidates. Maximal degree in co-relation 170. Up to 30 conditions per place. [2025-01-09 21:22:19,062 INFO L140 encePairwiseOnDemand]: 88/91 looper letters, 11 selfloop transitions, 1 changer transitions 0/91 dead transitions. [2025-01-09 21:22:19,062 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 91 transitions, 222 flow [2025-01-09 21:22:19,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:22:19,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:22:19,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 251 transitions. [2025-01-09 21:22:19,064 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9194139194139194 [2025-01-09 21:22:19,064 INFO L175 Difference]: Start difference. First operand has 93 places, 91 transitions, 198 flow. Second operand 3 states and 251 transitions. [2025-01-09 21:22:19,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 91 transitions, 222 flow [2025-01-09 21:22:19,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 91 transitions, 220 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:22:19,067 INFO L231 Difference]: Finished difference. Result has 92 places, 89 transitions, 194 flow [2025-01-09 21:22:19,067 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=194, PETRI_PLACES=92, PETRI_TRANSITIONS=89} [2025-01-09 21:22:19,067 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 1 predicate places. [2025-01-09 21:22:19,068 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 89 transitions, 194 flow [2025-01-09 21:22:19,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 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-01-09 21:22:19,068 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:22:19,068 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] [2025-01-09 21:22:19,078 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 21:22:19,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:22:19,269 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-01-09 21:22:19,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:22:19,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1538839136, now seen corresponding path program 1 times [2025-01-09 21:22:19,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:22:19,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956002781] [2025-01-09 21:22:19,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:22:19,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:22:19,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-09 21:22:19,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 21:22:19,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:22:19,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:22:19,381 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:22:19,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:22:19,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956002781] [2025-01-09 21:22:19,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956002781] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:22:19,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1336056483] [2025-01-09 21:22:19,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:22:19,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:22:19,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:22:19,387 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 21:22:19,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 21:22:19,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-09 21:22:19,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 21:22:19,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:22:19,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:22:19,444 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 21:22:19,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:22:19,455 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 21:22:19,455 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 21:22:19,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1336056483] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:22:19,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 21:22:19,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-01-09 21:22:19,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31631869] [2025-01-09 21:22:19,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:22:19,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:22:19,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:22:19,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:22:19,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:22:19,470 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 91 [2025-01-09 21:22:19,471 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 89 transitions, 194 flow. Second operand has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 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-01-09 21:22:19,471 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:22:19,471 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 91 [2025-01-09 21:22:19,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:22:19,523 INFO L124 PetriNetUnfolderBase]: 15/153 cut-off events. [2025-01-09 21:22:19,523 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:22:19,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 153 events. 15/153 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 420 event pairs, 0 based on Foata normal form. 0/141 useless extension candidates. Maximal degree in co-relation 145. Up to 30 conditions per place. [2025-01-09 21:22:19,524 INFO L140 encePairwiseOnDemand]: 88/91 looper letters, 11 selfloop transitions, 1 changer transitions 0/89 dead transitions. [2025-01-09 21:22:19,524 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 89 transitions, 218 flow [2025-01-09 21:22:19,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:22:19,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:22:19,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 251 transitions. [2025-01-09 21:22:19,528 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9194139194139194 [2025-01-09 21:22:19,529 INFO L175 Difference]: Start difference. First operand has 92 places, 89 transitions, 194 flow. Second operand 3 states and 251 transitions. [2025-01-09 21:22:19,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 89 transitions, 218 flow [2025-01-09 21:22:19,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 89 transitions, 217 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:22:19,531 INFO L231 Difference]: Finished difference. Result has 91 places, 87 transitions, 191 flow [2025-01-09 21:22:19,532 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=189, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=191, PETRI_PLACES=91, PETRI_TRANSITIONS=87} [2025-01-09 21:22:19,532 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 0 predicate places. [2025-01-09 21:22:19,532 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 87 transitions, 191 flow [2025-01-09 21:22:19,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 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-01-09 21:22:19,533 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:22:19,533 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:22:19,541 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 21:22:19,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:22:19,734 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-01-09 21:22:19,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:22:19,735 INFO L85 PathProgramCache]: Analyzing trace with hash -775990810, now seen corresponding path program 1 times [2025-01-09 21:22:19,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:22:19,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871031350] [2025-01-09 21:22:19,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:22:19,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:22:19,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-09 21:22:19,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-09 21:22:19,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:22:19,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:22:19,851 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:22:19,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:22:19,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871031350] [2025-01-09 21:22:19,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871031350] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:22:19,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [361407695] [2025-01-09 21:22:19,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:22:19,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:22:19,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:22:19,855 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 21:22:19,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 21:22:19,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-09 21:22:19,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-09 21:22:19,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:22:19,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:22:19,920 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 21:22:19,922 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:22:19,932 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 21:22:19,932 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 21:22:19,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [361407695] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:22:19,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 21:22:19,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-01-09 21:22:19,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112436318] [2025-01-09 21:22:19,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:22:19,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:22:19,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:22:19,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:22:19,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:22:19,953 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 91 [2025-01-09 21:22:19,954 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 87 transitions, 191 flow. Second operand has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 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-01-09 21:22:19,954 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:22:19,954 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 91 [2025-01-09 21:22:19,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:22:20,007 INFO L124 PetriNetUnfolderBase]: 18/201 cut-off events. [2025-01-09 21:22:20,007 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-01-09 21:22:20,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 266 conditions, 201 events. 18/201 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 673 event pairs, 10 based on Foata normal form. 0/186 useless extension candidates. Maximal degree in co-relation 146. Up to 35 conditions per place. [2025-01-09 21:22:20,010 INFO L140 encePairwiseOnDemand]: 87/91 looper letters, 14 selfloop transitions, 3 changer transitions 0/91 dead transitions. [2025-01-09 21:22:20,010 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 91 transitions, 237 flow [2025-01-09 21:22:20,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:22:20,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:22:20,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 252 transitions. [2025-01-09 21:22:20,012 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9230769230769231 [2025-01-09 21:22:20,012 INFO L175 Difference]: Start difference. First operand has 91 places, 87 transitions, 191 flow. Second operand 3 states and 252 transitions. [2025-01-09 21:22:20,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 91 transitions, 237 flow [2025-01-09 21:22:20,013 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 91 transitions, 235 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:22:20,014 INFO L231 Difference]: Finished difference. Result has 92 places, 88 transitions, 206 flow [2025-01-09 21:22:20,016 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=206, PETRI_PLACES=92, PETRI_TRANSITIONS=88} [2025-01-09 21:22:20,017 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 1 predicate places. [2025-01-09 21:22:20,018 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 88 transitions, 206 flow [2025-01-09 21:22:20,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 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-01-09 21:22:20,019 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:22:20,019 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:22:20,025 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 21:22:20,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:22:20,220 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-01-09 21:22:20,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:22:20,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1683151289, now seen corresponding path program 1 times [2025-01-09 21:22:20,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:22:20,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643969432] [2025-01-09 21:22:20,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:22:20,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:22:20,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-09 21:22:20,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-09 21:22:20,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:22:20,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:22:20,302 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:22:20,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:22:20,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643969432] [2025-01-09 21:22:20,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643969432] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:22:20,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1246648956] [2025-01-09 21:22:20,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:22:20,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:22:20,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:22:20,305 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 21:22:20,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 21:22:20,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-09 21:22:20,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-09 21:22:20,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:22:20,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:22:20,368 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 21:22:20,369 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:22:20,389 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-09 21:22:20,390 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 21:22:20,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1246648956] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:22:20,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 21:22:20,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-01-09 21:22:20,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713150930] [2025-01-09 21:22:20,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:22:20,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:22:20,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:22:20,391 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:22:20,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:22:20,407 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 91 [2025-01-09 21:22:20,408 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 88 transitions, 206 flow. Second operand has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 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-01-09 21:22:20,408 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:22:20,408 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 91 [2025-01-09 21:22:20,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:22:20,458 INFO L124 PetriNetUnfolderBase]: 28/293 cut-off events. [2025-01-09 21:22:20,458 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:22:20,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 406 conditions, 293 events. 28/293 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1216 event pairs, 13 based on Foata normal form. 0/275 useless extension candidates. Maximal degree in co-relation 286. Up to 48 conditions per place. [2025-01-09 21:22:20,461 INFO L140 encePairwiseOnDemand]: 86/91 looper letters, 14 selfloop transitions, 4 changer transitions 0/93 dead transitions. [2025-01-09 21:22:20,462 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 93 transitions, 255 flow [2025-01-09 21:22:20,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:22:20,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:22:20,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 253 transitions. [2025-01-09 21:22:20,463 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9267399267399268 [2025-01-09 21:22:20,464 INFO L175 Difference]: Start difference. First operand has 92 places, 88 transitions, 206 flow. Second operand 3 states and 253 transitions. [2025-01-09 21:22:20,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 93 transitions, 255 flow [2025-01-09 21:22:20,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 93 transitions, 252 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:22:20,467 INFO L231 Difference]: Finished difference. Result has 93 places, 90 transitions, 226 flow [2025-01-09 21:22:20,469 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=226, PETRI_PLACES=93, PETRI_TRANSITIONS=90} [2025-01-09 21:22:20,470 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 2 predicate places. [2025-01-09 21:22:20,470 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 90 transitions, 226 flow [2025-01-09 21:22:20,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 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-01-09 21:22:20,471 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:22:20,471 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] [2025-01-09 21:22:20,479 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 21:22:20,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:22:20,672 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting fErr1ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-01-09 21:22:20,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:22:20,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1320673165, now seen corresponding path program 1 times [2025-01-09 21:22:20,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:22:20,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183975567] [2025-01-09 21:22:20,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:22:20,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:22:20,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-09 21:22:20,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-09 21:22:20,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:22:20,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:22:20,730 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:22:20,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:22:20,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183975567] [2025-01-09 21:22:20,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183975567] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:22:20,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1578842070] [2025-01-09 21:22:20,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:22:20,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:22:20,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:22:20,733 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 21:22:20,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 21:22:20,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-09 21:22:20,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-09 21:22:20,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:22:20,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:22:20,791 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 21:22:20,792 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:22:20,802 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 21:22:20,802 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 21:22:20,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1578842070] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:22:20,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 21:22:20,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-01-09 21:22:20,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866005931] [2025-01-09 21:22:20,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:22:20,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:22:20,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:22:20,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:22:20,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:22:20,823 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 91 [2025-01-09 21:22:20,824 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 90 transitions, 226 flow. Second operand has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 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-01-09 21:22:20,824 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:22:20,824 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 91 [2025-01-09 21:22:20,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:22:20,891 INFO L124 PetriNetUnfolderBase]: 46/395 cut-off events. [2025-01-09 21:22:20,891 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:22:20,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 564 conditions, 395 events. 46/395 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 2041 event pairs, 15 based on Foata normal form. 0/372 useless extension candidates. Maximal degree in co-relation 440. Up to 56 conditions per place. [2025-01-09 21:22:20,894 INFO L140 encePairwiseOnDemand]: 83/91 looper letters, 17 selfloop transitions, 6 changer transitions 0/100 dead transitions. [2025-01-09 21:22:20,894 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 100 transitions, 292 flow [2025-01-09 21:22:20,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:22:20,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:22:20,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 259 transitions. [2025-01-09 21:22:20,896 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9487179487179487 [2025-01-09 21:22:20,896 INFO L175 Difference]: Start difference. First operand has 93 places, 90 transitions, 226 flow. Second operand 3 states and 259 transitions. [2025-01-09 21:22:20,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 100 transitions, 292 flow [2025-01-09 21:22:20,897 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 100 transitions, 288 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:22:20,900 INFO L231 Difference]: Finished difference. Result has 96 places, 96 transitions, 274 flow [2025-01-09 21:22:20,900 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=274, PETRI_PLACES=96, PETRI_TRANSITIONS=96} [2025-01-09 21:22:20,901 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 5 predicate places. [2025-01-09 21:22:20,903 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 96 transitions, 274 flow [2025-01-09 21:22:20,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 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-01-09 21:22:20,904 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:22:20,904 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] [2025-01-09 21:22:20,911 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-09 21:22:21,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:22:21,108 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting fErr2ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-01-09 21:22:21,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:22:21,109 INFO L85 PathProgramCache]: Analyzing trace with hash -752803953, now seen corresponding path program 1 times [2025-01-09 21:22:21,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:22:21,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694516115] [2025-01-09 21:22:21,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:22:21,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:22:21,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-09 21:22:21,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-09 21:22:21,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:22:21,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:22:21,187 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:22:21,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:22:21,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694516115] [2025-01-09 21:22:21,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694516115] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:22:21,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [897465717] [2025-01-09 21:22:21,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:22:21,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:22:21,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:22:21,191 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 21:22:21,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 21:22:21,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-09 21:22:21,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-09 21:22:21,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:22:21,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:22:21,258 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 21:22:21,259 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:22:21,273 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 21:22:21,273 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 21:22:21,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [897465717] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:22:21,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 21:22:21,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-01-09 21:22:21,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509740057] [2025-01-09 21:22:21,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:22:21,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:22:21,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:22:21,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:22:21,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:22:21,294 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 91 [2025-01-09 21:22:21,295 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 96 transitions, 274 flow. Second operand has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 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-01-09 21:22:21,295 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:22:21,295 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 91 [2025-01-09 21:22:21,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:22:21,357 INFO L124 PetriNetUnfolderBase]: 61/460 cut-off events. [2025-01-09 21:22:21,357 INFO L125 PetriNetUnfolderBase]: For 103/108 co-relation queries the response was YES. [2025-01-09 21:22:21,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 766 conditions, 460 events. 61/460 cut-off events. For 103/108 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 2581 event pairs, 23 based on Foata normal form. 3/443 useless extension candidates. Maximal degree in co-relation 524. Up to 103 conditions per place. [2025-01-09 21:22:21,360 INFO L140 encePairwiseOnDemand]: 85/91 looper letters, 16 selfloop transitions, 7 changer transitions 2/103 dead transitions. [2025-01-09 21:22:21,360 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 103 transitions, 346 flow [2025-01-09 21:22:21,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:22:21,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:22:21,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 254 transitions. [2025-01-09 21:22:21,362 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9304029304029304 [2025-01-09 21:22:21,362 INFO L175 Difference]: Start difference. First operand has 96 places, 96 transitions, 274 flow. Second operand 3 states and 254 transitions. [2025-01-09 21:22:21,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 103 transitions, 346 flow [2025-01-09 21:22:21,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 103 transitions, 330 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:22:21,393 INFO L231 Difference]: Finished difference. Result has 98 places, 100 transitions, 314 flow [2025-01-09 21:22:21,393 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=314, PETRI_PLACES=98, PETRI_TRANSITIONS=100} [2025-01-09 21:22:21,394 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 7 predicate places. [2025-01-09 21:22:21,394 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 100 transitions, 314 flow [2025-01-09 21:22:21,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 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-01-09 21:22:21,394 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:22:21,394 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] [2025-01-09 21:22:21,402 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-09 21:22:21,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-01-09 21:22:21,595 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-01-09 21:22:21,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:22:21,595 INFO L85 PathProgramCache]: Analyzing trace with hash -135110132, now seen corresponding path program 1 times [2025-01-09 21:22:21,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:22:21,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084028873] [2025-01-09 21:22:21,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:22:21,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:22:21,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-09 21:22:21,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-09 21:22:21,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:22:21,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:22:21,655 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:22:21,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:22:21,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084028873] [2025-01-09 21:22:21,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084028873] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:22:21,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1756075908] [2025-01-09 21:22:21,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:22:21,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:22:21,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:22:21,658 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 21:22:21,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-09 21:22:21,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-09 21:22:21,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-09 21:22:21,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:22:21,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:22:21,728 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 21:22:21,729 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:22:21,741 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 21:22:21,742 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 21:22:21,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1756075908] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:22:21,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 21:22:21,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-01-09 21:22:21,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62920185] [2025-01-09 21:22:21,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:22:21,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:22:21,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:22:21,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:22:21,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:22:21,774 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 91 [2025-01-09 21:22:21,775 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 100 transitions, 314 flow. Second operand has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 3 states have internal predecessors, (235), 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-01-09 21:22:21,775 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:22:21,775 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 91 [2025-01-09 21:22:21,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:22:21,832 INFO L124 PetriNetUnfolderBase]: 79/520 cut-off events. [2025-01-09 21:22:21,833 INFO L125 PetriNetUnfolderBase]: For 237/244 co-relation queries the response was YES. [2025-01-09 21:22:21,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 962 conditions, 520 events. 79/520 cut-off events. For 237/244 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 3019 event pairs, 27 based on Foata normal form. 2/504 useless extension candidates. Maximal degree in co-relation 718. Up to 128 conditions per place. [2025-01-09 21:22:21,835 INFO L140 encePairwiseOnDemand]: 85/91 looper letters, 17 selfloop transitions, 7 changer transitions 7/107 dead transitions. [2025-01-09 21:22:21,835 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 107 transitions, 400 flow [2025-01-09 21:22:21,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:22:21,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:22:21,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 250 transitions. [2025-01-09 21:22:21,836 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9157509157509157 [2025-01-09 21:22:21,836 INFO L175 Difference]: Start difference. First operand has 98 places, 100 transitions, 314 flow. Second operand 3 states and 250 transitions. [2025-01-09 21:22:21,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 107 transitions, 400 flow [2025-01-09 21:22:21,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 107 transitions, 382 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:22:21,841 INFO L231 Difference]: Finished difference. Result has 100 places, 99 transitions, 332 flow [2025-01-09 21:22:21,842 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=332, PETRI_PLACES=100, PETRI_TRANSITIONS=99} [2025-01-09 21:22:21,843 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 9 predicate places. [2025-01-09 21:22:21,845 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 99 transitions, 332 flow [2025-01-09 21:22:21,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 3 states have internal predecessors, (235), 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-01-09 21:22:21,845 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:22:21,846 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] [2025-01-09 21:22:21,853 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-09 21:22:22,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:22:22,046 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-01-09 21:22:22,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:22:22,047 INFO L85 PathProgramCache]: Analyzing trace with hash -739770760, now seen corresponding path program 1 times [2025-01-09 21:22:22,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:22:22,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146685224] [2025-01-09 21:22:22,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:22:22,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:22:22,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-01-09 21:22:22,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-09 21:22:22,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:22:22,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:22:22,129 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:22:22,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:22:22,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146685224] [2025-01-09 21:22:22,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146685224] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:22:22,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2073809276] [2025-01-09 21:22:22,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:22:22,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:22:22,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:22:22,132 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 21:22:22,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-09 21:22:22,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-01-09 21:22:22,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-09 21:22:22,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:22:22,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:22:22,205 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 21:22:22,207 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:22:22,263 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:22:22,263 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:22:22,312 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:22:22,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2073809276] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 21:22:22,312 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 21:22:22,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-01-09 21:22:22,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652249171] [2025-01-09 21:22:22,313 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 21:22:22,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 21:22:22,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:22:22,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 21:22:22,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-09 21:22:22,347 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 91 [2025-01-09 21:22:22,348 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 99 transitions, 332 flow. Second operand has 10 states, 10 states have (on average 77.1) internal successors, (771), 10 states have internal predecessors, (771), 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-01-09 21:22:22,348 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:22:22,348 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 91 [2025-01-09 21:22:22,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:22:22,516 INFO L124 PetriNetUnfolderBase]: 40/464 cut-off events. [2025-01-09 21:22:22,516 INFO L125 PetriNetUnfolderBase]: For 165/165 co-relation queries the response was YES. [2025-01-09 21:22:22,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 838 conditions, 464 events. 40/464 cut-off events. For 165/165 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 2383 event pairs, 12 based on Foata normal form. 7/459 useless extension candidates. Maximal degree in co-relation 508. Up to 54 conditions per place. [2025-01-09 21:22:22,518 INFO L140 encePairwiseOnDemand]: 83/91 looper letters, 15 selfloop transitions, 13 changer transitions 0/110 dead transitions. [2025-01-09 21:22:22,519 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 110 transitions, 416 flow [2025-01-09 21:22:22,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 21:22:22,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-09 21:22:22,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 857 transitions. [2025-01-09 21:22:22,522 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8561438561438561 [2025-01-09 21:22:22,522 INFO L175 Difference]: Start difference. First operand has 100 places, 99 transitions, 332 flow. Second operand 11 states and 857 transitions. [2025-01-09 21:22:22,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 110 transitions, 416 flow [2025-01-09 21:22:22,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 110 transitions, 402 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:22:22,526 INFO L231 Difference]: Finished difference. Result has 111 places, 108 transitions, 392 flow [2025-01-09 21:22:22,527 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=318, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=392, PETRI_PLACES=111, PETRI_TRANSITIONS=108} [2025-01-09 21:22:22,527 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 20 predicate places. [2025-01-09 21:22:22,527 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 108 transitions, 392 flow [2025-01-09 21:22:22,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 77.1) internal successors, (771), 10 states have internal predecessors, (771), 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-01-09 21:22:22,530 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:22:22,530 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:22:22,537 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-01-09 21:22:22,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:22:22,731 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-01-09 21:22:22,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:22:22,732 INFO L85 PathProgramCache]: Analyzing trace with hash -999059986, now seen corresponding path program 2 times [2025-01-09 21:22:22,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:22:22,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365488274] [2025-01-09 21:22:22,732 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 21:22:22,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:22:22,742 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 66 statements into 2 equivalence classes. [2025-01-09 21:22:22,745 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 36 of 66 statements. [2025-01-09 21:22:22,745 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 21:22:22,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:22:22,840 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-01-09 21:22:22,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:22:22,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365488274] [2025-01-09 21:22:22,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365488274] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:22:22,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:22:22,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:22:22,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12094459] [2025-01-09 21:22:22,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:22:22,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 21:22:22,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:22:22,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 21:22:22,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:22:22,851 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 91 [2025-01-09 21:22:22,852 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 108 transitions, 392 flow. Second operand has 5 states, 5 states have (on average 82.2) internal successors, (411), 5 states have internal predecessors, (411), 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-01-09 21:22:22,852 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:22:22,852 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 91 [2025-01-09 21:22:22,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:22:22,995 INFO L124 PetriNetUnfolderBase]: 57/800 cut-off events. [2025-01-09 21:22:22,996 INFO L125 PetriNetUnfolderBase]: For 215/215 co-relation queries the response was YES. [2025-01-09 21:22:22,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1406 conditions, 800 events. 57/800 cut-off events. For 215/215 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 5358 event pairs, 15 based on Foata normal form. 2/782 useless extension candidates. Maximal degree in co-relation 490. Up to 74 conditions per place. [2025-01-09 21:22:22,999 INFO L140 encePairwiseOnDemand]: 83/91 looper letters, 13 selfloop transitions, 11 changer transitions 8/130 dead transitions. [2025-01-09 21:22:22,999 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 130 transitions, 504 flow [2025-01-09 21:22:23,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 21:22:23,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-09 21:22:23,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 601 transitions. [2025-01-09 21:22:23,001 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9434850863422292 [2025-01-09 21:22:23,001 INFO L175 Difference]: Start difference. First operand has 111 places, 108 transitions, 392 flow. Second operand 7 states and 601 transitions. [2025-01-09 21:22:23,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 130 transitions, 504 flow [2025-01-09 21:22:23,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 130 transitions, 492 flow, removed 5 selfloop flow, removed 1 redundant places. [2025-01-09 21:22:23,006 INFO L231 Difference]: Finished difference. Result has 118 places, 115 transitions, 429 flow [2025-01-09 21:22:23,006 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=380, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=429, PETRI_PLACES=118, PETRI_TRANSITIONS=115} [2025-01-09 21:22:23,006 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 27 predicate places. [2025-01-09 21:22:23,007 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 115 transitions, 429 flow [2025-01-09 21:22:23,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 82.2) internal successors, (411), 5 states have internal predecessors, (411), 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-01-09 21:22:23,007 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:22:23,007 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2025-01-09 21:22:23,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 21:22:23,008 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-01-09 21:22:23,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:22:23,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1079890278, now seen corresponding path program 1 times [2025-01-09 21:22:23,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:22:23,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26193272] [2025-01-09 21:22:23,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:22:23,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:22:23,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-01-09 21:22:23,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-01-09 21:22:23,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:22:23,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:22:23,126 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 36 proven. 24 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 21:22:23,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:22:23,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26193272] [2025-01-09 21:22:23,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26193272] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:22:23,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [27000139] [2025-01-09 21:22:23,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:22:23,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:22:23,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:22:23,129 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 21:22:23,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-09 21:22:23,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-01-09 21:22:23,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-01-09 21:22:23,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:22:23,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:22:23,221 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 21:22:23,223 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:22:23,281 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 36 proven. 24 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 21:22:23,281 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:22:23,365 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 36 proven. 24 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 21:22:23,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [27000139] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 21:22:23,366 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 21:22:23,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2025-01-09 21:22:23,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56326566] [2025-01-09 21:22:23,366 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 21:22:23,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 21:22:23,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:22:23,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 21:22:23,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2025-01-09 21:22:23,423 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 91 [2025-01-09 21:22:23,425 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 115 transitions, 429 flow. Second operand has 14 states, 14 states have (on average 78.0) internal successors, (1092), 14 states have internal predecessors, (1092), 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-01-09 21:22:23,425 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:22:23,425 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 91 [2025-01-09 21:22:23,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:22:23,637 INFO L124 PetriNetUnfolderBase]: 58/761 cut-off events. [2025-01-09 21:22:23,638 INFO L125 PetriNetUnfolderBase]: For 309/315 co-relation queries the response was YES. [2025-01-09 21:22:23,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1459 conditions, 761 events. 58/761 cut-off events. For 309/315 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 4472 event pairs, 14 based on Foata normal form. 14/756 useless extension candidates. Maximal degree in co-relation 594. Up to 94 conditions per place. [2025-01-09 21:22:23,641 INFO L140 encePairwiseOnDemand]: 84/91 looper letters, 21 selfloop transitions, 20 changer transitions 0/128 dead transitions. [2025-01-09 21:22:23,641 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 128 transitions, 569 flow [2025-01-09 21:22:23,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 21:22:23,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-01-09 21:22:23,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1332 transitions. [2025-01-09 21:22:23,645 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.861021331609567 [2025-01-09 21:22:23,645 INFO L175 Difference]: Start difference. First operand has 118 places, 115 transitions, 429 flow. Second operand 17 states and 1332 transitions. [2025-01-09 21:22:23,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 128 transitions, 569 flow [2025-01-09 21:22:23,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 128 transitions, 567 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-01-09 21:22:23,649 INFO L231 Difference]: Finished difference. Result has 137 places, 127 transitions, 560 flow [2025-01-09 21:22:23,650 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=419, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=560, PETRI_PLACES=137, PETRI_TRANSITIONS=127} [2025-01-09 21:22:23,650 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 46 predicate places. [2025-01-09 21:22:23,651 INFO L471 AbstractCegarLoop]: Abstraction has has 137 places, 127 transitions, 560 flow [2025-01-09 21:22:23,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 78.0) internal successors, (1092), 14 states have internal predecessors, (1092), 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-01-09 21:22:23,652 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:22:23,652 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:22:23,660 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-01-09 21:22:23,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:22:23,853 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-01-09 21:22:23,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:22:23,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1817159862, now seen corresponding path program 1 times [2025-01-09 21:22:23,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:22:23,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956073064] [2025-01-09 21:22:23,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:22:23,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:22:23,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 21:22:23,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 21:22:23,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:22:23,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:22:24,028 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 88 proven. 20 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-01-09 21:22:24,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:22:24,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956073064] [2025-01-09 21:22:24,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956073064] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:22:24,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [465125985] [2025-01-09 21:22:24,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:22:24,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:22:24,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:22:24,031 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 21:22:24,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-01-09 21:22:24,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 21:22:24,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 21:22:24,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:22:24,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:22:24,122 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 21:22:24,127 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:22:24,181 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 88 proven. 20 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-01-09 21:22:24,181 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:22:24,291 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 88 proven. 20 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-01-09 21:22:24,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [465125985] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 21:22:24,294 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 21:22:24,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2025-01-09 21:22:24,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470690095] [2025-01-09 21:22:24,294 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 21:22:24,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 21:22:24,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:22:24,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 21:22:24,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-01-09 21:22:24,354 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 91 [2025-01-09 21:22:24,355 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 127 transitions, 560 flow. Second operand has 15 states, 15 states have (on average 76.86666666666666) internal successors, (1153), 15 states have internal predecessors, (1153), 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-01-09 21:22:24,355 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:22:24,355 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 91 [2025-01-09 21:22:24,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:22:24,644 INFO L124 PetriNetUnfolderBase]: 64/772 cut-off events. [2025-01-09 21:22:24,644 INFO L125 PetriNetUnfolderBase]: For 549/555 co-relation queries the response was YES. [2025-01-09 21:22:24,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1656 conditions, 772 events. 64/772 cut-off events. For 549/555 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 3615 event pairs, 13 based on Foata normal form. 9/763 useless extension candidates. Maximal degree in co-relation 820. Up to 66 conditions per place. [2025-01-09 21:22:24,648 INFO L140 encePairwiseOnDemand]: 82/91 looper letters, 29 selfloop transitions, 45 changer transitions 1/158 dead transitions. [2025-01-09 21:22:24,648 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 158 transitions, 906 flow [2025-01-09 21:22:24,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-01-09 21:22:24,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-01-09 21:22:24,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1613 transitions. [2025-01-09 21:22:24,652 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8440607012035584 [2025-01-09 21:22:24,652 INFO L175 Difference]: Start difference. First operand has 137 places, 127 transitions, 560 flow. Second operand 21 states and 1613 transitions. [2025-01-09 21:22:24,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 158 transitions, 906 flow [2025-01-09 21:22:24,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 158 transitions, 888 flow, removed 4 selfloop flow, removed 5 redundant places. [2025-01-09 21:22:24,658 INFO L231 Difference]: Finished difference. Result has 156 places, 146 transitions, 823 flow [2025-01-09 21:22:24,659 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=539, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=823, PETRI_PLACES=156, PETRI_TRANSITIONS=146} [2025-01-09 21:22:24,659 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 65 predicate places. [2025-01-09 21:22:24,660 INFO L471 AbstractCegarLoop]: Abstraction has has 156 places, 146 transitions, 823 flow [2025-01-09 21:22:24,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 76.86666666666666) internal successors, (1153), 15 states have internal predecessors, (1153), 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-01-09 21:22:24,661 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:22:24,661 INFO L206 CegarLoopForPetriNet]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 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] [2025-01-09 21:22:24,669 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-01-09 21:22:24,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-01-09 21:22:24,862 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-01-09 21:22:24,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:22:24,863 INFO L85 PathProgramCache]: Analyzing trace with hash -216749472, now seen corresponding path program 2 times [2025-01-09 21:22:24,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:22:24,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589323574] [2025-01-09 21:22:24,863 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 21:22:24,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:22:24,876 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 120 statements into 2 equivalence classes. [2025-01-09 21:22:24,898 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 120 of 120 statements. [2025-01-09 21:22:24,899 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 21:22:24,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:22:25,134 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 135 proven. 135 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-09 21:22:25,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:22:25,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589323574] [2025-01-09 21:22:25,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589323574] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:22:25,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1153447029] [2025-01-09 21:22:25,134 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 21:22:25,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:22:25,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:22:25,137 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 21:22:25,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-01-09 21:22:25,203 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 120 statements into 2 equivalence classes. [2025-01-09 21:22:25,236 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 120 of 120 statements. [2025-01-09 21:22:25,237 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 21:22:25,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:22:25,238 INFO L256 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-09 21:22:25,241 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:22:25,345 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 135 proven. 135 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-09 21:22:25,345 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:22:25,527 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 135 proven. 135 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-09 21:22:25,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1153447029] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 21:22:25,528 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 21:22:25,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 17 [2025-01-09 21:22:25,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831501061] [2025-01-09 21:22:25,528 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 21:22:25,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-09 21:22:25,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:22:25,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-09 21:22:25,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2025-01-09 21:22:25,575 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 91 [2025-01-09 21:22:25,576 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 146 transitions, 823 flow. Second operand has 17 states, 17 states have (on average 77.52941176470588) internal successors, (1318), 17 states have internal predecessors, (1318), 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-01-09 21:22:25,576 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:22:25,576 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 91 [2025-01-09 21:22:25,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:22:25,812 INFO L124 PetriNetUnfolderBase]: 37/455 cut-off events. [2025-01-09 21:22:25,813 INFO L125 PetriNetUnfolderBase]: For 499/501 co-relation queries the response was YES. [2025-01-09 21:22:25,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1144 conditions, 455 events. 37/455 cut-off events. For 499/501 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1562 event pairs, 5 based on Foata normal form. 1/447 useless extension candidates. Maximal degree in co-relation 752. Up to 53 conditions per place. [2025-01-09 21:22:25,815 INFO L140 encePairwiseOnDemand]: 84/91 looper letters, 35 selfloop transitions, 34 changer transitions 0/153 dead transitions. [2025-01-09 21:22:25,815 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 153 transitions, 1011 flow [2025-01-09 21:22:25,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-01-09 21:22:25,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-01-09 21:22:25,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1623 transitions. [2025-01-09 21:22:25,819 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8492935635792779 [2025-01-09 21:22:25,819 INFO L175 Difference]: Start difference. First operand has 156 places, 146 transitions, 823 flow. Second operand 21 states and 1623 transitions. [2025-01-09 21:22:25,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 153 transitions, 1011 flow [2025-01-09 21:22:25,825 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 153 transitions, 911 flow, removed 32 selfloop flow, removed 7 redundant places. [2025-01-09 21:22:25,827 INFO L231 Difference]: Finished difference. Result has 172 places, 146 transitions, 860 flow [2025-01-09 21:22:25,827 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=705, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=860, PETRI_PLACES=172, PETRI_TRANSITIONS=146} [2025-01-09 21:22:25,828 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 81 predicate places. [2025-01-09 21:22:25,828 INFO L471 AbstractCegarLoop]: Abstraction has has 172 places, 146 transitions, 860 flow [2025-01-09 21:22:25,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 77.52941176470588) internal successors, (1318), 17 states have internal predecessors, (1318), 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-01-09 21:22:25,829 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:22:25,829 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:22:25,837 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-01-09 21:22:26,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-01-09 21:22:26,030 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-01-09 21:22:26,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:22:26,031 INFO L85 PathProgramCache]: Analyzing trace with hash -659801372, now seen corresponding path program 1 times [2025-01-09 21:22:26,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:22:26,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821752938] [2025-01-09 21:22:26,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:22:26,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:22:26,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 21:22:26,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 21:22:26,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:22:26,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:22:26,068 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:22:26,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 21:22:26,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 21:22:26,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:22:26,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:22:26,129 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:22:26,129 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:22:26,130 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (14 of 15 remaining) [2025-01-09 21:22:26,131 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location fErr0ASSERT_VIOLATIONDATA_RACE (13 of 15 remaining) [2025-01-09 21:22:26,133 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location fErr1ASSERT_VIOLATIONDATA_RACE (12 of 15 remaining) [2025-01-09 21:22:26,133 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location fErr2ASSERT_VIOLATIONDATA_RACE (11 of 15 remaining) [2025-01-09 21:22:26,133 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location fErr3ASSERT_VIOLATIONDATA_RACE (10 of 15 remaining) [2025-01-09 21:22:26,133 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (9 of 15 remaining) [2025-01-09 21:22:26,133 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (8 of 15 remaining) [2025-01-09 21:22:26,134 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (7 of 15 remaining) [2025-01-09 21:22:26,134 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (6 of 15 remaining) [2025-01-09 21:22:26,134 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (5 of 15 remaining) [2025-01-09 21:22:26,134 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 15 remaining) [2025-01-09 21:22:26,134 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location fErr0ASSERT_VIOLATIONDATA_RACE (3 of 15 remaining) [2025-01-09 21:22:26,134 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location fErr1ASSERT_VIOLATIONDATA_RACE (2 of 15 remaining) [2025-01-09 21:22:26,134 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location fErr2ASSERT_VIOLATIONDATA_RACE (1 of 15 remaining) [2025-01-09 21:22:26,134 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location fErr3ASSERT_VIOLATIONDATA_RACE (0 of 15 remaining) [2025-01-09 21:22:26,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 21:22:26,135 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:22:26,231 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-09 21:22:26,232 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 21:22:26,238 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 09:22:26 BasicIcfg [2025-01-09 21:22:26,238 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 21:22:26,238 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 21:22:26,239 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 21:22:26,239 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 21:22:26,240 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:22:18" (3/4) ... [2025-01-09 21:22:26,241 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-01-09 21:22:26,350 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 32. [2025-01-09 21:22:26,414 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 21:22:26,415 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 21:22:26,415 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 21:22:26,415 INFO L158 Benchmark]: Toolchain (without parser) took 9152.66ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 128.3MB in the beginning and 159.2MB in the end (delta: -30.9MB). Peak memory consumption was 95.1MB. Max. memory is 16.1GB. [2025-01-09 21:22:26,416 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 201.3MB. Free memory is still 125.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:22:26,416 INFO L158 Benchmark]: CACSL2BoogieTranslator took 458.23ms. Allocated memory is still 167.8MB. Free memory was 128.3MB in the beginning and 101.8MB in the end (delta: 26.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 21:22:26,416 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.45ms. Allocated memory is still 167.8MB. Free memory was 101.8MB in the beginning and 99.7MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:22:26,416 INFO L158 Benchmark]: Boogie Preprocessor took 32.93ms. Allocated memory is still 167.8MB. Free memory was 99.7MB in the beginning and 98.8MB in the end (delta: 902.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:22:26,416 INFO L158 Benchmark]: RCFGBuilder took 400.77ms. Allocated memory is still 167.8MB. Free memory was 98.8MB in the beginning and 84.5MB in the end (delta: 14.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:22:26,417 INFO L158 Benchmark]: TraceAbstraction took 8029.09ms. Allocated memory is still 167.8MB. Free memory was 84.1MB in the beginning and 50.8MB in the end (delta: 33.3MB). Peak memory consumption was 43.9MB. Max. memory is 16.1GB. [2025-01-09 21:22:26,417 INFO L158 Benchmark]: Witness Printer took 176.23ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 50.8MB in the beginning and 159.2MB in the end (delta: -108.4MB). Peak memory consumption was 17.6MB. Max. memory is 16.1GB. [2025-01-09 21:22:26,418 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.27ms. Allocated memory is still 201.3MB. Free memory is still 125.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 458.23ms. Allocated memory is still 167.8MB. Free memory was 128.3MB in the beginning and 101.8MB in the end (delta: 26.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.45ms. Allocated memory is still 167.8MB. Free memory was 101.8MB in the beginning and 99.7MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.93ms. Allocated memory is still 167.8MB. Free memory was 99.7MB in the beginning and 98.8MB in the end (delta: 902.1kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 400.77ms. Allocated memory is still 167.8MB. Free memory was 98.8MB in the beginning and 84.5MB in the end (delta: 14.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 8029.09ms. Allocated memory is still 167.8MB. Free memory was 84.1MB in the beginning and 50.8MB in the end (delta: 33.3MB). Peak memory consumption was 43.9MB. Max. memory is 16.1GB. * Witness Printer took 176.23ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 50.8MB in the beginning and 159.2MB in the end (delta: -108.4MB). Peak memory consumption was 17.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 1009]: Data race detected Data race detected The following path leads to a data race: [L987] 0 int glob; VAL [glob=0] [L988] 0 pthread_mutex_t *p, *q; VAL [glob=0, p={0:0}, q={0:0}] [L996] 0 pthread_t t1, t2; VAL [glob=0, p={0:0}, q={0:0}] [L997] 0 int i; VAL [glob=0, p={0:0}, q={0:0}] [L998] 0 pthread_mutex_t *a; VAL [glob=0, p={0:0}, q={0:0}] [L999] 0 i=0 VAL [glob=0, i=0, p={0:0}, q={0:0}] [L999] COND TRUE 0 i < 10 VAL [glob=0, p={0:0}, q={0:0}] [L1000] 0 a = malloc(sizeof(pthread_mutex_t)) VAL [a={-2:0}, glob=0, i=0, p={0:0}, q={0:0}] [L1002] COND FALSE 0 !(i==3) VAL [a={-2:0}, glob=0, i=0, p={0:0}, q={0:0}] [L1004] COND FALSE 0 !(i==7) VAL [a={-2:0}, glob=0, i=0, p={0:0}, q={0:0}] [L999] 0 i++ VAL [a={-2:0}, glob=0, i=1, p={0:0}, q={0:0}] [L999] COND TRUE 0 i < 10 VAL [glob=0, p={0:0}, q={0:0}] [L1000] 0 a = malloc(sizeof(pthread_mutex_t)) VAL [a={-3:0}, glob=0, i=1, p={0:0}, q={0:0}] [L1002] COND FALSE 0 !(i==3) VAL [a={-3:0}, glob=0, i=1, p={0:0}, q={0:0}] [L1004] COND FALSE 0 !(i==7) VAL [a={-3:0}, glob=0, i=1, p={0:0}, q={0:0}] [L999] 0 i++ VAL [a={-3:0}, glob=0, i=2, p={0:0}, q={0:0}] [L999] COND TRUE 0 i < 10 VAL [glob=0, p={0:0}, q={0:0}] [L1000] 0 a = malloc(sizeof(pthread_mutex_t)) VAL [a={-4:0}, glob=0, i=2, p={0:0}, q={0:0}] [L1002] COND FALSE 0 !(i==3) VAL [a={-4:0}, glob=0, i=2, p={0:0}, q={0:0}] [L1004] COND FALSE 0 !(i==7) VAL [a={-4:0}, glob=0, i=2, p={0:0}, q={0:0}] [L999] 0 i++ VAL [a={-4:0}, glob=0, i=3, p={0:0}, q={0:0}] [L999] COND TRUE 0 i < 10 VAL [glob=0, p={0:0}, q={0:0}] [L1000] 0 a = malloc(sizeof(pthread_mutex_t)) VAL [a={-5:0}, glob=0, i=3, p={0:0}, q={0:0}] [L1002] COND TRUE 0 i==3 VAL [a={-5:0}, glob=0, i=3, p={0:0}, q={0:0}] [L1003] 0 p = a VAL [a={-5:0}, glob=0, i=3, p={-5:0}, q={0:0}] [L1004] COND FALSE 0 !(i==7) VAL [a={-5:0}, glob=0, i=3, p={-5:0}, q={0:0}] [L999] 0 i++ VAL [a={-5:0}, glob=0, i=4, p={-5:0}, q={0:0}] [L999] COND TRUE 0 i < 10 VAL [glob=0, p={-5:0}, q={0:0}] [L1000] 0 a = malloc(sizeof(pthread_mutex_t)) VAL [a={-6:0}, glob=0, i=4, p={-5:0}, q={0:0}] [L1002] COND FALSE 0 !(i==3) VAL [a={-6:0}, glob=0, i=4, p={-5:0}, q={0:0}] [L1004] COND FALSE 0 !(i==7) VAL [a={-6:0}, glob=0, i=4, p={-5:0}, q={0:0}] [L999] 0 i++ VAL [a={-6:0}, glob=0, i=5, p={-5:0}, q={0:0}] [L999] COND TRUE 0 i < 10 VAL [glob=0, p={-5:0}, q={0:0}] [L1000] 0 a = malloc(sizeof(pthread_mutex_t)) VAL [a={-7:0}, glob=0, i=5, p={-5:0}, q={0:0}] [L1002] COND FALSE 0 !(i==3) VAL [a={-7:0}, glob=0, i=5, p={-5:0}, q={0:0}] [L1004] COND FALSE 0 !(i==7) VAL [a={-7:0}, glob=0, i=5, p={-5:0}, q={0:0}] [L999] 0 i++ VAL [a={-7:0}, glob=0, i=6, p={-5:0}, q={0:0}] [L999] COND TRUE 0 i < 10 VAL [glob=0, p={-5:0}, q={0:0}] [L1000] 0 a = malloc(sizeof(pthread_mutex_t)) VAL [a={-8:0}, glob=0, i=6, p={-5:0}, q={0:0}] [L1002] COND FALSE 0 !(i==3) VAL [a={-8:0}, glob=0, i=6, p={-5:0}, q={0:0}] [L1004] COND FALSE 0 !(i==7) VAL [a={-8:0}, glob=0, i=6, p={-5:0}, q={0:0}] [L999] 0 i++ VAL [a={-8:0}, glob=0, i=7, p={-5:0}, q={0:0}] [L999] COND TRUE 0 i < 10 VAL [glob=0, p={-5:0}, q={0:0}] [L1000] 0 a = malloc(sizeof(pthread_mutex_t)) VAL [a={-9:0}, glob=0, i=7, p={-5:0}, q={0:0}] [L1002] COND FALSE 0 !(i==3) VAL [a={-9:0}, glob=0, i=7, p={-5:0}, q={0:0}] [L1004] COND TRUE 0 i==7 VAL [a={-9:0}, glob=0, i=7, p={-5:0}, q={0:0}] [L1005] 0 q = a VAL [a={-9:0}, glob=0, i=7, p={-5:0}, q={-9:0}] [L999] 0 i++ VAL [a={-9:0}, glob=0, i=8, p={-5:0}, q={-9:0}] [L999] COND TRUE 0 i < 10 VAL [glob=0, p={-5:0}, q={-9:0}] [L1000] 0 a = malloc(sizeof(pthread_mutex_t)) VAL [a={-10:0}, glob=0, i=8, p={-5:0}, q={-9:0}] [L1002] COND FALSE 0 !(i==3) VAL [a={-10:0}, glob=0, i=8, p={-5:0}, q={-9:0}] [L1004] COND FALSE 0 !(i==7) VAL [a={-10:0}, glob=0, i=8, p={-5:0}, q={-9:0}] [L999] 0 i++ VAL [a={-10:0}, glob=0, i=9, p={-5:0}, q={-9:0}] [L999] COND TRUE 0 i < 10 VAL [glob=0, p={-5:0}, q={-9:0}] [L1000] 0 a = malloc(sizeof(pthread_mutex_t)) VAL [a={-11:0}, glob=0, i=9, p={-5:0}, q={-9:0}] [L1002] COND FALSE 0 !(i==3) VAL [a={-11:0}, glob=0, i=9, p={-5:0}, q={-9:0}] [L1004] COND FALSE 0 !(i==7) VAL [a={-11:0}, glob=0, i=9, p={-5:0}, q={-9:0}] [L999] 0 i++ VAL [a={-11:0}, glob=0, i=10, p={-5:0}, q={-9:0}] [L999] COND FALSE 0 !(i < 10) VAL [glob=0, p={-5:0}, q={-9:0}] [L1007] FCALL, FORK 0 pthread_create(&t1, 0, f, 0) VAL [\old(x)={0:0}, a={-11:0}, glob=0, i=10, p={-5:0}, q={-9:0}, t1=-1] [L1008] 0 pthread_mutex_lock(p) VAL [\old(x)={0:0}, a={-11:0}, glob=0, i=10, p={-5:0}, q={-9:0}, t1=-1] [L990] 1 pthread_mutex_lock(q) VAL [\old(x)={0:0}, glob=0, p={-5:0}, q={-9:0}, x={0:0}] [L991] 1 glob++ VAL [\old(x)={0:0}, glob=0, p={-5:0}, q={-9:0}, x={0:0}] [L1009] 0 glob++ VAL [\old(x)={0:0}, a={-11:0}, glob=0, i=10, p={-5:0}, q={-9:0}, t1=-1, x={0:0}] [L991] 1 glob++ VAL [\old(x)={0:0}, glob=1, p={-5:0}, q={-9:0}, x={0:0}] [L1009] 0 glob++ VAL [\old(x)={0:0}, a={-11:0}, glob=1, i=10, p={-5:0}, q={-9:0}, t1=-1, x={0:0}] Now there is a data race on ~glob~0 between C: glob++ [991] and C: glob++ [1009] - UnprovableResult [Line: 990]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 991]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 991]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 992]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1008]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1005]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1009]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1010]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1007]: 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 115 locations, 15 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: 7.8s, OverallIterations: 14, TraceHistogramMax: 10, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 399 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 232 mSDsluCounter, 256 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 154 mSDsCounter, 59 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 881 IncrementalHoareTripleChecker+Invalid, 940 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 59 mSolverCounterUnsat, 102 mSDtfsCounter, 881 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1034 GetRequests, 903 SyntacticMatches, 10 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 489 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=860occurred in iteration=13, InterpolantAutomatonStates: 101, 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.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 1400 NumberOfCodeBlocks, 1370 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 1574 ConstructedInterpolants, 0 QuantifiedInterpolants, 2823 SizeOfPredicates, 22 NumberOfNonLiveVariables, 1509 ConjunctsInSsa, 51 ConjunctsInUnsatCore, 28 InterpolantComputations, 9 PerfectInterpolantSequences, 1038/1596 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-01-09 21:22:26,438 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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)