./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/09-regions_10-arraylist_rc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/09-regions_10-arraylist_rc.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 406569de44adfe8c1be02a1261bb34c87b6e96e16ab8124ccb5c3636d70e4f02 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 09:22:04,501 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 09:22:04,578 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-06 09:22:04,583 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 09:22:04,584 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 09:22:04,610 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 09:22:04,611 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 09:22:04,612 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 09:22:04,612 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 09:22:04,613 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 09:22:04,614 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 09:22:04,614 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 09:22:04,614 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 09:22:04,614 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 09:22:04,615 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 09:22:04,615 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 09:22:04,615 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 09:22:04,615 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 09:22:04,616 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 09:22:04,616 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 09:22:04,616 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 09:22:04,616 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 09:22:04,616 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-06 09:22:04,616 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 09:22:04,616 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 09:22:04,616 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 09:22:04,616 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 09:22:04,616 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 09:22:04,616 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 09:22:04,617 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 09:22:04,617 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 09:22:04,617 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:22:04,617 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 09:22:04,617 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 09:22:04,617 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 09:22:04,617 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 09:22:04,617 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 09:22:04,617 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 09:22:04,617 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 09:22:04,617 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 09:22:04,617 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 09:22:04,617 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 09:22:04,617 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 -> 406569de44adfe8c1be02a1261bb34c87b6e96e16ab8124ccb5c3636d70e4f02 [2025-02-06 09:22:04,911 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 09:22:04,917 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 09:22:04,920 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 09:22:04,921 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 09:22:04,921 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 09:22:04,922 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/09-regions_10-arraylist_rc.i [2025-02-06 09:22:06,163 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/889be99d1/d6735a834a0b469a8420a200f7549d58/FLAG0e8329896 [2025-02-06 09:22:06,483 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 09:22:06,487 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_10-arraylist_rc.i [2025-02-06 09:22:06,506 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/889be99d1/d6735a834a0b469a8420a200f7549d58/FLAG0e8329896 [2025-02-06 09:22:06,517 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/889be99d1/d6735a834a0b469a8420a200f7549d58 [2025-02-06 09:22:06,519 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 09:22:06,520 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 09:22:06,521 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 09:22:06,521 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 09:22:06,524 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 09:22:06,525 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:22:06" (1/1) ... [2025-02-06 09:22:06,527 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9b569e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:22:06, skipping insertion in model container [2025-02-06 09:22:06,528 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:22:06" (1/1) ... [2025-02-06 09:22:06,572 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 09:22:06,918 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:22:06,953 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 09:22:07,038 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:22:07,111 INFO L204 MainTranslator]: Completed translation [2025-02-06 09:22:07,112 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:22:07 WrapperNode [2025-02-06 09:22:07,113 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 09:22:07,114 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 09:22:07,114 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 09:22:07,114 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 09:22:07,121 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:22:07" (1/1) ... [2025-02-06 09:22:07,140 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:22:07" (1/1) ... [2025-02-06 09:22:07,178 INFO L138 Inliner]: procedures = 372, calls = 88, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 294 [2025-02-06 09:22:07,179 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 09:22:07,179 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 09:22:07,179 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 09:22:07,179 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 09:22:07,186 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:22:07" (1/1) ... [2025-02-06 09:22:07,187 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:22:07" (1/1) ... [2025-02-06 09:22:07,192 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:22:07" (1/1) ... [2025-02-06 09:22:07,193 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:22:07" (1/1) ... [2025-02-06 09:22:07,221 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:22:07" (1/1) ... [2025-02-06 09:22:07,223 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:22:07" (1/1) ... [2025-02-06 09:22:07,225 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:22:07" (1/1) ... [2025-02-06 09:22:07,226 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:22:07" (1/1) ... [2025-02-06 09:22:07,235 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 09:22:07,236 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 09:22:07,236 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 09:22:07,236 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 09:22:07,237 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:22:07" (1/1) ... [2025-02-06 09:22:07,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:22:07,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:22:07,270 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 09:22:07,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 09:22:07,294 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-02-06 09:22:07,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-02-06 09:22:07,294 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-06 09:22:07,294 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-06 09:22:07,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-06 09:22:07,295 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-06 09:22:07,295 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 09:22:07,295 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 09:22:07,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-02-06 09:22:07,295 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-02-06 09:22:07,295 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-02-06 09:22:07,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-06 09:22:07,296 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 09:22:07,296 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 09:22:07,297 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 09:22:07,450 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 09:22:07,452 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 09:22:08,138 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 09:22:08,138 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 09:22:08,176 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 09:22:08,177 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 09:22:08,177 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:22:08 BoogieIcfgContainer [2025-02-06 09:22:08,177 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 09:22:08,179 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 09:22:08,179 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 09:22:08,184 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 09:22:08,184 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 09:22:06" (1/3) ... [2025-02-06 09:22:08,184 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5eb5c2ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:22:08, skipping insertion in model container [2025-02-06 09:22:08,184 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:22:07" (2/3) ... [2025-02-06 09:22:08,184 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5eb5c2ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:22:08, skipping insertion in model container [2025-02-06 09:22:08,185 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:22:08" (3/3) ... [2025-02-06 09:22:08,186 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_10-arraylist_rc.i [2025-02-06 09:22:08,201 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 09:22:08,202 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09-regions_10-arraylist_rc.i that has 2 procedures, 336 locations, 1 initial locations, 2 loop locations, and 18 error locations. [2025-02-06 09:22:08,205 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 09:22:08,312 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 09:22:08,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 339 places, 339 transitions, 682 flow [2025-02-06 09:22:08,486 INFO L124 PetriNetUnfolderBase]: 4/338 cut-off events. [2025-02-06 09:22:08,488 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:22:08,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 342 conditions, 338 events. 4/338 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 416 event pairs, 0 based on Foata normal form. 0/316 useless extension candidates. Maximal degree in co-relation 210. Up to 2 conditions per place. [2025-02-06 09:22:08,497 INFO L82 GeneralOperation]: Start removeDead. Operand has 339 places, 339 transitions, 682 flow [2025-02-06 09:22:08,505 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 338 places, 338 transitions, 679 flow [2025-02-06 09:22:08,517 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 09:22:08,534 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;@15eaa631, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 09:22:08,534 INFO L334 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2025-02-06 09:22:08,570 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 09:22:08,570 INFO L124 PetriNetUnfolderBase]: 2/128 cut-off events. [2025-02-06 09:22:08,570 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:22:08,571 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:22:08,571 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:22:08,572 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-02-06 09:22:08,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:22:08,577 INFO L85 PathProgramCache]: Analyzing trace with hash 914903096, now seen corresponding path program 1 times [2025-02-06 09:22:08,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:22:08,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941879629] [2025-02-06 09:22:08,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:22:08,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:22:08,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-06 09:22:08,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-06 09:22:08,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:22:08,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:22:09,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:22:09,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:22:09,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941879629] [2025-02-06 09:22:09,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941879629] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:22:09,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:22:09,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 09:22:09,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421686665] [2025-02-06 09:22:09,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:22:09,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:22:09,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:22:09,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:22:09,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:22:09,095 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 326 out of 339 [2025-02-06 09:22:09,100 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 338 places, 338 transitions, 679 flow. Second operand has 3 states, 3 states have (on average 327.3333333333333) internal successors, (982), 3 states have internal predecessors, (982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:22:09,100 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:22:09,100 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 326 of 339 [2025-02-06 09:22:09,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:22:09,206 INFO L124 PetriNetUnfolderBase]: 8/416 cut-off events. [2025-02-06 09:22:09,206 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 09:22:09,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 416 events. 8/416 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 887 event pairs, 6 based on Foata normal form. 5/390 useless extension candidates. Maximal degree in co-relation 219. Up to 24 conditions per place. [2025-02-06 09:22:09,211 INFO L140 encePairwiseOnDemand]: 334/339 looper letters, 10 selfloop transitions, 2 changer transitions 1/337 dead transitions. [2025-02-06 09:22:09,211 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 340 places, 337 transitions, 701 flow [2025-02-06 09:22:09,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:22:09,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:22:09,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 993 transitions. [2025-02-06 09:22:09,229 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.976401179941003 [2025-02-06 09:22:09,231 INFO L175 Difference]: Start difference. First operand has 338 places, 338 transitions, 679 flow. Second operand 3 states and 993 transitions. [2025-02-06 09:22:09,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 340 places, 337 transitions, 701 flow [2025-02-06 09:22:09,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 339 places, 337 transitions, 700 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:22:09,246 INFO L231 Difference]: Finished difference. Result has 340 places, 336 transitions, 684 flow [2025-02-06 09:22:09,249 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=674, PETRI_DIFFERENCE_MINUEND_PLACES=337, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=336, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=334, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=684, PETRI_PLACES=340, PETRI_TRANSITIONS=336} [2025-02-06 09:22:09,253 INFO L279 CegarLoopForPetriNet]: 338 programPoint places, 2 predicate places. [2025-02-06 09:22:09,254 INFO L471 AbstractCegarLoop]: Abstraction has has 340 places, 336 transitions, 684 flow [2025-02-06 09:22:09,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 327.3333333333333) internal successors, (982), 3 states have internal predecessors, (982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:22:09,255 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:22:09,255 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:22:09,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 09:22:09,256 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-02-06 09:22:09,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:22:09,257 INFO L85 PathProgramCache]: Analyzing trace with hash 645831783, now seen corresponding path program 1 times [2025-02-06 09:22:09,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:22:09,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338488022] [2025-02-06 09:22:09,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:22:09,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:22:09,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-06 09:22:09,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-06 09:22:09,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:22:09,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:22:09,598 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:22:09,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:22:09,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338488022] [2025-02-06 09:22:09,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338488022] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 09:22:09,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1322678918] [2025-02-06 09:22:09,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:22:09,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:22:09,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:22:09,602 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 09:22:09,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 09:22:09,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-06 09:22:09,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-06 09:22:09,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:22:09,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:22:09,721 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 09:22:09,726 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 09:22:09,787 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:22:09,789 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 09:22:09,839 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:22:09,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1322678918] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 09:22:09,840 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 09:22:09,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-02-06 09:22:09,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351142151] [2025-02-06 09:22:09,842 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 09:22:09,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 09:22:09,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:22:09,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 09:22:09,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-06 09:22:09,883 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 323 out of 339 [2025-02-06 09:22:09,888 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 340 places, 336 transitions, 684 flow. Second operand has 10 states, 10 states have (on average 324.8) internal successors, (3248), 10 states have internal predecessors, (3248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:22:09,888 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:22:09,888 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 323 of 339 [2025-02-06 09:22:09,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:22:10,044 INFO L124 PetriNetUnfolderBase]: 8/422 cut-off events. [2025-02-06 09:22:10,045 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 09:22:10,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 469 conditions, 422 events. 8/422 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 880 event pairs, 6 based on Foata normal form. 2/394 useless extension candidates. Maximal degree in co-relation 384. Up to 24 conditions per place. [2025-02-06 09:22:10,047 INFO L140 encePairwiseOnDemand]: 333/339 looper letters, 14 selfloop transitions, 9 changer transitions 0/344 dead transitions. [2025-02-06 09:22:10,048 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 347 places, 344 transitions, 748 flow [2025-02-06 09:22:10,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 09:22:10,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-06 09:22:10,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2932 transitions. [2025-02-06 09:22:10,056 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9609963946247132 [2025-02-06 09:22:10,058 INFO L175 Difference]: Start difference. First operand has 340 places, 336 transitions, 684 flow. Second operand 9 states and 2932 transitions. [2025-02-06 09:22:10,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 347 places, 344 transitions, 748 flow [2025-02-06 09:22:10,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 346 places, 344 transitions, 746 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:22:10,064 INFO L231 Difference]: Finished difference. Result has 349 places, 342 transitions, 732 flow [2025-02-06 09:22:10,065 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=682, PETRI_DIFFERENCE_MINUEND_PLACES=338, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=336, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=330, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=732, PETRI_PLACES=349, PETRI_TRANSITIONS=342} [2025-02-06 09:22:10,066 INFO L279 CegarLoopForPetriNet]: 338 programPoint places, 11 predicate places. [2025-02-06 09:22:10,066 INFO L471 AbstractCegarLoop]: Abstraction has has 349 places, 342 transitions, 732 flow [2025-02-06 09:22:10,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 324.8) internal successors, (3248), 10 states have internal predecessors, (3248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:22:10,068 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:22:10,068 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:22:10,077 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-02-06 09:22:10,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:22:10,269 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-02-06 09:22:10,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:22:10,271 INFO L85 PathProgramCache]: Analyzing trace with hash -263212281, now seen corresponding path program 2 times [2025-02-06 09:22:10,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:22:10,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15826161] [2025-02-06 09:22:10,272 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 09:22:10,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:22:10,298 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 114 statements into 2 equivalence classes. [2025-02-06 09:22:10,316 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 99 of 114 statements. [2025-02-06 09:22:10,317 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 09:22:10,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:22:10,900 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-06 09:22:10,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:22:10,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15826161] [2025-02-06 09:22:10,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15826161] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:22:10,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:22:10,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:22:10,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580387194] [2025-02-06 09:22:10,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:22:10,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:22:10,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:22:10,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:22:10,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:22:11,447 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 254 out of 339 [2025-02-06 09:22:11,450 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 349 places, 342 transitions, 732 flow. Second operand has 6 states, 6 states have (on average 255.33333333333334) internal successors, (1532), 6 states have internal predecessors, (1532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:22:11,450 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:22:11,450 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 254 of 339 [2025-02-06 09:22:11,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:22:11,946 INFO L124 PetriNetUnfolderBase]: 366/1706 cut-off events. [2025-02-06 09:22:11,947 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-02-06 09:22:11,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2548 conditions, 1706 events. 366/1706 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 10167 event pairs, 364 based on Foata normal form. 0/1580 useless extension candidates. Maximal degree in co-relation 2435. Up to 800 conditions per place. [2025-02-06 09:22:11,955 INFO L140 encePairwiseOnDemand]: 327/339 looper letters, 71 selfloop transitions, 10 changer transitions 0/340 dead transitions. [2025-02-06 09:22:11,956 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 352 places, 340 transitions, 890 flow [2025-02-06 09:22:11,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:22:11,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:22:11,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1607 transitions. [2025-02-06 09:22:11,963 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7900688298918387 [2025-02-06 09:22:11,963 INFO L175 Difference]: Start difference. First operand has 349 places, 342 transitions, 732 flow. Second operand 6 states and 1607 transitions. [2025-02-06 09:22:11,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 352 places, 340 transitions, 890 flow [2025-02-06 09:22:11,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 351 places, 340 transitions, 884 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-02-06 09:22:11,970 INFO L231 Difference]: Finished difference. Result has 351 places, 340 transitions, 742 flow [2025-02-06 09:22:11,971 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=722, PETRI_DIFFERENCE_MINUEND_PLACES=346, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=340, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=330, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=742, PETRI_PLACES=351, PETRI_TRANSITIONS=340} [2025-02-06 09:22:11,972 INFO L279 CegarLoopForPetriNet]: 338 programPoint places, 13 predicate places. [2025-02-06 09:22:11,972 INFO L471 AbstractCegarLoop]: Abstraction has has 351 places, 340 transitions, 742 flow [2025-02-06 09:22:11,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 255.33333333333334) internal successors, (1532), 6 states have internal predecessors, (1532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:22:11,973 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:22:11,973 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:22:11,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 09:22:11,974 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-02-06 09:22:11,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:22:11,974 INFO L85 PathProgramCache]: Analyzing trace with hash 937474965, now seen corresponding path program 1 times [2025-02-06 09:22:11,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:22:11,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660861199] [2025-02-06 09:22:11,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:22:11,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:22:11,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-02-06 09:22:12,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-02-06 09:22:12,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:22:12,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:22:12,062 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-06 09:22:12,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:22:12,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660861199] [2025-02-06 09:22:12,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660861199] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:22:12,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:22:12,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 09:22:12,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094632924] [2025-02-06 09:22:12,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:22:12,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:22:12,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:22:12,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:22:12,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:22:12,099 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 326 out of 339 [2025-02-06 09:22:12,100 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 351 places, 340 transitions, 742 flow. Second operand has 3 states, 3 states have (on average 328.0) internal successors, (984), 3 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:22:12,101 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:22:12,101 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 326 of 339 [2025-02-06 09:22:12,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:22:12,174 INFO L124 PetriNetUnfolderBase]: 8/531 cut-off events. [2025-02-06 09:22:12,174 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-06 09:22:12,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 606 conditions, 531 events. 8/531 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 871 event pairs, 6 based on Foata normal form. 1/498 useless extension candidates. Maximal degree in co-relation 494. Up to 24 conditions per place. [2025-02-06 09:22:12,177 INFO L140 encePairwiseOnDemand]: 336/339 looper letters, 10 selfloop transitions, 2 changer transitions 0/341 dead transitions. [2025-02-06 09:22:12,177 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 353 places, 341 transitions, 768 flow [2025-02-06 09:22:12,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:22:12,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:22:12,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 991 transitions. [2025-02-06 09:22:12,180 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9744346116027532 [2025-02-06 09:22:12,180 INFO L175 Difference]: Start difference. First operand has 351 places, 340 transitions, 742 flow. Second operand 3 states and 991 transitions. [2025-02-06 09:22:12,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 353 places, 341 transitions, 768 flow [2025-02-06 09:22:12,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 348 places, 341 transitions, 748 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:22:12,186 INFO L231 Difference]: Finished difference. Result has 349 places, 341 transitions, 734 flow [2025-02-06 09:22:12,186 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=722, PETRI_DIFFERENCE_MINUEND_PLACES=346, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=340, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=338, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=734, PETRI_PLACES=349, PETRI_TRANSITIONS=341} [2025-02-06 09:22:12,187 INFO L279 CegarLoopForPetriNet]: 338 programPoint places, 11 predicate places. [2025-02-06 09:22:12,187 INFO L471 AbstractCegarLoop]: Abstraction has has 349 places, 341 transitions, 734 flow [2025-02-06 09:22:12,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 328.0) internal successors, (984), 3 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:22:12,188 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:22:12,188 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:22:12,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 09:22:12,189 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-02-06 09:22:12,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:22:12,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1434565419, now seen corresponding path program 1 times [2025-02-06 09:22:12,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:22:12,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825623613] [2025-02-06 09:22:12,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:22:12,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:22:12,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-02-06 09:22:12,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-02-06 09:22:12,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:22:12,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:22:12,375 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:22:12,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:22:12,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825623613] [2025-02-06 09:22:12,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825623613] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 09:22:12,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1826872508] [2025-02-06 09:22:12,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:22:12,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:22:12,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:22:12,378 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 09:22:12,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 09:22:12,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-02-06 09:22:12,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-02-06 09:22:12,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:22:12,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:22:12,500 INFO L256 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 09:22:12,503 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 09:22:12,560 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:22:12,560 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 09:22:12,665 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:22:12,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1826872508] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 09:22:12,669 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 09:22:12,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-02-06 09:22:12,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350417015] [2025-02-06 09:22:12,669 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 09:22:12,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-06 09:22:12,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:22:12,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-06 09:22:12,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-02-06 09:22:12,716 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 323 out of 339 [2025-02-06 09:22:12,722 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 349 places, 341 transitions, 734 flow. Second operand has 18 states, 18 states have (on average 324.8888888888889) internal successors, (5848), 18 states have internal predecessors, (5848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:22:12,722 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:22:12,723 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 323 of 339 [2025-02-06 09:22:12,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:22:13,015 INFO L124 PetriNetUnfolderBase]: 8/551 cut-off events. [2025-02-06 09:22:13,015 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2025-02-06 09:22:13,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 663 conditions, 551 events. 8/551 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 871 event pairs, 6 based on Foata normal form. 4/521 useless extension candidates. Maximal degree in co-relation 476. Up to 24 conditions per place. [2025-02-06 09:22:13,017 INFO L140 encePairwiseOnDemand]: 333/339 looper letters, 18 selfloop transitions, 21 changer transitions 0/359 dead transitions. [2025-02-06 09:22:13,018 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 369 places, 359 transitions, 900 flow [2025-02-06 09:22:13,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-06 09:22:13,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-02-06 09:22:13,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 6826 transitions. [2025-02-06 09:22:13,030 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.958842534063773 [2025-02-06 09:22:13,030 INFO L175 Difference]: Start difference. First operand has 349 places, 341 transitions, 734 flow. Second operand 21 states and 6826 transitions. [2025-02-06 09:22:13,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 369 places, 359 transitions, 900 flow [2025-02-06 09:22:13,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 368 places, 359 transitions, 898 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:22:13,039 INFO L231 Difference]: Finished difference. Result has 373 places, 354 transitions, 862 flow [2025-02-06 09:22:13,039 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=732, PETRI_DIFFERENCE_MINUEND_PLACES=348, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=341, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=330, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=862, PETRI_PLACES=373, PETRI_TRANSITIONS=354} [2025-02-06 09:22:13,040 INFO L279 CegarLoopForPetriNet]: 338 programPoint places, 35 predicate places. [2025-02-06 09:22:13,042 INFO L471 AbstractCegarLoop]: Abstraction has has 373 places, 354 transitions, 862 flow [2025-02-06 09:22:13,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 324.8888888888889) internal successors, (5848), 18 states have internal predecessors, (5848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:22:13,045 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:22:13,045 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:22:13,054 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-02-06 09:22:13,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:22:13,250 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-02-06 09:22:13,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:22:13,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1641631851, now seen corresponding path program 2 times [2025-02-06 09:22:13,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:22:13,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950953437] [2025-02-06 09:22:13,251 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 09:22:13,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:22:13,272 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 142 statements into 2 equivalence classes. [2025-02-06 09:22:13,282 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 107 of 142 statements. [2025-02-06 09:22:13,282 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 09:22:13,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:22:13,662 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-02-06 09:22:13,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:22:13,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950953437] [2025-02-06 09:22:13,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950953437] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:22:13,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:22:13,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:22:13,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727851007] [2025-02-06 09:22:13,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:22:13,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:22:13,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:22:13,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:22:13,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:22:14,127 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 254 out of 339 [2025-02-06 09:22:14,129 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 373 places, 354 transitions, 862 flow. Second operand has 6 states, 6 states have (on average 255.33333333333334) internal successors, (1532), 6 states have internal predecessors, (1532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:22:14,129 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:22:14,129 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 254 of 339 [2025-02-06 09:22:14,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:22:14,545 INFO L124 PetriNetUnfolderBase]: 366/1833 cut-off events. [2025-02-06 09:22:14,545 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2025-02-06 09:22:14,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2783 conditions, 1833 events. 366/1833 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 10063 event pairs, 364 based on Foata normal form. 0/1705 useless extension candidates. Maximal degree in co-relation 2590. Up to 830 conditions per place. [2025-02-06 09:22:14,556 INFO L140 encePairwiseOnDemand]: 327/339 looper letters, 71 selfloop transitions, 10 changer transitions 0/352 dead transitions. [2025-02-06 09:22:14,557 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 376 places, 352 transitions, 1020 flow [2025-02-06 09:22:14,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:22:14,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:22:14,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1607 transitions. [2025-02-06 09:22:14,561 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7900688298918387 [2025-02-06 09:22:14,562 INFO L175 Difference]: Start difference. First operand has 373 places, 354 transitions, 862 flow. Second operand 6 states and 1607 transitions. [2025-02-06 09:22:14,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 376 places, 352 transitions, 1020 flow [2025-02-06 09:22:14,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 370 places, 352 transitions, 996 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-02-06 09:22:14,570 INFO L231 Difference]: Finished difference. Result has 370 places, 352 transitions, 854 flow [2025-02-06 09:22:14,570 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=834, PETRI_DIFFERENCE_MINUEND_PLACES=365, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=352, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=342, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=854, PETRI_PLACES=370, PETRI_TRANSITIONS=352} [2025-02-06 09:22:14,571 INFO L279 CegarLoopForPetriNet]: 338 programPoint places, 32 predicate places. [2025-02-06 09:22:14,572 INFO L471 AbstractCegarLoop]: Abstraction has has 370 places, 352 transitions, 854 flow [2025-02-06 09:22:14,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 255.33333333333334) internal successors, (1532), 6 states have internal predecessors, (1532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:22:14,573 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:22:14,573 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:22:14,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 09:22:14,574 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-02-06 09:22:14,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:22:14,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1509174260, now seen corresponding path program 1 times [2025-02-06 09:22:14,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:22:14,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627330607] [2025-02-06 09:22:14,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:22:14,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:22:14,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-02-06 09:22:14,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-02-06 09:22:14,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:22:14,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:22:14,948 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:22:14,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:22:14,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627330607] [2025-02-06 09:22:14,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627330607] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 09:22:14,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1166805535] [2025-02-06 09:22:14,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:22:14,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:22:14,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:22:14,951 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 09:22:14,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 09:22:15,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-02-06 09:22:15,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-02-06 09:22:15,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:22:15,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:22:15,088 INFO L256 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-06 09:22:15,093 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 09:22:15,185 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:22:15,185 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 09:22:15,403 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:22:15,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1166805535] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 09:22:15,405 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 09:22:15,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2025-02-06 09:22:15,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118019516] [2025-02-06 09:22:15,406 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 09:22:15,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-06 09:22:15,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:22:15,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-06 09:22:15,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-02-06 09:22:15,444 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 323 out of 339 [2025-02-06 09:22:15,450 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 370 places, 352 transitions, 854 flow. Second operand has 23 states, 23 states have (on average 325.0) internal successors, (7475), 23 states have internal predecessors, (7475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:22:15,451 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:22:15,451 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 323 of 339 [2025-02-06 09:22:15,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:22:15,819 INFO L124 PetriNetUnfolderBase]: 8/562 cut-off events. [2025-02-06 09:22:15,820 INFO L125 PetriNetUnfolderBase]: For 140/140 co-relation queries the response was YES. [2025-02-06 09:22:15,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 768 conditions, 562 events. 8/562 cut-off events. For 140/140 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 857 event pairs, 6 based on Foata normal form. 3/535 useless extension candidates. Maximal degree in co-relation 498. Up to 24 conditions per place. [2025-02-06 09:22:15,822 INFO L140 encePairwiseOnDemand]: 333/339 looper letters, 21 selfloop transitions, 30 changer transitions 0/369 dead transitions. [2025-02-06 09:22:15,822 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 399 places, 369 transitions, 1078 flow [2025-02-06 09:22:15,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-02-06 09:22:15,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-02-06 09:22:15,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 9744 transitions. [2025-02-06 09:22:15,840 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9581120943952802 [2025-02-06 09:22:15,841 INFO L175 Difference]: Start difference. First operand has 370 places, 352 transitions, 854 flow. Second operand 30 states and 9744 transitions. [2025-02-06 09:22:15,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 399 places, 369 transitions, 1078 flow [2025-02-06 09:22:15,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 394 places, 369 transitions, 1058 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:22:15,847 INFO L231 Difference]: Finished difference. Result has 398 places, 362 transitions, 986 flow [2025-02-06 09:22:15,848 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=834, PETRI_DIFFERENCE_MINUEND_PLACES=365, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=352, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=329, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=986, PETRI_PLACES=398, PETRI_TRANSITIONS=362} [2025-02-06 09:22:15,848 INFO L279 CegarLoopForPetriNet]: 338 programPoint places, 60 predicate places. [2025-02-06 09:22:15,848 INFO L471 AbstractCegarLoop]: Abstraction has has 398 places, 362 transitions, 986 flow [2025-02-06 09:22:15,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 325.0) internal successors, (7475), 23 states have internal predecessors, (7475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:22:15,852 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:22:15,852 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:22:15,860 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-02-06 09:22:16,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:22:16,056 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-02-06 09:22:16,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:22:16,057 INFO L85 PathProgramCache]: Analyzing trace with hash -1292661691, now seen corresponding path program 2 times [2025-02-06 09:22:16,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:22:16,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76124047] [2025-02-06 09:22:16,057 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 09:22:16,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:22:16,075 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 169 statements into 2 equivalence classes. [2025-02-06 09:22:16,088 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 119 of 169 statements. [2025-02-06 09:22:16,088 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 09:22:16,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:22:16,470 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-02-06 09:22:16,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:22:16,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76124047] [2025-02-06 09:22:16,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76124047] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:22:16,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:22:16,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:22:16,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123131025] [2025-02-06 09:22:16,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:22:16,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:22:16,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:22:16,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:22:16,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:22:17,061 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 249 out of 339 [2025-02-06 09:22:17,062 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 398 places, 362 transitions, 986 flow. Second operand has 6 states, 6 states have (on average 251.83333333333334) internal successors, (1511), 6 states have internal predecessors, (1511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:22:17,063 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:22:17,063 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 249 of 339 [2025-02-06 09:22:17,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:22:17,398 INFO L124 PetriNetUnfolderBase]: 392/1935 cut-off events. [2025-02-06 09:22:17,398 INFO L125 PetriNetUnfolderBase]: For 121/121 co-relation queries the response was YES. [2025-02-06 09:22:17,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3012 conditions, 1935 events. 392/1935 cut-off events. For 121/121 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 10924 event pairs, 390 based on Foata normal form. 0/1804 useless extension candidates. Maximal degree in co-relation 2740. Up to 899 conditions per place. [2025-02-06 09:22:17,410 INFO L140 encePairwiseOnDemand]: 333/339 looper letters, 83 selfloop transitions, 5 changer transitions 0/361 dead transitions. [2025-02-06 09:22:17,410 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 402 places, 361 transitions, 1160 flow [2025-02-06 09:22:17,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:22:17,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:22:17,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1582 transitions. [2025-02-06 09:22:17,415 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7777777777777778 [2025-02-06 09:22:17,415 INFO L175 Difference]: Start difference. First operand has 398 places, 362 transitions, 986 flow. Second operand 6 states and 1582 transitions. [2025-02-06 09:22:17,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 402 places, 361 transitions, 1160 flow [2025-02-06 09:22:17,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 384 places, 361 transitions, 1114 flow, removed 5 selfloop flow, removed 18 redundant places. [2025-02-06 09:22:17,424 INFO L231 Difference]: Finished difference. Result has 384 places, 361 transitions, 948 flow [2025-02-06 09:22:17,425 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=938, PETRI_DIFFERENCE_MINUEND_PLACES=379, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=361, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=356, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=948, PETRI_PLACES=384, PETRI_TRANSITIONS=361} [2025-02-06 09:22:17,427 INFO L279 CegarLoopForPetriNet]: 338 programPoint places, 46 predicate places. [2025-02-06 09:22:17,428 INFO L471 AbstractCegarLoop]: Abstraction has has 384 places, 361 transitions, 948 flow [2025-02-06 09:22:17,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 251.83333333333334) internal successors, (1511), 6 states have internal predecessors, (1511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:22:17,428 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:22:17,429 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:22:17,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 09:22:17,429 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-02-06 09:22:17,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:22:17,430 INFO L85 PathProgramCache]: Analyzing trace with hash -763943389, now seen corresponding path program 1 times [2025-02-06 09:22:17,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:22:17,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448117055] [2025-02-06 09:22:17,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:22:17,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:22:17,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-02-06 09:22:17,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-02-06 09:22:17,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:22:17,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:22:18,077 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-02-06 09:22:18,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:22:18,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448117055] [2025-02-06 09:22:18,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448117055] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:22:18,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:22:18,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:22:18,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735605750] [2025-02-06 09:22:18,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:22:18,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:22:18,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:22:18,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:22:18,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:22:18,609 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 275 out of 339 [2025-02-06 09:22:18,610 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 384 places, 361 transitions, 948 flow. Second operand has 6 states, 6 states have (on average 279.8333333333333) internal successors, (1679), 6 states have internal predecessors, (1679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:22:18,610 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:22:18,610 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 275 of 339 [2025-02-06 09:22:18,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:22:18,813 INFO L124 PetriNetUnfolderBase]: 56/801 cut-off events. [2025-02-06 09:22:18,814 INFO L125 PetriNetUnfolderBase]: For 130/130 co-relation queries the response was YES. [2025-02-06 09:22:18,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1162 conditions, 801 events. 56/801 cut-off events. For 130/130 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2596 event pairs, 54 based on Foata normal form. 0/749 useless extension candidates. Maximal degree in co-relation 911. Up to 195 conditions per place. [2025-02-06 09:22:18,817 INFO L140 encePairwiseOnDemand]: 333/339 looper letters, 57 selfloop transitions, 5 changer transitions 0/360 dead transitions. [2025-02-06 09:22:18,817 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 388 places, 360 transitions, 1070 flow [2025-02-06 09:22:18,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:22:18,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:22:18,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1712 transitions. [2025-02-06 09:22:18,822 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8416912487708947 [2025-02-06 09:22:18,822 INFO L175 Difference]: Start difference. First operand has 384 places, 361 transitions, 948 flow. Second operand 6 states and 1712 transitions. [2025-02-06 09:22:18,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 388 places, 360 transitions, 1070 flow [2025-02-06 09:22:18,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 383 places, 360 transitions, 1060 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:22:18,832 INFO L231 Difference]: Finished difference. Result has 383 places, 360 transitions, 946 flow [2025-02-06 09:22:18,832 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=936, PETRI_DIFFERENCE_MINUEND_PLACES=378, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=360, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=355, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=946, PETRI_PLACES=383, PETRI_TRANSITIONS=360} [2025-02-06 09:22:18,834 INFO L279 CegarLoopForPetriNet]: 338 programPoint places, 45 predicate places. [2025-02-06 09:22:18,834 INFO L471 AbstractCegarLoop]: Abstraction has has 383 places, 360 transitions, 946 flow [2025-02-06 09:22:18,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 279.8333333333333) internal successors, (1679), 6 states have internal predecessors, (1679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:22:18,835 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:22:18,835 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:22:18,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 09:22:18,836 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-02-06 09:22:18,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:22:18,837 INFO L85 PathProgramCache]: Analyzing trace with hash 239713264, now seen corresponding path program 1 times [2025-02-06 09:22:18,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:22:18,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996610110] [2025-02-06 09:22:18,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:22:18,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:22:18,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-02-06 09:22:18,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-02-06 09:22:18,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:22:18,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:22:19,399 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-02-06 09:22:19,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:22:19,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996610110] [2025-02-06 09:22:19,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996610110] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:22:19,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:22:19,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:22:19,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927949841] [2025-02-06 09:22:19,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:22:19,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:22:19,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:22:19,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:22:19,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:22:19,897 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 278 out of 339 [2025-02-06 09:22:19,899 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 383 places, 360 transitions, 946 flow. Second operand has 6 states, 6 states have (on average 282.5) internal successors, (1695), 6 states have internal predecessors, (1695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:22:19,899 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:22:19,899 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 278 of 339 [2025-02-06 09:22:19,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:22:20,088 INFO L124 PetriNetUnfolderBase]: 38/716 cut-off events. [2025-02-06 09:22:20,088 INFO L125 PetriNetUnfolderBase]: For 127/127 co-relation queries the response was YES. [2025-02-06 09:22:20,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1040 conditions, 716 events. 38/716 cut-off events. For 127/127 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2074 event pairs, 36 based on Foata normal form. 0/677 useless extension candidates. Maximal degree in co-relation 791. Up to 158 conditions per place. [2025-02-06 09:22:20,091 INFO L140 encePairwiseOnDemand]: 333/339 looper letters, 53 selfloop transitions, 5 changer transitions 0/359 dead transitions. [2025-02-06 09:22:20,092 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 387 places, 359 transitions, 1060 flow [2025-02-06 09:22:20,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:22:20,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:22:20,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1727 transitions. [2025-02-06 09:22:20,096 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8490658800393314 [2025-02-06 09:22:20,096 INFO L175 Difference]: Start difference. First operand has 383 places, 360 transitions, 946 flow. Second operand 6 states and 1727 transitions. [2025-02-06 09:22:20,097 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 387 places, 359 transitions, 1060 flow [2025-02-06 09:22:20,101 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 382 places, 359 transitions, 1050 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:22:20,105 INFO L231 Difference]: Finished difference. Result has 382 places, 359 transitions, 944 flow [2025-02-06 09:22:20,106 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=934, PETRI_DIFFERENCE_MINUEND_PLACES=377, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=359, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=354, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=944, PETRI_PLACES=382, PETRI_TRANSITIONS=359} [2025-02-06 09:22:20,106 INFO L279 CegarLoopForPetriNet]: 338 programPoint places, 44 predicate places. [2025-02-06 09:22:20,107 INFO L471 AbstractCegarLoop]: Abstraction has has 382 places, 359 transitions, 944 flow [2025-02-06 09:22:20,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 282.5) internal successors, (1695), 6 states have internal predecessors, (1695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:22:20,107 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:22:20,108 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:22:20,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 09:22:20,108 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-02-06 09:22:20,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:22:20,109 INFO L85 PathProgramCache]: Analyzing trace with hash 215701357, now seen corresponding path program 1 times [2025-02-06 09:22:20,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:22:20,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447608846] [2025-02-06 09:22:20,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:22:20,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:22:20,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 223 statements into 1 equivalence classes. [2025-02-06 09:22:20,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 223 of 223 statements. [2025-02-06 09:22:20,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:22:20,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:22:20,768 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2025-02-06 09:22:20,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:22:20,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447608846] [2025-02-06 09:22:20,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447608846] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:22:20,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:22:20,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:22:20,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748622613] [2025-02-06 09:22:20,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:22:20,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:22:20,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:22:20,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:22:20,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:22:21,100 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 252 out of 339 [2025-02-06 09:22:21,101 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 382 places, 359 transitions, 944 flow. Second operand has 6 states, 6 states have (on average 258.1666666666667) internal successors, (1549), 6 states have internal predecessors, (1549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:22:21,101 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:22:21,101 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 252 of 339 [2025-02-06 09:22:21,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:22:21,450 INFO L124 PetriNetUnfolderBase]: 366/1840 cut-off events. [2025-02-06 09:22:21,450 INFO L125 PetriNetUnfolderBase]: For 127/127 co-relation queries the response was YES. [2025-02-06 09:22:21,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2852 conditions, 1840 events. 366/1840 cut-off events. For 127/127 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 10052 event pairs, 364 based on Foata normal form. 0/1720 useless extension candidates. Maximal degree in co-relation 2603. Up to 846 conditions per place. [2025-02-06 09:22:21,460 INFO L140 encePairwiseOnDemand]: 333/339 looper letters, 79 selfloop transitions, 5 changer transitions 0/358 dead transitions. [2025-02-06 09:22:21,460 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 386 places, 358 transitions, 1110 flow [2025-02-06 09:22:21,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:22:21,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:22:21,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1597 transitions. [2025-02-06 09:22:21,463 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7851524090462143 [2025-02-06 09:22:21,463 INFO L175 Difference]: Start difference. First operand has 382 places, 359 transitions, 944 flow. Second operand 6 states and 1597 transitions. [2025-02-06 09:22:21,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 386 places, 358 transitions, 1110 flow [2025-02-06 09:22:21,467 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 381 places, 358 transitions, 1100 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:22:21,470 INFO L231 Difference]: Finished difference. Result has 381 places, 358 transitions, 942 flow [2025-02-06 09:22:21,471 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=932, PETRI_DIFFERENCE_MINUEND_PLACES=376, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=358, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=353, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=942, PETRI_PLACES=381, PETRI_TRANSITIONS=358} [2025-02-06 09:22:21,472 INFO L279 CegarLoopForPetriNet]: 338 programPoint places, 43 predicate places. [2025-02-06 09:22:21,472 INFO L471 AbstractCegarLoop]: Abstraction has has 381 places, 358 transitions, 942 flow [2025-02-06 09:22:21,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 258.1666666666667) internal successors, (1549), 6 states have internal predecessors, (1549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:22:21,472 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:22:21,473 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:22:21,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 09:22:21,473 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-02-06 09:22:21,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:22:21,474 INFO L85 PathProgramCache]: Analyzing trace with hash -597701135, now seen corresponding path program 1 times [2025-02-06 09:22:21,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:22:21,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051761308] [2025-02-06 09:22:21,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:22:21,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:22:21,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 231 statements into 1 equivalence classes. [2025-02-06 09:22:21,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 231 of 231 statements. [2025-02-06 09:22:21,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:22:21,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:22:21,998 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2025-02-06 09:22:21,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:22:21,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051761308] [2025-02-06 09:22:21,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051761308] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:22:21,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:22:21,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:22:21,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917057833] [2025-02-06 09:22:21,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:22:22,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:22:22,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:22:22,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:22:22,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:22:22,327 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 253 out of 339 [2025-02-06 09:22:22,328 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 381 places, 358 transitions, 942 flow. Second operand has 6 states, 6 states have (on average 259.6666666666667) internal successors, (1558), 6 states have internal predecessors, (1558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:22:22,328 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:22:22,328 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 253 of 339 [2025-02-06 09:22:22,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:22:22,683 INFO L124 PetriNetUnfolderBase]: 366/1838 cut-off events. [2025-02-06 09:22:22,683 INFO L125 PetriNetUnfolderBase]: For 127/127 co-relation queries the response was YES. [2025-02-06 09:22:22,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2848 conditions, 1838 events. 366/1838 cut-off events. For 127/127 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 10062 event pairs, 364 based on Foata normal form. 0/1720 useless extension candidates. Maximal degree in co-relation 2599. Up to 844 conditions per place. [2025-02-06 09:22:22,692 INFO L140 encePairwiseOnDemand]: 333/339 looper letters, 78 selfloop transitions, 5 changer transitions 0/357 dead transitions. [2025-02-06 09:22:22,693 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 385 places, 357 transitions, 1106 flow [2025-02-06 09:22:22,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:22:22,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:22:22,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1602 transitions. [2025-02-06 09:22:22,695 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7876106194690266 [2025-02-06 09:22:22,695 INFO L175 Difference]: Start difference. First operand has 381 places, 358 transitions, 942 flow. Second operand 6 states and 1602 transitions. [2025-02-06 09:22:22,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 385 places, 357 transitions, 1106 flow [2025-02-06 09:22:22,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 380 places, 357 transitions, 1096 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:22:22,702 INFO L231 Difference]: Finished difference. Result has 380 places, 357 transitions, 940 flow [2025-02-06 09:22:22,702 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=930, PETRI_DIFFERENCE_MINUEND_PLACES=375, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=357, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=352, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=940, PETRI_PLACES=380, PETRI_TRANSITIONS=357} [2025-02-06 09:22:22,703 INFO L279 CegarLoopForPetriNet]: 338 programPoint places, 42 predicate places. [2025-02-06 09:22:22,703 INFO L471 AbstractCegarLoop]: Abstraction has has 380 places, 357 transitions, 940 flow [2025-02-06 09:22:22,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 259.6666666666667) internal successors, (1558), 6 states have internal predecessors, (1558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:22:22,703 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:22:22,704 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:22:22,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 09:22:22,704 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-02-06 09:22:22,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:22:22,705 INFO L85 PathProgramCache]: Analyzing trace with hash -1595220511, now seen corresponding path program 1 times [2025-02-06 09:22:22,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:22:22,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579880099] [2025-02-06 09:22:22,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:22:22,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:22:22,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 255 statements into 1 equivalence classes. [2025-02-06 09:22:22,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 255 of 255 statements. [2025-02-06 09:22:22,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:22:22,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:22:22,879 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 241 trivial. 0 not checked. [2025-02-06 09:22:22,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:22:22,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579880099] [2025-02-06 09:22:22,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579880099] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 09:22:22,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1605034717] [2025-02-06 09:22:22,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:22:22,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:22:22,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:22:22,883 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 09:22:22,884 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 09:22:23,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 255 statements into 1 equivalence classes. [2025-02-06 09:22:23,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 255 of 255 statements. [2025-02-06 09:22:23,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:22:23,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:22:23,114 INFO L256 TraceCheckSpWp]: Trace formula consists of 754 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 09:22:23,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 09:22:23,264 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 241 trivial. 0 not checked. [2025-02-06 09:22:23,265 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 09:22:23,412 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 241 trivial. 0 not checked. [2025-02-06 09:22:23,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1605034717] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 09:22:23,412 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 09:22:23,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-02-06 09:22:23,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188595310] [2025-02-06 09:22:23,413 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 09:22:23,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 09:22:23,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:22:23,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 09:22:23,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-06 09:22:23,530 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 323 out of 339 [2025-02-06 09:22:23,533 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 380 places, 357 transitions, 940 flow. Second operand has 10 states, 10 states have (on average 325.0) internal successors, (3250), 10 states have internal predecessors, (3250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:22:23,533 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:22:23,533 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 323 of 339 [2025-02-06 09:22:23,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:22:23,711 INFO L124 PetriNetUnfolderBase]: 8/659 cut-off events. [2025-02-06 09:22:23,711 INFO L125 PetriNetUnfolderBase]: For 126/126 co-relation queries the response was YES. [2025-02-06 09:22:23,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 857 conditions, 659 events. 8/659 cut-off events. For 126/126 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 390 event pairs, 6 based on Foata normal form. 2/641 useless extension candidates. Maximal degree in co-relation 607. Up to 24 conditions per place. [2025-02-06 09:22:23,713 INFO L140 encePairwiseOnDemand]: 333/339 looper letters, 14 selfloop transitions, 9 changer transitions 0/365 dead transitions. [2025-02-06 09:22:23,713 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 388 places, 365 transitions, 1004 flow [2025-02-06 09:22:23,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 09:22:23,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-06 09:22:23,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2932 transitions. [2025-02-06 09:22:23,715 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9609963946247132 [2025-02-06 09:22:23,716 INFO L175 Difference]: Start difference. First operand has 380 places, 357 transitions, 940 flow. Second operand 9 states and 2932 transitions. [2025-02-06 09:22:23,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 388 places, 365 transitions, 1004 flow [2025-02-06 09:22:23,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 383 places, 365 transitions, 994 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:22:23,722 INFO L231 Difference]: Finished difference. Result has 386 places, 363 transitions, 980 flow [2025-02-06 09:22:23,722 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=930, PETRI_DIFFERENCE_MINUEND_PLACES=375, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=357, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=351, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=980, PETRI_PLACES=386, PETRI_TRANSITIONS=363} [2025-02-06 09:22:23,723 INFO L279 CegarLoopForPetriNet]: 338 programPoint places, 48 predicate places. [2025-02-06 09:22:23,723 INFO L471 AbstractCegarLoop]: Abstraction has has 386 places, 363 transitions, 980 flow [2025-02-06 09:22:23,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 325.0) internal successors, (3250), 10 states have internal predecessors, (3250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:22:23,724 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:22:23,725 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:22:23,739 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-06 09:22:23,925 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,SelfDestructingSolverStorable12 [2025-02-06 09:22:23,925 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-02-06 09:22:23,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:22:23,927 INFO L85 PathProgramCache]: Analyzing trace with hash -511377087, now seen corresponding path program 2 times [2025-02-06 09:22:23,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:22:23,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833365525] [2025-02-06 09:22:23,927 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 09:22:23,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:22:24,000 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 465 statements into 2 equivalence classes. [2025-02-06 09:22:24,006 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 100 of 465 statements. [2025-02-06 09:22:24,007 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 09:22:24,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:22:24,245 INFO L134 CoverageAnalysis]: Checked inductivity of 643 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 643 trivial. 0 not checked. [2025-02-06 09:22:24,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:22:24,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833365525] [2025-02-06 09:22:24,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833365525] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:22:24,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:22:24,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:22:24,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985289242] [2025-02-06 09:22:24,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:22:24,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:22:24,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:22:24,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:22:24,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:22:24,705 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 278 out of 339 [2025-02-06 09:22:24,706 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 386 places, 363 transitions, 980 flow. Second operand has 6 states, 6 states have (on average 284.3333333333333) internal successors, (1706), 6 states have internal predecessors, (1706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:22:24,706 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:22:24,706 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 278 of 339 [2025-02-06 09:22:24,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:22:25,065 INFO L124 PetriNetUnfolderBase]: 258/1966 cut-off events. [2025-02-06 09:22:25,065 INFO L125 PetriNetUnfolderBase]: For 130/130 co-relation queries the response was YES. [2025-02-06 09:22:25,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2769 conditions, 1966 events. 258/1966 cut-off events. For 130/130 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 10091 event pairs, 34 based on Foata normal form. 0/1840 useless extension candidates. Maximal degree in co-relation 2516. Up to 491 conditions per place. [2025-02-06 09:22:25,071 INFO L140 encePairwiseOnDemand]: 316/339 looper letters, 67 selfloop transitions, 70 changer transitions 0/441 dead transitions. [2025-02-06 09:22:25,071 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 391 places, 441 transitions, 1410 flow [2025-02-06 09:22:25,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:22:25,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:22:25,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1806 transitions. [2025-02-06 09:22:25,072 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.887905604719764 [2025-02-06 09:22:25,073 INFO L175 Difference]: Start difference. First operand has 386 places, 363 transitions, 980 flow. Second operand 6 states and 1806 transitions. [2025-02-06 09:22:25,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 391 places, 441 transitions, 1410 flow [2025-02-06 09:22:25,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 390 places, 441 transitions, 1404 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-02-06 09:22:25,078 INFO L231 Difference]: Finished difference. Result has 395 places, 432 transitions, 1436 flow [2025-02-06 09:22:25,079 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=974, PETRI_DIFFERENCE_MINUEND_PLACES=385, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=363, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=341, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1436, PETRI_PLACES=395, PETRI_TRANSITIONS=432} [2025-02-06 09:22:25,079 INFO L279 CegarLoopForPetriNet]: 338 programPoint places, 57 predicate places. [2025-02-06 09:22:25,079 INFO L471 AbstractCegarLoop]: Abstraction has has 395 places, 432 transitions, 1436 flow [2025-02-06 09:22:25,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 284.3333333333333) internal successors, (1706), 6 states have internal predecessors, (1706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:22:25,080 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:22:25,080 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:22:25,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 09:22:25,080 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-02-06 09:22:25,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:22:25,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1106740087, now seen corresponding path program 1 times [2025-02-06 09:22:25,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:22:25,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558258198] [2025-02-06 09:22:25,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:22:25,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:22:25,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 471 statements into 1 equivalence classes. [2025-02-06 09:22:25,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 471 of 471 statements. [2025-02-06 09:22:25,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:22:25,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:22:25,565 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 0 proven. 408 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2025-02-06 09:22:25,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:22:25,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558258198] [2025-02-06 09:22:25,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558258198] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 09:22:25,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1072017226] [2025-02-06 09:22:25,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:22:25,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:22:25,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:22:25,569 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-02-06 09:22:25,571 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-02-06 09:22:25,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 471 statements into 1 equivalence classes. [2025-02-06 09:22:25,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 471 of 471 statements. [2025-02-06 09:22:25,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:22:25,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:22:25,962 INFO L256 TraceCheckSpWp]: Trace formula consists of 1624 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 09:22:25,970 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 09:22:26,321 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 0 proven. 408 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2025-02-06 09:22:26,322 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 09:22:26,707 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 0 proven. 408 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2025-02-06 09:22:26,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1072017226] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 09:22:26,708 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 09:22:26,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-02-06 09:22:26,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137414026] [2025-02-06 09:22:26,708 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 09:22:26,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-06 09:22:26,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:22:26,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-06 09:22:26,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-02-06 09:22:26,872 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 323 out of 339 [2025-02-06 09:22:26,875 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 395 places, 432 transitions, 1436 flow. Second operand has 18 states, 18 states have (on average 325.0) internal successors, (5850), 18 states have internal predecessors, (5850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:22:26,875 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:22:26,875 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 323 of 339 [2025-02-06 09:22:26,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:22:27,389 INFO L124 PetriNetUnfolderBase]: 121/2052 cut-off events. [2025-02-06 09:22:27,389 INFO L125 PetriNetUnfolderBase]: For 309/329 co-relation queries the response was YES. [2025-02-06 09:22:27,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2854 conditions, 2052 events. 121/2052 cut-off events. For 309/329 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 7335 event pairs, 21 based on Foata normal form. 4/1969 useless extension candidates. Maximal degree in co-relation 2597. Up to 206 conditions per place. [2025-02-06 09:22:27,394 INFO L140 encePairwiseOnDemand]: 333/339 looper letters, 19 selfloop transitions, 21 changer transitions 0/450 dead transitions. [2025-02-06 09:22:27,394 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 415 places, 450 transitions, 1604 flow [2025-02-06 09:22:27,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-06 09:22:27,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-02-06 09:22:27,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 6826 transitions. [2025-02-06 09:22:27,398 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.958842534063773 [2025-02-06 09:22:27,398 INFO L175 Difference]: Start difference. First operand has 395 places, 432 transitions, 1436 flow. Second operand 21 states and 6826 transitions. [2025-02-06 09:22:27,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 415 places, 450 transitions, 1604 flow [2025-02-06 09:22:27,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 415 places, 450 transitions, 1604 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:22:27,408 INFO L231 Difference]: Finished difference. Result has 420 places, 445 transitions, 1566 flow [2025-02-06 09:22:27,409 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=1436, PETRI_DIFFERENCE_MINUEND_PLACES=395, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=432, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=421, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=1566, PETRI_PLACES=420, PETRI_TRANSITIONS=445} [2025-02-06 09:22:27,409 INFO L279 CegarLoopForPetriNet]: 338 programPoint places, 82 predicate places. [2025-02-06 09:22:27,409 INFO L471 AbstractCegarLoop]: Abstraction has has 420 places, 445 transitions, 1566 flow [2025-02-06 09:22:27,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 325.0) internal successors, (5850), 18 states have internal predecessors, (5850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:22:27,411 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:22:27,411 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:22:27,422 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-06 09:22:27,612 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,SelfDestructingSolverStorable14 [2025-02-06 09:22:27,612 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-02-06 09:22:27,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:22:27,614 INFO L85 PathProgramCache]: Analyzing trace with hash 208366409, now seen corresponding path program 2 times [2025-02-06 09:22:27,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:22:27,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560746983] [2025-02-06 09:22:27,614 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 09:22:27,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:22:27,727 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 891 statements into 2 equivalence classes. [2025-02-06 09:22:27,731 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 106 of 891 statements. [2025-02-06 09:22:27,731 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 09:22:27,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:22:27,925 INFO L134 CoverageAnalysis]: Checked inductivity of 3182 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3182 trivial. 0 not checked. [2025-02-06 09:22:27,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:22:27,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560746983] [2025-02-06 09:22:27,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560746983] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:22:27,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:22:27,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:22:27,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626412649] [2025-02-06 09:22:27,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:22:27,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:22:27,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:22:27,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:22:27,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:22:28,312 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 278 out of 339 [2025-02-06 09:22:28,313 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 420 places, 445 transitions, 1566 flow. Second operand has 6 states, 6 states have (on average 284.1666666666667) internal successors, (1705), 6 states have internal predecessors, (1705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:22:28,313 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:22:28,313 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 278 of 339 [2025-02-06 09:22:28,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:22:29,272 INFO L124 PetriNetUnfolderBase]: 501/3121 cut-off events. [2025-02-06 09:22:29,272 INFO L125 PetriNetUnfolderBase]: For 991/1074 co-relation queries the response was YES. [2025-02-06 09:22:29,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5522 conditions, 3121 events. 501/3121 cut-off events. For 991/1074 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 16096 event pairs, 92 based on Foata normal form. 16/2980 useless extension candidates. Maximal degree in co-relation 5260. Up to 981 conditions per place. [2025-02-06 09:22:29,291 INFO L140 encePairwiseOnDemand]: 316/339 looper letters, 131 selfloop transitions, 130 changer transitions 0/582 dead transitions. [2025-02-06 09:22:29,292 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 425 places, 582 transitions, 2738 flow [2025-02-06 09:22:29,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:22:29,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:22:29,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1805 transitions. [2025-02-06 09:22:29,294 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8874139626352016 [2025-02-06 09:22:29,294 INFO L175 Difference]: Start difference. First operand has 420 places, 445 transitions, 1566 flow. Second operand 6 states and 1805 transitions. [2025-02-06 09:22:29,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 425 places, 582 transitions, 2738 flow [2025-02-06 09:22:29,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 419 places, 582 transitions, 2714 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-02-06 09:22:29,311 INFO L231 Difference]: Finished difference. Result has 424 places, 574 transitions, 2770 flow [2025-02-06 09:22:29,311 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=1542, PETRI_DIFFERENCE_MINUEND_PLACES=414, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=445, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=408, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2770, PETRI_PLACES=424, PETRI_TRANSITIONS=574} [2025-02-06 09:22:29,312 INFO L279 CegarLoopForPetriNet]: 338 programPoint places, 86 predicate places. [2025-02-06 09:22:29,312 INFO L471 AbstractCegarLoop]: Abstraction has has 424 places, 574 transitions, 2770 flow [2025-02-06 09:22:29,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 284.1666666666667) internal successors, (1705), 6 states have internal predecessors, (1705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:22:29,312 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:22:29,313 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:22:29,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 09:22:29,313 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-02-06 09:22:29,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:22:29,316 INFO L85 PathProgramCache]: Analyzing trace with hash 2016651925, now seen corresponding path program 1 times [2025-02-06 09:22:29,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:22:29,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426889320] [2025-02-06 09:22:29,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:22:29,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:22:29,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 901 statements into 1 equivalence classes. [2025-02-06 09:22:29,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 901 of 901 statements. [2025-02-06 09:22:29,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:22:29,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:22:30,913 INFO L134 CoverageAnalysis]: Checked inductivity of 3182 backedges. 0 proven. 2842 refuted. 0 times theorem prover too weak. 340 trivial. 0 not checked. [2025-02-06 09:22:30,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:22:30,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426889320] [2025-02-06 09:22:30,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426889320] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 09:22:30,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [368686996] [2025-02-06 09:22:30,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:22:30,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:22:30,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:22:30,916 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-02-06 09:22:30,917 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-02-06 09:22:31,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 901 statements into 1 equivalence classes. [2025-02-06 09:22:31,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 901 of 901 statements. [2025-02-06 09:22:31,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:22:31,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:22:31,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 3341 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-06 09:22:31,679 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 09:22:32,477 INFO L134 CoverageAnalysis]: Checked inductivity of 3182 backedges. 0 proven. 2842 refuted. 0 times theorem prover too weak. 340 trivial. 0 not checked. [2025-02-06 09:22:32,477 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 09:22:33,219 INFO L134 CoverageAnalysis]: Checked inductivity of 3182 backedges. 0 proven. 2842 refuted. 0 times theorem prover too weak. 340 trivial. 0 not checked. [2025-02-06 09:22:33,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [368686996] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 09:22:33,220 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 09:22:33,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2025-02-06 09:22:33,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268019178] [2025-02-06 09:22:33,220 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 09:22:33,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-06 09:22:33,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:22:33,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-06 09:22:33,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-02-06 09:22:33,426 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 323 out of 339 [2025-02-06 09:22:33,429 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 424 places, 574 transitions, 2770 flow. Second operand has 23 states, 23 states have (on average 325.0869565217391) internal successors, (7477), 23 states have internal predecessors, (7477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:22:33,430 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:22:33,430 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 323 of 339 [2025-02-06 09:22:33,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:22:34,506 INFO L124 PetriNetUnfolderBase]: 382/3132 cut-off events. [2025-02-06 09:22:34,506 INFO L125 PetriNetUnfolderBase]: For 1289/1327 co-relation queries the response was YES. [2025-02-06 09:22:34,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5427 conditions, 3132 events. 382/3132 cut-off events. For 1289/1327 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 13258 event pairs, 37 based on Foata normal form. 7/3031 useless extension candidates. Maximal degree in co-relation 5160. Up to 467 conditions per place. [2025-02-06 09:22:34,520 INFO L140 encePairwiseOnDemand]: 333/339 looper letters, 22 selfloop transitions, 30 changer transitions 0/591 dead transitions. [2025-02-06 09:22:34,520 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 453 places, 591 transitions, 2996 flow [2025-02-06 09:22:34,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-02-06 09:22:34,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-02-06 09:22:34,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 9744 transitions. [2025-02-06 09:22:34,530 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9581120943952802 [2025-02-06 09:22:34,530 INFO L175 Difference]: Start difference. First operand has 424 places, 574 transitions, 2770 flow. Second operand 30 states and 9744 transitions. [2025-02-06 09:22:34,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 453 places, 591 transitions, 2996 flow [2025-02-06 09:22:34,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 453 places, 591 transitions, 2996 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:22:34,550 INFO L231 Difference]: Finished difference. Result has 457 places, 584 transitions, 2922 flow [2025-02-06 09:22:34,550 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=2770, PETRI_DIFFERENCE_MINUEND_PLACES=424, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=574, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=551, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=2922, PETRI_PLACES=457, PETRI_TRANSITIONS=584} [2025-02-06 09:22:34,551 INFO L279 CegarLoopForPetriNet]: 338 programPoint places, 119 predicate places. [2025-02-06 09:22:34,551 INFO L471 AbstractCegarLoop]: Abstraction has has 457 places, 584 transitions, 2922 flow [2025-02-06 09:22:34,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 325.0869565217391) internal successors, (7477), 23 states have internal predecessors, (7477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:22:34,553 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:22:34,553 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:22:34,567 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-06 09:22:34,754 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,SelfDestructingSolverStorable16 [2025-02-06 09:22:34,754 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-02-06 09:22:34,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:22:34,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1301413208, now seen corresponding path program 2 times [2025-02-06 09:22:34,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:22:34,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344632066] [2025-02-06 09:22:34,758 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 09:22:34,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:22:34,912 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1216 statements into 2 equivalence classes. [2025-02-06 09:22:34,916 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 116 of 1216 statements. [2025-02-06 09:22:34,916 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 09:22:34,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:22:35,126 INFO L134 CoverageAnalysis]: Checked inductivity of 6470 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6470 trivial. 0 not checked. [2025-02-06 09:22:35,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:22:35,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344632066] [2025-02-06 09:22:35,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344632066] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:22:35,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:22:35,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:22:35,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328504587] [2025-02-06 09:22:35,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:22:35,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:22:35,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:22:35,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:22:35,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:22:35,462 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 278 out of 339 [2025-02-06 09:22:35,463 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 457 places, 584 transitions, 2922 flow. Second operand has 6 states, 6 states have (on average 284.3333333333333) internal successors, (1706), 6 states have internal predecessors, (1706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:22:35,463 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:22:35,464 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 278 of 339 [2025-02-06 09:22:35,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:22:36,604 INFO L124 PetriNetUnfolderBase]: 777/4207 cut-off events. [2025-02-06 09:22:36,604 INFO L125 PetriNetUnfolderBase]: For 3426/3601 co-relation queries the response was YES. [2025-02-06 09:22:36,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8874 conditions, 4207 events. 777/4207 cut-off events. For 3426/3601 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 22292 event pairs, 65 based on Foata normal form. 52/4094 useless extension candidates. Maximal degree in co-relation 8603. Up to 1323 conditions per place. [2025-02-06 09:22:36,623 INFO L140 encePairwiseOnDemand]: 316/339 looper letters, 251 selfloop transitions, 131 changer transitions 5/722 dead transitions. [2025-02-06 09:22:36,623 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 462 places, 722 transitions, 4596 flow [2025-02-06 09:22:36,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:22:36,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:22:36,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1806 transitions. [2025-02-06 09:22:36,625 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.887905604719764 [2025-02-06 09:22:36,625 INFO L175 Difference]: Start difference. First operand has 457 places, 584 transitions, 2922 flow. Second operand 6 states and 1806 transitions. [2025-02-06 09:22:36,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 462 places, 722 transitions, 4596 flow [2025-02-06 09:22:36,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 444 places, 722 transitions, 4550 flow, removed 5 selfloop flow, removed 18 redundant places. [2025-02-06 09:22:36,645 INFO L231 Difference]: Finished difference. Result has 449 places, 712 transitions, 4356 flow [2025-02-06 09:22:36,646 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=2876, PETRI_DIFFERENCE_MINUEND_PLACES=439, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=584, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=546, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4356, PETRI_PLACES=449, PETRI_TRANSITIONS=712} [2025-02-06 09:22:36,646 INFO L279 CegarLoopForPetriNet]: 338 programPoint places, 111 predicate places. [2025-02-06 09:22:36,646 INFO L471 AbstractCegarLoop]: Abstraction has has 449 places, 712 transitions, 4356 flow [2025-02-06 09:22:36,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 284.3333333333333) internal successors, (1706), 6 states have internal predecessors, (1706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:22:36,647 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:22:36,648 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:22:36,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 09:22:36,648 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting t_funErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-02-06 09:22:36,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:22:36,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1064133320, now seen corresponding path program 1 times [2025-02-06 09:22:36,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:22:36,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487427558] [2025-02-06 09:22:36,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:22:36,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:22:36,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1217 statements into 1 equivalence classes. [2025-02-06 09:22:36,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1217 of 1217 statements. [2025-02-06 09:22:36,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:22:36,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:22:39,660 INFO L134 CoverageAnalysis]: Checked inductivity of 6470 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6470 trivial. 0 not checked. [2025-02-06 09:22:39,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:22:39,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487427558] [2025-02-06 09:22:39,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487427558] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:22:39,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:22:39,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:22:39,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19034675] [2025-02-06 09:22:39,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:22:39,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:22:39,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:22:39,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:22:39,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:22:39,923 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 257 out of 339 [2025-02-06 09:22:39,924 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 449 places, 712 transitions, 4356 flow. Second operand has 6 states, 6 states have (on average 264.6666666666667) internal successors, (1588), 6 states have internal predecessors, (1588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:22:39,924 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:22:39,924 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 257 of 339 [2025-02-06 09:22:39,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:22:41,764 INFO L124 PetriNetUnfolderBase]: 1309/5605 cut-off events. [2025-02-06 09:22:41,764 INFO L125 PetriNetUnfolderBase]: For 4997/5054 co-relation queries the response was YES. [2025-02-06 09:22:41,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13621 conditions, 5605 events. 1309/5605 cut-off events. For 4997/5054 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 33836 event pairs, 369 based on Foata normal form. 11/5371 useless extension candidates. Maximal degree in co-relation 13346. Up to 2549 conditions per place. [2025-02-06 09:22:41,796 INFO L140 encePairwiseOnDemand]: 320/339 looper letters, 316 selfloop transitions, 84 changer transitions 0/791 dead transitions. [2025-02-06 09:22:41,796 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 453 places, 791 transitions, 5554 flow [2025-02-06 09:22:41,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:22:41,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:22:41,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1684 transitions. [2025-02-06 09:22:41,799 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8279252704031466 [2025-02-06 09:22:41,799 INFO L175 Difference]: Start difference. First operand has 449 places, 712 transitions, 4356 flow. Second operand 6 states and 1684 transitions. [2025-02-06 09:22:41,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 453 places, 791 transitions, 5554 flow [2025-02-06 09:22:41,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 453 places, 791 transitions, 5300 flow, removed 127 selfloop flow, removed 0 redundant places. [2025-02-06 09:22:41,832 INFO L231 Difference]: Finished difference. Result has 458 places, 783 transitions, 4892 flow [2025-02-06 09:22:41,833 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=4108, PETRI_DIFFERENCE_MINUEND_PLACES=448, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=712, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=664, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4892, PETRI_PLACES=458, PETRI_TRANSITIONS=783} [2025-02-06 09:22:41,834 INFO L279 CegarLoopForPetriNet]: 338 programPoint places, 120 predicate places. [2025-02-06 09:22:41,834 INFO L471 AbstractCegarLoop]: Abstraction has has 458 places, 783 transitions, 4892 flow [2025-02-06 09:22:41,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 264.6666666666667) internal successors, (1588), 6 states have internal predecessors, (1588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:22:41,835 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:22:41,835 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:22:41,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 09:22:41,836 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-02-06 09:22:41,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:22:41,840 INFO L85 PathProgramCache]: Analyzing trace with hash 24383486, now seen corresponding path program 1 times [2025-02-06 09:22:41,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:22:41,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804620487] [2025-02-06 09:22:41,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:22:41,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:22:41,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1223 statements into 1 equivalence classes. [2025-02-06 09:22:44,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1223 of 1223 statements. [2025-02-06 09:22:44,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:22:44,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:23:02,737 INFO L134 CoverageAnalysis]: Checked inductivity of 6470 backedges. 633 proven. 2188 refuted. 0 times theorem prover too weak. 3649 trivial. 0 not checked. [2025-02-06 09:23:02,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:23:02,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804620487] [2025-02-06 09:23:02,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804620487] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 09:23:02,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1257064087] [2025-02-06 09:23:02,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:23:02,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:23:02,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:23:02,739 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-02-06 09:23:02,740 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-02-06 09:23:03,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1223 statements into 1 equivalence classes. [2025-02-06 09:23:04,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1223 of 1223 statements. [2025-02-06 09:23:04,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:23:04,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:23:04,308 INFO L256 TraceCheckSpWp]: Trace formula consists of 4610 conjuncts, 122 conjuncts are in the unsatisfiable core [2025-02-06 09:23:04,327 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 09:23:04,974 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-02-06 09:23:04,974 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-02-06 09:23:05,268 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-02-06 09:23:05,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-02-06 09:23:05,762 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-06 09:23:05,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-02-06 09:23:06,317 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2025-02-06 09:23:06,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2025-02-06 09:23:07,639 INFO L349 Elim1Store]: treesize reduction 60, result has 31.8 percent of original size [2025-02-06 09:23:07,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 40 [2025-02-06 09:23:08,311 INFO L349 Elim1Store]: treesize reduction 42, result has 27.6 percent of original size [2025-02-06 09:23:08,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 30 [2025-02-06 09:23:09,916 INFO L349 Elim1Store]: treesize reduction 42, result has 27.6 percent of original size [2025-02-06 09:23:09,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 30 [2025-02-06 09:23:10,623 INFO L349 Elim1Store]: treesize reduction 42, result has 27.6 percent of original size [2025-02-06 09:23:10,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 30 [2025-02-06 09:23:12,046 INFO L349 Elim1Store]: treesize reduction 60, result has 31.8 percent of original size [2025-02-06 09:23:12,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 40 [2025-02-06 09:23:12,667 INFO L349 Elim1Store]: treesize reduction 60, result has 31.8 percent of original size [2025-02-06 09:23:12,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 40 [2025-02-06 09:23:13,718 INFO L349 Elim1Store]: treesize reduction 60, result has 31.8 percent of original size [2025-02-06 09:23:13,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 40 [2025-02-06 09:23:14,288 INFO L349 Elim1Store]: treesize reduction 60, result has 31.8 percent of original size [2025-02-06 09:23:14,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 40 [2025-02-06 09:23:15,404 INFO L349 Elim1Store]: treesize reduction 60, result has 31.8 percent of original size [2025-02-06 09:23:15,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 40 [2025-02-06 09:23:16,017 INFO L349 Elim1Store]: treesize reduction 60, result has 31.8 percent of original size [2025-02-06 09:23:16,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 40 [2025-02-06 09:23:17,092 INFO L349 Elim1Store]: treesize reduction 60, result has 31.8 percent of original size [2025-02-06 09:23:17,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 40 [2025-02-06 09:23:17,715 INFO L349 Elim1Store]: treesize reduction 60, result has 31.8 percent of original size [2025-02-06 09:23:17,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 40 [2025-02-06 09:23:18,785 INFO L349 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2025-02-06 09:23:18,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 27 treesize of output 45 [2025-02-06 09:23:19,674 INFO L349 Elim1Store]: treesize reduction 80, result has 31.6 percent of original size [2025-02-06 09:23:19,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 34 treesize of output 52