./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-ext/11_fmaxsymopt-race.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-ext/11_fmaxsymopt-race.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 c885fc256284ed3b5456c69b30daa307e14001acfa6c144983451f9519cbd1fd --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:04:41,602 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:04:41,648 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-01-09 21:04:41,651 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:04:41,652 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:04:41,663 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:04:41,664 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:04:41,664 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:04:41,664 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:04:41,664 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:04:41,664 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:04:41,664 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:04:41,665 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:04:41,665 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:04:41,665 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:04:41,665 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:04:41,665 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:04:41,665 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:04:41,665 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:04:41,665 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:04:41,665 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:04:41,665 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:04:41,665 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:04:41,665 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:04:41,666 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:04:41,666 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:04:41,666 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:04:41,666 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:04:41,666 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:04:41,666 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:04:41,666 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:04:41,666 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:04:41,666 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:04:41,666 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:04:41,666 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:04:41,666 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:04:41,666 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:04:41,666 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:04:41,667 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:04:41,667 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:04:41,667 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:04:41,667 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:04:41,667 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:04:41,667 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:04:41,667 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:04:41,667 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:04:41,667 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 -> c885fc256284ed3b5456c69b30daa307e14001acfa6c144983451f9519cbd1fd [2025-01-09 21:04:41,962 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:04:41,969 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:04:41,970 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:04:41,971 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:04:41,972 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:04:41,972 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/11_fmaxsymopt-race.i [2025-01-09 21:04:43,086 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4fe56a7a6/a77c4e50a5354e81b3ec8a21fcebe5b3/FLAG406d11db1 [2025-01-09 21:04:43,387 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:04:43,388 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-ext/11_fmaxsymopt-race.i [2025-01-09 21:04:43,400 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4fe56a7a6/a77c4e50a5354e81b3ec8a21fcebe5b3/FLAG406d11db1 [2025-01-09 21:04:43,413 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4fe56a7a6/a77c4e50a5354e81b3ec8a21fcebe5b3 [2025-01-09 21:04:43,415 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:04:43,417 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:04:43,422 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:04:43,422 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:04:43,425 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:04:43,426 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:04:43" (1/1) ... [2025-01-09 21:04:43,430 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ef49d2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:04:43, skipping insertion in model container [2025-01-09 21:04:43,430 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:04:43" (1/1) ... [2025-01-09 21:04:43,457 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:04:43,650 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:04:43,660 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:04:43,704 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:04:43,734 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:04:43,735 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:04:43 WrapperNode [2025-01-09 21:04:43,736 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:04:43,737 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:04:43,737 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:04:43,737 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:04:43,741 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:04:43" (1/1) ... [2025-01-09 21:04:43,752 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:04:43" (1/1) ... [2025-01-09 21:04:43,770 INFO L138 Inliner]: procedures = 164, calls = 27, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 102 [2025-01-09 21:04:43,770 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:04:43,770 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:04:43,770 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:04:43,771 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:04:43,775 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:04:43" (1/1) ... [2025-01-09 21:04:43,775 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:04:43" (1/1) ... [2025-01-09 21:04:43,777 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:04:43" (1/1) ... [2025-01-09 21:04:43,780 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:04:43" (1/1) ... [2025-01-09 21:04:43,784 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:04:43" (1/1) ... [2025-01-09 21:04:43,788 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:04:43" (1/1) ... [2025-01-09 21:04:43,789 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:04:43" (1/1) ... [2025-01-09 21:04:43,790 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:04:43" (1/1) ... [2025-01-09 21:04:43,794 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:04:43" (1/1) ... [2025-01-09 21:04:43,795 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:04:43,799 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:04:43,799 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:04:43,799 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:04:43,800 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:04:43" (1/1) ... [2025-01-09 21:04:43,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:04:43,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:04:43,823 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 21:04:43,828 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 21:04:43,842 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 21:04:43,843 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-01-09 21:04:43,843 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-01-09 21:04:43,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 21:04:43,843 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-09 21:04:43,843 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:04:43,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:04:43,843 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-09 21:04:43,843 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:04:43,843 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:04:43,844 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 21:04:43,924 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:04:43,925 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:04:44,052 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:04:44,053 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:04:44,072 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:04:44,072 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 21:04:44,072 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:04:44 BoogieIcfgContainer [2025-01-09 21:04:44,072 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:04:44,074 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:04:44,074 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:04:44,079 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:04:44,080 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:04:43" (1/3) ... [2025-01-09 21:04:44,080 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a761b4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:04:44, skipping insertion in model container [2025-01-09 21:04:44,080 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:04:43" (2/3) ... [2025-01-09 21:04:44,080 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a761b4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:04:44, skipping insertion in model container [2025-01-09 21:04:44,080 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:04:44" (3/3) ... [2025-01-09 21:04:44,081 INFO L128 eAbstractionObserver]: Analyzing ICFG 11_fmaxsymopt-race.i [2025-01-09 21:04:44,093 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:04:44,095 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 11_fmaxsymopt-race.i that has 2 procedures, 114 locations, 1 initial locations, 3 loop locations, and 5 error locations. [2025-01-09 21:04:44,095 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:04:44,177 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:04:44,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 122 transitions, 248 flow [2025-01-09 21:04:44,246 INFO L124 PetriNetUnfolderBase]: 8/129 cut-off events. [2025-01-09 21:04:44,249 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:04:44,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133 conditions, 129 events. 8/129 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 189 event pairs, 0 based on Foata normal form. 0/114 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2025-01-09 21:04:44,253 INFO L82 GeneralOperation]: Start removeDead. Operand has 117 places, 122 transitions, 248 flow [2025-01-09 21:04:44,256 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 117 places, 122 transitions, 248 flow [2025-01-09 21:04:44,261 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:04:44,269 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;@3d267eb9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:04:44,269 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-01-09 21:04:44,285 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:04:44,285 INFO L124 PetriNetUnfolderBase]: 0/52 cut-off events. [2025-01-09 21:04:44,285 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:04:44,286 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:04:44,286 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:04:44,286 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-01-09 21:04:44,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:04:44,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1956030421, now seen corresponding path program 1 times [2025-01-09 21:04:44,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:04:44,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342156292] [2025-01-09 21:04:44,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:04:44,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:04:44,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-09 21:04:44,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-09 21:04:44,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:04:44,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:04:44,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:04:44,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:04:44,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342156292] [2025-01-09 21:04:44,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342156292] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:04:44,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:04:44,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:04:44,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265677096] [2025-01-09 21:04:44,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:04:44,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:04:44,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:04:44,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:04:44,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:04:45,045 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 122 [2025-01-09 21:04:45,049 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 122 transitions, 248 flow. Second operand has 6 states, 6 states have (on average 98.5) internal successors, (591), 6 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:04:45,050 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:04:45,050 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 122 [2025-01-09 21:04:45,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:04:45,094 INFO L124 PetriNetUnfolderBase]: 5/115 cut-off events. [2025-01-09 21:04:45,094 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 21:04:45,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 115 events. 5/115 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 132 event pairs, 0 based on Foata normal form. 11/115 useless extension candidates. Maximal degree in co-relation 75. Up to 14 conditions per place. [2025-01-09 21:04:45,096 INFO L140 encePairwiseOnDemand]: 112/122 looper letters, 13 selfloop transitions, 5 changer transitions 0/112 dead transitions. [2025-01-09 21:04:45,096 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 112 transitions, 264 flow [2025-01-09 21:04:45,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:04:45,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:04:45,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 605 transitions. [2025-01-09 21:04:45,111 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8265027322404371 [2025-01-09 21:04:45,114 INFO L175 Difference]: Start difference. First operand has 117 places, 122 transitions, 248 flow. Second operand 6 states and 605 transitions. [2025-01-09 21:04:45,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 112 transitions, 264 flow [2025-01-09 21:04:45,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 112 transitions, 264 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:04:45,131 INFO L231 Difference]: Finished difference. Result has 115 places, 112 transitions, 238 flow [2025-01-09 21:04:45,133 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=238, PETRI_PLACES=115, PETRI_TRANSITIONS=112} [2025-01-09 21:04:45,140 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, -2 predicate places. [2025-01-09 21:04:45,141 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 112 transitions, 238 flow [2025-01-09 21:04:45,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 98.5) internal successors, (591), 6 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:04:45,142 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:04:45,142 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:04:45,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:04:45,143 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-01-09 21:04:45,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:04:45,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1472335641, now seen corresponding path program 1 times [2025-01-09 21:04:45,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:04:45,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678615383] [2025-01-09 21:04:45,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:04:45,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:04:45,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-09 21:04:45,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-09 21:04:45,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:04:45,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:04:45,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:04:45,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:04:45,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678615383] [2025-01-09 21:04:45,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678615383] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:04:45,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:04:45,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:04:45,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882770555] [2025-01-09 21:04:45,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:04:45,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:04:45,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:04:45,212 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:04:45,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:04:45,239 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 122 [2025-01-09 21:04:45,240 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 112 transitions, 238 flow. Second operand has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:04:45,240 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:04:45,240 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 122 [2025-01-09 21:04:45,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:04:45,271 INFO L124 PetriNetUnfolderBase]: 5/127 cut-off events. [2025-01-09 21:04:45,274 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-09 21:04:45,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152 conditions, 127 events. 5/127 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 126 event pairs, 0 based on Foata normal form. 1/118 useless extension candidates. Maximal degree in co-relation 90. Up to 9 conditions per place. [2025-01-09 21:04:45,275 INFO L140 encePairwiseOnDemand]: 119/122 looper letters, 7 selfloop transitions, 2 changer transitions 0/113 dead transitions. [2025-01-09 21:04:45,275 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 113 transitions, 260 flow [2025-01-09 21:04:45,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:04:45,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:04:45,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 334 transitions. [2025-01-09 21:04:45,278 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.912568306010929 [2025-01-09 21:04:45,278 INFO L175 Difference]: Start difference. First operand has 115 places, 112 transitions, 238 flow. Second operand 3 states and 334 transitions. [2025-01-09 21:04:45,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 113 transitions, 260 flow [2025-01-09 21:04:45,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 113 transitions, 248 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:04:45,281 INFO L231 Difference]: Finished difference. Result has 113 places, 113 transitions, 240 flow [2025-01-09 21:04:45,281 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=240, PETRI_PLACES=113, PETRI_TRANSITIONS=113} [2025-01-09 21:04:45,282 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, -4 predicate places. [2025-01-09 21:04:45,282 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 113 transitions, 240 flow [2025-01-09 21:04:45,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:04:45,283 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:04:45,283 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:04:45,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:04:45,283 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-01-09 21:04:45,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:04:45,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1471498483, now seen corresponding path program 1 times [2025-01-09 21:04:45,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:04:45,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641029607] [2025-01-09 21:04:45,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:04:45,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:04:45,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-09 21:04:45,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-09 21:04:45,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:04:45,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:04:45,406 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:04:45,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:04:45,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641029607] [2025-01-09 21:04:45,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641029607] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:04:45,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1609641355] [2025-01-09 21:04:45,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:04:45,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:04:45,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:04:45,411 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 21:04:45,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 21:04:45,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-09 21:04:45,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-09 21:04:45,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:04:45,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:04:45,469 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 21:04:45,471 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:04:45,516 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:04:45,516 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:04:45,557 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:04:45,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1609641355] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 21:04:45,557 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 21:04:45,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-01-09 21:04:45,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508001871] [2025-01-09 21:04:45,557 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 21:04:45,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 21:04:45,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:04:45,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 21:04:45,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-09 21:04:45,665 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 122 [2025-01-09 21:04:45,666 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 113 transitions, 240 flow. Second operand has 10 states, 10 states have (on average 106.9) internal successors, (1069), 10 states have internal predecessors, (1069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:04:45,666 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:04:45,666 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 122 [2025-01-09 21:04:45,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:04:45,736 INFO L124 PetriNetUnfolderBase]: 5/142 cut-off events. [2025-01-09 21:04:45,739 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 21:04:45,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 175 conditions, 142 events. 5/142 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 100 event pairs, 0 based on Foata normal form. 2/134 useless extension candidates. Maximal degree in co-relation 125. Up to 9 conditions per place. [2025-01-09 21:04:45,740 INFO L140 encePairwiseOnDemand]: 116/122 looper letters, 11 selfloop transitions, 9 changer transitions 0/121 dead transitions. [2025-01-09 21:04:45,740 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 121 transitions, 298 flow [2025-01-09 21:04:45,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 21:04:45,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-09 21:04:45,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 967 transitions. [2025-01-09 21:04:45,744 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8806921675774135 [2025-01-09 21:04:45,744 INFO L175 Difference]: Start difference. First operand has 113 places, 113 transitions, 240 flow. Second operand 9 states and 967 transitions. [2025-01-09 21:04:45,744 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 121 transitions, 298 flow [2025-01-09 21:04:45,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 121 transitions, 296 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:04:45,747 INFO L231 Difference]: Finished difference. Result has 123 places, 119 transitions, 288 flow [2025-01-09 21:04:45,748 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=288, PETRI_PLACES=123, PETRI_TRANSITIONS=119} [2025-01-09 21:04:45,748 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, 6 predicate places. [2025-01-09 21:04:45,748 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 119 transitions, 288 flow [2025-01-09 21:04:45,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 106.9) internal successors, (1069), 10 states have internal predecessors, (1069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:04:45,749 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:04:45,750 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:04:45,757 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 21:04:45,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:04:45,951 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-01-09 21:04:45,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:04:45,952 INFO L85 PathProgramCache]: Analyzing trace with hash -610761357, now seen corresponding path program 2 times [2025-01-09 21:04:45,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:04:45,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832699690] [2025-01-09 21:04:45,953 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 21:04:45,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:04:45,971 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 77 statements into 2 equivalence classes. [2025-01-09 21:04:45,986 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 21:04:45,988 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 21:04:45,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:04:46,131 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 21:04:46,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:04:46,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832699690] [2025-01-09 21:04:46,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832699690] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:04:46,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [339581864] [2025-01-09 21:04:46,131 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 21:04:46,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:04:46,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:04:46,135 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 21:04:46,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 21:04:46,185 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 77 statements into 2 equivalence classes. [2025-01-09 21:04:46,208 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 21:04:46,208 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 21:04:46,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:04:46,210 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 21:04:46,211 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:04:46,291 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 21:04:46,292 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:04:46,430 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 21:04:46,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [339581864] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 21:04:46,432 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 21:04:46,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2025-01-09 21:04:46,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398390438] [2025-01-09 21:04:46,433 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 21:04:46,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 21:04:46,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:04:46,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 21:04:46,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-01-09 21:04:46,551 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 122 [2025-01-09 21:04:46,553 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 119 transitions, 288 flow. Second operand has 15 states, 15 states have (on average 107.06666666666666) internal successors, (1606), 15 states have internal predecessors, (1606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:04:46,553 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:04:46,553 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 122 [2025-01-09 21:04:46,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:04:46,682 INFO L124 PetriNetUnfolderBase]: 5/181 cut-off events. [2025-01-09 21:04:46,682 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2025-01-09 21:04:46,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 268 conditions, 181 events. 5/181 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 101 event pairs, 0 based on Foata normal form. 3/174 useless extension candidates. Maximal degree in co-relation 185. Up to 9 conditions per place. [2025-01-09 21:04:46,683 INFO L140 encePairwiseOnDemand]: 116/122 looper letters, 14 selfloop transitions, 18 changer transitions 0/133 dead transitions. [2025-01-09 21:04:46,683 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 133 transitions, 426 flow [2025-01-09 21:04:46,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 21:04:46,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-01-09 21:04:46,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1925 transitions. [2025-01-09 21:04:46,689 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8765938069216758 [2025-01-09 21:04:46,690 INFO L175 Difference]: Start difference. First operand has 123 places, 119 transitions, 288 flow. Second operand 18 states and 1925 transitions. [2025-01-09 21:04:46,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 133 transitions, 426 flow [2025-01-09 21:04:46,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 133 transitions, 414 flow, removed 5 selfloop flow, removed 1 redundant places. [2025-01-09 21:04:46,696 INFO L231 Difference]: Finished difference. Result has 143 places, 129 transitions, 388 flow [2025-01-09 21:04:46,696 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=282, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=388, PETRI_PLACES=143, PETRI_TRANSITIONS=129} [2025-01-09 21:04:46,697 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, 26 predicate places. [2025-01-09 21:04:46,697 INFO L471 AbstractCegarLoop]: Abstraction has has 143 places, 129 transitions, 388 flow [2025-01-09 21:04:46,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 107.06666666666666) internal successors, (1606), 15 states have internal predecessors, (1606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:04:46,698 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:04:46,698 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:04:46,705 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 21:04:46,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:04:46,899 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-01-09 21:04:46,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:04:46,901 INFO L85 PathProgramCache]: Analyzing trace with hash -358667417, now seen corresponding path program 3 times [2025-01-09 21:04:46,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:04:46,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225691926] [2025-01-09 21:04:46,902 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 21:04:46,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:04:46,925 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 116 statements into 8 equivalence classes. [2025-01-09 21:04:46,968 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 116 of 116 statements. [2025-01-09 21:04:46,969 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-01-09 21:04:46,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:04:46,969 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:04:46,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-09 21:04:46,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-09 21:04:46,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:04:46,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:04:47,011 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:04:47,011 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:04:47,012 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining) [2025-01-09 21:04:47,013 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (8 of 10 remaining) [2025-01-09 21:04:47,013 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (7 of 10 remaining) [2025-01-09 21:04:47,013 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (6 of 10 remaining) [2025-01-09 21:04:47,013 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (5 of 10 remaining) [2025-01-09 21:04:47,013 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (4 of 10 remaining) [2025-01-09 21:04:47,013 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (3 of 10 remaining) [2025-01-09 21:04:47,013 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (2 of 10 remaining) [2025-01-09 21:04:47,014 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (1 of 10 remaining) [2025-01-09 21:04:47,014 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (0 of 10 remaining) [2025-01-09 21:04:47,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:04:47,014 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1] [2025-01-09 21:04:47,016 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:04:47,016 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-01-09 21:04:47,039 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:04:47,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 182 places, 192 transitions, 394 flow [2025-01-09 21:04:47,072 INFO L124 PetriNetUnfolderBase]: 15/208 cut-off events. [2025-01-09 21:04:47,072 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 21:04:47,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 216 conditions, 208 events. 15/208 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 513 event pairs, 0 based on Foata normal form. 0/181 useless extension candidates. Maximal degree in co-relation 147. Up to 3 conditions per place. [2025-01-09 21:04:47,074 INFO L82 GeneralOperation]: Start removeDead. Operand has 182 places, 192 transitions, 394 flow [2025-01-09 21:04:47,075 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 182 places, 192 transitions, 394 flow [2025-01-09 21:04:47,075 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:04:47,076 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;@3d267eb9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:04:47,076 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2025-01-09 21:04:47,079 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:04:47,079 INFO L124 PetriNetUnfolderBase]: 0/52 cut-off events. [2025-01-09 21:04:47,079 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:04:47,079 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:04:47,079 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:04:47,079 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-01-09 21:04:47,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:04:47,079 INFO L85 PathProgramCache]: Analyzing trace with hash -1023930219, now seen corresponding path program 1 times [2025-01-09 21:04:47,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:04:47,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208574877] [2025-01-09 21:04:47,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:04:47,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:04:47,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-09 21:04:47,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-09 21:04:47,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:04:47,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:04:47,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:04:47,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:04:47,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208574877] [2025-01-09 21:04:47,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208574877] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:04:47,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:04:47,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:04:47,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320236908] [2025-01-09 21:04:47,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:04:47,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:04:47,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:04:47,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:04:47,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:04:47,431 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 192 [2025-01-09 21:04:47,432 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 192 transitions, 394 flow. Second operand has 6 states, 6 states have (on average 157.5) internal successors, (945), 6 states have internal predecessors, (945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:04:47,432 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:04:47,432 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 192 [2025-01-09 21:04:47,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:04:47,516 INFO L124 PetriNetUnfolderBase]: 90/600 cut-off events. [2025-01-09 21:04:47,516 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2025-01-09 21:04:47,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 756 conditions, 600 events. 90/600 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 3372 event pairs, 42 based on Foata normal form. 104/608 useless extension candidates. Maximal degree in co-relation 312. Up to 125 conditions per place. [2025-01-09 21:04:47,521 INFO L140 encePairwiseOnDemand]: 179/192 looper letters, 20 selfloop transitions, 5 changer transitions 0/177 dead transitions. [2025-01-09 21:04:47,521 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 177 transitions, 414 flow [2025-01-09 21:04:47,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:04:47,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:04:47,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 969 transitions. [2025-01-09 21:04:47,523 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8411458333333334 [2025-01-09 21:04:47,523 INFO L175 Difference]: Start difference. First operand has 182 places, 192 transitions, 394 flow. Second operand 6 states and 969 transitions. [2025-01-09 21:04:47,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 177 transitions, 414 flow [2025-01-09 21:04:47,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 177 transitions, 414 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:04:47,526 INFO L231 Difference]: Finished difference. Result has 178 places, 177 transitions, 374 flow [2025-01-09 21:04:47,526 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=364, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=374, PETRI_PLACES=178, PETRI_TRANSITIONS=177} [2025-01-09 21:04:47,527 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, -4 predicate places. [2025-01-09 21:04:47,527 INFO L471 AbstractCegarLoop]: Abstraction has has 178 places, 177 transitions, 374 flow [2025-01-09 21:04:47,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 157.5) internal successors, (945), 6 states have internal predecessors, (945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:04:47,528 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:04:47,528 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:04:47,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:04:47,528 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-01-09 21:04:47,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:04:47,528 INFO L85 PathProgramCache]: Analyzing trace with hash 325488323, now seen corresponding path program 1 times [2025-01-09 21:04:47,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:04:47,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968833609] [2025-01-09 21:04:47,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:04:47,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:04:47,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-09 21:04:47,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-09 21:04:47,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:04:47,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:04:47,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:04:47,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:04:47,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968833609] [2025-01-09 21:04:47,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968833609] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:04:47,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:04:47,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:04:47,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221247664] [2025-01-09 21:04:47,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:04:47,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:04:47,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:04:47,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:04:47,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:04:47,569 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 192 [2025-01-09 21:04:47,570 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 177 transitions, 374 flow. Second operand has 3 states, 3 states have (on average 173.0) internal successors, (519), 3 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:04:47,570 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:04:47,570 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 192 [2025-01-09 21:04:47,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:04:47,611 INFO L124 PetriNetUnfolderBase]: 23/345 cut-off events. [2025-01-09 21:04:47,611 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-01-09 21:04:47,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 395 conditions, 345 events. 23/345 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1176 event pairs, 6 based on Foata normal form. 1/305 useless extension candidates. Maximal degree in co-relation 332. Up to 24 conditions per place. [2025-01-09 21:04:47,613 INFO L140 encePairwiseOnDemand]: 189/192 looper letters, 10 selfloop transitions, 2 changer transitions 0/178 dead transitions. [2025-01-09 21:04:47,614 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 178 transitions, 402 flow [2025-01-09 21:04:47,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:04:47,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:04:47,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 526 transitions. [2025-01-09 21:04:47,615 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9131944444444444 [2025-01-09 21:04:47,615 INFO L175 Difference]: Start difference. First operand has 178 places, 177 transitions, 374 flow. Second operand 3 states and 526 transitions. [2025-01-09 21:04:47,615 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 178 transitions, 402 flow [2025-01-09 21:04:47,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 178 transitions, 390 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:04:47,618 INFO L231 Difference]: Finished difference. Result has 176 places, 178 transitions, 376 flow [2025-01-09 21:04:47,618 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=364, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=376, PETRI_PLACES=176, PETRI_TRANSITIONS=178} [2025-01-09 21:04:47,619 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, -6 predicate places. [2025-01-09 21:04:47,619 INFO L471 AbstractCegarLoop]: Abstraction has has 176 places, 178 transitions, 376 flow [2025-01-09 21:04:47,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 173.0) internal successors, (519), 3 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:04:47,619 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:04:47,620 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:04:47,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:04:47,620 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-01-09 21:04:47,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:04:47,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1149501809, now seen corresponding path program 1 times [2025-01-09 21:04:47,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:04:47,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562801225] [2025-01-09 21:04:47,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:04:47,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:04:47,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-01-09 21:04:47,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-01-09 21:04:47,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:04:47,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:04:47,699 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:04:47,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:04:47,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562801225] [2025-01-09 21:04:47,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562801225] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:04:47,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1171777132] [2025-01-09 21:04:47,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:04:47,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:04:47,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:04:47,702 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 21:04:47,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 21:04:47,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-01-09 21:04:47,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-01-09 21:04:47,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:04:47,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:04:47,761 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 21:04:47,762 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:04:47,789 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:04:47,789 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:04:47,827 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:04:47,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1171777132] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 21:04:47,827 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 21:04:47,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-01-09 21:04:47,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636868581] [2025-01-09 21:04:47,828 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 21:04:47,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 21:04:47,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:04:47,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 21:04:47,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-09 21:04:47,909 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 192 [2025-01-09 21:04:47,910 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 178 transitions, 376 flow. Second operand has 10 states, 10 states have (on average 170.0) internal successors, (1700), 10 states have internal predecessors, (1700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:04:47,910 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:04:47,910 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 192 [2025-01-09 21:04:47,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:04:47,986 INFO L124 PetriNetUnfolderBase]: 23/360 cut-off events. [2025-01-09 21:04:47,986 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-01-09 21:04:47,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 418 conditions, 360 events. 23/360 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1149 event pairs, 6 based on Foata normal form. 2/321 useless extension candidates. Maximal degree in co-relation 367. Up to 24 conditions per place. [2025-01-09 21:04:47,987 INFO L140 encePairwiseOnDemand]: 186/192 looper letters, 14 selfloop transitions, 9 changer transitions 0/186 dead transitions. [2025-01-09 21:04:47,987 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 186 transitions, 440 flow [2025-01-09 21:04:47,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 21:04:47,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-09 21:04:47,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1537 transitions. [2025-01-09 21:04:47,990 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8894675925925926 [2025-01-09 21:04:47,990 INFO L175 Difference]: Start difference. First operand has 176 places, 178 transitions, 376 flow. Second operand 9 states and 1537 transitions. [2025-01-09 21:04:47,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 186 transitions, 440 flow [2025-01-09 21:04:47,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 186 transitions, 438 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:04:47,992 INFO L231 Difference]: Finished difference. Result has 186 places, 184 transitions, 424 flow [2025-01-09 21:04:47,992 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=374, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=424, PETRI_PLACES=186, PETRI_TRANSITIONS=184} [2025-01-09 21:04:47,993 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, 4 predicate places. [2025-01-09 21:04:47,993 INFO L471 AbstractCegarLoop]: Abstraction has has 186 places, 184 transitions, 424 flow [2025-01-09 21:04:47,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 170.0) internal successors, (1700), 10 states have internal predecessors, (1700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:04:47,994 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:04:47,995 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:04:48,000 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 21:04:48,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:04:48,195 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-01-09 21:04:48,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:04:48,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1620991217, now seen corresponding path program 2 times [2025-01-09 21:04:48,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:04:48,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956490749] [2025-01-09 21:04:48,196 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 21:04:48,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:04:48,206 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 83 statements into 2 equivalence classes. [2025-01-09 21:04:48,212 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 83 of 83 statements. [2025-01-09 21:04:48,216 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 21:04:48,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:04:48,323 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:04:48,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:04:48,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956490749] [2025-01-09 21:04:48,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956490749] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:04:48,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [570673682] [2025-01-09 21:04:48,323 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 21:04:48,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:04:48,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:04:48,325 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 21:04:48,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 21:04:48,370 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 83 statements into 2 equivalence classes. [2025-01-09 21:04:48,389 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 83 of 83 statements. [2025-01-09 21:04:48,389 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 21:04:48,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:04:48,390 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 21:04:48,392 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:04:48,442 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:04:48,442 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:04:48,520 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:04:48,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [570673682] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 21:04:48,520 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 21:04:48,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2025-01-09 21:04:48,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074915240] [2025-01-09 21:04:48,520 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 21:04:48,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 21:04:48,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:04:48,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 21:04:48,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-01-09 21:04:48,608 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 192 [2025-01-09 21:04:48,610 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 184 transitions, 424 flow. Second operand has 15 states, 15 states have (on average 170.13333333333333) internal successors, (2552), 15 states have internal predecessors, (2552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:04:48,610 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:04:48,610 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 192 [2025-01-09 21:04:48,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:04:48,769 INFO L124 PetriNetUnfolderBase]: 23/399 cut-off events. [2025-01-09 21:04:48,769 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2025-01-09 21:04:48,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 511 conditions, 399 events. 23/399 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1148 event pairs, 6 based on Foata normal form. 3/361 useless extension candidates. Maximal degree in co-relation 329. Up to 24 conditions per place. [2025-01-09 21:04:48,771 INFO L140 encePairwiseOnDemand]: 186/192 looper letters, 17 selfloop transitions, 18 changer transitions 0/198 dead transitions. [2025-01-09 21:04:48,771 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 198 transitions, 568 flow [2025-01-09 21:04:48,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 21:04:48,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-01-09 21:04:48,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 3062 transitions. [2025-01-09 21:04:48,776 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8859953703703703 [2025-01-09 21:04:48,776 INFO L175 Difference]: Start difference. First operand has 186 places, 184 transitions, 424 flow. Second operand 18 states and 3062 transitions. [2025-01-09 21:04:48,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 198 transitions, 568 flow [2025-01-09 21:04:48,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 198 transitions, 556 flow, removed 5 selfloop flow, removed 1 redundant places. [2025-01-09 21:04:48,781 INFO L231 Difference]: Finished difference. Result has 206 places, 194 transitions, 524 flow [2025-01-09 21:04:48,781 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=418, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=524, PETRI_PLACES=206, PETRI_TRANSITIONS=194} [2025-01-09 21:04:48,781 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, 24 predicate places. [2025-01-09 21:04:48,781 INFO L471 AbstractCegarLoop]: Abstraction has has 206 places, 194 transitions, 524 flow [2025-01-09 21:04:48,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 170.13333333333333) internal successors, (2552), 15 states have internal predecessors, (2552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:04:48,782 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:04:48,782 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:04:48,790 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 21:04:48,982 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-01-09 21:04:48,983 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-01-09 21:04:48,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:04:48,983 INFO L85 PathProgramCache]: Analyzing trace with hash 314282307, now seen corresponding path program 3 times [2025-01-09 21:04:48,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:04:48,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872054467] [2025-01-09 21:04:48,983 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 21:04:48,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:04:49,007 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 122 statements into 7 equivalence classes. [2025-01-09 21:04:49,050 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 122 of 122 statements. [2025-01-09 21:04:49,050 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-01-09 21:04:49,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:04:49,051 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:04:49,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-09 21:04:49,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-09 21:04:49,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:04:49,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:04:49,079 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:04:49,079 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:04:49,079 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 14 remaining) [2025-01-09 21:04:49,079 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (12 of 14 remaining) [2025-01-09 21:04:49,079 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (11 of 14 remaining) [2025-01-09 21:04:49,079 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (10 of 14 remaining) [2025-01-09 21:04:49,079 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (9 of 14 remaining) [2025-01-09 21:04:49,080 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (8 of 14 remaining) [2025-01-09 21:04:49,080 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (7 of 14 remaining) [2025-01-09 21:04:49,080 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (6 of 14 remaining) [2025-01-09 21:04:49,080 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (5 of 14 remaining) [2025-01-09 21:04:49,080 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (4 of 14 remaining) [2025-01-09 21:04:49,080 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (3 of 14 remaining) [2025-01-09 21:04:49,080 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (2 of 14 remaining) [2025-01-09 21:04:49,080 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (1 of 14 remaining) [2025-01-09 21:04:49,080 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (0 of 14 remaining) [2025-01-09 21:04:49,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 21:04:49,080 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1] [2025-01-09 21:04:49,080 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:04:49,080 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-01-09 21:04:49,114 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:04:49,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 247 places, 262 transitions, 542 flow [2025-01-09 21:04:49,164 INFO L124 PetriNetUnfolderBase]: 22/287 cut-off events. [2025-01-09 21:04:49,164 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-01-09 21:04:49,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 300 conditions, 287 events. 22/287 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 899 event pairs, 0 based on Foata normal form. 0/248 useless extension candidates. Maximal degree in co-relation 216. Up to 4 conditions per place. [2025-01-09 21:04:49,165 INFO L82 GeneralOperation]: Start removeDead. Operand has 247 places, 262 transitions, 542 flow [2025-01-09 21:04:49,167 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 247 places, 262 transitions, 542 flow [2025-01-09 21:04:49,167 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:04:49,168 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;@3d267eb9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:04:49,168 INFO L334 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2025-01-09 21:04:49,170 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:04:49,170 INFO L124 PetriNetUnfolderBase]: 0/52 cut-off events. [2025-01-09 21:04:49,170 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:04:49,170 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:04:49,170 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:04:49,170 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-01-09 21:04:49,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:04:49,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1978465499, now seen corresponding path program 1 times [2025-01-09 21:04:49,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:04:49,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389718361] [2025-01-09 21:04:49,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:04:49,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:04:49,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-09 21:04:49,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-09 21:04:49,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:04:49,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:04:49,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:04:49,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:04:49,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389718361] [2025-01-09 21:04:49,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389718361] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:04:49,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:04:49,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:04:49,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831449996] [2025-01-09 21:04:49,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:04:49,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:04:49,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:04:49,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:04:49,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:04:49,515 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 262 [2025-01-09 21:04:49,516 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 262 transitions, 542 flow. Second operand has 6 states, 6 states have (on average 216.5) internal successors, (1299), 6 states have internal predecessors, (1299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:04:49,516 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:04:49,516 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 262 [2025-01-09 21:04:49,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:04:49,888 INFO L124 PetriNetUnfolderBase]: 1081/4122 cut-off events. [2025-01-09 21:04:49,888 INFO L125 PetriNetUnfolderBase]: For 364/364 co-relation queries the response was YES. [2025-01-09 21:04:49,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5668 conditions, 4122 events. 1081/4122 cut-off events. For 364/364 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 39069 event pairs, 630 based on Foata normal form. 925/4260 useless extension candidates. Maximal degree in co-relation 1470. Up to 1318 conditions per place. [2025-01-09 21:04:49,920 INFO L140 encePairwiseOnDemand]: 246/262 looper letters, 27 selfloop transitions, 5 changer transitions 0/242 dead transitions. [2025-01-09 21:04:49,920 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 242 transitions, 566 flow [2025-01-09 21:04:49,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:04:49,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:04:49,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1333 transitions. [2025-01-09 21:04:49,922 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8479643765903307 [2025-01-09 21:04:49,923 INFO L175 Difference]: Start difference. First operand has 247 places, 262 transitions, 542 flow. Second operand 6 states and 1333 transitions. [2025-01-09 21:04:49,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 242 transitions, 566 flow [2025-01-09 21:04:49,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 242 transitions, 564 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-01-09 21:04:49,925 INFO L231 Difference]: Finished difference. Result has 241 places, 242 transitions, 510 flow [2025-01-09 21:04:49,926 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=500, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=237, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=510, PETRI_PLACES=241, PETRI_TRANSITIONS=242} [2025-01-09 21:04:49,926 INFO L279 CegarLoopForPetriNet]: 247 programPoint places, -6 predicate places. [2025-01-09 21:04:49,926 INFO L471 AbstractCegarLoop]: Abstraction has has 241 places, 242 transitions, 510 flow [2025-01-09 21:04:49,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 216.5) internal successors, (1299), 6 states have internal predecessors, (1299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:04:49,927 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:04:49,927 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:04:49,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 21:04:49,927 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-01-09 21:04:49,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:04:49,928 INFO L85 PathProgramCache]: Analyzing trace with hash -743958806, now seen corresponding path program 1 times [2025-01-09 21:04:49,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:04:49,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359264409] [2025-01-09 21:04:49,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:04:49,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:04:49,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-09 21:04:49,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-09 21:04:49,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:04:49,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:04:49,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:04:49,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:04:49,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359264409] [2025-01-09 21:04:49,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359264409] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:04:49,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:04:49,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:04:49,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302437239] [2025-01-09 21:04:49,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:04:49,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:04:49,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:04:49,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:04:49,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:04:49,965 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 234 out of 262 [2025-01-09 21:04:49,965 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 242 transitions, 510 flow. Second operand has 3 states, 3 states have (on average 236.33333333333334) internal successors, (709), 3 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:04:49,965 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:04:49,965 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 262 [2025-01-09 21:04:49,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:04:50,121 INFO L124 PetriNetUnfolderBase]: 95/1017 cut-off events. [2025-01-09 21:04:50,122 INFO L125 PetriNetUnfolderBase]: For 66/66 co-relation queries the response was YES. [2025-01-09 21:04:50,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1158 conditions, 1017 events. 95/1017 cut-off events. For 66/66 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 6205 event pairs, 42 based on Foata normal form. 1/883 useless extension candidates. Maximal degree in co-relation 1094. Up to 87 conditions per place. [2025-01-09 21:04:50,130 INFO L140 encePairwiseOnDemand]: 259/262 looper letters, 13 selfloop transitions, 2 changer transitions 0/243 dead transitions. [2025-01-09 21:04:50,130 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 243 transitions, 544 flow [2025-01-09 21:04:50,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:04:50,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:04:50,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 718 transitions. [2025-01-09 21:04:50,132 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9134860050890585 [2025-01-09 21:04:50,132 INFO L175 Difference]: Start difference. First operand has 241 places, 242 transitions, 510 flow. Second operand 3 states and 718 transitions. [2025-01-09 21:04:50,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 243 transitions, 544 flow [2025-01-09 21:04:50,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 243 transitions, 532 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:04:50,136 INFO L231 Difference]: Finished difference. Result has 239 places, 243 transitions, 512 flow [2025-01-09 21:04:50,136 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=500, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=512, PETRI_PLACES=239, PETRI_TRANSITIONS=243} [2025-01-09 21:04:50,137 INFO L279 CegarLoopForPetriNet]: 247 programPoint places, -8 predicate places. [2025-01-09 21:04:50,137 INFO L471 AbstractCegarLoop]: Abstraction has has 239 places, 243 transitions, 512 flow [2025-01-09 21:04:50,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 236.33333333333334) internal successors, (709), 3 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:04:50,138 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:04:50,138 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:04:50,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 21:04:50,138 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-01-09 21:04:50,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:04:50,138 INFO L85 PathProgramCache]: Analyzing trace with hash -292311876, now seen corresponding path program 1 times [2025-01-09 21:04:50,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:04:50,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301365250] [2025-01-09 21:04:50,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:04:50,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:04:50,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-09 21:04:50,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-09 21:04:50,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:04:50,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:04:50,192 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:04:50,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:04:50,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301365250] [2025-01-09 21:04:50,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301365250] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:04:50,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1578082953] [2025-01-09 21:04:50,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:04:50,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:04:50,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:04:50,196 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 21:04:50,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 21:04:50,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-09 21:04:50,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-09 21:04:50,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:04:50,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:04:50,265 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 21:04:50,266 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:04:50,292 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:04:50,292 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:04:50,323 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:04:50,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1578082953] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 21:04:50,323 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 21:04:50,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-01-09 21:04:50,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447542713] [2025-01-09 21:04:50,324 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 21:04:50,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 21:04:50,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:04:50,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 21:04:50,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-09 21:04:50,384 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 262 [2025-01-09 21:04:50,386 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 243 transitions, 512 flow. Second operand has 10 states, 10 states have (on average 233.1) internal successors, (2331), 10 states have internal predecessors, (2331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:04:50,386 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:04:50,386 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 262 [2025-01-09 21:04:50,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:04:50,510 INFO L124 PetriNetUnfolderBase]: 95/1032 cut-off events. [2025-01-09 21:04:50,510 INFO L125 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2025-01-09 21:04:50,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1181 conditions, 1032 events. 95/1032 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 6178 event pairs, 42 based on Foata normal form. 2/899 useless extension candidates. Maximal degree in co-relation 1129. Up to 87 conditions per place. [2025-01-09 21:04:50,518 INFO L140 encePairwiseOnDemand]: 256/262 looper letters, 17 selfloop transitions, 9 changer transitions 0/251 dead transitions. [2025-01-09 21:04:50,518 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 251 transitions, 582 flow [2025-01-09 21:04:50,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 21:04:50,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-09 21:04:50,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2107 transitions. [2025-01-09 21:04:50,522 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8935538592027141 [2025-01-09 21:04:50,522 INFO L175 Difference]: Start difference. First operand has 239 places, 243 transitions, 512 flow. Second operand 9 states and 2107 transitions. [2025-01-09 21:04:50,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 251 transitions, 582 flow [2025-01-09 21:04:50,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 251 transitions, 580 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:04:50,525 INFO L231 Difference]: Finished difference. Result has 249 places, 249 transitions, 560 flow [2025-01-09 21:04:50,525 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=510, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=237, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=560, PETRI_PLACES=249, PETRI_TRANSITIONS=249} [2025-01-09 21:04:50,525 INFO L279 CegarLoopForPetriNet]: 247 programPoint places, 2 predicate places. [2025-01-09 21:04:50,525 INFO L471 AbstractCegarLoop]: Abstraction has has 249 places, 249 transitions, 560 flow [2025-01-09 21:04:50,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 233.1) internal successors, (2331), 10 states have internal predecessors, (2331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:04:50,526 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:04:50,526 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:04:50,536 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-09 21:04:50,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-01-09 21:04:50,730 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-01-09 21:04:50,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:04:50,731 INFO L85 PathProgramCache]: Analyzing trace with hash -1237536900, now seen corresponding path program 2 times [2025-01-09 21:04:50,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:04:50,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505971824] [2025-01-09 21:04:50,731 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 21:04:50,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:04:50,739 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 89 statements into 2 equivalence classes. [2025-01-09 21:04:50,744 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 21:04:50,744 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 21:04:50,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:04:50,822 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 21:04:50,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:04:50,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505971824] [2025-01-09 21:04:50,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505971824] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:04:50,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1436817811] [2025-01-09 21:04:50,822 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 21:04:50,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:04:50,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:04:50,824 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 21:04:50,828 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 21:04:50,881 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 89 statements into 2 equivalence classes. [2025-01-09 21:04:50,900 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 21:04:50,900 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 21:04:50,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:04:50,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 21:04:50,902 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:04:50,951 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 21:04:50,951 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:04:51,034 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 21:04:51,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1436817811] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 21:04:51,035 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 21:04:51,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2025-01-09 21:04:51,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984399175] [2025-01-09 21:04:51,035 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 21:04:51,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 21:04:51,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:04:51,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 21:04:51,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-01-09 21:04:51,118 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 262 [2025-01-09 21:04:51,120 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 249 transitions, 560 flow. Second operand has 15 states, 15 states have (on average 233.2) internal successors, (3498), 15 states have internal predecessors, (3498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:04:51,120 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:04:51,120 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 262 [2025-01-09 21:04:51,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:04:51,315 INFO L124 PetriNetUnfolderBase]: 95/1071 cut-off events. [2025-01-09 21:04:51,316 INFO L125 PetriNetUnfolderBase]: For 87/87 co-relation queries the response was YES. [2025-01-09 21:04:51,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1274 conditions, 1071 events. 95/1071 cut-off events. For 87/87 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 6202 event pairs, 42 based on Foata normal form. 3/939 useless extension candidates. Maximal degree in co-relation 1091. Up to 87 conditions per place. [2025-01-09 21:04:51,322 INFO L140 encePairwiseOnDemand]: 256/262 looper letters, 20 selfloop transitions, 18 changer transitions 0/263 dead transitions. [2025-01-09 21:04:51,322 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 263 transitions, 710 flow [2025-01-09 21:04:51,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 21:04:51,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-01-09 21:04:51,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 4199 transitions. [2025-01-09 21:04:51,327 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.890373197625106 [2025-01-09 21:04:51,327 INFO L175 Difference]: Start difference. First operand has 249 places, 249 transitions, 560 flow. Second operand 18 states and 4199 transitions. [2025-01-09 21:04:51,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 263 transitions, 710 flow [2025-01-09 21:04:51,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 263 transitions, 698 flow, removed 5 selfloop flow, removed 1 redundant places. [2025-01-09 21:04:51,330 INFO L231 Difference]: Finished difference. Result has 269 places, 259 transitions, 660 flow [2025-01-09 21:04:51,330 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=554, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=660, PETRI_PLACES=269, PETRI_TRANSITIONS=259} [2025-01-09 21:04:51,331 INFO L279 CegarLoopForPetriNet]: 247 programPoint places, 22 predicate places. [2025-01-09 21:04:51,331 INFO L471 AbstractCegarLoop]: Abstraction has has 269 places, 259 transitions, 660 flow [2025-01-09 21:04:51,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 233.2) internal successors, (3498), 15 states have internal predecessors, (3498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:04:51,332 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:04:51,332 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:04:51,337 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-09 21:04:51,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-01-09 21:04:51,532 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-01-09 21:04:51,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:04:51,533 INFO L85 PathProgramCache]: Analyzing trace with hash 1262515882, now seen corresponding path program 3 times [2025-01-09 21:04:51,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:04:51,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675395798] [2025-01-09 21:04:51,533 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 21:04:51,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:04:51,556 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 128 statements into 8 equivalence classes. [2025-01-09 21:04:51,592 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 128 of 128 statements. [2025-01-09 21:04:51,592 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-01-09 21:04:51,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:04:51,592 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:04:51,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-01-09 21:04:51,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-01-09 21:04:51,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:04:51,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:04:51,612 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:04:51,612 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:04:51,612 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (17 of 18 remaining) [2025-01-09 21:04:51,613 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (16 of 18 remaining) [2025-01-09 21:04:51,613 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (15 of 18 remaining) [2025-01-09 21:04:51,613 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (14 of 18 remaining) [2025-01-09 21:04:51,613 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (13 of 18 remaining) [2025-01-09 21:04:51,613 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (12 of 18 remaining) [2025-01-09 21:04:51,613 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (11 of 18 remaining) [2025-01-09 21:04:51,613 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (10 of 18 remaining) [2025-01-09 21:04:51,613 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (9 of 18 remaining) [2025-01-09 21:04:51,613 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (8 of 18 remaining) [2025-01-09 21:04:51,613 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (7 of 18 remaining) [2025-01-09 21:04:51,613 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (6 of 18 remaining) [2025-01-09 21:04:51,613 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (5 of 18 remaining) [2025-01-09 21:04:51,613 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (4 of 18 remaining) [2025-01-09 21:04:51,613 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (3 of 18 remaining) [2025-01-09 21:04:51,613 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (2 of 18 remaining) [2025-01-09 21:04:51,613 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (1 of 18 remaining) [2025-01-09 21:04:51,614 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (0 of 18 remaining) [2025-01-09 21:04:51,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 21:04:51,614 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1] [2025-01-09 21:04:51,614 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:04:51,614 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-01-09 21:04:51,650 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:04:51,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 312 places, 332 transitions, 692 flow [2025-01-09 21:04:51,677 INFO L124 PetriNetUnfolderBase]: 29/366 cut-off events. [2025-01-09 21:04:51,678 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-01-09 21:04:51,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 385 conditions, 366 events. 29/366 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1327 event pairs, 0 based on Foata normal form. 0/315 useless extension candidates. Maximal degree in co-relation 295. Up to 5 conditions per place. [2025-01-09 21:04:51,679 INFO L82 GeneralOperation]: Start removeDead. Operand has 312 places, 332 transitions, 692 flow [2025-01-09 21:04:51,681 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 312 places, 332 transitions, 692 flow [2025-01-09 21:04:51,682 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:04:51,682 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;@3d267eb9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:04:51,682 INFO L334 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2025-01-09 21:04:51,684 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:04:51,684 INFO L124 PetriNetUnfolderBase]: 0/52 cut-off events. [2025-01-09 21:04:51,684 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:04:51,684 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:04:51,684 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:04:51,684 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-01-09 21:04:51,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:04:51,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1921684313, now seen corresponding path program 1 times [2025-01-09 21:04:51,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:04:51,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313155457] [2025-01-09 21:04:51,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:04:51,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:04:51,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-09 21:04:51,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-09 21:04:51,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:04:51,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:04:51,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:04:51,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:04:51,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313155457] [2025-01-09 21:04:51,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313155457] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:04:51,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:04:51,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:04:51,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173392676] [2025-01-09 21:04:51,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:04:51,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:04:51,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:04:51,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:04:51,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:04:52,129 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 274 out of 332 [2025-01-09 21:04:52,130 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 332 transitions, 692 flow. Second operand has 6 states, 6 states have (on average 275.5) internal successors, (1653), 6 states have internal predecessors, (1653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:04:52,131 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:04:52,131 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 274 of 332 [2025-01-09 21:04:52,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:04:54,921 INFO L124 PetriNetUnfolderBase]: 10778/30460 cut-off events. [2025-01-09 21:04:54,921 INFO L125 PetriNetUnfolderBase]: For 4130/4130 co-relation queries the response was YES. [2025-01-09 21:04:55,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44913 conditions, 30460 events. 10778/30460 cut-off events. For 4130/4130 co-relation queries the response was YES. Maximal size of possible extension queue 1428. Compared 371198 event pairs, 6804 based on Foata normal form. 7887/32081 useless extension candidates. Maximal degree in co-relation 6942. Up to 12509 conditions per place. [2025-01-09 21:04:55,173 INFO L140 encePairwiseOnDemand]: 313/332 looper letters, 34 selfloop transitions, 5 changer transitions 0/307 dead transitions. [2025-01-09 21:04:55,173 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 307 transitions, 720 flow [2025-01-09 21:04:55,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:04:55,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:04:55,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1697 transitions. [2025-01-09 21:04:55,175 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8519076305220884 [2025-01-09 21:04:55,175 INFO L175 Difference]: Start difference. First operand has 312 places, 332 transitions, 692 flow. Second operand 6 states and 1697 transitions. [2025-01-09 21:04:55,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 307 transitions, 720 flow [2025-01-09 21:04:55,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 307 transitions, 714 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-01-09 21:04:55,180 INFO L231 Difference]: Finished difference. Result has 304 places, 307 transitions, 646 flow [2025-01-09 21:04:55,181 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=636, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=307, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=302, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=646, PETRI_PLACES=304, PETRI_TRANSITIONS=307} [2025-01-09 21:04:55,182 INFO L279 CegarLoopForPetriNet]: 312 programPoint places, -8 predicate places. [2025-01-09 21:04:55,182 INFO L471 AbstractCegarLoop]: Abstraction has has 304 places, 307 transitions, 646 flow [2025-01-09 21:04:55,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 275.5) internal successors, (1653), 6 states have internal predecessors, (1653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:04:55,182 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:04:55,182 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] [2025-01-09 21:04:55,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 21:04:55,183 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-01-09 21:04:55,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:04:55,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1553531937, now seen corresponding path program 1 times [2025-01-09 21:04:55,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:04:55,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535977473] [2025-01-09 21:04:55,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:04:55,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:04:55,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-01-09 21:04:55,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-09 21:04:55,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:04:55,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:04:55,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:04:55,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:04:55,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535977473] [2025-01-09 21:04:55,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535977473] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:04:55,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:04:55,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:04:55,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12084641] [2025-01-09 21:04:55,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:04:55,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:04:55,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:04:55,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:04:55,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:04:55,270 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 297 out of 332 [2025-01-09 21:04:55,270 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 307 transitions, 646 flow. Second operand has 3 states, 3 states have (on average 299.0) internal successors, (897), 3 states have internal predecessors, (897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:04:55,270 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:04:55,270 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 297 of 332 [2025-01-09 21:04:55,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:04:56,036 INFO L124 PetriNetUnfolderBase]: 365/3087 cut-off events. [2025-01-09 21:04:56,037 INFO L125 PetriNetUnfolderBase]: For 282/282 co-relation queries the response was YES. [2025-01-09 21:04:56,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3553 conditions, 3087 events. 365/3087 cut-off events. For 282/282 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 27033 event pairs, 204 based on Foata normal form. 1/2670 useless extension candidates. Maximal degree in co-relation 3488. Up to 330 conditions per place. [2025-01-09 21:04:56,087 INFO L140 encePairwiseOnDemand]: 329/332 looper letters, 16 selfloop transitions, 2 changer transitions 0/308 dead transitions. [2025-01-09 21:04:56,091 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 308 transitions, 686 flow [2025-01-09 21:04:56,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:04:56,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:04:56,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 910 transitions. [2025-01-09 21:04:56,096 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9136546184738956 [2025-01-09 21:04:56,096 INFO L175 Difference]: Start difference. First operand has 304 places, 307 transitions, 646 flow. Second operand 3 states and 910 transitions. [2025-01-09 21:04:56,096 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 308 transitions, 686 flow [2025-01-09 21:04:56,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 308 transitions, 674 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:04:56,100 INFO L231 Difference]: Finished difference. Result has 302 places, 308 transitions, 648 flow [2025-01-09 21:04:56,101 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=636, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=307, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=305, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=648, PETRI_PLACES=302, PETRI_TRANSITIONS=308} [2025-01-09 21:04:56,101 INFO L279 CegarLoopForPetriNet]: 312 programPoint places, -10 predicate places. [2025-01-09 21:04:56,101 INFO L471 AbstractCegarLoop]: Abstraction has has 302 places, 308 transitions, 648 flow [2025-01-09 21:04:56,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 299.0) internal successors, (897), 3 states have internal predecessors, (897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:04:56,105 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:04:56,105 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] [2025-01-09 21:04:56,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 21:04:56,106 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-01-09 21:04:56,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:04:56,106 INFO L85 PathProgramCache]: Analyzing trace with hash 324930433, now seen corresponding path program 1 times [2025-01-09 21:04:56,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:04:56,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817579246] [2025-01-09 21:04:56,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:04:56,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:04:56,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 21:04:56,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 21:04:56,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:04:56,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:04:56,166 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:04:56,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:04:56,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817579246] [2025-01-09 21:04:56,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817579246] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:04:56,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [400914235] [2025-01-09 21:04:56,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:04:56,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:04:56,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:04:56,168 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 21:04:56,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-09 21:04:56,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 21:04:56,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 21:04:56,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:04:56,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:04:56,251 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 21:04:56,252 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:04:56,264 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 21:04:56,265 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 21:04:56,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [400914235] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:04:56,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 21:04:56,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-01-09 21:04:56,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103691937] [2025-01-09 21:04:56,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:04:56,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:04:56,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:04:56,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:04:56,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:04:56,297 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 296 out of 332 [2025-01-09 21:04:56,298 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 308 transitions, 648 flow. Second operand has 3 states, 3 states have (on average 298.3333333333333) internal successors, (895), 3 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:04:56,298 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:04:56,298 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 296 of 332 [2025-01-09 21:04:56,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:04:57,076 INFO L124 PetriNetUnfolderBase]: 1136/6735 cut-off events. [2025-01-09 21:04:57,077 INFO L125 PetriNetUnfolderBase]: For 644/644 co-relation queries the response was YES. [2025-01-09 21:04:57,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8351 conditions, 6735 events. 1136/6735 cut-off events. For 644/644 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 70836 event pairs, 690 based on Foata normal form. 40/5788 useless extension candidates. Maximal degree in co-relation 8303. Up to 1091 conditions per place. [2025-01-09 21:04:57,140 INFO L140 encePairwiseOnDemand]: 329/332 looper letters, 27 selfloop transitions, 2 changer transitions 0/318 dead transitions. [2025-01-09 21:04:57,140 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 318 transitions, 741 flow [2025-01-09 21:04:57,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:04:57,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:04:57,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 918 transitions. [2025-01-09 21:04:57,141 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9216867469879518 [2025-01-09 21:04:57,141 INFO L175 Difference]: Start difference. First operand has 302 places, 308 transitions, 648 flow. Second operand 3 states and 918 transitions. [2025-01-09 21:04:57,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 318 transitions, 741 flow [2025-01-09 21:04:57,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 318 transitions, 739 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:04:57,145 INFO L231 Difference]: Finished difference. Result has 304 places, 309 transitions, 658 flow [2025-01-09 21:04:57,146 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=646, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=308, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=306, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=658, PETRI_PLACES=304, PETRI_TRANSITIONS=309} [2025-01-09 21:04:57,146 INFO L279 CegarLoopForPetriNet]: 312 programPoint places, -8 predicate places. [2025-01-09 21:04:57,146 INFO L471 AbstractCegarLoop]: Abstraction has has 304 places, 309 transitions, 658 flow [2025-01-09 21:04:57,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 298.3333333333333) internal successors, (895), 3 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:04:57,146 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:04:57,147 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:04:57,156 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-09 21:04:57,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:04:57,351 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-01-09 21:04:57,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:04:57,351 INFO L85 PathProgramCache]: Analyzing trace with hash -1246154566, now seen corresponding path program 1 times [2025-01-09 21:04:57,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:04:57,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613395730] [2025-01-09 21:04:57,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:04:57,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:04:57,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 21:04:57,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 21:04:57,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:04:57,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:04:57,396 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 21:04:57,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:04:57,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613395730] [2025-01-09 21:04:57,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613395730] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:04:57,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1088549821] [2025-01-09 21:04:57,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:04:57,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:04:57,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:04:57,400 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 21:04:57,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-09 21:04:57,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 21:04:57,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 21:04:57,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:04:57,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:04:57,489 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 21:04:57,490 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:04:57,511 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 21:04:57,512 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:04:57,538 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 21:04:57,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1088549821] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 21:04:57,539 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 21:04:57,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-01-09 21:04:57,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928911049] [2025-01-09 21:04:57,539 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 21:04:57,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 21:04:57,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:04:57,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 21:04:57,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-09 21:04:57,584 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 294 out of 332 [2025-01-09 21:04:57,587 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 309 transitions, 658 flow. Second operand has 10 states, 10 states have (on average 296.2) internal successors, (2962), 10 states have internal predecessors, (2962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:04:57,587 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:04:57,587 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 294 of 332 [2025-01-09 21:04:57,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:04:57,928 INFO L124 PetriNetUnfolderBase]: 366/3121 cut-off events. [2025-01-09 21:04:57,929 INFO L125 PetriNetUnfolderBase]: For 281/281 co-relation queries the response was YES. [2025-01-09 21:04:57,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3600 conditions, 3121 events. 366/3121 cut-off events. For 281/281 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 26839 event pairs, 204 based on Foata normal form. 2/2699 useless extension candidates. Maximal degree in co-relation 3504. Up to 330 conditions per place. [2025-01-09 21:04:57,971 INFO L140 encePairwiseOnDemand]: 326/332 looper letters, 20 selfloop transitions, 9 changer transitions 0/317 dead transitions. [2025-01-09 21:04:57,971 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 317 transitions, 734 flow [2025-01-09 21:04:57,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 21:04:57,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-09 21:04:57,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2677 transitions. [2025-01-09 21:04:57,974 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8959170013386881 [2025-01-09 21:04:57,974 INFO L175 Difference]: Start difference. First operand has 304 places, 309 transitions, 658 flow. Second operand 9 states and 2677 transitions. [2025-01-09 21:04:57,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 317 transitions, 734 flow [2025-01-09 21:04:57,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 311 places, 317 transitions, 732 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:04:57,978 INFO L231 Difference]: Finished difference. Result has 314 places, 315 transitions, 706 flow [2025-01-09 21:04:57,978 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=656, PETRI_DIFFERENCE_MINUEND_PLACES=303, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=309, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=303, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=706, PETRI_PLACES=314, PETRI_TRANSITIONS=315} [2025-01-09 21:04:57,979 INFO L279 CegarLoopForPetriNet]: 312 programPoint places, 2 predicate places. [2025-01-09 21:04:57,979 INFO L471 AbstractCegarLoop]: Abstraction has has 314 places, 315 transitions, 706 flow [2025-01-09 21:04:57,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 296.2) internal successors, (2962), 10 states have internal predecessors, (2962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:04:57,980 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:04:57,980 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:04:57,986 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-01-09 21:04:58,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:04:58,180 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-01-09 21:04:58,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:04:58,181 INFO L85 PathProgramCache]: Analyzing trace with hash 316766202, now seen corresponding path program 2 times [2025-01-09 21:04:58,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:04:58,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415866517] [2025-01-09 21:04:58,182 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 21:04:58,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:04:58,190 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 95 statements into 2 equivalence classes. [2025-01-09 21:04:58,195 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 95 of 95 statements. [2025-01-09 21:04:58,195 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 21:04:58,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:04:58,277 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 21:04:58,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:04:58,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415866517] [2025-01-09 21:04:58,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415866517] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:04:58,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1271453274] [2025-01-09 21:04:58,277 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 21:04:58,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:04:58,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:04:58,280 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 21:04:58,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-09 21:04:58,357 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 95 statements into 2 equivalence classes. [2025-01-09 21:04:58,380 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 95 of 95 statements. [2025-01-09 21:04:58,380 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 21:04:58,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:04:58,381 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 21:04:58,383 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:04:58,436 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 21:04:58,436 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:04:58,526 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 21:04:58,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1271453274] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 21:04:58,526 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 21:04:58,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2025-01-09 21:04:58,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778702821] [2025-01-09 21:04:58,526 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 21:04:58,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 21:04:58,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:04:58,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 21:04:58,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-01-09 21:04:58,613 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 294 out of 332 [2025-01-09 21:04:58,616 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 314 places, 315 transitions, 706 flow. Second operand has 15 states, 15 states have (on average 296.26666666666665) internal successors, (4444), 15 states have internal predecessors, (4444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:04:58,617 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:04:58,617 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 294 of 332 [2025-01-09 21:04:58,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:04:59,193 INFO L124 PetriNetUnfolderBase]: 366/3160 cut-off events. [2025-01-09 21:04:59,193 INFO L125 PetriNetUnfolderBase]: For 303/303 co-relation queries the response was YES. [2025-01-09 21:04:59,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3693 conditions, 3160 events. 366/3160 cut-off events. For 303/303 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 26798 event pairs, 204 based on Foata normal form. 3/2739 useless extension candidates. Maximal degree in co-relation 3508. Up to 330 conditions per place. [2025-01-09 21:04:59,236 INFO L140 encePairwiseOnDemand]: 326/332 looper letters, 23 selfloop transitions, 18 changer transitions 0/329 dead transitions. [2025-01-09 21:04:59,236 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 331 places, 329 transitions, 862 flow [2025-01-09 21:04:59,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 21:04:59,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-01-09 21:04:59,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 5336 transitions. [2025-01-09 21:04:59,242 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.892904953145917 [2025-01-09 21:04:59,242 INFO L175 Difference]: Start difference. First operand has 314 places, 315 transitions, 706 flow. Second operand 18 states and 5336 transitions. [2025-01-09 21:04:59,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 331 places, 329 transitions, 862 flow [2025-01-09 21:04:59,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 330 places, 329 transitions, 850 flow, removed 5 selfloop flow, removed 1 redundant places. [2025-01-09 21:04:59,246 INFO L231 Difference]: Finished difference. Result has 334 places, 325 transitions, 806 flow [2025-01-09 21:04:59,247 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=700, PETRI_DIFFERENCE_MINUEND_PLACES=313, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=315, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=304, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=806, PETRI_PLACES=334, PETRI_TRANSITIONS=325} [2025-01-09 21:04:59,247 INFO L279 CegarLoopForPetriNet]: 312 programPoint places, 22 predicate places. [2025-01-09 21:04:59,247 INFO L471 AbstractCegarLoop]: Abstraction has has 334 places, 325 transitions, 806 flow [2025-01-09 21:04:59,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 296.26666666666665) internal successors, (4444), 15 states have internal predecessors, (4444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:04:59,248 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:04:59,248 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:04:59,257 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-01-09 21:04:59,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:04:59,449 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-01-09 21:04:59,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:04:59,450 INFO L85 PathProgramCache]: Analyzing trace with hash 450547292, now seen corresponding path program 3 times [2025-01-09 21:04:59,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:04:59,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742041613] [2025-01-09 21:04:59,450 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 21:04:59,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:04:59,467 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 134 statements into 8 equivalence classes. [2025-01-09 21:04:59,499 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 134 of 134 statements. [2025-01-09 21:04:59,500 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-01-09 21:04:59,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:04:59,500 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:04:59,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-01-09 21:04:59,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-01-09 21:04:59,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:04:59,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:04:59,523 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:04:59,523 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:04:59,524 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (21 of 22 remaining) [2025-01-09 21:04:59,524 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (20 of 22 remaining) [2025-01-09 21:04:59,524 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (19 of 22 remaining) [2025-01-09 21:04:59,524 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (18 of 22 remaining) [2025-01-09 21:04:59,524 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (17 of 22 remaining) [2025-01-09 21:04:59,524 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (16 of 22 remaining) [2025-01-09 21:04:59,524 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (15 of 22 remaining) [2025-01-09 21:04:59,524 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (14 of 22 remaining) [2025-01-09 21:04:59,524 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (13 of 22 remaining) [2025-01-09 21:04:59,524 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (12 of 22 remaining) [2025-01-09 21:04:59,524 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (11 of 22 remaining) [2025-01-09 21:04:59,524 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (10 of 22 remaining) [2025-01-09 21:04:59,524 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (9 of 22 remaining) [2025-01-09 21:04:59,525 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (8 of 22 remaining) [2025-01-09 21:04:59,525 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (7 of 22 remaining) [2025-01-09 21:04:59,525 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (6 of 22 remaining) [2025-01-09 21:04:59,528 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (5 of 22 remaining) [2025-01-09 21:04:59,529 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (4 of 22 remaining) [2025-01-09 21:04:59,529 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (3 of 22 remaining) [2025-01-09 21:04:59,529 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (2 of 22 remaining) [2025-01-09 21:04:59,529 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (1 of 22 remaining) [2025-01-09 21:04:59,529 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (0 of 22 remaining) [2025-01-09 21:04:59,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 21:04:59,529 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1] [2025-01-09 21:04:59,529 WARN L246 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:04:59,529 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2025-01-09 21:04:59,570 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:04:59,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 377 places, 402 transitions, 844 flow [2025-01-09 21:04:59,630 INFO L124 PetriNetUnfolderBase]: 36/445 cut-off events. [2025-01-09 21:04:59,630 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-01-09 21:04:59,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 471 conditions, 445 events. 36/445 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1766 event pairs, 0 based on Foata normal form. 0/382 useless extension candidates. Maximal degree in co-relation 379. Up to 6 conditions per place. [2025-01-09 21:04:59,636 INFO L82 GeneralOperation]: Start removeDead. Operand has 377 places, 402 transitions, 844 flow [2025-01-09 21:04:59,639 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 377 places, 402 transitions, 844 flow [2025-01-09 21:04:59,640 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:04:59,640 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;@3d267eb9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:04:59,640 INFO L334 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2025-01-09 21:04:59,643 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:04:59,643 INFO L124 PetriNetUnfolderBase]: 0/52 cut-off events. [2025-01-09 21:04:59,643 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:04:59,643 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:04:59,643 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:04:59,643 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-01-09 21:04:59,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:04:59,644 INFO L85 PathProgramCache]: Analyzing trace with hash 160522233, now seen corresponding path program 1 times [2025-01-09 21:04:59,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:04:59,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614600648] [2025-01-09 21:04:59,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:04:59,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:04:59,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-09 21:04:59,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-09 21:04:59,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:04:59,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:04:59,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:04:59,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:04:59,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614600648] [2025-01-09 21:04:59,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614600648] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:04:59,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:04:59,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:04:59,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655472661] [2025-01-09 21:04:59,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:04:59,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:04:59,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:04:59,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:04:59,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:04:59,972 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 333 out of 402 [2025-01-09 21:04:59,973 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 377 places, 402 transitions, 844 flow. Second operand has 6 states, 6 states have (on average 334.5) internal successors, (2007), 6 states have internal predecessors, (2007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:04:59,973 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:04:59,973 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 333 of 402 [2025-01-09 21:04:59,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:05:28,004 INFO L124 PetriNetUnfolderBase]: 98025/234114 cut-off events. [2025-01-09 21:05:28,004 INFO L125 PetriNetUnfolderBase]: For 43281/43281 co-relation queries the response was YES. [2025-01-09 21:05:30,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 360711 conditions, 234114 events. 98025/234114 cut-off events. For 43281/43281 co-relation queries the response was YES. Maximal size of possible extension queue 9655. Compared 3369898 event pairs, 64428 based on Foata normal form. 65085/249683 useless extension candidates. Maximal degree in co-relation 45257. Up to 110246 conditions per place. [2025-01-09 21:05:32,331 INFO L140 encePairwiseOnDemand]: 380/402 looper letters, 41 selfloop transitions, 5 changer transitions 0/372 dead transitions. [2025-01-09 21:05:32,331 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 367 places, 372 transitions, 876 flow [2025-01-09 21:05:32,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:05:32,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:05:32,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2061 transitions. [2025-01-09 21:05:32,336 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8544776119402985 [2025-01-09 21:05:32,336 INFO L175 Difference]: Start difference. First operand has 377 places, 402 transitions, 844 flow. Second operand 6 states and 2061 transitions. [2025-01-09 21:05:32,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 367 places, 372 transitions, 876 flow [2025-01-09 21:05:32,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 367 places, 372 transitions, 864 flow, removed 6 selfloop flow, removed 0 redundant places. [2025-01-09 21:05:32,364 INFO L231 Difference]: Finished difference. Result has 367 places, 372 transitions, 782 flow [2025-01-09 21:05:32,368 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=402, PETRI_DIFFERENCE_MINUEND_FLOW=772, PETRI_DIFFERENCE_MINUEND_PLACES=362, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=372, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=367, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=782, PETRI_PLACES=367, PETRI_TRANSITIONS=372} [2025-01-09 21:05:32,368 INFO L279 CegarLoopForPetriNet]: 377 programPoint places, -10 predicate places. [2025-01-09 21:05:32,368 INFO L471 AbstractCegarLoop]: Abstraction has has 367 places, 372 transitions, 782 flow [2025-01-09 21:05:32,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 334.5) internal successors, (2007), 6 states have internal predecessors, (2007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:05:32,369 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:05:32,369 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] [2025-01-09 21:05:32,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 21:05:32,369 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-01-09 21:05:32,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:05:32,369 INFO L85 PathProgramCache]: Analyzing trace with hash -596400793, now seen corresponding path program 1 times [2025-01-09 21:05:32,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:05:32,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488094182] [2025-01-09 21:05:32,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:05:32,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:05:32,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-01-09 21:05:32,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-09 21:05:32,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:05:32,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:05:32,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:05:32,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:05:32,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488094182] [2025-01-09 21:05:32,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488094182] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:05:32,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:05:32,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:05:32,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406897581] [2025-01-09 21:05:32,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:05:32,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:05:32,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:05:32,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:05:32,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:05:32,434 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 360 out of 402 [2025-01-09 21:05:32,439 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 367 places, 372 transitions, 782 flow. Second operand has 3 states, 3 states have (on average 362.0) internal successors, (1086), 3 states have internal predecessors, (1086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:05:32,439 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:05:32,439 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 360 of 402 [2025-01-09 21:05:32,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:05:33,557 INFO L124 PetriNetUnfolderBase]: 1337/9459 cut-off events. [2025-01-09 21:05:33,557 INFO L125 PetriNetUnfolderBase]: For 1173/1173 co-relation queries the response was YES. [2025-01-09 21:05:33,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11060 conditions, 9459 events. 1337/9459 cut-off events. For 1173/1173 co-relation queries the response was YES. Maximal size of possible extension queue 252. Compared 106233 event pairs, 852 based on Foata normal form. 1/8193 useless extension candidates. Maximal degree in co-relation 10994. Up to 1221 conditions per place. [2025-01-09 21:05:33,723 INFO L140 encePairwiseOnDemand]: 399/402 looper letters, 19 selfloop transitions, 2 changer transitions 0/373 dead transitions. [2025-01-09 21:05:33,724 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 369 places, 373 transitions, 828 flow [2025-01-09 21:05:33,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:05:33,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:05:33,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1102 transitions. [2025-01-09 21:05:33,725 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9137645107794361 [2025-01-09 21:05:33,725 INFO L175 Difference]: Start difference. First operand has 367 places, 372 transitions, 782 flow. Second operand 3 states and 1102 transitions. [2025-01-09 21:05:33,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 369 places, 373 transitions, 828 flow [2025-01-09 21:05:33,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 364 places, 373 transitions, 816 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:05:33,730 INFO L231 Difference]: Finished difference. Result has 365 places, 373 transitions, 784 flow [2025-01-09 21:05:33,730 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=402, PETRI_DIFFERENCE_MINUEND_FLOW=772, PETRI_DIFFERENCE_MINUEND_PLACES=362, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=372, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=370, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=784, PETRI_PLACES=365, PETRI_TRANSITIONS=373} [2025-01-09 21:05:33,731 INFO L279 CegarLoopForPetriNet]: 377 programPoint places, -12 predicate places. [2025-01-09 21:05:33,731 INFO L471 AbstractCegarLoop]: Abstraction has has 365 places, 373 transitions, 784 flow [2025-01-09 21:05:33,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 362.0) internal successors, (1086), 3 states have internal predecessors, (1086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:05:33,731 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:05:33,731 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] [2025-01-09 21:05:33,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 21:05:33,732 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-01-09 21:05:33,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:05:33,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1144919223, now seen corresponding path program 1 times [2025-01-09 21:05:33,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:05:33,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578920355] [2025-01-09 21:05:33,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:05:33,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:05:33,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 21:05:33,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 21:05:33,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:05:33,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:05:33,769 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:05:33,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:05:33,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578920355] [2025-01-09 21:05:33,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578920355] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:05:33,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [622869529] [2025-01-09 21:05:33,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:05:33,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:05:33,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:05:33,773 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 21:05:33,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-01-09 21:05:33,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 21:05:33,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 21:05:33,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:05:33,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:05:33,863 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 21:05:33,863 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:05:33,869 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 21:05:33,870 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 21:05:33,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [622869529] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:05:33,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 21:05:33,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-01-09 21:05:33,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212220713] [2025-01-09 21:05:33,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:05:33,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:05:33,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:05:33,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:05:33,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:05:33,887 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 359 out of 402 [2025-01-09 21:05:33,888 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 365 places, 373 transitions, 784 flow. Second operand has 3 states, 3 states have (on average 361.3333333333333) internal successors, (1084), 3 states have internal predecessors, (1084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:05:33,888 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:05:33,888 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 359 of 402 [2025-01-09 21:05:33,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:05:36,812 INFO L124 PetriNetUnfolderBase]: 4346/23625 cut-off events. [2025-01-09 21:05:36,812 INFO L125 PetriNetUnfolderBase]: For 2702/2702 co-relation queries the response was YES. [2025-01-09 21:05:37,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29292 conditions, 23625 events. 4346/23625 cut-off events. For 2702/2702 co-relation queries the response was YES. Maximal size of possible extension queue 586. Compared 310465 event pairs, 2796 based on Foata normal form. 121/20356 useless extension candidates. Maximal degree in co-relation 29243. Up to 4007 conditions per place. [2025-01-09 21:05:37,168 INFO L140 encePairwiseOnDemand]: 399/402 looper letters, 33 selfloop transitions, 2 changer transitions 0/386 dead transitions. [2025-01-09 21:05:37,168 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 367 places, 386 transitions, 900 flow [2025-01-09 21:05:37,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:05:37,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:05:37,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1113 transitions. [2025-01-09 21:05:37,171 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9228855721393034 [2025-01-09 21:05:37,171 INFO L175 Difference]: Start difference. First operand has 365 places, 373 transitions, 784 flow. Second operand 3 states and 1113 transitions. [2025-01-09 21:05:37,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 367 places, 386 transitions, 900 flow [2025-01-09 21:05:37,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 366 places, 386 transitions, 898 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:05:37,182 INFO L231 Difference]: Finished difference. Result has 367 places, 374 transitions, 794 flow [2025-01-09 21:05:37,182 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=402, PETRI_DIFFERENCE_MINUEND_FLOW=782, PETRI_DIFFERENCE_MINUEND_PLACES=364, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=373, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=371, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=794, PETRI_PLACES=367, PETRI_TRANSITIONS=374} [2025-01-09 21:05:37,183 INFO L279 CegarLoopForPetriNet]: 377 programPoint places, -10 predicate places. [2025-01-09 21:05:37,183 INFO L471 AbstractCegarLoop]: Abstraction has has 367 places, 374 transitions, 794 flow [2025-01-09 21:05:37,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 361.3333333333333) internal successors, (1084), 3 states have internal predecessors, (1084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:05:37,183 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:05:37,183 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] [2025-01-09 21:05:37,189 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-01-09 21:05:37,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-01-09 21:05:37,384 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-01-09 21:05:37,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:05:37,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1672884092, now seen corresponding path program 1 times [2025-01-09 21:05:37,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:05:37,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144083104] [2025-01-09 21:05:37,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:05:37,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:05:37,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-01-09 21:05:37,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-01-09 21:05:37,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:05:37,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:05:37,423 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 21:05:37,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:05:37,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144083104] [2025-01-09 21:05:37,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144083104] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:05:37,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [610024782] [2025-01-09 21:05:37,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:05:37,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:05:37,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:05:37,425 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 21:05:37,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-01-09 21:05:37,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-01-09 21:05:37,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-01-09 21:05:37,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:05:37,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:05:37,528 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 21:05:37,529 INFO L279 TraceCheckSpWp]: Computing forward predicates...