./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-ext/11_fmaxsymopt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-ext/11_fmaxsymopt.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 ec355916cf6ee76d4008e84bb2b3ecc632256e3b320d2f47b453f4ca1f46acbc --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:04:47,548 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:04:47,602 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-01-09 21:04:47,608 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:04:47,608 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:04:47,625 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:04:47,625 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:04:47,625 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:04:47,625 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:04:47,625 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:04:47,626 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:04:47,626 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:04:47,626 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:04:47,626 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:04:47,626 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:04:47,626 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:04:47,626 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:04:47,626 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:04:47,626 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:04:47,626 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:04:47,626 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:04:47,626 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:04:47,626 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:04:47,626 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:04:47,626 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:04:47,626 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:04:47,626 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:04:47,626 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:04:47,627 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:04:47,627 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:04:47,627 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:04:47,627 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:04:47,627 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:04:47,627 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:04:47,627 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:04:47,627 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:04:47,627 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:04:47,627 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:04:47,627 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:04:47,627 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:04:47,627 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:04:47,627 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:04:47,627 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:04:47,627 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:04:47,627 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:04:47,627 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:04:47,627 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 -> ec355916cf6ee76d4008e84bb2b3ecc632256e3b320d2f47b453f4ca1f46acbc [2025-01-09 21:04:47,827 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:04:47,832 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:04:47,834 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:04:47,834 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:04:47,835 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:04:47,835 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/11_fmaxsymopt.i [2025-01-09 21:04:48,933 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/580f3c7d1/9b518b95ba07438c8bef3be811100a99/FLAGe021e43f1 [2025-01-09 21:04:49,233 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:04:49,234 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-ext/11_fmaxsymopt.i [2025-01-09 21:04:49,248 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/580f3c7d1/9b518b95ba07438c8bef3be811100a99/FLAGe021e43f1 [2025-01-09 21:04:49,499 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/580f3c7d1/9b518b95ba07438c8bef3be811100a99 [2025-01-09 21:04:49,501 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:04:49,502 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:04:49,502 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:04:49,503 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:04:49,505 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:04:49,506 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:04:49" (1/1) ... [2025-01-09 21:04:49,506 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@eec5165 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:04:49, skipping insertion in model container [2025-01-09 21:04:49,506 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:04:49" (1/1) ... [2025-01-09 21:04:49,522 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:04:49,749 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:04:49,758 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:04:49,788 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:04:49,812 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:04:49,812 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:04:49 WrapperNode [2025-01-09 21:04:49,812 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:04:49,813 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:04:49,813 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:04:49,813 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:04:49,817 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:04:49" (1/1) ... [2025-01-09 21:04:49,824 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:04:49" (1/1) ... [2025-01-09 21:04:49,837 INFO L138 Inliner]: procedures = 164, calls = 29, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 108 [2025-01-09 21:04:49,838 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:04:49,838 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:04:49,838 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:04:49,838 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:04:49,842 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:04:49" (1/1) ... [2025-01-09 21:04:49,843 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:04:49" (1/1) ... [2025-01-09 21:04:49,844 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:04:49" (1/1) ... [2025-01-09 21:04:49,844 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:04:49" (1/1) ... [2025-01-09 21:04:49,851 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:04:49" (1/1) ... [2025-01-09 21:04:49,852 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:04:49" (1/1) ... [2025-01-09 21:04:49,853 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:04:49" (1/1) ... [2025-01-09 21:04:49,854 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:04:49" (1/1) ... [2025-01-09 21:04:49,855 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:04:49" (1/1) ... [2025-01-09 21:04:49,856 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:04:49,856 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:04:49,856 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:04:49,856 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:04:49,857 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:04:49" (1/1) ... [2025-01-09 21:04:49,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:04:49,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:04:49,884 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 21:04:49,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 21:04:49,911 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 21:04:49,911 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-01-09 21:04:49,911 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-01-09 21:04:49,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 21:04:49,911 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-09 21:04:49,911 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:04:49,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:04:49,911 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-09 21:04:49,911 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:04:49,911 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:04:49,912 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 21:04:50,010 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:04:50,012 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:04:50,210 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:04:50,211 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:04:50,233 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:04:50,234 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 21:04:50,234 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:04:50 BoogieIcfgContainer [2025-01-09 21:04:50,237 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:04:50,239 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:04:50,239 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:04:50,246 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:04:50,246 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:04:49" (1/3) ... [2025-01-09 21:04:50,247 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ba80be0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:04:50, skipping insertion in model container [2025-01-09 21:04:50,247 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:04:49" (2/3) ... [2025-01-09 21:04:50,247 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ba80be0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:04:50, skipping insertion in model container [2025-01-09 21:04:50,247 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:04:50" (3/3) ... [2025-01-09 21:04:50,247 INFO L128 eAbstractionObserver]: Analyzing ICFG 11_fmaxsymopt.i [2025-01-09 21:04:50,257 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:04:50,258 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 11_fmaxsymopt.i that has 2 procedures, 118 locations, 1 initial locations, 3 loop locations, and 5 error locations. [2025-01-09 21:04:50,258 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:04:50,336 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:04:50,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 121 places, 126 transitions, 256 flow [2025-01-09 21:04:50,417 INFO L124 PetriNetUnfolderBase]: 8/133 cut-off events. [2025-01-09 21:04:50,419 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:04:50,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 133 events. 8/133 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 184 event pairs, 0 based on Foata normal form. 0/118 useless extension candidates. Maximal degree in co-relation 82. Up to 2 conditions per place. [2025-01-09 21:04:50,429 INFO L82 GeneralOperation]: Start removeDead. Operand has 121 places, 126 transitions, 256 flow [2025-01-09 21:04:50,433 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 121 places, 126 transitions, 256 flow [2025-01-09 21:04:50,439 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:04:50,448 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;@7fef0089, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:04:50,448 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-01-09 21:04:50,463 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:04:50,463 INFO L124 PetriNetUnfolderBase]: 0/52 cut-off events. [2025-01-09 21:04:50,463 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:04:50,463 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:04:50,463 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:04:50,464 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-01-09 21:04:50,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:04:50,468 INFO L85 PathProgramCache]: Analyzing trace with hash 2079414045, now seen corresponding path program 1 times [2025-01-09 21:04:50,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:04:50,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361222364] [2025-01-09 21:04:50,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:04:50,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:04:50,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-09 21:04:50,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-09 21:04:50,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:04:50,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:04:51,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:04:51,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:04:51,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361222364] [2025-01-09 21:04:51,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361222364] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:04:51,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:04:51,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:04:51,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409734785] [2025-01-09 21:04:51,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:04:51,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:04:51,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:04:51,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:04:51,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:04:51,258 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 126 [2025-01-09 21:04:51,261 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 126 transitions, 256 flow. Second operand has 6 states, 6 states have (on average 100.5) internal successors, (603), 6 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:04:51,261 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:04:51,261 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 126 [2025-01-09 21:04:51,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:04:51,309 INFO L124 PetriNetUnfolderBase]: 5/119 cut-off events. [2025-01-09 21:04:51,309 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 21:04:51,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 144 conditions, 119 events. 5/119 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 131 event pairs, 0 based on Foata normal form. 13/121 useless extension candidates. Maximal degree in co-relation 81. Up to 16 conditions per place. [2025-01-09 21:04:51,310 INFO L140 encePairwiseOnDemand]: 116/126 looper letters, 15 selfloop transitions, 5 changer transitions 0/116 dead transitions. [2025-01-09 21:04:51,310 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 116 transitions, 276 flow [2025-01-09 21:04:51,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:04:51,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:04:51,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 619 transitions. [2025-01-09 21:04:51,319 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8187830687830688 [2025-01-09 21:04:51,320 INFO L175 Difference]: Start difference. First operand has 121 places, 126 transitions, 256 flow. Second operand 6 states and 619 transitions. [2025-01-09 21:04:51,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 116 transitions, 276 flow [2025-01-09 21:04:51,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 116 transitions, 276 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:04:51,325 INFO L231 Difference]: Finished difference. Result has 119 places, 116 transitions, 246 flow [2025-01-09 21:04:51,327 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=246, PETRI_PLACES=119, PETRI_TRANSITIONS=116} [2025-01-09 21:04:51,329 INFO L279 CegarLoopForPetriNet]: 121 programPoint places, -2 predicate places. [2025-01-09 21:04:51,329 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 116 transitions, 246 flow [2025-01-09 21:04:51,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 100.5) internal successors, (603), 6 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:04:51,329 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:04:51,329 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:04:51,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:04:51,330 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-01-09 21:04:51,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:04:51,330 INFO L85 PathProgramCache]: Analyzing trace with hash -185004957, now seen corresponding path program 1 times [2025-01-09 21:04:51,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:04:51,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988755365] [2025-01-09 21:04:51,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:04:51,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:04:51,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-09 21:04:51,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-09 21:04:51,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:04:51,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:04:51,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:04:51,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:04:51,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988755365] [2025-01-09 21:04:51,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988755365] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:04:51,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:04:51,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:04:51,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395287841] [2025-01-09 21:04:51,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:04:51,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:04:51,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:04:51,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:04:51,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:04:51,389 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 126 [2025-01-09 21:04:51,389 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 116 transitions, 246 flow. Second operand has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:04:51,389 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:04:51,389 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 126 [2025-01-09 21:04:51,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:04:51,411 INFO L124 PetriNetUnfolderBase]: 5/131 cut-off events. [2025-01-09 21:04:51,411 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-09 21:04:51,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158 conditions, 131 events. 5/131 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 124 event pairs, 0 based on Foata normal form. 1/122 useless extension candidates. Maximal degree in co-relation 96. Up to 11 conditions per place. [2025-01-09 21:04:51,416 INFO L140 encePairwiseOnDemand]: 123/126 looper letters, 9 selfloop transitions, 2 changer transitions 0/117 dead transitions. [2025-01-09 21:04:51,416 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 117 transitions, 272 flow [2025-01-09 21:04:51,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:04:51,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:04:51,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 342 transitions. [2025-01-09 21:04:51,418 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9047619047619048 [2025-01-09 21:04:51,418 INFO L175 Difference]: Start difference. First operand has 119 places, 116 transitions, 246 flow. Second operand 3 states and 342 transitions. [2025-01-09 21:04:51,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 117 transitions, 272 flow [2025-01-09 21:04:51,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 117 transitions, 260 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:04:51,421 INFO L231 Difference]: Finished difference. Result has 117 places, 117 transitions, 248 flow [2025-01-09 21:04:51,421 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=248, PETRI_PLACES=117, PETRI_TRANSITIONS=117} [2025-01-09 21:04:51,421 INFO L279 CegarLoopForPetriNet]: 121 programPoint places, -4 predicate places. [2025-01-09 21:04:51,421 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 117 transitions, 248 flow [2025-01-09 21:04:51,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:04:51,422 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:04:51,422 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:04:51,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:04:51,422 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-01-09 21:04:51,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:04:51,422 INFO L85 PathProgramCache]: Analyzing trace with hash -1645151535, now seen corresponding path program 1 times [2025-01-09 21:04:51,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:04:51,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570067454] [2025-01-09 21:04:51,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:04:51,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:04:51,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-09 21:04:51,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-09 21:04:51,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:04:51,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:04:51,496 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:04:51,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:04:51,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570067454] [2025-01-09 21:04:51,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570067454] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:04:51,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [176851341] [2025-01-09 21:04:51,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:04:51,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:04:51,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:04:51,498 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 21:04:51,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 21:04:51,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-09 21:04:51,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-09 21:04:51,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:04:51,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:04:51,559 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 21:04:51,561 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:04:51,602 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:04:51,602 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:04:51,659 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:04:51,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [176851341] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 21:04:51,659 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 21:04:51,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-01-09 21:04:51,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293655144] [2025-01-09 21:04:51,660 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 21:04:51,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 21:04:51,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:04:51,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 21:04:51,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-09 21:04:51,738 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 126 [2025-01-09 21:04:51,739 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 117 transitions, 248 flow. Second operand has 10 states, 10 states have (on average 108.9) internal successors, (1089), 10 states have internal predecessors, (1089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:04:51,739 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:04:51,739 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 126 [2025-01-09 21:04:51,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:04:51,814 INFO L124 PetriNetUnfolderBase]: 5/146 cut-off events. [2025-01-09 21:04:51,814 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 21:04:51,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 181 conditions, 146 events. 5/146 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 98 event pairs, 0 based on Foata normal form. 2/138 useless extension candidates. Maximal degree in co-relation 131. Up to 11 conditions per place. [2025-01-09 21:04:51,815 INFO L140 encePairwiseOnDemand]: 120/126 looper letters, 13 selfloop transitions, 9 changer transitions 0/125 dead transitions. [2025-01-09 21:04:51,815 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 125 transitions, 310 flow [2025-01-09 21:04:51,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 21:04:51,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-09 21:04:51,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 987 transitions. [2025-01-09 21:04:51,817 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8703703703703703 [2025-01-09 21:04:51,817 INFO L175 Difference]: Start difference. First operand has 117 places, 117 transitions, 248 flow. Second operand 9 states and 987 transitions. [2025-01-09 21:04:51,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 125 transitions, 310 flow [2025-01-09 21:04:51,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 125 transitions, 308 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:04:51,819 INFO L231 Difference]: Finished difference. Result has 127 places, 123 transitions, 296 flow [2025-01-09 21:04:51,819 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=296, PETRI_PLACES=127, PETRI_TRANSITIONS=123} [2025-01-09 21:04:51,820 INFO L279 CegarLoopForPetriNet]: 121 programPoint places, 6 predicate places. [2025-01-09 21:04:51,820 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 123 transitions, 296 flow [2025-01-09 21:04:51,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 108.9) internal successors, (1089), 10 states have internal predecessors, (1089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:04:51,821 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:04:51,821 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:04:51,827 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 21:04:52,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:04:52,025 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-01-09 21:04:52,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:04:52,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1917317103, now seen corresponding path program 2 times [2025-01-09 21:04:52,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:04:52,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613799960] [2025-01-09 21:04:52,026 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 21:04:52,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:04:52,044 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 77 statements into 2 equivalence classes. [2025-01-09 21:04:52,057 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 21:04:52,057 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 21:04:52,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:04:52,200 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:04:52,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:04:52,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613799960] [2025-01-09 21:04:52,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613799960] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:04:52,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [313546508] [2025-01-09 21:04:52,200 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 21:04:52,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:04:52,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:04:52,202 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 21:04:52,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 21:04:52,251 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 77 statements into 2 equivalence classes. [2025-01-09 21:04:52,272 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 21:04:52,272 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 21:04:52,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:04:52,273 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 21:04:52,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:04:52,339 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:04:52,339 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:04:52,493 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:04:52,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [313546508] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 21:04:52,494 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 21:04:52,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2025-01-09 21:04:52,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750109875] [2025-01-09 21:04:52,494 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 21:04:52,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 21:04:52,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:04:52,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 21:04:52,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-01-09 21:04:52,594 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 126 [2025-01-09 21:04:52,595 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 123 transitions, 296 flow. Second operand has 15 states, 15 states have (on average 109.06666666666666) internal successors, (1636), 15 states have internal predecessors, (1636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:04:52,595 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:04:52,595 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 126 [2025-01-09 21:04:52,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:04:52,721 INFO L124 PetriNetUnfolderBase]: 5/185 cut-off events. [2025-01-09 21:04:52,722 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2025-01-09 21:04:52,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 274 conditions, 185 events. 5/185 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 99 event pairs, 0 based on Foata normal form. 3/178 useless extension candidates. Maximal degree in co-relation 185. Up to 11 conditions per place. [2025-01-09 21:04:52,722 INFO L140 encePairwiseOnDemand]: 120/126 looper letters, 16 selfloop transitions, 18 changer transitions 0/137 dead transitions. [2025-01-09 21:04:52,722 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 137 transitions, 438 flow [2025-01-09 21:04:52,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 21:04:52,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-01-09 21:04:52,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1963 transitions. [2025-01-09 21:04:52,725 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8655202821869489 [2025-01-09 21:04:52,726 INFO L175 Difference]: Start difference. First operand has 127 places, 123 transitions, 296 flow. Second operand 18 states and 1963 transitions. [2025-01-09 21:04:52,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 137 transitions, 438 flow [2025-01-09 21:04:52,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 137 transitions, 426 flow, removed 5 selfloop flow, removed 1 redundant places. [2025-01-09 21:04:52,728 INFO L231 Difference]: Finished difference. Result has 147 places, 133 transitions, 396 flow [2025-01-09 21:04:52,728 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=396, PETRI_PLACES=147, PETRI_TRANSITIONS=133} [2025-01-09 21:04:52,729 INFO L279 CegarLoopForPetriNet]: 121 programPoint places, 26 predicate places. [2025-01-09 21:04:52,729 INFO L471 AbstractCegarLoop]: Abstraction has has 147 places, 133 transitions, 396 flow [2025-01-09 21:04:52,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 109.06666666666666) internal successors, (1636), 15 states have internal predecessors, (1636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:04:52,730 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:04:52,730 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:04:52,739 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 21:04:52,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:04:52,931 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-01-09 21:04:52,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:04:52,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1011180707, now seen corresponding path program 3 times [2025-01-09 21:04:52,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:04:52,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270066761] [2025-01-09 21:04:52,932 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 21:04:52,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:04:52,960 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 116 statements into 7 equivalence classes. [2025-01-09 21:04:53,007 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 116 of 116 statements. [2025-01-09 21:04:53,007 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-01-09 21:04:53,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:04:53,008 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:04:53,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-09 21:04:53,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-09 21:04:53,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:04:53,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:04:53,052 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:04:53,052 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:04:53,053 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining) [2025-01-09 21:04:53,054 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (8 of 10 remaining) [2025-01-09 21:04:53,054 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (7 of 10 remaining) [2025-01-09 21:04:53,054 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (6 of 10 remaining) [2025-01-09 21:04:53,054 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (5 of 10 remaining) [2025-01-09 21:04:53,054 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (4 of 10 remaining) [2025-01-09 21:04:53,054 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (3 of 10 remaining) [2025-01-09 21:04:53,054 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (2 of 10 remaining) [2025-01-09 21:04:53,054 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (1 of 10 remaining) [2025-01-09 21:04:53,054 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (0 of 10 remaining) [2025-01-09 21:04:53,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:04:53,055 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1] [2025-01-09 21:04:53,056 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:04:53,056 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-01-09 21:04:53,082 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:04:53,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 190 places, 200 transitions, 410 flow [2025-01-09 21:04:53,116 INFO L124 PetriNetUnfolderBase]: 15/216 cut-off events. [2025-01-09 21:04:53,116 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 21:04:53,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 224 conditions, 216 events. 15/216 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 527 event pairs, 0 based on Foata normal form. 0/189 useless extension candidates. Maximal degree in co-relation 155. Up to 3 conditions per place. [2025-01-09 21:04:53,118 INFO L82 GeneralOperation]: Start removeDead. Operand has 190 places, 200 transitions, 410 flow [2025-01-09 21:04:53,119 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 190 places, 200 transitions, 410 flow [2025-01-09 21:04:53,119 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:04:53,120 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;@7fef0089, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:04:53,120 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2025-01-09 21:04:53,122 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:04:53,122 INFO L124 PetriNetUnfolderBase]: 0/52 cut-off events. [2025-01-09 21:04:53,122 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:04:53,122 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:04:53,122 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:04:53,122 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-01-09 21:04:53,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:04:53,123 INFO L85 PathProgramCache]: Analyzing trace with hash 764858085, now seen corresponding path program 1 times [2025-01-09 21:04:53,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:04:53,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621075625] [2025-01-09 21:04:53,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:04:53,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:04:53,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-09 21:04:53,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-09 21:04:53,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:04:53,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:04:53,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:04:53,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:04:53,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621075625] [2025-01-09 21:04:53,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621075625] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:04:53,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:04:53,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:04:53,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315886673] [2025-01-09 21:04:53,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:04:53,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:04:53,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:04:53,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:04:53,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:04:53,443 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 200 [2025-01-09 21:04:53,444 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 200 transitions, 410 flow. Second operand has 6 states, 6 states have (on average 161.5) internal successors, (969), 6 states have internal predecessors, (969), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:04:53,444 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:04:53,444 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 200 [2025-01-09 21:04:53,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:04:53,539 INFO L124 PetriNetUnfolderBase]: 134/844 cut-off events. [2025-01-09 21:04:53,539 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2025-01-09 21:04:53,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1074 conditions, 844 events. 134/844 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 5333 event pairs, 72 based on Foata normal form. 137/853 useless extension candidates. Maximal degree in co-relation 384. Up to 193 conditions per place. [2025-01-09 21:04:53,544 INFO L140 encePairwiseOnDemand]: 187/200 looper letters, 24 selfloop transitions, 5 changer transitions 0/185 dead transitions. [2025-01-09 21:04:53,544 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 185 transitions, 438 flow [2025-01-09 21:04:53,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:04:53,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:04:53,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 997 transitions. [2025-01-09 21:04:53,547 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8308333333333333 [2025-01-09 21:04:53,547 INFO L175 Difference]: Start difference. First operand has 190 places, 200 transitions, 410 flow. Second operand 6 states and 997 transitions. [2025-01-09 21:04:53,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 185 transitions, 438 flow [2025-01-09 21:04:53,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 185 transitions, 438 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:04:53,550 INFO L231 Difference]: Finished difference. Result has 186 places, 185 transitions, 390 flow [2025-01-09 21:04:53,550 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=380, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=390, PETRI_PLACES=186, PETRI_TRANSITIONS=185} [2025-01-09 21:04:53,550 INFO L279 CegarLoopForPetriNet]: 190 programPoint places, -4 predicate places. [2025-01-09 21:04:53,550 INFO L471 AbstractCegarLoop]: Abstraction has has 186 places, 185 transitions, 390 flow [2025-01-09 21:04:53,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 161.5) internal successors, (969), 6 states have internal predecessors, (969), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:04:53,551 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:04:53,551 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:04:53,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:04:53,551 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-01-09 21:04:53,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:04:53,552 INFO L85 PathProgramCache]: Analyzing trace with hash 1171019963, now seen corresponding path program 1 times [2025-01-09 21:04:53,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:04:53,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71916351] [2025-01-09 21:04:53,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:04:53,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:04:53,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-09 21:04:53,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-09 21:04:53,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:04:53,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:04:53,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:04:53,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:04:53,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71916351] [2025-01-09 21:04:53,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71916351] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:04:53,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:04:53,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:04:53,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934046887] [2025-01-09 21:04:53,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:04:53,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:04:53,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:04:53,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:04:53,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:04:53,591 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 200 [2025-01-09 21:04:53,592 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 185 transitions, 390 flow. Second operand has 3 states, 3 states have (on average 177.0) internal successors, (531), 3 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:04:53,592 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:04:53,592 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 200 [2025-01-09 21:04:53,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:04:53,682 INFO L124 PetriNetUnfolderBase]: 45/525 cut-off events. [2025-01-09 21:04:53,682 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2025-01-09 21:04:53,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 613 conditions, 525 events. 45/525 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2385 event pairs, 20 based on Foata normal form. 1/465 useless extension candidates. Maximal degree in co-relation 550. Up to 56 conditions per place. [2025-01-09 21:04:53,684 INFO L140 encePairwiseOnDemand]: 197/200 looper letters, 14 selfloop transitions, 2 changer transitions 0/186 dead transitions. [2025-01-09 21:04:53,684 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 186 transitions, 426 flow [2025-01-09 21:04:53,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:04:53,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:04:53,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 542 transitions. [2025-01-09 21:04:53,686 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9033333333333333 [2025-01-09 21:04:53,686 INFO L175 Difference]: Start difference. First operand has 186 places, 185 transitions, 390 flow. Second operand 3 states and 542 transitions. [2025-01-09 21:04:53,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 186 transitions, 426 flow [2025-01-09 21:04:53,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 186 transitions, 414 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:04:53,688 INFO L231 Difference]: Finished difference. Result has 184 places, 186 transitions, 392 flow [2025-01-09 21:04:53,688 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=380, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=392, PETRI_PLACES=184, PETRI_TRANSITIONS=186} [2025-01-09 21:04:53,688 INFO L279 CegarLoopForPetriNet]: 190 programPoint places, -6 predicate places. [2025-01-09 21:04:53,688 INFO L471 AbstractCegarLoop]: Abstraction has has 184 places, 186 transitions, 392 flow [2025-01-09 21:04:53,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 177.0) internal successors, (531), 3 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:04:53,689 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:04:53,689 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:04:53,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:04:53,689 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-01-09 21:04:53,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:04:53,689 INFO L85 PathProgramCache]: Analyzing trace with hash -645653647, now seen corresponding path program 1 times [2025-01-09 21:04:53,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:04:53,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321733781] [2025-01-09 21:04:53,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:04:53,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:04:53,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-01-09 21:04:53,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-01-09 21:04:53,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:04:53,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:04:53,735 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:04:53,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:04:53,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321733781] [2025-01-09 21:04:53,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321733781] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:04:53,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2119226082] [2025-01-09 21:04:53,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:04:53,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:04:53,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:04:53,737 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 21:04:53,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 21:04:53,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-01-09 21:04:53,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-01-09 21:04:53,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:04:53,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:04:53,796 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 21:04:53,797 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:04:53,821 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:04:53,821 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:04:53,855 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:04:53,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2119226082] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 21:04:53,855 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 21:04:53,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-01-09 21:04:53,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237745667] [2025-01-09 21:04:53,855 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 21:04:53,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 21:04:53,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:04:53,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 21:04:53,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-09 21:04:53,910 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 200 [2025-01-09 21:04:53,911 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 186 transitions, 392 flow. Second operand has 10 states, 10 states have (on average 174.0) internal successors, (1740), 10 states have internal predecessors, (1740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:04:53,911 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:04:53,911 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 200 [2025-01-09 21:04:53,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:04:53,996 INFO L124 PetriNetUnfolderBase]: 45/540 cut-off events. [2025-01-09 21:04:53,996 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2025-01-09 21:04:53,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 636 conditions, 540 events. 45/540 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2356 event pairs, 20 based on Foata normal form. 2/481 useless extension candidates. Maximal degree in co-relation 585. Up to 56 conditions per place. [2025-01-09 21:04:53,998 INFO L140 encePairwiseOnDemand]: 194/200 looper letters, 18 selfloop transitions, 9 changer transitions 0/194 dead transitions. [2025-01-09 21:04:53,998 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 194 transitions, 464 flow [2025-01-09 21:04:53,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 21:04:53,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-09 21:04:54,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1577 transitions. [2025-01-09 21:04:54,000 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8761111111111111 [2025-01-09 21:04:54,000 INFO L175 Difference]: Start difference. First operand has 184 places, 186 transitions, 392 flow. Second operand 9 states and 1577 transitions. [2025-01-09 21:04:54,000 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 194 transitions, 464 flow [2025-01-09 21:04:54,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 194 transitions, 462 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:04:54,002 INFO L231 Difference]: Finished difference. Result has 194 places, 192 transitions, 440 flow [2025-01-09 21:04:54,003 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=390, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=440, PETRI_PLACES=194, PETRI_TRANSITIONS=192} [2025-01-09 21:04:54,003 INFO L279 CegarLoopForPetriNet]: 190 programPoint places, 4 predicate places. [2025-01-09 21:04:54,003 INFO L471 AbstractCegarLoop]: Abstraction has has 194 places, 192 transitions, 440 flow [2025-01-09 21:04:54,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 174.0) internal successors, (1740), 10 states have internal predecessors, (1740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:04:54,004 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:04:54,004 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:04:54,010 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 21:04:54,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:04:54,208 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-01-09 21:04:54,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:04:54,208 INFO L85 PathProgramCache]: Analyzing trace with hash -386917455, now seen corresponding path program 2 times [2025-01-09 21:04:54,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:04:54,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753767940] [2025-01-09 21:04:54,209 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 21:04:54,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:04:54,218 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 83 statements into 2 equivalence classes. [2025-01-09 21:04:54,224 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 83 of 83 statements. [2025-01-09 21:04:54,224 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 21:04:54,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:04:54,322 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 21:04:54,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:04:54,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753767940] [2025-01-09 21:04:54,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753767940] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:04:54,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [453442223] [2025-01-09 21:04:54,322 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 21:04:54,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:04:54,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:04:54,328 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 21:04:54,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 21:04:54,375 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 83 statements into 2 equivalence classes. [2025-01-09 21:04:54,395 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 83 of 83 statements. [2025-01-09 21:04:54,395 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 21:04:54,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:04:54,396 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 21:04:54,398 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:04:54,453 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 21:04:54,453 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:04:54,542 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 21:04:54,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [453442223] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 21:04:54,543 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 21:04:54,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2025-01-09 21:04:54,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772747950] [2025-01-09 21:04:54,543 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 21:04:54,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 21:04:54,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:04:54,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 21:04:54,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-01-09 21:04:54,705 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 200 [2025-01-09 21:04:54,707 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 192 transitions, 440 flow. Second operand has 15 states, 15 states have (on average 174.13333333333333) internal successors, (2612), 15 states have internal predecessors, (2612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:04:54,707 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:04:54,707 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 200 [2025-01-09 21:04:54,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:04:54,882 INFO L124 PetriNetUnfolderBase]: 45/579 cut-off events. [2025-01-09 21:04:54,882 INFO L125 PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES. [2025-01-09 21:04:54,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 729 conditions, 579 events. 45/579 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2354 event pairs, 20 based on Foata normal form. 3/521 useless extension candidates. Maximal degree in co-relation 547. Up to 56 conditions per place. [2025-01-09 21:04:54,885 INFO L140 encePairwiseOnDemand]: 194/200 looper letters, 21 selfloop transitions, 18 changer transitions 0/206 dead transitions. [2025-01-09 21:04:54,886 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 206 transitions, 592 flow [2025-01-09 21:04:54,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 21:04:54,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-01-09 21:04:54,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 3138 transitions. [2025-01-09 21:04:54,892 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8716666666666667 [2025-01-09 21:04:54,893 INFO L175 Difference]: Start difference. First operand has 194 places, 192 transitions, 440 flow. Second operand 18 states and 3138 transitions. [2025-01-09 21:04:54,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 206 transitions, 592 flow [2025-01-09 21:04:54,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 206 transitions, 580 flow, removed 5 selfloop flow, removed 1 redundant places. [2025-01-09 21:04:54,897 INFO L231 Difference]: Finished difference. Result has 214 places, 202 transitions, 540 flow [2025-01-09 21:04:54,898 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=434, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=540, PETRI_PLACES=214, PETRI_TRANSITIONS=202} [2025-01-09 21:04:54,900 INFO L279 CegarLoopForPetriNet]: 190 programPoint places, 24 predicate places. [2025-01-09 21:04:54,900 INFO L471 AbstractCegarLoop]: Abstraction has has 214 places, 202 transitions, 540 flow [2025-01-09 21:04:54,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 174.13333333333333) internal successors, (2612), 15 states have internal predecessors, (2612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:04:54,901 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:04:54,901 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:04:54,909 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 21:04:55,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-01-09 21:04:55,102 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-01-09 21:04:55,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:04:55,102 INFO L85 PathProgramCache]: Analyzing trace with hash 1002147835, now seen corresponding path program 3 times [2025-01-09 21:04:55,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:04:55,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457713842] [2025-01-09 21:04:55,103 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 21:04:55,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:04:55,118 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 122 statements into 8 equivalence classes. [2025-01-09 21:04:55,155 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 122 of 122 statements. [2025-01-09 21:04:55,155 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-01-09 21:04:55,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:04:55,155 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:04:55,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-09 21:04:55,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-09 21:04:55,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:04:55,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:04:55,185 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:04:55,185 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:04:55,185 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 14 remaining) [2025-01-09 21:04:55,186 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (12 of 14 remaining) [2025-01-09 21:04:55,186 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (11 of 14 remaining) [2025-01-09 21:04:55,186 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (10 of 14 remaining) [2025-01-09 21:04:55,186 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (9 of 14 remaining) [2025-01-09 21:04:55,186 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (8 of 14 remaining) [2025-01-09 21:04:55,186 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (7 of 14 remaining) [2025-01-09 21:04:55,186 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (6 of 14 remaining) [2025-01-09 21:04:55,186 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (5 of 14 remaining) [2025-01-09 21:04:55,186 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (4 of 14 remaining) [2025-01-09 21:04:55,186 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (3 of 14 remaining) [2025-01-09 21:04:55,186 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (2 of 14 remaining) [2025-01-09 21:04:55,186 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (1 of 14 remaining) [2025-01-09 21:04:55,186 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (0 of 14 remaining) [2025-01-09 21:04:55,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 21:04:55,186 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1] [2025-01-09 21:04:55,186 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:04:55,186 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-01-09 21:04:55,230 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:04:55,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 259 places, 274 transitions, 566 flow [2025-01-09 21:04:55,255 INFO L124 PetriNetUnfolderBase]: 22/299 cut-off events. [2025-01-09 21:04:55,255 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-01-09 21:04:55,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 312 conditions, 299 events. 22/299 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 953 event pairs, 0 based on Foata normal form. 0/260 useless extension candidates. Maximal degree in co-relation 228. Up to 4 conditions per place. [2025-01-09 21:04:55,259 INFO L82 GeneralOperation]: Start removeDead. Operand has 259 places, 274 transitions, 566 flow [2025-01-09 21:04:55,262 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 259 places, 274 transitions, 566 flow [2025-01-09 21:04:55,263 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:04:55,263 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;@7fef0089, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:04:55,263 INFO L334 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2025-01-09 21:04:55,266 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:04:55,266 INFO L124 PetriNetUnfolderBase]: 0/52 cut-off events. [2025-01-09 21:04:55,266 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:04:55,266 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:04:55,266 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:04:55,266 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-01-09 21:04:55,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:04:55,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1970393527, now seen corresponding path program 1 times [2025-01-09 21:04:55,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:04:55,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504287552] [2025-01-09 21:04:55,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:04:55,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:04:55,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-09 21:04:55,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-09 21:04:55,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:04:55,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:04:55,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:04:55,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:04:55,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504287552] [2025-01-09 21:04:55,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504287552] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:04:55,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:04:55,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:04:55,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349681761] [2025-01-09 21:04:55,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:04:55,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:04:55,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:04:55,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:04:55,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:04:55,616 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 221 out of 274 [2025-01-09 21:04:55,617 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 274 transitions, 566 flow. Second operand has 6 states, 6 states have (on average 222.5) internal successors, (1335), 6 states have internal predecessors, (1335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:04:55,617 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:04:55,617 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 221 of 274 [2025-01-09 21:04:55,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:04:56,744 INFO L124 PetriNetUnfolderBase]: 2123/7948 cut-off events. [2025-01-09 21:04:56,744 INFO L125 PetriNetUnfolderBase]: For 622/622 co-relation queries the response was YES. [2025-01-09 21:04:56,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10942 conditions, 7948 events. 2123/7948 cut-off events. For 622/622 co-relation queries the response was YES. Maximal size of possible extension queue 313. Compared 84885 event pairs, 1368 based on Foata normal form. 1386/7953 useless extension candidates. Maximal degree in co-relation 1866. Up to 2632 conditions per place. [2025-01-09 21:04:56,810 INFO L140 encePairwiseOnDemand]: 258/274 looper letters, 33 selfloop transitions, 5 changer transitions 0/254 dead transitions. [2025-01-09 21:04:56,810 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 254 transitions, 602 flow [2025-01-09 21:04:56,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:04:56,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:04:56,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1375 transitions. [2025-01-09 21:04:56,813 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8363746958637469 [2025-01-09 21:04:56,813 INFO L175 Difference]: Start difference. First operand has 259 places, 274 transitions, 566 flow. Second operand 6 states and 1375 transitions. [2025-01-09 21:04:56,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 254 transitions, 602 flow [2025-01-09 21:04:56,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 254 transitions, 600 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-01-09 21:04:56,817 INFO L231 Difference]: Finished difference. Result has 253 places, 254 transitions, 534 flow [2025-01-09 21:04:56,817 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=524, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=249, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=534, PETRI_PLACES=253, PETRI_TRANSITIONS=254} [2025-01-09 21:04:56,818 INFO L279 CegarLoopForPetriNet]: 259 programPoint places, -6 predicate places. [2025-01-09 21:04:56,818 INFO L471 AbstractCegarLoop]: Abstraction has has 253 places, 254 transitions, 534 flow [2025-01-09 21:04:56,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 222.5) internal successors, (1335), 6 states have internal predecessors, (1335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:04:56,819 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:04:56,819 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:04:56,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 21:04:56,819 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-01-09 21:04:56,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:04:56,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1554195482, now seen corresponding path program 1 times [2025-01-09 21:04:56,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:04:56,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147558367] [2025-01-09 21:04:56,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:04:56,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:04:56,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-09 21:04:56,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-09 21:04:56,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:04:56,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:04:56,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:04:56,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:04:56,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147558367] [2025-01-09 21:04:56,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147558367] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:04:56,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:04:56,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:04:56,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400845113] [2025-01-09 21:04:56,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:04:56,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:04:56,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:04:56,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:04:56,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:04:56,863 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 240 out of 274 [2025-01-09 21:04:56,864 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 254 transitions, 534 flow. Second operand has 3 states, 3 states have (on average 242.33333333333334) internal successors, (727), 3 states have internal predecessors, (727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:04:56,864 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:04:56,864 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 240 of 274 [2025-01-09 21:04:56,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:04:57,097 INFO L124 PetriNetUnfolderBase]: 345/2595 cut-off events. [2025-01-09 21:04:57,097 INFO L125 PetriNetUnfolderBase]: For 168/168 co-relation queries the response was YES. [2025-01-09 21:04:57,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3084 conditions, 2595 events. 345/2595 cut-off events. For 168/168 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 21903 event pairs, 220 based on Foata normal form. 1/2279 useless extension candidates. Maximal degree in co-relation 3020. Up to 381 conditions per place. [2025-01-09 21:04:57,118 INFO L140 encePairwiseOnDemand]: 271/274 looper letters, 19 selfloop transitions, 2 changer transitions 0/255 dead transitions. [2025-01-09 21:04:57,119 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 255 transitions, 580 flow [2025-01-09 21:04:57,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:04:57,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:04:57,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 742 transitions. [2025-01-09 21:04:57,120 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.902676399026764 [2025-01-09 21:04:57,120 INFO L175 Difference]: Start difference. First operand has 253 places, 254 transitions, 534 flow. Second operand 3 states and 742 transitions. [2025-01-09 21:04:57,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 255 transitions, 580 flow [2025-01-09 21:04:57,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 255 transitions, 568 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:04:57,123 INFO L231 Difference]: Finished difference. Result has 251 places, 255 transitions, 536 flow [2025-01-09 21:04:57,124 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=524, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=536, PETRI_PLACES=251, PETRI_TRANSITIONS=255} [2025-01-09 21:04:57,125 INFO L279 CegarLoopForPetriNet]: 259 programPoint places, -8 predicate places. [2025-01-09 21:04:57,125 INFO L471 AbstractCegarLoop]: Abstraction has has 251 places, 255 transitions, 536 flow [2025-01-09 21:04:57,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 242.33333333333334) internal successors, (727), 3 states have internal predecessors, (727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:04:57,126 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:04:57,126 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:04:57,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 21:04:57,126 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-01-09 21:04:57,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:04:57,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1292252882, now seen corresponding path program 1 times [2025-01-09 21:04:57,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:04:57,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583898378] [2025-01-09 21:04:57,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:04:57,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:04:57,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-09 21:04:57,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-09 21:04:57,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:04:57,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:04:57,170 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:04:57,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:04:57,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583898378] [2025-01-09 21:04:57,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583898378] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:04:57,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1470078688] [2025-01-09 21:04:57,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:04:57,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:04:57,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:04:57,173 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 21:04:57,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 21:04:57,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-09 21:04:57,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-09 21:04:57,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:04:57,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:04:57,245 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 21:04:57,246 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:04:57,269 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:04:57,270 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:04:57,299 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:04:57,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1470078688] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 21:04:57,300 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 21:04:57,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-01-09 21:04:57,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362718723] [2025-01-09 21:04:57,300 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 21:04:57,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 21:04:57,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:04:57,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 21:04:57,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-09 21:04:57,357 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 237 out of 274 [2025-01-09 21:04:57,359 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 255 transitions, 536 flow. Second operand has 10 states, 10 states have (on average 239.1) internal successors, (2391), 10 states have internal predecessors, (2391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:04:57,359 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:04:57,359 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 237 of 274 [2025-01-09 21:04:57,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:04:57,634 INFO L124 PetriNetUnfolderBase]: 345/2610 cut-off events. [2025-01-09 21:04:57,635 INFO L125 PetriNetUnfolderBase]: For 167/167 co-relation queries the response was YES. [2025-01-09 21:04:57,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3107 conditions, 2610 events. 345/2610 cut-off events. For 167/167 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 21908 event pairs, 220 based on Foata normal form. 2/2295 useless extension candidates. Maximal degree in co-relation 3055. Up to 381 conditions per place. [2025-01-09 21:04:57,653 INFO L140 encePairwiseOnDemand]: 268/274 looper letters, 23 selfloop transitions, 9 changer transitions 0/263 dead transitions. [2025-01-09 21:04:57,653 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 263 transitions, 618 flow [2025-01-09 21:04:57,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 21:04:57,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-09 21:04:57,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2167 transitions. [2025-01-09 21:04:57,656 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8787510137875101 [2025-01-09 21:04:57,656 INFO L175 Difference]: Start difference. First operand has 251 places, 255 transitions, 536 flow. Second operand 9 states and 2167 transitions. [2025-01-09 21:04:57,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 259 places, 263 transitions, 618 flow [2025-01-09 21:04:57,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 263 transitions, 616 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:04:57,659 INFO L231 Difference]: Finished difference. Result has 261 places, 261 transitions, 584 flow [2025-01-09 21:04:57,660 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=534, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=249, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=584, PETRI_PLACES=261, PETRI_TRANSITIONS=261} [2025-01-09 21:04:57,660 INFO L279 CegarLoopForPetriNet]: 259 programPoint places, 2 predicate places. [2025-01-09 21:04:57,660 INFO L471 AbstractCegarLoop]: Abstraction has has 261 places, 261 transitions, 584 flow [2025-01-09 21:04:57,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 239.1) internal successors, (2391), 10 states have internal predecessors, (2391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:04:57,661 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:04:57,661 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:04:57,666 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-09 21:04:57,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-01-09 21:04:57,865 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-01-09 21:04:57,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:04:57,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1792152622, now seen corresponding path program 2 times [2025-01-09 21:04:57,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:04:57,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639462114] [2025-01-09 21:04:57,865 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 21:04:57,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:04:57,874 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 89 statements into 2 equivalence classes. [2025-01-09 21:04:57,879 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 21:04:57,879 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 21:04:57,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:04:57,968 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:04:57,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:04:57,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639462114] [2025-01-09 21:04:57,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639462114] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:04:57,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [327854318] [2025-01-09 21:04:57,968 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 21:04:57,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:04:57,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:04:57,973 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 21:04:57,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 21:04:58,032 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 89 statements into 2 equivalence classes. [2025-01-09 21:04:58,053 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 21:04:58,053 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 21:04:58,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:04:58,054 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 21:04:58,057 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:04:58,122 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:04:58,122 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:04:58,218 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:04:58,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [327854318] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 21:04:58,218 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 21:04:58,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2025-01-09 21:04:58,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681930548] [2025-01-09 21:04:58,218 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 21:04:58,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 21:04:58,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:04:58,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 21:04:58,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-01-09 21:04:58,309 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 237 out of 274 [2025-01-09 21:04:58,312 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 261 transitions, 584 flow. Second operand has 15 states, 15 states have (on average 239.2) internal successors, (3588), 15 states have internal predecessors, (3588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:04:58,312 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:04:58,312 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 237 of 274 [2025-01-09 21:04:58,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:04:58,753 INFO L124 PetriNetUnfolderBase]: 345/2649 cut-off events. [2025-01-09 21:04:58,753 INFO L125 PetriNetUnfolderBase]: For 189/189 co-relation queries the response was YES. [2025-01-09 21:04:58,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3200 conditions, 2649 events. 345/2649 cut-off events. For 189/189 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 22012 event pairs, 220 based on Foata normal form. 3/2335 useless extension candidates. Maximal degree in co-relation 3017. Up to 381 conditions per place. [2025-01-09 21:04:58,779 INFO L140 encePairwiseOnDemand]: 268/274 looper letters, 26 selfloop transitions, 18 changer transitions 0/275 dead transitions. [2025-01-09 21:04:58,779 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 275 transitions, 746 flow [2025-01-09 21:04:58,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 21:04:58,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-01-09 21:04:58,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 4313 transitions. [2025-01-09 21:04:58,788 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.874493106244931 [2025-01-09 21:04:58,789 INFO L175 Difference]: Start difference. First operand has 261 places, 261 transitions, 584 flow. Second operand 18 states and 4313 transitions. [2025-01-09 21:04:58,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 275 transitions, 746 flow [2025-01-09 21:04:58,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 275 transitions, 734 flow, removed 5 selfloop flow, removed 1 redundant places. [2025-01-09 21:04:58,795 INFO L231 Difference]: Finished difference. Result has 281 places, 271 transitions, 684 flow [2025-01-09 21:04:58,795 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=578, PETRI_DIFFERENCE_MINUEND_PLACES=260, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=250, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=684, PETRI_PLACES=281, PETRI_TRANSITIONS=271} [2025-01-09 21:04:58,795 INFO L279 CegarLoopForPetriNet]: 259 programPoint places, 22 predicate places. [2025-01-09 21:04:58,795 INFO L471 AbstractCegarLoop]: Abstraction has has 281 places, 271 transitions, 684 flow [2025-01-09 21:04:58,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 239.2) internal successors, (3588), 15 states have internal predecessors, (3588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:04:58,798 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:04:58,799 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:04:58,805 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-09 21:04:58,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-01-09 21:04:58,999 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-01-09 21:04:59,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:04:59,000 INFO L85 PathProgramCache]: Analyzing trace with hash -421946650, now seen corresponding path program 3 times [2025-01-09 21:04:59,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:04:59,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938775100] [2025-01-09 21:04:59,000 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 21:04:59,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:04:59,019 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 128 statements into 7 equivalence classes. [2025-01-09 21:04:59,052 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 128 of 128 statements. [2025-01-09 21:04:59,052 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-01-09 21:04:59,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:04:59,052 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:04:59,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-01-09 21:04:59,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-01-09 21:04:59,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:04:59,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:04:59,088 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:04:59,088 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:04:59,088 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (17 of 18 remaining) [2025-01-09 21:04:59,088 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (16 of 18 remaining) [2025-01-09 21:04:59,088 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (15 of 18 remaining) [2025-01-09 21:04:59,088 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (14 of 18 remaining) [2025-01-09 21:04:59,088 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (13 of 18 remaining) [2025-01-09 21:04:59,088 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (12 of 18 remaining) [2025-01-09 21:04:59,088 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (11 of 18 remaining) [2025-01-09 21:04:59,088 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (10 of 18 remaining) [2025-01-09 21:04:59,088 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (9 of 18 remaining) [2025-01-09 21:04:59,089 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (8 of 18 remaining) [2025-01-09 21:04:59,089 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (7 of 18 remaining) [2025-01-09 21:04:59,089 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (6 of 18 remaining) [2025-01-09 21:04:59,089 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (5 of 18 remaining) [2025-01-09 21:04:59,089 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (4 of 18 remaining) [2025-01-09 21:04:59,089 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (3 of 18 remaining) [2025-01-09 21:04:59,089 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (2 of 18 remaining) [2025-01-09 21:04:59,089 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (1 of 18 remaining) [2025-01-09 21:04:59,089 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (0 of 18 remaining) [2025-01-09 21:04:59,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 21:04:59,089 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1] [2025-01-09 21:04:59,089 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:04:59,089 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-01-09 21:04:59,127 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:04:59,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 328 places, 348 transitions, 724 flow [2025-01-09 21:04:59,174 INFO L124 PetriNetUnfolderBase]: 29/382 cut-off events. [2025-01-09 21:04:59,174 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-01-09 21:04:59,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 401 conditions, 382 events. 29/382 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1403 event pairs, 0 based on Foata normal form. 0/331 useless extension candidates. Maximal degree in co-relation 307. Up to 5 conditions per place. [2025-01-09 21:04:59,178 INFO L82 GeneralOperation]: Start removeDead. Operand has 328 places, 348 transitions, 724 flow [2025-01-09 21:04:59,181 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 328 places, 348 transitions, 724 flow [2025-01-09 21:04:59,181 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:04:59,182 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;@7fef0089, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:04:59,182 INFO L334 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2025-01-09 21:04:59,185 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:04:59,185 INFO L124 PetriNetUnfolderBase]: 0/52 cut-off events. [2025-01-09 21:04:59,185 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:04:59,185 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:04:59,185 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:04:59,185 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-01-09 21:04:59,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:04:59,185 INFO L85 PathProgramCache]: Analyzing trace with hash 1401053075, now seen corresponding path program 1 times [2025-01-09 21:04:59,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:04:59,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404114031] [2025-01-09 21:04:59,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:04:59,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:04:59,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-09 21:04:59,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-09 21:04:59,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:04:59,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:04:59,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:04:59,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:04:59,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404114031] [2025-01-09 21:04:59,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404114031] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:04:59,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:04:59,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:04:59,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885772930] [2025-01-09 21:04:59,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:04:59,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:04:59,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:04:59,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:04:59,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:04:59,458 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 282 out of 348 [2025-01-09 21:04:59,460 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 328 places, 348 transitions, 724 flow. Second operand has 6 states, 6 states have (on average 283.5) internal successors, (1701), 6 states have internal predecessors, (1701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:04:59,460 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:04:59,460 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 282 of 348 [2025-01-09 21:04:59,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:05:07,069 INFO L124 PetriNetUnfolderBase]: 27422/77788 cut-off events. [2025-01-09 21:05:07,069 INFO L125 PetriNetUnfolderBase]: For 9100/9100 co-relation queries the response was YES. [2025-01-09 21:05:07,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113885 conditions, 77788 events. 27422/77788 cut-off events. For 9100/9100 co-relation queries the response was YES. Maximal size of possible extension queue 2935. Compared 1071633 event pairs, 18864 based on Foata normal form. 13732/77272 useless extension candidates. Maximal degree in co-relation 10978. Up to 32089 conditions per place. [2025-01-09 21:05:08,189 INFO L140 encePairwiseOnDemand]: 329/348 looper letters, 42 selfloop transitions, 5 changer transitions 0/323 dead transitions. [2025-01-09 21:05:08,189 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 323 transitions, 768 flow [2025-01-09 21:05:08,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:05:08,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:05:08,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1753 transitions. [2025-01-09 21:05:08,191 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8395593869731801 [2025-01-09 21:05:08,191 INFO L175 Difference]: Start difference. First operand has 328 places, 348 transitions, 724 flow. Second operand 6 states and 1753 transitions. [2025-01-09 21:05:08,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 320 places, 323 transitions, 768 flow [2025-01-09 21:05:08,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 320 places, 323 transitions, 762 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-01-09 21:05:08,199 INFO L231 Difference]: Finished difference. Result has 320 places, 323 transitions, 678 flow [2025-01-09 21:05:08,200 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=668, PETRI_DIFFERENCE_MINUEND_PLACES=315, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=323, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=318, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=678, PETRI_PLACES=320, PETRI_TRANSITIONS=323} [2025-01-09 21:05:08,201 INFO L279 CegarLoopForPetriNet]: 328 programPoint places, -8 predicate places. [2025-01-09 21:05:08,201 INFO L471 AbstractCegarLoop]: Abstraction has has 320 places, 323 transitions, 678 flow [2025-01-09 21:05:08,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 283.5) internal successors, (1701), 6 states have internal predecessors, (1701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:05:08,202 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:05:08,202 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:05:08,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 21:05:08,202 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-01-09 21:05:08,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:05:08,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1221845796, now seen corresponding path program 1 times [2025-01-09 21:05:08,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:05:08,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797286982] [2025-01-09 21:05:08,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:05:08,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:05:08,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-01-09 21:05:08,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-09 21:05:08,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:05:08,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:05:08,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:05:08,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:05:08,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797286982] [2025-01-09 21:05:08,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797286982] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:05:08,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:05:08,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:05:08,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328205752] [2025-01-09 21:05:08,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:05:08,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:05:08,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:05:08,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:05:08,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:05:08,271 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 305 out of 348 [2025-01-09 21:05:08,272 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 323 transitions, 678 flow. Second operand has 3 states, 3 states have (on average 307.0) internal successors, (921), 3 states have internal predecessors, (921), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:05:08,272 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:05:08,272 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 305 of 348 [2025-01-09 21:05:08,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:05:09,791 INFO L124 PetriNetUnfolderBase]: 2345/13445 cut-off events. [2025-01-09 21:05:09,791 INFO L125 PetriNetUnfolderBase]: For 1218/1218 co-relation queries the response was YES. [2025-01-09 21:05:09,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16435 conditions, 13445 events. 2345/13445 cut-off events. For 1218/1218 co-relation queries the response was YES. Maximal size of possible extension queue 355. Compared 161445 event pairs, 1720 based on Foata normal form. 1/11848 useless extension candidates. Maximal degree in co-relation 16370. Up to 2506 conditions per place. [2025-01-09 21:05:09,948 INFO L140 encePairwiseOnDemand]: 345/348 looper letters, 24 selfloop transitions, 2 changer transitions 0/324 dead transitions. [2025-01-09 21:05:09,948 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 322 places, 324 transitions, 734 flow [2025-01-09 21:05:09,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:05:09,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:05:09,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 942 transitions. [2025-01-09 21:05:09,950 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9022988505747126 [2025-01-09 21:05:09,950 INFO L175 Difference]: Start difference. First operand has 320 places, 323 transitions, 678 flow. Second operand 3 states and 942 transitions. [2025-01-09 21:05:09,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 322 places, 324 transitions, 734 flow [2025-01-09 21:05:09,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 317 places, 324 transitions, 722 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:05:09,956 INFO L231 Difference]: Finished difference. Result has 318 places, 324 transitions, 680 flow [2025-01-09 21:05:09,956 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=668, PETRI_DIFFERENCE_MINUEND_PLACES=315, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=323, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=321, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=680, PETRI_PLACES=318, PETRI_TRANSITIONS=324} [2025-01-09 21:05:09,957 INFO L279 CegarLoopForPetriNet]: 328 programPoint places, -10 predicate places. [2025-01-09 21:05:09,957 INFO L471 AbstractCegarLoop]: Abstraction has has 318 places, 324 transitions, 680 flow [2025-01-09 21:05:09,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 307.0) internal successors, (921), 3 states have internal predecessors, (921), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:05:09,957 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:05:09,957 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:05:09,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 21:05:09,958 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-01-09 21:05:09,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:05:09,958 INFO L85 PathProgramCache]: Analyzing trace with hash -51015936, now seen corresponding path program 1 times [2025-01-09 21:05:09,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:05:09,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531293349] [2025-01-09 21:05:09,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:05:09,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:05:09,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 21:05:09,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 21:05:09,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:05:09,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:05:10,019 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:05:10,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:05:10,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531293349] [2025-01-09 21:05:10,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531293349] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:05:10,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2142967405] [2025-01-09 21:05:10,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:05:10,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:05:10,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:05:10,022 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 21:05:10,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-09 21:05:10,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 21:05:10,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 21:05:10,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:05:10,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:05:10,108 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 21:05:10,109 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:05:10,122 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 21:05:10,123 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 21:05:10,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2142967405] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:05:10,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 21:05:10,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-01-09 21:05:10,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671717799] [2025-01-09 21:05:10,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:05:10,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:05:10,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:05:10,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:05:10,124 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:05:10,150 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 304 out of 348 [2025-01-09 21:05:10,151 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 324 transitions, 680 flow. Second operand has 3 states, 3 states have (on average 306.3333333333333) internal successors, (919), 3 states have internal predecessors, (919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:05:10,151 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:05:10,151 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 304 of 348 [2025-01-09 21:05:10,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:05:13,363 INFO L124 PetriNetUnfolderBase]: 5494/24147 cut-off events. [2025-01-09 21:05:13,363 INFO L125 PetriNetUnfolderBase]: For 1898/1898 co-relation queries the response was YES. [2025-01-09 21:05:13,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31651 conditions, 24147 events. 5494/24147 cut-off events. For 1898/1898 co-relation queries the response was YES. Maximal size of possible extension queue 628. Compared 308874 event pairs, 3970 based on Foata normal form. 156/21149 useless extension candidates. Maximal degree in co-relation 31603. Up to 5843 conditions per place. [2025-01-09 21:05:13,832 INFO L140 encePairwiseOnDemand]: 345/348 looper letters, 41 selfloop transitions, 2 changer transitions 0/340 dead transitions. [2025-01-09 21:05:13,833 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 340 transitions, 813 flow [2025-01-09 21:05:13,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:05:13,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:05:13,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 956 transitions. [2025-01-09 21:05:13,834 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9157088122605364 [2025-01-09 21:05:13,834 INFO L175 Difference]: Start difference. First operand has 318 places, 324 transitions, 680 flow. Second operand 3 states and 956 transitions. [2025-01-09 21:05:13,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 320 places, 340 transitions, 813 flow [2025-01-09 21:05:13,842 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 319 places, 340 transitions, 811 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:05:13,845 INFO L231 Difference]: Finished difference. Result has 320 places, 325 transitions, 690 flow [2025-01-09 21:05:13,845 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=678, PETRI_DIFFERENCE_MINUEND_PLACES=317, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=324, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=322, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=690, PETRI_PLACES=320, PETRI_TRANSITIONS=325} [2025-01-09 21:05:13,846 INFO L279 CegarLoopForPetriNet]: 328 programPoint places, -8 predicate places. [2025-01-09 21:05:13,846 INFO L471 AbstractCegarLoop]: Abstraction has has 320 places, 325 transitions, 690 flow [2025-01-09 21:05:13,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 306.3333333333333) internal successors, (919), 3 states have internal predecessors, (919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:05:13,846 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:05:13,846 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:05:13,855 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-09 21:05:14,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:05:14,047 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-01-09 21:05:14,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:05:14,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1252248632, now seen corresponding path program 1 times [2025-01-09 21:05:14,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:05:14,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460887143] [2025-01-09 21:05:14,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:05:14,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:05:14,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 21:05:14,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 21:05:14,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:05:14,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:05:14,096 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 21:05:14,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:05:14,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460887143] [2025-01-09 21:05:14,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460887143] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:05:14,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [140189605] [2025-01-09 21:05:14,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:05:14,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:05:14,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:05:14,105 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 21:05:14,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-09 21:05:14,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 21:05:14,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 21:05:14,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:05:14,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:05:14,198 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 21:05:14,199 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:05:14,223 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 21:05:14,223 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:05:14,253 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 21:05:14,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [140189605] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 21:05:14,254 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 21:05:14,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-01-09 21:05:14,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935852451] [2025-01-09 21:05:14,254 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 21:05:14,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 21:05:14,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:05:14,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 21:05:14,255 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-09 21:05:14,305 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 348 [2025-01-09 21:05:14,309 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 325 transitions, 690 flow. Second operand has 10 states, 10 states have (on average 304.2) internal successors, (3042), 10 states have internal predecessors, (3042), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:05:14,309 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:05:14,309 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 348 [2025-01-09 21:05:14,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:05:16,429 INFO L124 PetriNetUnfolderBase]: 2346/13479 cut-off events. [2025-01-09 21:05:16,430 INFO L125 PetriNetUnfolderBase]: For 1217/1217 co-relation queries the response was YES. [2025-01-09 21:05:16,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16482 conditions, 13479 events. 2346/13479 cut-off events. For 1217/1217 co-relation queries the response was YES. Maximal size of possible extension queue 333. Compared 162110 event pairs, 1720 based on Foata normal form. 2/11876 useless extension candidates. Maximal degree in co-relation 16386. Up to 2506 conditions per place. [2025-01-09 21:05:16,653 INFO L140 encePairwiseOnDemand]: 342/348 looper letters, 28 selfloop transitions, 9 changer transitions 0/333 dead transitions. [2025-01-09 21:05:16,653 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 328 places, 333 transitions, 782 flow [2025-01-09 21:05:16,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 21:05:16,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-09 21:05:16,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2757 transitions. [2025-01-09 21:05:16,655 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8802681992337165 [2025-01-09 21:05:16,655 INFO L175 Difference]: Start difference. First operand has 320 places, 325 transitions, 690 flow. Second operand 9 states and 2757 transitions. [2025-01-09 21:05:16,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 328 places, 333 transitions, 782 flow [2025-01-09 21:05:16,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 327 places, 333 transitions, 780 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:05:16,662 INFO L231 Difference]: Finished difference. Result has 330 places, 331 transitions, 738 flow [2025-01-09 21:05:16,662 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=688, PETRI_DIFFERENCE_MINUEND_PLACES=319, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=325, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=319, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=738, PETRI_PLACES=330, PETRI_TRANSITIONS=331} [2025-01-09 21:05:16,663 INFO L279 CegarLoopForPetriNet]: 328 programPoint places, 2 predicate places. [2025-01-09 21:05:16,663 INFO L471 AbstractCegarLoop]: Abstraction has has 330 places, 331 transitions, 738 flow [2025-01-09 21:05:16,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 304.2) internal successors, (3042), 10 states have internal predecessors, (3042), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:05:16,664 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:05:16,664 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:05:16,670 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-01-09 21:05:16,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:05:16,865 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-01-09 21:05:16,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:05:16,865 INFO L85 PathProgramCache]: Analyzing trace with hash 924039496, now seen corresponding path program 2 times [2025-01-09 21:05:16,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:05:16,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104047990] [2025-01-09 21:05:16,866 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 21:05:16,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:05:16,874 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 95 statements into 2 equivalence classes. [2025-01-09 21:05:16,878 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 95 of 95 statements. [2025-01-09 21:05:16,879 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 21:05:16,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:05:16,948 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 21:05:16,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:05:16,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104047990] [2025-01-09 21:05:16,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104047990] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:05:16,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1819295837] [2025-01-09 21:05:16,949 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 21:05:16,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:05:16,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:05:16,954 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 21:05:16,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-09 21:05:17,029 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 95 statements into 2 equivalence classes. [2025-01-09 21:05:17,049 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 95 of 95 statements. [2025-01-09 21:05:17,049 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 21:05:17,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:05:17,050 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 21:05:17,051 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:05:17,098 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 21:05:17,099 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:05:17,182 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 21:05:17,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1819295837] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 21:05:17,183 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 21:05:17,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2025-01-09 21:05:17,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676892906] [2025-01-09 21:05:17,183 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 21:05:17,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 21:05:17,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:05:17,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 21:05:17,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-01-09 21:05:17,262 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 348 [2025-01-09 21:05:17,265 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 330 places, 331 transitions, 738 flow. Second operand has 15 states, 15 states have (on average 304.26666666666665) internal successors, (4564), 15 states have internal predecessors, (4564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:05:17,265 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:05:17,265 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 348 [2025-01-09 21:05:17,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:05:19,038 INFO L124 PetriNetUnfolderBase]: 2346/13518 cut-off events. [2025-01-09 21:05:19,039 INFO L125 PetriNetUnfolderBase]: For 1239/1239 co-relation queries the response was YES. [2025-01-09 21:05:19,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16575 conditions, 13518 events. 2346/13518 cut-off events. For 1239/1239 co-relation queries the response was YES. Maximal size of possible extension queue 333. Compared 162108 event pairs, 1720 based on Foata normal form. 3/11916 useless extension candidates. Maximal degree in co-relation 16390. Up to 2506 conditions per place. [2025-01-09 21:05:19,224 INFO L140 encePairwiseOnDemand]: 342/348 looper letters, 31 selfloop transitions, 18 changer transitions 0/345 dead transitions. [2025-01-09 21:05:19,224 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 347 places, 345 transitions, 910 flow [2025-01-09 21:05:19,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 21:05:19,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-01-09 21:05:19,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 5488 transitions. [2025-01-09 21:05:19,228 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.876117496807152 [2025-01-09 21:05:19,228 INFO L175 Difference]: Start difference. First operand has 330 places, 331 transitions, 738 flow. Second operand 18 states and 5488 transitions. [2025-01-09 21:05:19,228 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 347 places, 345 transitions, 910 flow [2025-01-09 21:05:19,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 346 places, 345 transitions, 898 flow, removed 5 selfloop flow, removed 1 redundant places. [2025-01-09 21:05:19,235 INFO L231 Difference]: Finished difference. Result has 350 places, 341 transitions, 838 flow [2025-01-09 21:05:19,235 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=732, PETRI_DIFFERENCE_MINUEND_PLACES=329, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=331, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=320, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=838, PETRI_PLACES=350, PETRI_TRANSITIONS=341} [2025-01-09 21:05:19,235 INFO L279 CegarLoopForPetriNet]: 328 programPoint places, 22 predicate places. [2025-01-09 21:05:19,235 INFO L471 AbstractCegarLoop]: Abstraction has has 350 places, 341 transitions, 838 flow [2025-01-09 21:05:19,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 304.26666666666665) internal successors, (4564), 15 states have internal predecessors, (4564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:05:19,237 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:05:19,237 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:05:19,243 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-01-09 21:05:19,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:05:19,438 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-01-09 21:05:19,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:05:19,438 INFO L85 PathProgramCache]: Analyzing trace with hash -132602972, now seen corresponding path program 3 times [2025-01-09 21:05:19,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:05:19,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415365326] [2025-01-09 21:05:19,438 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 21:05:19,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:05:19,452 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 134 statements into 8 equivalence classes. [2025-01-09 21:05:19,473 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 134 of 134 statements. [2025-01-09 21:05:19,473 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-01-09 21:05:19,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:05:19,473 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:05:19,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-01-09 21:05:19,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-01-09 21:05:19,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:05:19,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:05:19,498 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:05:19,500 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:05:19,500 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (21 of 22 remaining) [2025-01-09 21:05:19,500 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (20 of 22 remaining) [2025-01-09 21:05:19,500 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (19 of 22 remaining) [2025-01-09 21:05:19,500 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (18 of 22 remaining) [2025-01-09 21:05:19,500 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (17 of 22 remaining) [2025-01-09 21:05:19,500 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (16 of 22 remaining) [2025-01-09 21:05:19,500 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (15 of 22 remaining) [2025-01-09 21:05:19,500 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (14 of 22 remaining) [2025-01-09 21:05:19,500 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (13 of 22 remaining) [2025-01-09 21:05:19,500 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (12 of 22 remaining) [2025-01-09 21:05:19,500 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (11 of 22 remaining) [2025-01-09 21:05:19,500 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (10 of 22 remaining) [2025-01-09 21:05:19,500 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (9 of 22 remaining) [2025-01-09 21:05:19,500 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (8 of 22 remaining) [2025-01-09 21:05:19,500 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (7 of 22 remaining) [2025-01-09 21:05:19,500 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (6 of 22 remaining) [2025-01-09 21:05:19,500 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (5 of 22 remaining) [2025-01-09 21:05:19,500 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (4 of 22 remaining) [2025-01-09 21:05:19,500 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (3 of 22 remaining) [2025-01-09 21:05:19,500 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (2 of 22 remaining) [2025-01-09 21:05:19,500 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (1 of 22 remaining) [2025-01-09 21:05:19,500 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (0 of 22 remaining) [2025-01-09 21:05:19,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 21:05:19,500 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1] [2025-01-09 21:05:19,501 WARN L246 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:05:19,501 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2025-01-09 21:05:19,541 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:05:19,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 397 places, 422 transitions, 884 flow [2025-01-09 21:05:19,581 INFO L124 PetriNetUnfolderBase]: 36/465 cut-off events. [2025-01-09 21:05:19,581 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-01-09 21:05:19,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 491 conditions, 465 events. 36/465 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1911 event pairs, 0 based on Foata normal form. 0/402 useless extension candidates. Maximal degree in co-relation 395. Up to 6 conditions per place. [2025-01-09 21:05:19,589 INFO L82 GeneralOperation]: Start removeDead. Operand has 397 places, 422 transitions, 884 flow [2025-01-09 21:05:19,591 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 397 places, 422 transitions, 884 flow [2025-01-09 21:05:19,592 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:05:19,592 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;@7fef0089, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:05:19,593 INFO L334 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2025-01-09 21:05:19,594 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:05:19,594 INFO L124 PetriNetUnfolderBase]: 0/52 cut-off events. [2025-01-09 21:05:19,594 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:05:19,594 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:05:19,595 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:05:19,595 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-01-09 21:05:19,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:05:19,595 INFO L85 PathProgramCache]: Analyzing trace with hash -943163271, now seen corresponding path program 1 times [2025-01-09 21:05:19,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:05:19,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676585530] [2025-01-09 21:05:19,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:05:19,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:05:19,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-09 21:05:19,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-09 21:05:19,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:05:19,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:05:19,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:05:19,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:05:19,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676585530] [2025-01-09 21:05:19,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676585530] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:05:19,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:05:19,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:05:19,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276640759] [2025-01-09 21:05:19,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:05:19,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:05:19,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:05:19,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:05:19,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:05:19,905 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 343 out of 422 [2025-01-09 21:05:19,906 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 397 places, 422 transitions, 884 flow. Second operand has 6 states, 6 states have (on average 344.5) internal successors, (2067), 6 states have internal predecessors, (2067), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:05:19,906 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:05:19,906 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 343 of 422 [2025-01-09 21:05:19,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand