./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_72-funloop_hard_racing.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version c00e63dc 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/28-race_reach_72-funloop_hard_racing.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 566e2cbe460cf96671c9cef5a53ce51910e23c462e96f394be80b957976729c5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 09:26:17,848 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 09:26:17,890 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-06 09:26:17,893 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 09:26:17,893 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 09:26:17,907 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 09:26:17,908 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 09:26:17,908 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 09:26:17,908 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 09:26:17,909 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 09:26:17,909 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 09:26:17,909 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 09:26:17,909 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 09:26:17,909 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 09:26:17,909 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 09:26:17,909 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 09:26:17,909 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 09:26:17,909 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 09:26:17,909 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 09:26:17,910 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 09:26:17,910 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 09:26:17,910 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 09:26:17,910 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-06 09:26:17,910 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 09:26:17,910 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 09:26:17,910 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 09:26:17,910 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 09:26:17,910 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 09:26:17,910 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 09:26:17,910 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 09:26:17,911 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 09:26:17,911 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:26:17,911 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 09:26:17,911 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 09:26:17,911 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 09:26:17,911 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 09:26:17,911 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 09:26:17,911 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 09:26:17,911 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 09:26:17,911 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 09:26:17,911 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 09:26:17,911 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 09:26:17,911 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 -> 566e2cbe460cf96671c9cef5a53ce51910e23c462e96f394be80b957976729c5 [2025-02-06 09:26:18,237 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 09:26:18,246 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 09:26:18,247 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 09:26:18,248 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 09:26:18,248 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 09:26:18,249 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_72-funloop_hard_racing.i [2025-02-06 09:26:19,406 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/302805795/eea9453a28b24774b91eb31140fc4fa2/FLAG4c3a8fef8 [2025-02-06 09:26:19,728 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 09:26:19,730 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_72-funloop_hard_racing.i [2025-02-06 09:26:19,746 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/302805795/eea9453a28b24774b91eb31140fc4fa2/FLAG4c3a8fef8 [2025-02-06 09:26:19,756 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/302805795/eea9453a28b24774b91eb31140fc4fa2 [2025-02-06 09:26:19,758 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 09:26:19,759 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 09:26:19,761 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 09:26:19,762 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 09:26:19,764 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 09:26:19,765 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:26:19" (1/1) ... [2025-02-06 09:26:19,765 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@655b42f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:26:19, skipping insertion in model container [2025-02-06 09:26:19,765 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:26:19" (1/1) ... [2025-02-06 09:26:19,795 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 09:26:20,120 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:26:20,152 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 09:26:20,210 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:26:20,250 INFO L204 MainTranslator]: Completed translation [2025-02-06 09:26:20,250 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:26:20 WrapperNode [2025-02-06 09:26:20,251 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 09:26:20,252 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 09:26:20,252 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 09:26:20,252 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 09:26:20,260 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:26:20" (1/1) ... [2025-02-06 09:26:20,285 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:26:20" (1/1) ... [2025-02-06 09:26:20,316 INFO L138 Inliner]: procedures = 272, calls = 110, calls flagged for inlining = 7, calls inlined = 10, statements flattened = 418 [2025-02-06 09:26:20,320 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 09:26:20,321 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 09:26:20,321 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 09:26:20,321 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 09:26:20,326 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:26:20" (1/1) ... [2025-02-06 09:26:20,326 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:26:20" (1/1) ... [2025-02-06 09:26:20,333 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:26:20" (1/1) ... [2025-02-06 09:26:20,338 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:26:20" (1/1) ... [2025-02-06 09:26:20,351 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:26:20" (1/1) ... [2025-02-06 09:26:20,352 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:26:20" (1/1) ... [2025-02-06 09:26:20,354 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:26:20" (1/1) ... [2025-02-06 09:26:20,355 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:26:20" (1/1) ... [2025-02-06 09:26:20,358 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 09:26:20,358 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 09:26:20,358 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 09:26:20,358 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 09:26:20,359 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:26:20" (1/1) ... [2025-02-06 09:26:20,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:26:20,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:26:20,383 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-02-06 09:26:20,386 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-02-06 09:26:20,402 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 09:26:20,402 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 09:26:20,402 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-06 09:26:20,402 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-06 09:26:20,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-06 09:26:20,403 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-06 09:26:20,403 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 09:26:20,403 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-02-06 09:26:20,403 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-02-06 09:26:20,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-06 09:26:20,403 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 09:26:20,403 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 09:26:20,404 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 09:26:20,501 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 09:26:20,503 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 09:26:20,926 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L953: havoc main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset; [2025-02-06 09:26:20,927 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L953-1: SUMMARY for call ULTIMATE.dealloc(main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset); srcloc: null [2025-02-06 09:26:21,043 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 09:26:21,043 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 09:26:21,095 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 09:26:21,095 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 09:26:21,095 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:26:21 BoogieIcfgContainer [2025-02-06 09:26:21,096 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 09:26:21,097 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 09:26:21,097 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 09:26:21,101 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 09:26:21,101 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 09:26:19" (1/3) ... [2025-02-06 09:26:21,102 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@286fbd4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:26:21, skipping insertion in model container [2025-02-06 09:26:21,102 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:26:20" (2/3) ... [2025-02-06 09:26:21,102 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@286fbd4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:26:21, skipping insertion in model container [2025-02-06 09:26:21,103 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:26:21" (3/3) ... [2025-02-06 09:26:21,104 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_72-funloop_hard_racing.i [2025-02-06 09:26:21,116 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 09:26:21,119 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_72-funloop_hard_racing.i that has 2 procedures, 410 locations, 1 initial locations, 20 loop locations, and 17 error locations. [2025-02-06 09:26:21,119 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 09:26:21,202 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-02-06 09:26:21,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 413 places, 453 transitions, 913 flow [2025-02-06 09:26:21,388 INFO L124 PetriNetUnfolderBase]: 70/694 cut-off events. [2025-02-06 09:26:21,390 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 09:26:21,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 699 conditions, 694 events. 70/694 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 3512 event pairs, 0 based on Foata normal form. 0/592 useless extension candidates. Maximal degree in co-relation 359. Up to 8 conditions per place. [2025-02-06 09:26:21,404 INFO L82 GeneralOperation]: Start removeDead. Operand has 413 places, 453 transitions, 913 flow [2025-02-06 09:26:21,414 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 413 places, 453 transitions, 913 flow [2025-02-06 09:26:21,424 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 09:26:21,435 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;@6b58e61c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 09:26:21,436 INFO L334 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2025-02-06 09:26:21,452 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 09:26:21,454 INFO L124 PetriNetUnfolderBase]: 1/117 cut-off events. [2025-02-06 09:26:21,454 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:26:21,454 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:26:21,455 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:26:21,455 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-02-06 09:26:21,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:26:21,460 INFO L85 PathProgramCache]: Analyzing trace with hash 169507832, now seen corresponding path program 1 times [2025-02-06 09:26:21,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:26:21,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61015272] [2025-02-06 09:26:21,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:26:21,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:26:21,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-06 09:26:21,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-06 09:26:21,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:26:21,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:26:21,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:26:21,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:26:21,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61015272] [2025-02-06 09:26:21,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61015272] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:26:21,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:26:21,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 09:26:21,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661383562] [2025-02-06 09:26:21,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:26:21,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:26:21,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:26:21,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:26:21,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:26:21,843 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 382 out of 453 [2025-02-06 09:26:21,847 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 413 places, 453 transitions, 913 flow. Second operand has 3 states, 3 states have (on average 383.3333333333333) internal successors, (1150), 3 states have internal predecessors, (1150), 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-02-06 09:26:21,847 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:26:21,847 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 382 of 453 [2025-02-06 09:26:21,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:26:22,251 INFO L124 PetriNetUnfolderBase]: 181/2448 cut-off events. [2025-02-06 09:26:22,251 INFO L125 PetriNetUnfolderBase]: For 7/8 co-relation queries the response was YES. [2025-02-06 09:26:22,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2795 conditions, 2448 events. 181/2448 cut-off events. For 7/8 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 20392 event pairs, 136 based on Foata normal form. 453/2703 useless extension candidates. Maximal degree in co-relation 2450. Up to 340 conditions per place. [2025-02-06 09:26:22,264 INFO L140 encePairwiseOnDemand]: 414/453 looper letters, 31 selfloop transitions, 2 changer transitions 0/412 dead transitions. [2025-02-06 09:26:22,266 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 409 places, 412 transitions, 897 flow [2025-02-06 09:26:22,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:26:22,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:26:22,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1216 transitions. [2025-02-06 09:26:22,281 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8947755702722591 [2025-02-06 09:26:22,284 INFO L175 Difference]: Start difference. First operand has 413 places, 453 transitions, 913 flow. Second operand 3 states and 1216 transitions. [2025-02-06 09:26:22,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 409 places, 412 transitions, 897 flow [2025-02-06 09:26:22,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 409 places, 412 transitions, 897 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:26:22,306 INFO L231 Difference]: Finished difference. Result has 410 places, 412 transitions, 841 flow [2025-02-06 09:26:22,309 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=453, PETRI_DIFFERENCE_MINUEND_FLOW=829, PETRI_DIFFERENCE_MINUEND_PLACES=407, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=411, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=409, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=841, PETRI_PLACES=410, PETRI_TRANSITIONS=412} [2025-02-06 09:26:22,313 INFO L279 CegarLoopForPetriNet]: 413 programPoint places, -3 predicate places. [2025-02-06 09:26:22,313 INFO L471 AbstractCegarLoop]: Abstraction has has 410 places, 412 transitions, 841 flow [2025-02-06 09:26:22,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 383.3333333333333) internal successors, (1150), 3 states have internal predecessors, (1150), 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-02-06 09:26:22,314 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:26:22,314 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:26:22,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 09:26:22,314 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-02-06 09:26:22,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:26:22,315 INFO L85 PathProgramCache]: Analyzing trace with hash -1527609582, now seen corresponding path program 1 times [2025-02-06 09:26:22,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:26:22,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994419165] [2025-02-06 09:26:22,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:26:22,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:26:22,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-06 09:26:22,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-06 09:26:22,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:26:22,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:26:22,482 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:26:22,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:26:22,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994419165] [2025-02-06 09:26:22,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994419165] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 09:26:22,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1532533799] [2025-02-06 09:26:22,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:26:22,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:26:22,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:26:22,490 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-02-06 09:26:22,494 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-02-06 09:26:22,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-06 09:26:22,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-06 09:26:22,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:26:22,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:26:22,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 09:26:22,602 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 09:26:22,661 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:26:22,661 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 09:26:22,695 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:26:22,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1532533799] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 09:26:22,698 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 09:26:22,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-02-06 09:26:22,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312453789] [2025-02-06 09:26:22,699 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 09:26:22,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 09:26:22,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:26:22,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 09:26:22,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-06 09:26:22,723 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 379 out of 453 [2025-02-06 09:26:22,727 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 410 places, 412 transitions, 841 flow. Second operand has 10 states, 10 states have (on average 380.8) internal successors, (3808), 10 states have internal predecessors, (3808), 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-02-06 09:26:22,727 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:26:22,727 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 379 of 453 [2025-02-06 09:26:22,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:26:23,159 INFO L124 PetriNetUnfolderBase]: 181/2455 cut-off events. [2025-02-06 09:26:23,159 INFO L125 PetriNetUnfolderBase]: For 8/9 co-relation queries the response was YES. [2025-02-06 09:26:23,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2821 conditions, 2455 events. 181/2455 cut-off events. For 8/9 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 20396 event pairs, 136 based on Foata normal form. 2/2259 useless extension candidates. Maximal degree in co-relation 2726. Up to 340 conditions per place. [2025-02-06 09:26:23,171 INFO L140 encePairwiseOnDemand]: 447/453 looper letters, 35 selfloop transitions, 9 changer transitions 0/420 dead transitions. [2025-02-06 09:26:23,171 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 418 places, 420 transitions, 947 flow [2025-02-06 09:26:23,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 09:26:23,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-06 09:26:23,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 3457 transitions. [2025-02-06 09:26:23,205 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8479273975962718 [2025-02-06 09:26:23,205 INFO L175 Difference]: Start difference. First operand has 410 places, 412 transitions, 841 flow. Second operand 9 states and 3457 transitions. [2025-02-06 09:26:23,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 418 places, 420 transitions, 947 flow [2025-02-06 09:26:23,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 417 places, 420 transitions, 945 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:26:23,210 INFO L231 Difference]: Finished difference. Result has 420 places, 418 transitions, 889 flow [2025-02-06 09:26:23,211 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=453, PETRI_DIFFERENCE_MINUEND_FLOW=839, PETRI_DIFFERENCE_MINUEND_PLACES=409, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=412, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=406, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=889, PETRI_PLACES=420, PETRI_TRANSITIONS=418} [2025-02-06 09:26:23,211 INFO L279 CegarLoopForPetriNet]: 413 programPoint places, 7 predicate places. [2025-02-06 09:26:23,211 INFO L471 AbstractCegarLoop]: Abstraction has has 420 places, 418 transitions, 889 flow [2025-02-06 09:26:23,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 380.8) internal successors, (3808), 10 states have internal predecessors, (3808), 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-02-06 09:26:23,213 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:26:23,213 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:26:23,220 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-06 09:26:23,414 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-02-06 09:26:23,414 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-02-06 09:26:23,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:26:23,418 INFO L85 PathProgramCache]: Analyzing trace with hash -494416174, now seen corresponding path program 2 times [2025-02-06 09:26:23,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:26:23,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348701662] [2025-02-06 09:26:23,419 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 09:26:23,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:26:23,439 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 108 statements into 2 equivalence classes. [2025-02-06 09:26:23,446 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 93 of 108 statements. [2025-02-06 09:26:23,447 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 09:26:23,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:26:23,823 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-06 09:26:23,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:26:23,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348701662] [2025-02-06 09:26:23,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348701662] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:26:23,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:26:23,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:26:23,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952981518] [2025-02-06 09:26:23,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:26:23,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:26:23,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:26:23,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:26:23,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:26:24,147 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 310 out of 453 [2025-02-06 09:26:24,149 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 420 places, 418 transitions, 889 flow. Second operand has 6 states, 6 states have (on average 311.5) internal successors, (1869), 6 states have internal predecessors, (1869), 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-02-06 09:26:24,150 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:26:24,150 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 310 of 453 [2025-02-06 09:26:24,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:26:25,401 INFO L124 PetriNetUnfolderBase]: 2315/9255 cut-off events. [2025-02-06 09:26:25,401 INFO L125 PetriNetUnfolderBase]: For 11/14 co-relation queries the response was YES. [2025-02-06 09:26:25,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13840 conditions, 9255 events. 2315/9255 cut-off events. For 11/14 co-relation queries the response was YES. Maximal size of possible extension queue 223. Compared 94553 event pairs, 1632 based on Foata normal form. 0/8469 useless extension candidates. Maximal degree in co-relation 13716. Up to 4323 conditions per place. [2025-02-06 09:26:25,431 INFO L140 encePairwiseOnDemand]: 426/453 looper letters, 135 selfloop transitions, 86 changer transitions 0/535 dead transitions. [2025-02-06 09:26:25,431 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 425 places, 535 transitions, 1565 flow [2025-02-06 09:26:25,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:26:25,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:26:25,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2082 transitions. [2025-02-06 09:26:25,435 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7660044150110376 [2025-02-06 09:26:25,435 INFO L175 Difference]: Start difference. First operand has 420 places, 418 transitions, 889 flow. Second operand 6 states and 2082 transitions. [2025-02-06 09:26:25,435 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 425 places, 535 transitions, 1565 flow [2025-02-06 09:26:25,438 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 424 places, 535 transitions, 1559 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-02-06 09:26:25,443 INFO L231 Difference]: Finished difference. Result has 429 places, 503 transitions, 1449 flow [2025-02-06 09:26:25,443 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=453, PETRI_DIFFERENCE_MINUEND_FLOW=883, PETRI_DIFFERENCE_MINUEND_PLACES=419, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=418, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=392, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1449, PETRI_PLACES=429, PETRI_TRANSITIONS=503} [2025-02-06 09:26:25,444 INFO L279 CegarLoopForPetriNet]: 413 programPoint places, 16 predicate places. [2025-02-06 09:26:25,444 INFO L471 AbstractCegarLoop]: Abstraction has has 429 places, 503 transitions, 1449 flow [2025-02-06 09:26:25,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 311.5) internal successors, (1869), 6 states have internal predecessors, (1869), 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-02-06 09:26:25,445 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:26:25,445 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:26:25,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 09:26:25,446 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-02-06 09:26:25,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:26:25,446 INFO L85 PathProgramCache]: Analyzing trace with hash 1258061004, now seen corresponding path program 1 times [2025-02-06 09:26:25,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:26:25,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787571922] [2025-02-06 09:26:25,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:26:25,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:26:25,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-02-06 09:26:25,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-02-06 09:26:25,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:26:25,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:26:25,590 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-06 09:26:25,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:26:25,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787571922] [2025-02-06 09:26:25,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787571922] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:26:25,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:26:25,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 09:26:25,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286202286] [2025-02-06 09:26:25,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:26:25,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:26:25,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:26:25,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:26:25,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:26:25,637 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 382 out of 453 [2025-02-06 09:26:25,639 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 429 places, 503 transitions, 1449 flow. Second operand has 3 states, 3 states have (on average 384.0) internal successors, (1152), 3 states have internal predecessors, (1152), 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-02-06 09:26:25,639 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:26:25,639 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 382 of 453 [2025-02-06 09:26:25,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:26:26,061 INFO L124 PetriNetUnfolderBase]: 369/3131 cut-off events. [2025-02-06 09:26:26,061 INFO L125 PetriNetUnfolderBase]: For 158/183 co-relation queries the response was YES. [2025-02-06 09:26:26,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4219 conditions, 3131 events. 369/3131 cut-off events. For 158/183 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 28173 event pairs, 152 based on Foata normal form. 1/2878 useless extension candidates. Maximal degree in co-relation 4093. Up to 410 conditions per place. [2025-02-06 09:26:26,079 INFO L140 encePairwiseOnDemand]: 450/453 looper letters, 38 selfloop transitions, 3 changer transitions 0/511 dead transitions. [2025-02-06 09:26:26,080 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 431 places, 511 transitions, 1547 flow [2025-02-06 09:26:26,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:26:26,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:26:26,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1187 transitions. [2025-02-06 09:26:26,083 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8734363502575423 [2025-02-06 09:26:26,083 INFO L175 Difference]: Start difference. First operand has 429 places, 503 transitions, 1449 flow. Second operand 3 states and 1187 transitions. [2025-02-06 09:26:26,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 431 places, 511 transitions, 1547 flow [2025-02-06 09:26:26,089 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 431 places, 511 transitions, 1547 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:26:26,093 INFO L231 Difference]: Finished difference. Result has 432 places, 503 transitions, 1460 flow [2025-02-06 09:26:26,094 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=453, PETRI_DIFFERENCE_MINUEND_FLOW=1449, PETRI_DIFFERENCE_MINUEND_PLACES=429, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=503, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=500, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1460, PETRI_PLACES=432, PETRI_TRANSITIONS=503} [2025-02-06 09:26:26,095 INFO L279 CegarLoopForPetriNet]: 413 programPoint places, 19 predicate places. [2025-02-06 09:26:26,095 INFO L471 AbstractCegarLoop]: Abstraction has has 432 places, 503 transitions, 1460 flow [2025-02-06 09:26:26,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 384.0) internal successors, (1152), 3 states have internal predecessors, (1152), 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-02-06 09:26:26,096 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:26:26,096 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 09:26:26,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 09:26:26,096 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-02-06 09:26:26,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:26:26,097 INFO L85 PathProgramCache]: Analyzing trace with hash 983535438, now seen corresponding path program 1 times [2025-02-06 09:26:26,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:26:26,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034173033] [2025-02-06 09:26:26,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:26:26,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:26:26,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-06 09:26:26,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-06 09:26:26,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:26:26,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:26:26,254 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:26:26,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:26:26,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034173033] [2025-02-06 09:26:26,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034173033] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 09:26:26,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1727615380] [2025-02-06 09:26:26,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:26:26,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:26:26,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:26:26,256 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-02-06 09:26:26,258 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-02-06 09:26:26,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-06 09:26:26,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-06 09:26:26,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:26:26,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:26:26,335 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 09:26:26,337 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 09:26:26,376 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:26:26,377 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 09:26:26,463 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:26:26,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1727615380] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 09:26:26,463 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 09:26:26,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-02-06 09:26:26,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032106034] [2025-02-06 09:26:26,463 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 09:26:26,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-06 09:26:26,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:26:26,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-06 09:26:26,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-02-06 09:26:26,489 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 379 out of 453 [2025-02-06 09:26:26,495 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 432 places, 503 transitions, 1460 flow. Second operand has 18 states, 18 states have (on average 380.94444444444446) internal successors, (6857), 18 states have internal predecessors, (6857), 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-02-06 09:26:26,495 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:26:26,495 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 379 of 453 [2025-02-06 09:26:26,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:26:26,982 INFO L124 PetriNetUnfolderBase]: 354/3196 cut-off events. [2025-02-06 09:26:26,983 INFO L125 PetriNetUnfolderBase]: For 168/210 co-relation queries the response was YES. [2025-02-06 09:26:26,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4659 conditions, 3196 events. 354/3196 cut-off events. For 168/210 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 28763 event pairs, 136 based on Foata normal form. 4/2964 useless extension candidates. Maximal degree in co-relation 4457. Up to 596 conditions per place. [2025-02-06 09:26:26,999 INFO L140 encePairwiseOnDemand]: 447/453 looper letters, 39 selfloop transitions, 21 changer transitions 0/521 dead transitions. [2025-02-06 09:26:27,001 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 452 places, 521 transitions, 1668 flow [2025-02-06 09:26:27,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-06 09:26:27,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-02-06 09:26:27,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 8023 transitions. [2025-02-06 09:26:27,012 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8433722274781877 [2025-02-06 09:26:27,012 INFO L175 Difference]: Start difference. First operand has 432 places, 503 transitions, 1460 flow. Second operand 21 states and 8023 transitions. [2025-02-06 09:26:27,013 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 452 places, 521 transitions, 1668 flow [2025-02-06 09:26:27,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 450 places, 521 transitions, 1662 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:26:27,023 INFO L231 Difference]: Finished difference. Result has 455 places, 516 transitions, 1584 flow [2025-02-06 09:26:27,025 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=453, PETRI_DIFFERENCE_MINUEND_FLOW=1454, PETRI_DIFFERENCE_MINUEND_PLACES=430, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=503, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=492, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=1584, PETRI_PLACES=455, PETRI_TRANSITIONS=516} [2025-02-06 09:26:27,026 INFO L279 CegarLoopForPetriNet]: 413 programPoint places, 42 predicate places. [2025-02-06 09:26:27,026 INFO L471 AbstractCegarLoop]: Abstraction has has 455 places, 516 transitions, 1584 flow [2025-02-06 09:26:27,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 380.94444444444446) internal successors, (6857), 18 states have internal predecessors, (6857), 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-02-06 09:26:27,029 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:26:27,029 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 09:26:27,037 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 09:26:27,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:26:27,235 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-02-06 09:26:27,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:26:27,236 INFO L85 PathProgramCache]: Analyzing trace with hash -770826290, now seen corresponding path program 2 times [2025-02-06 09:26:27,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:26:27,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719712791] [2025-02-06 09:26:27,237 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 09:26:27,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:26:27,249 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 143 statements into 2 equivalence classes. [2025-02-06 09:26:27,267 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 143 of 143 statements. [2025-02-06 09:26:27,269 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 09:26:27,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:26:27,536 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:26:27,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:26:27,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719712791] [2025-02-06 09:26:27,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719712791] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 09:26:27,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1698788320] [2025-02-06 09:26:27,536 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 09:26:27,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:26:27,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:26:27,541 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-02-06 09:26:27,545 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-02-06 09:26:27,606 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 143 statements into 2 equivalence classes. [2025-02-06 09:26:27,650 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 143 of 143 statements. [2025-02-06 09:26:27,650 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 09:26:27,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:26:27,652 INFO L256 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-06 09:26:27,655 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 09:26:27,730 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:26:27,730 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 09:26:27,934 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:26:27,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1698788320] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 09:26:27,938 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 09:26:27,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2025-02-06 09:26:27,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782235763] [2025-02-06 09:26:27,938 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 09:26:27,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-06 09:26:27,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:26:27,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-06 09:26:27,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-02-06 09:26:27,973 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 379 out of 453 [2025-02-06 09:26:27,983 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 455 places, 516 transitions, 1584 flow. Second operand has 23 states, 23 states have (on average 381.04347826086956) internal successors, (8764), 23 states have internal predecessors, (8764), 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-02-06 09:26:27,983 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:26:27,983 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 379 of 453 [2025-02-06 09:26:27,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:26:28,692 INFO L124 PetriNetUnfolderBase]: 354/3211 cut-off events. [2025-02-06 09:26:28,693 INFO L125 PetriNetUnfolderBase]: For 269/311 co-relation queries the response was YES. [2025-02-06 09:26:28,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4759 conditions, 3211 events. 354/3211 cut-off events. For 269/311 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 28768 event pairs, 136 based on Foata normal form. 3/2978 useless extension candidates. Maximal degree in co-relation 4457. Up to 596 conditions per place. [2025-02-06 09:26:28,709 INFO L140 encePairwiseOnDemand]: 447/453 looper letters, 42 selfloop transitions, 30 changer transitions 0/533 dead transitions. [2025-02-06 09:26:28,709 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 484 places, 533 transitions, 1856 flow [2025-02-06 09:26:28,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-02-06 09:26:28,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-02-06 09:26:28,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 11445 transitions. [2025-02-06 09:26:28,725 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8421633554083885 [2025-02-06 09:26:28,725 INFO L175 Difference]: Start difference. First operand has 455 places, 516 transitions, 1584 flow. Second operand 30 states and 11445 transitions. [2025-02-06 09:26:28,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 484 places, 533 transitions, 1856 flow [2025-02-06 09:26:28,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 478 places, 533 transitions, 1826 flow, removed 9 selfloop flow, removed 6 redundant places. [2025-02-06 09:26:28,736 INFO L231 Difference]: Finished difference. Result has 482 places, 526 transitions, 1712 flow [2025-02-06 09:26:28,737 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=453, PETRI_DIFFERENCE_MINUEND_FLOW=1560, PETRI_DIFFERENCE_MINUEND_PLACES=449, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=516, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=493, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=1712, PETRI_PLACES=482, PETRI_TRANSITIONS=526} [2025-02-06 09:26:28,737 INFO L279 CegarLoopForPetriNet]: 413 programPoint places, 69 predicate places. [2025-02-06 09:26:28,737 INFO L471 AbstractCegarLoop]: Abstraction has has 482 places, 526 transitions, 1712 flow [2025-02-06 09:26:28,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 381.04347826086956) internal successors, (8764), 23 states have internal predecessors, (8764), 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-02-06 09:26:28,740 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:26:28,741 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 09:26:28,747 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-06 09:26:28,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:26:28,941 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-02-06 09:26:28,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:26:28,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1765427240, now seen corresponding path program 3 times [2025-02-06 09:26:28,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:26:28,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741457299] [2025-02-06 09:26:28,942 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 09:26:28,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:26:28,957 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 158 statements into 11 equivalence classes. [2025-02-06 09:26:29,017 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 158 of 158 statements. [2025-02-06 09:26:29,017 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-02-06 09:26:29,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 09:26:29,017 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 09:26:29,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-02-06 09:26:29,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-02-06 09:26:29,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:26:29,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 09:26:29,073 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 09:26:29,074 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 09:26:29,074 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 23 remaining) [2025-02-06 09:26:29,076 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (21 of 23 remaining) [2025-02-06 09:26:29,077 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (20 of 23 remaining) [2025-02-06 09:26:29,077 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (19 of 23 remaining) [2025-02-06 09:26:29,077 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (18 of 23 remaining) [2025-02-06 09:26:29,078 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (17 of 23 remaining) [2025-02-06 09:26:29,078 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (16 of 23 remaining) [2025-02-06 09:26:29,078 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (15 of 23 remaining) [2025-02-06 09:26:29,078 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (14 of 23 remaining) [2025-02-06 09:26:29,078 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (13 of 23 remaining) [2025-02-06 09:26:29,078 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (12 of 23 remaining) [2025-02-06 09:26:29,081 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (11 of 23 remaining) [2025-02-06 09:26:29,081 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (10 of 23 remaining) [2025-02-06 09:26:29,081 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (9 of 23 remaining) [2025-02-06 09:26:29,081 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (8 of 23 remaining) [2025-02-06 09:26:29,081 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (7 of 23 remaining) [2025-02-06 09:26:29,081 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (6 of 23 remaining) [2025-02-06 09:26:29,081 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (5 of 23 remaining) [2025-02-06 09:26:29,082 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (4 of 23 remaining) [2025-02-06 09:26:29,082 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (3 of 23 remaining) [2025-02-06 09:26:29,082 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (2 of 23 remaining) [2025-02-06 09:26:29,082 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (1 of 23 remaining) [2025-02-06 09:26:29,082 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 23 remaining) [2025-02-06 09:26:29,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 09:26:29,082 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1] [2025-02-06 09:26:29,084 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 09:26:29,084 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-06 09:26:29,134 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-06 09:26:29,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 517 places, 570 transitions, 1156 flow [2025-02-06 09:26:29,274 INFO L124 PetriNetUnfolderBase]: 113/1079 cut-off events. [2025-02-06 09:26:29,274 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-06 09:26:29,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1091 conditions, 1079 events. 113/1079 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 6389 event pairs, 0 based on Foata normal form. 0/915 useless extension candidates. Maximal degree in co-relation 696. Up to 12 conditions per place. [2025-02-06 09:26:29,284 INFO L82 GeneralOperation]: Start removeDead. Operand has 517 places, 570 transitions, 1156 flow [2025-02-06 09:26:29,290 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 517 places, 570 transitions, 1156 flow [2025-02-06 09:26:29,291 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 09:26:29,291 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;@6b58e61c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 09:26:29,291 INFO L334 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2025-02-06 09:26:29,299 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 09:26:29,299 INFO L124 PetriNetUnfolderBase]: 1/117 cut-off events. [2025-02-06 09:26:29,299 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:26:29,299 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:26:29,300 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:26:29,300 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2025-02-06 09:26:29,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:26:29,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1969115314, now seen corresponding path program 1 times [2025-02-06 09:26:29,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:26:29,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908065148] [2025-02-06 09:26:29,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:26:29,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:26:29,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-06 09:26:29,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-06 09:26:29,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:26:29,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:26:29,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:26:29,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:26:29,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908065148] [2025-02-06 09:26:29,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908065148] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:26:29,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:26:29,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 09:26:29,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260493677] [2025-02-06 09:26:29,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:26:29,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:26:29,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:26:29,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:26:29,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:26:29,353 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 476 out of 570 [2025-02-06 09:26:29,354 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 517 places, 570 transitions, 1156 flow. Second operand has 3 states, 3 states have (on average 477.3333333333333) internal successors, (1432), 3 states have internal predecessors, (1432), 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-02-06 09:26:29,354 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:26:29,354 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 476 of 570 [2025-02-06 09:26:29,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:26:31,928 INFO L124 PetriNetUnfolderBase]: 3251/23508 cut-off events. [2025-02-06 09:26:31,928 INFO L125 PetriNetUnfolderBase]: For 149/153 co-relation queries the response was YES. [2025-02-06 09:26:31,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28288 conditions, 23508 events. 3251/23508 cut-off events. For 149/153 co-relation queries the response was YES. Maximal size of possible extension queue 526. Compared 319924 event pairs, 2680 based on Foata normal form. 6277/27918 useless extension candidates. Maximal degree in co-relation 25286. Up to 4707 conditions per place. [2025-02-06 09:26:32,065 INFO L140 encePairwiseOnDemand]: 519/570 looper letters, 41 selfloop transitions, 2 changer transitions 0/515 dead transitions. [2025-02-06 09:26:32,066 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 511 places, 515 transitions, 1132 flow [2025-02-06 09:26:32,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:26:32,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:26:32,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1520 transitions. [2025-02-06 09:26:32,068 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8888888888888888 [2025-02-06 09:26:32,069 INFO L175 Difference]: Start difference. First operand has 517 places, 570 transitions, 1156 flow. Second operand 3 states and 1520 transitions. [2025-02-06 09:26:32,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 511 places, 515 transitions, 1132 flow [2025-02-06 09:26:32,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 511 places, 515 transitions, 1132 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:26:32,076 INFO L231 Difference]: Finished difference. Result has 512 places, 515 transitions, 1056 flow [2025-02-06 09:26:32,076 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=570, PETRI_DIFFERENCE_MINUEND_FLOW=1044, PETRI_DIFFERENCE_MINUEND_PLACES=509, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=514, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=512, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1056, PETRI_PLACES=512, PETRI_TRANSITIONS=515} [2025-02-06 09:26:32,077 INFO L279 CegarLoopForPetriNet]: 517 programPoint places, -5 predicate places. [2025-02-06 09:26:32,077 INFO L471 AbstractCegarLoop]: Abstraction has has 512 places, 515 transitions, 1056 flow [2025-02-06 09:26:32,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 477.3333333333333) internal successors, (1432), 3 states have internal predecessors, (1432), 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-02-06 09:26:32,078 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:26:32,078 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:26:32,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 09:26:32,078 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2025-02-06 09:26:32,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:26:32,079 INFO L85 PathProgramCache]: Analyzing trace with hash -322655662, now seen corresponding path program 1 times [2025-02-06 09:26:32,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:26:32,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970614706] [2025-02-06 09:26:32,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:26:32,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:26:32,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-06 09:26:32,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-06 09:26:32,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:26:32,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:26:32,162 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:26:32,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:26:32,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970614706] [2025-02-06 09:26:32,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970614706] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 09:26:32,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1201922690] [2025-02-06 09:26:32,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:26:32,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:26:32,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:26:32,167 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-02-06 09:26:32,170 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-02-06 09:26:32,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-06 09:26:32,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-06 09:26:32,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:26:32,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:26:32,251 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 09:26:32,253 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 09:26:32,278 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:26:32,278 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 09:26:32,303 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:26:32,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1201922690] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 09:26:32,304 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 09:26:32,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-02-06 09:26:32,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729510639] [2025-02-06 09:26:32,304 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 09:26:32,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 09:26:32,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:26:32,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 09:26:32,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-06 09:26:32,322 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 473 out of 570 [2025-02-06 09:26:32,326 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 512 places, 515 transitions, 1056 flow. Second operand has 10 states, 10 states have (on average 474.8) internal successors, (4748), 10 states have internal predecessors, (4748), 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-02-06 09:26:32,326 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:26:32,326 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 473 of 570 [2025-02-06 09:26:32,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:26:35,102 INFO L124 PetriNetUnfolderBase]: 3251/23515 cut-off events. [2025-02-06 09:26:35,102 INFO L125 PetriNetUnfolderBase]: For 152/156 co-relation queries the response was YES. [2025-02-06 09:26:35,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28314 conditions, 23515 events. 3251/23515 cut-off events. For 152/156 co-relation queries the response was YES. Maximal size of possible extension queue 526. Compared 320098 event pairs, 2680 based on Foata normal form. 2/21650 useless extension candidates. Maximal degree in co-relation 28218. Up to 4707 conditions per place. [2025-02-06 09:26:35,228 INFO L140 encePairwiseOnDemand]: 564/570 looper letters, 45 selfloop transitions, 9 changer transitions 0/523 dead transitions. [2025-02-06 09:26:35,229 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 520 places, 523 transitions, 1182 flow [2025-02-06 09:26:35,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 09:26:35,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-06 09:26:35,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 4313 transitions. [2025-02-06 09:26:35,234 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8407407407407408 [2025-02-06 09:26:35,234 INFO L175 Difference]: Start difference. First operand has 512 places, 515 transitions, 1056 flow. Second operand 9 states and 4313 transitions. [2025-02-06 09:26:35,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 520 places, 523 transitions, 1182 flow [2025-02-06 09:26:35,237 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 519 places, 523 transitions, 1180 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:26:35,240 INFO L231 Difference]: Finished difference. Result has 522 places, 521 transitions, 1104 flow [2025-02-06 09:26:35,241 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=570, PETRI_DIFFERENCE_MINUEND_FLOW=1054, PETRI_DIFFERENCE_MINUEND_PLACES=511, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=515, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=509, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1104, PETRI_PLACES=522, PETRI_TRANSITIONS=521} [2025-02-06 09:26:35,242 INFO L279 CegarLoopForPetriNet]: 517 programPoint places, 5 predicate places. [2025-02-06 09:26:35,242 INFO L471 AbstractCegarLoop]: Abstraction has has 522 places, 521 transitions, 1104 flow [2025-02-06 09:26:35,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 474.8) internal successors, (4748), 10 states have internal predecessors, (4748), 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-02-06 09:26:35,243 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:26:35,243 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:26:35,252 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-02-06 09:26:35,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-02-06 09:26:35,448 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2025-02-06 09:26:35,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:26:35,449 INFO L85 PathProgramCache]: Analyzing trace with hash -1771035054, now seen corresponding path program 2 times [2025-02-06 09:26:35,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:26:35,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664658815] [2025-02-06 09:26:35,449 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 09:26:35,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:26:35,460 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 108 statements into 2 equivalence classes. [2025-02-06 09:26:35,468 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 93 of 108 statements. [2025-02-06 09:26:35,468 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 09:26:35,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:26:35,670 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-06 09:26:35,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:26:35,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664658815] [2025-02-06 09:26:35,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664658815] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:26:35,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:26:35,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:26:35,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121120006] [2025-02-06 09:26:35,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:26:35,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:26:35,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:26:35,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:26:35,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:26:36,087 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 384 out of 570 [2025-02-06 09:26:36,090 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 522 places, 521 transitions, 1104 flow. Second operand has 6 states, 6 states have (on average 385.5) internal successors, (2313), 6 states have internal predecessors, (2313), 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-02-06 09:26:36,090 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:26:36,090 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 384 of 570 [2025-02-06 09:26:36,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand