./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/05-lval_ls_09-idxsense_rc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/05-lval_ls_09-idxsense_rc.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0e635f0fe47aceede1c472bdc8d824736c973da1578eefbb4d4eeab774d2111f --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:22:27,051 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:22:27,105 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-01-09 21:22:27,109 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:22:27,109 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:22:27,124 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:22:27,125 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:22:27,125 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:22:27,125 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:22:27,125 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:22:27,126 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:22:27,126 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:22:27,126 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:22:27,126 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:22:27,126 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:22:27,126 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:22:27,126 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:22:27,127 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:22:27,127 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:22:27,127 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:22:27,127 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:22:27,127 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:22:27,127 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:22:27,127 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:22:27,127 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:22:27,127 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:22:27,128 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:22:27,128 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:22:27,128 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:22:27,128 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:22:27,128 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:22:27,128 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:22:27,128 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:22:27,128 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:22:27,128 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:22:27,128 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:22:27,128 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:22:27,128 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:22:27,128 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:22:27,128 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:22:27,128 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:22:27,129 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:22:27,129 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:22:27,129 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:22:27,129 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:22:27,129 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:22:27,129 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 -> 0e635f0fe47aceede1c472bdc8d824736c973da1578eefbb4d4eeab774d2111f [2025-01-09 21:22:27,321 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:22:27,332 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:22:27,337 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:22:27,338 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:22:27,338 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:22:27,339 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/05-lval_ls_09-idxsense_rc.i [2025-01-09 21:22:28,476 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b970e3eeb/811aeef16b4540c69225434f77594b04/FLAG4822fb3b8 [2025-01-09 21:22:28,876 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:22:28,876 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/05-lval_ls_09-idxsense_rc.i [2025-01-09 21:22:28,906 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b970e3eeb/811aeef16b4540c69225434f77594b04/FLAG4822fb3b8 [2025-01-09 21:22:28,934 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b970e3eeb/811aeef16b4540c69225434f77594b04 [2025-01-09 21:22:28,936 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:22:28,937 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:22:28,938 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:22:28,938 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:22:28,941 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:22:28,942 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:22:28" (1/1) ... [2025-01-09 21:22:28,943 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18fe87e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:28, skipping insertion in model container [2025-01-09 21:22:28,943 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:22:28" (1/1) ... [2025-01-09 21:22:28,967 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:22:29,121 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:22:29,150 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:22:29,201 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:22:29,224 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:22:29,225 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:29 WrapperNode [2025-01-09 21:22:29,225 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:22:29,226 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:22:29,226 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:22:29,226 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:22:29,229 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:29" (1/1) ... [2025-01-09 21:22:29,237 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:29" (1/1) ... [2025-01-09 21:22:29,249 INFO L138 Inliner]: procedures = 162, calls = 73, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 107 [2025-01-09 21:22:29,249 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:22:29,249 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:22:29,250 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:22:29,250 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:22:29,254 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:29" (1/1) ... [2025-01-09 21:22:29,254 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:29" (1/1) ... [2025-01-09 21:22:29,256 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:29" (1/1) ... [2025-01-09 21:22:29,257 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:29" (1/1) ... [2025-01-09 21:22:29,262 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:29" (1/1) ... [2025-01-09 21:22:29,263 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:29" (1/1) ... [2025-01-09 21:22:29,265 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:29" (1/1) ... [2025-01-09 21:22:29,265 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:29" (1/1) ... [2025-01-09 21:22:29,266 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:29" (1/1) ... [2025-01-09 21:22:29,267 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:22:29,268 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:22:29,268 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:22:29,268 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:22:29,268 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:29" (1/1) ... [2025-01-09 21:22:29,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:22:29,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:22:29,292 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 21:22:29,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 21:22:29,311 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 21:22:29,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 21:22:29,311 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-09 21:22:29,311 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:22:29,312 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-01-09 21:22:29,312 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-01-09 21:22:29,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:22:29,312 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-09 21:22:29,312 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:22:29,312 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:22:29,313 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 21:22:29,387 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:22:29,388 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:22:29,541 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:22:29,541 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:22:29,555 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:22:29,555 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 21:22:29,555 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:22:29 BoogieIcfgContainer [2025-01-09 21:22:29,556 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:22:29,557 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:22:29,557 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:22:29,560 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:22:29,560 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:22:28" (1/3) ... [2025-01-09 21:22:29,560 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5481ac60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:22:29, skipping insertion in model container [2025-01-09 21:22:29,561 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:29" (2/3) ... [2025-01-09 21:22:29,561 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5481ac60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:22:29, skipping insertion in model container [2025-01-09 21:22:29,561 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:22:29" (3/3) ... [2025-01-09 21:22:29,561 INFO L128 eAbstractionObserver]: Analyzing ICFG 05-lval_ls_09-idxsense_rc.i [2025-01-09 21:22:29,571 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:22:29,572 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 05-lval_ls_09-idxsense_rc.i that has 2 procedures, 137 locations, 1 initial locations, 1 loop locations, and 4 error locations. [2025-01-09 21:22:29,572 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:22:29,617 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:22:29,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 137 transitions, 278 flow [2025-01-09 21:22:29,680 INFO L124 PetriNetUnfolderBase]: 1/136 cut-off events. [2025-01-09 21:22:29,682 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:22:29,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 136 events. 1/136 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 70 event pairs, 0 based on Foata normal form. 0/131 useless extension candidates. Maximal degree in co-relation 80. Up to 2 conditions per place. [2025-01-09 21:22:29,685 INFO L82 GeneralOperation]: Start removeDead. Operand has 140 places, 137 transitions, 278 flow [2025-01-09 21:22:29,687 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 139 places, 136 transitions, 275 flow [2025-01-09 21:22:29,693 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:22:29,700 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;@59c1c41c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:22:29,700 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-01-09 21:22:29,715 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:22:29,715 INFO L124 PetriNetUnfolderBase]: 1/97 cut-off events. [2025-01-09 21:22:29,715 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:22:29,716 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:22:29,716 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:22:29,717 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 21:22:29,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:22:29,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1040197650, now seen corresponding path program 1 times [2025-01-09 21:22:29,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:22:29,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66122311] [2025-01-09 21:22:29,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:22:29,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:22:29,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-01-09 21:22:29,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-01-09 21:22:29,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:22:29,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:22:29,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:22:30,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:22:30,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66122311] [2025-01-09 21:22:30,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66122311] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:22:30,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:22:30,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:22:30,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167129464] [2025-01-09 21:22:30,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:22:30,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:22:30,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:22:30,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:22:30,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:22:30,040 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 137 [2025-01-09 21:22:30,043 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 136 transitions, 275 flow. Second operand has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:22:30,043 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:22:30,043 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 137 [2025-01-09 21:22:30,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:22:30,088 INFO L124 PetriNetUnfolderBase]: 7/221 cut-off events. [2025-01-09 21:22:30,088 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 21:22:30,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 250 conditions, 221 events. 7/221 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 323 event pairs, 6 based on Foata normal form. 1/209 useless extension candidates. Maximal degree in co-relation 153. Up to 24 conditions per place. [2025-01-09 21:22:30,090 INFO L140 encePairwiseOnDemand]: 134/137 looper letters, 10 selfloop transitions, 2 changer transitions 0/137 dead transitions. [2025-01-09 21:22:30,090 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 137 transitions, 301 flow [2025-01-09 21:22:30,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:22:30,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:22:30,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 391 transitions. [2025-01-09 21:22:30,099 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9513381995133819 [2025-01-09 21:22:30,100 INFO L175 Difference]: Start difference. First operand has 139 places, 136 transitions, 275 flow. Second operand 3 states and 391 transitions. [2025-01-09 21:22:30,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 137 transitions, 301 flow [2025-01-09 21:22:30,103 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 137 transitions, 300 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:22:30,106 INFO L231 Difference]: Finished difference. Result has 141 places, 137 transitions, 286 flow [2025-01-09 21:22:30,109 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=286, PETRI_PLACES=141, PETRI_TRANSITIONS=137} [2025-01-09 21:22:30,111 INFO L279 CegarLoopForPetriNet]: 139 programPoint places, 2 predicate places. [2025-01-09 21:22:30,112 INFO L471 AbstractCegarLoop]: Abstraction has has 141 places, 137 transitions, 286 flow [2025-01-09 21:22:30,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:22:30,113 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:22:30,113 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:22:30,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:22:30,113 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 21:22:30,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:22:30,115 INFO L85 PathProgramCache]: Analyzing trace with hash -824966364, now seen corresponding path program 1 times [2025-01-09 21:22:30,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:22:30,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092119526] [2025-01-09 21:22:30,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:22:30,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:22:30,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 21:22:30,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 21:22:30,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:22:30,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:22:30,275 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:22:30,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:22:30,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092119526] [2025-01-09 21:22:30,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092119526] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:22:30,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1523420827] [2025-01-09 21:22:30,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:22:30,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:22:30,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:22:30,281 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 21:22:30,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 21:22:30,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 21:22:30,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 21:22:30,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:22:30,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:22:30,385 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 21:22:30,388 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:22:30,426 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:22:30,426 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:22:30,456 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:22:30,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1523420827] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 21:22:30,456 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 21:22:30,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-01-09 21:22:30,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272904964] [2025-01-09 21:22:30,457 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 21:22:30,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 21:22:30,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:22:30,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 21:22:30,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-09 21:22:30,479 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 137 [2025-01-09 21:22:30,480 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 137 transitions, 286 flow. Second operand has 10 states, 10 states have (on average 125.0) internal successors, (1250), 10 states have internal predecessors, (1250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:22:30,480 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:22:30,480 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 137 [2025-01-09 21:22:30,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:22:30,562 INFO L124 PetriNetUnfolderBase]: 7/228 cut-off events. [2025-01-09 21:22:30,562 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 21:22:30,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 275 conditions, 228 events. 7/228 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 317 event pairs, 6 based on Foata normal form. 2/217 useless extension candidates. Maximal degree in co-relation 190. Up to 24 conditions per place. [2025-01-09 21:22:30,563 INFO L140 encePairwiseOnDemand]: 131/137 looper letters, 14 selfloop transitions, 9 changer transitions 0/145 dead transitions. [2025-01-09 21:22:30,564 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 145 transitions, 350 flow [2025-01-09 21:22:30,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 21:22:30,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-09 21:22:30,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1132 transitions. [2025-01-09 21:22:30,567 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9180859691808597 [2025-01-09 21:22:30,567 INFO L175 Difference]: Start difference. First operand has 141 places, 137 transitions, 286 flow. Second operand 9 states and 1132 transitions. [2025-01-09 21:22:30,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 145 transitions, 350 flow [2025-01-09 21:22:30,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 145 transitions, 348 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:22:30,569 INFO L231 Difference]: Finished difference. Result has 151 places, 143 transitions, 334 flow [2025-01-09 21:22:30,569 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=334, PETRI_PLACES=151, PETRI_TRANSITIONS=143} [2025-01-09 21:22:30,570 INFO L279 CegarLoopForPetriNet]: 139 programPoint places, 12 predicate places. [2025-01-09 21:22:30,570 INFO L471 AbstractCegarLoop]: Abstraction has has 151 places, 143 transitions, 334 flow [2025-01-09 21:22:30,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 125.0) internal successors, (1250), 10 states have internal predecessors, (1250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:22:30,571 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:22:30,571 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:22:30,578 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 21:22:30,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:22:30,772 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 21:22:30,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:22:30,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1610944540, now seen corresponding path program 2 times [2025-01-09 21:22:30,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:22:30,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457347700] [2025-01-09 21:22:30,774 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 21:22:30,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:22:30,785 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 100 statements into 2 equivalence classes. [2025-01-09 21:22:30,792 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 85 of 100 statements. [2025-01-09 21:22:30,792 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 21:22:30,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:22:31,221 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-09 21:22:31,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:22:31,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457347700] [2025-01-09 21:22:31,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457347700] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:22:31,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:22:31,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:22:31,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525982084] [2025-01-09 21:22:31,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:22:31,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:22:31,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:22:31,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:22:31,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:22:31,376 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 137 [2025-01-09 21:22:31,377 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 143 transitions, 334 flow. Second operand has 6 states, 6 states have (on average 110.33333333333333) internal successors, (662), 6 states have internal predecessors, (662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:22:31,377 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:22:31,378 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 137 [2025-01-09 21:22:31,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:22:31,619 INFO L124 PetriNetUnfolderBase]: 261/1003 cut-off events. [2025-01-09 21:22:31,619 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-01-09 21:22:31,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1606 conditions, 1003 events. 261/1003 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 5963 event pairs, 67 based on Foata normal form. 0/966 useless extension candidates. Maximal degree in co-relation 1492. Up to 257 conditions per place. [2025-01-09 21:22:31,625 INFO L140 encePairwiseOnDemand]: 115/137 looper letters, 88 selfloop transitions, 42 changer transitions 0/245 dead transitions. [2025-01-09 21:22:31,625 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 245 transitions, 798 flow [2025-01-09 21:22:31,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:22:31,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:22:31,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 786 transitions. [2025-01-09 21:22:31,627 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9562043795620438 [2025-01-09 21:22:31,627 INFO L175 Difference]: Start difference. First operand has 151 places, 143 transitions, 334 flow. Second operand 6 states and 786 transitions. [2025-01-09 21:22:31,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 245 transitions, 798 flow [2025-01-09 21:22:31,629 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 245 transitions, 792 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-01-09 21:22:31,631 INFO L231 Difference]: Finished difference. Result has 160 places, 189 transitions, 644 flow [2025-01-09 21:22:31,632 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=328, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=644, PETRI_PLACES=160, PETRI_TRANSITIONS=189} [2025-01-09 21:22:31,632 INFO L279 CegarLoopForPetriNet]: 139 programPoint places, 21 predicate places. [2025-01-09 21:22:31,632 INFO L471 AbstractCegarLoop]: Abstraction has has 160 places, 189 transitions, 644 flow [2025-01-09 21:22:31,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 110.33333333333333) internal successors, (662), 6 states have internal predecessors, (662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:22:31,633 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:22:31,633 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:22:31,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:22:31,633 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 21:22:31,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:22:31,634 INFO L85 PathProgramCache]: Analyzing trace with hash 136768233, now seen corresponding path program 1 times [2025-01-09 21:22:31,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:22:31,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048468394] [2025-01-09 21:22:31,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:22:31,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:22:31,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-09 21:22:31,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-09 21:22:31,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:22:31,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:22:31,796 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:22:31,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:22:31,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048468394] [2025-01-09 21:22:31,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048468394] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:22:31,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [200133278] [2025-01-09 21:22:31,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:22:31,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:22:31,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:22:31,803 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 21:22:31,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 21:22:31,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-09 21:22:31,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-09 21:22:31,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:22:31,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:22:31,882 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 21:22:31,884 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:22:31,923 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:22:31,923 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:22:32,024 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:22:32,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [200133278] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 21:22:32,027 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 21:22:32,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-01-09 21:22:32,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008109321] [2025-01-09 21:22:32,027 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 21:22:32,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-09 21:22:32,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:22:32,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-09 21:22:32,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-01-09 21:22:32,066 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 137 [2025-01-09 21:22:32,069 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 189 transitions, 644 flow. Second operand has 18 states, 18 states have (on average 125.0) internal successors, (2250), 18 states have internal predecessors, (2250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:22:32,069 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:22:32,069 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 137 [2025-01-09 21:22:32,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:22:32,346 INFO L124 PetriNetUnfolderBase]: 123/770 cut-off events. [2025-01-09 21:22:32,346 INFO L125 PetriNetUnfolderBase]: For 129/144 co-relation queries the response was YES. [2025-01-09 21:22:32,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1440 conditions, 770 events. 123/770 cut-off events. For 129/144 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 4489 event pairs, 41 based on Foata normal form. 4/757 useless extension candidates. Maximal degree in co-relation 1250. Up to 126 conditions per place. [2025-01-09 21:22:32,352 INFO L140 encePairwiseOnDemand]: 131/137 looper letters, 18 selfloop transitions, 21 changer transitions 0/207 dead transitions. [2025-01-09 21:22:32,352 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 207 transitions, 810 flow [2025-01-09 21:22:32,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-01-09 21:22:32,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-01-09 21:22:32,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 2626 transitions. [2025-01-09 21:22:32,359 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9127563434132777 [2025-01-09 21:22:32,359 INFO L175 Difference]: Start difference. First operand has 160 places, 189 transitions, 644 flow. Second operand 21 states and 2626 transitions. [2025-01-09 21:22:32,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 207 transitions, 810 flow [2025-01-09 21:22:32,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 207 transitions, 810 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:22:32,368 INFO L231 Difference]: Finished difference. Result has 185 places, 202 transitions, 774 flow [2025-01-09 21:22:32,370 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=644, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=774, PETRI_PLACES=185, PETRI_TRANSITIONS=202} [2025-01-09 21:22:32,370 INFO L279 CegarLoopForPetriNet]: 139 programPoint places, 46 predicate places. [2025-01-09 21:22:32,370 INFO L471 AbstractCegarLoop]: Abstraction has has 185 places, 202 transitions, 774 flow [2025-01-09 21:22:32,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 125.0) internal successors, (2250), 18 states have internal predecessors, (2250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:22:32,372 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:22:32,372 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:22:32,379 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 21:22:32,577 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:22:32,577 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 21:22:32,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:22:32,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1282176105, now seen corresponding path program 2 times [2025-01-09 21:22:32,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:22:32,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564706434] [2025-01-09 21:22:32,580 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 21:22:32,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:22:32,596 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 128 statements into 2 equivalence classes. [2025-01-09 21:22:32,602 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 93 of 128 statements. [2025-01-09 21:22:32,603 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 21:22:32,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:22:32,906 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-01-09 21:22:32,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:22:32,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564706434] [2025-01-09 21:22:32,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564706434] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:22:32,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:22:32,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:22:32,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527100900] [2025-01-09 21:22:32,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:22:32,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:22:32,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:22:32,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:22:32,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:22:33,046 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 137 [2025-01-09 21:22:33,047 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 202 transitions, 774 flow. Second operand has 6 states, 6 states have (on average 110.33333333333333) internal successors, (662), 6 states have internal predecessors, (662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:22:33,047 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:22:33,047 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 137 [2025-01-09 21:22:33,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:22:33,265 INFO L124 PetriNetUnfolderBase]: 417/1422 cut-off events. [2025-01-09 21:22:33,265 INFO L125 PetriNetUnfolderBase]: For 645/680 co-relation queries the response was YES. [2025-01-09 21:22:33,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3426 conditions, 1422 events. 417/1422 cut-off events. For 645/680 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 9203 event pairs, 108 based on Foata normal form. 21/1426 useless extension candidates. Maximal degree in co-relation 3228. Up to 602 conditions per place. [2025-01-09 21:22:33,271 INFO L140 encePairwiseOnDemand]: 120/137 looper letters, 99 selfloop transitions, 53 changer transitions 6/285 dead transitions. [2025-01-09 21:22:33,271 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 285 transitions, 1442 flow [2025-01-09 21:22:33,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:22:33,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:22:33,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 746 transitions. [2025-01-09 21:22:33,273 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9075425790754258 [2025-01-09 21:22:33,273 INFO L175 Difference]: Start difference. First operand has 185 places, 202 transitions, 774 flow. Second operand 6 states and 746 transitions. [2025-01-09 21:22:33,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 285 transitions, 1442 flow [2025-01-09 21:22:33,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 285 transitions, 1418 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-01-09 21:22:33,280 INFO L231 Difference]: Finished difference. Result has 189 places, 253 transitions, 1256 flow [2025-01-09 21:22:33,280 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=750, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1256, PETRI_PLACES=189, PETRI_TRANSITIONS=253} [2025-01-09 21:22:33,281 INFO L279 CegarLoopForPetriNet]: 139 programPoint places, 50 predicate places. [2025-01-09 21:22:33,281 INFO L471 AbstractCegarLoop]: Abstraction has has 189 places, 253 transitions, 1256 flow [2025-01-09 21:22:33,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 110.33333333333333) internal successors, (662), 6 states have internal predecessors, (662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:22:33,281 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:22:33,282 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:22:33,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:22:33,282 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 21:22:33,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:22:33,283 INFO L85 PathProgramCache]: Analyzing trace with hash 135322309, now seen corresponding path program 1 times [2025-01-09 21:22:33,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:22:33,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341085433] [2025-01-09 21:22:33,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:22:33,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:22:33,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-01-09 21:22:33,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-01-09 21:22:33,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:22:33,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:22:33,544 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:22:33,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:22:33,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341085433] [2025-01-09 21:22:33,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341085433] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:22:33,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [613753525] [2025-01-09 21:22:33,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:22:33,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:22:33,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:22:33,546 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 21:22:33,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 21:22:33,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-01-09 21:22:33,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-01-09 21:22:33,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:22:33,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:22:33,623 INFO L256 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-09 21:22:33,625 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:22:33,700 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:22:33,701 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:22:33,892 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:22:33,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [613753525] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 21:22:33,893 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 21:22:33,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2025-01-09 21:22:33,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843860916] [2025-01-09 21:22:33,893 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 21:22:33,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-01-09 21:22:33,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:22:33,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-01-09 21:22:33,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-01-09 21:22:33,923 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 137 [2025-01-09 21:22:33,925 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 253 transitions, 1256 flow. Second operand has 23 states, 23 states have (on average 125.08695652173913) internal successors, (2877), 23 states have internal predecessors, (2877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:22:33,925 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:22:33,925 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 137 [2025-01-09 21:22:33,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:22:34,288 INFO L124 PetriNetUnfolderBase]: 227/1128 cut-off events. [2025-01-09 21:22:34,289 INFO L125 PetriNetUnfolderBase]: For 978/1007 co-relation queries the response was YES. [2025-01-09 21:22:34,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2849 conditions, 1128 events. 227/1128 cut-off events. For 978/1007 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 7358 event pairs, 39 based on Foata normal form. 7/1121 useless extension candidates. Maximal degree in co-relation 2571. Up to 212 conditions per place. [2025-01-09 21:22:34,293 INFO L140 encePairwiseOnDemand]: 131/137 looper letters, 21 selfloop transitions, 30 changer transitions 0/270 dead transitions. [2025-01-09 21:22:34,294 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 270 transitions, 1480 flow [2025-01-09 21:22:34,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-01-09 21:22:34,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-01-09 21:22:34,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 3744 transitions. [2025-01-09 21:22:34,299 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.910948905109489 [2025-01-09 21:22:34,299 INFO L175 Difference]: Start difference. First operand has 189 places, 253 transitions, 1256 flow. Second operand 30 states and 3744 transitions. [2025-01-09 21:22:34,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 270 transitions, 1480 flow [2025-01-09 21:22:34,304 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 270 transitions, 1472 flow, removed 4 selfloop flow, removed 0 redundant places. [2025-01-09 21:22:34,306 INFO L231 Difference]: Finished difference. Result has 222 places, 263 transitions, 1400 flow [2025-01-09 21:22:34,306 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=1248, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=230, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=1400, PETRI_PLACES=222, PETRI_TRANSITIONS=263} [2025-01-09 21:22:34,307 INFO L279 CegarLoopForPetriNet]: 139 programPoint places, 83 predicate places. [2025-01-09 21:22:34,307 INFO L471 AbstractCegarLoop]: Abstraction has has 222 places, 263 transitions, 1400 flow [2025-01-09 21:22:34,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 125.08695652173913) internal successors, (2877), 23 states have internal predecessors, (2877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:22:34,308 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:22:34,308 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:22:34,314 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:22:34,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:22:34,509 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 21:22:34,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:22:34,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1440960617, now seen corresponding path program 2 times [2025-01-09 21:22:34,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:22:34,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885529386] [2025-01-09 21:22:34,510 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 21:22:34,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:22:34,521 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 144 statements into 2 equivalence classes. [2025-01-09 21:22:34,525 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 94 of 144 statements. [2025-01-09 21:22:34,525 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 21:22:34,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:22:34,811 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-01-09 21:22:34,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:22:34,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885529386] [2025-01-09 21:22:34,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885529386] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:22:34,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:22:34,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:22:34,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801592893] [2025-01-09 21:22:34,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:22:34,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:22:34,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:22:34,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:22:34,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:22:34,942 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 137 [2025-01-09 21:22:34,942 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 263 transitions, 1400 flow. Second operand has 6 states, 6 states have (on average 108.5) internal successors, (651), 6 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:22:34,942 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:22:34,942 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 137 [2025-01-09 21:22:34,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:22:35,267 INFO L124 PetriNetUnfolderBase]: 571/1817 cut-off events. [2025-01-09 21:22:35,267 INFO L125 PetriNetUnfolderBase]: For 2403/2451 co-relation queries the response was YES. [2025-01-09 21:22:35,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5537 conditions, 1817 events. 571/1817 cut-off events. For 2403/2451 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 12259 event pairs, 127 based on Foata normal form. 25/1817 useless extension candidates. Maximal degree in co-relation 5256. Up to 841 conditions per place. [2025-01-09 21:22:35,275 INFO L140 encePairwiseOnDemand]: 120/137 looper letters, 120 selfloop transitions, 58 changer transitions 39/355 dead transitions. [2025-01-09 21:22:35,275 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 355 transitions, 2358 flow [2025-01-09 21:22:35,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:22:35,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:22:35,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 736 transitions. [2025-01-09 21:22:35,277 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8953771289537713 [2025-01-09 21:22:35,277 INFO L175 Difference]: Start difference. First operand has 222 places, 263 transitions, 1400 flow. Second operand 6 states and 736 transitions. [2025-01-09 21:22:35,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 355 transitions, 2358 flow [2025-01-09 21:22:35,284 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 355 transitions, 2312 flow, removed 5 selfloop flow, removed 18 redundant places. [2025-01-09 21:22:35,287 INFO L231 Difference]: Finished difference. Result has 213 places, 290 transitions, 1762 flow [2025-01-09 21:22:35,287 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=1354, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=263, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1762, PETRI_PLACES=213, PETRI_TRANSITIONS=290} [2025-01-09 21:22:35,287 INFO L279 CegarLoopForPetriNet]: 139 programPoint places, 74 predicate places. [2025-01-09 21:22:35,287 INFO L471 AbstractCegarLoop]: Abstraction has has 213 places, 290 transitions, 1762 flow [2025-01-09 21:22:35,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 108.5) internal successors, (651), 6 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:22:35,288 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:22:35,288 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:22:35,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:22:35,288 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 21:22:35,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:22:35,289 INFO L85 PathProgramCache]: Analyzing trace with hash -14623660, now seen corresponding path program 1 times [2025-01-09 21:22:35,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:22:35,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15136105] [2025-01-09 21:22:35,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:22:35,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:22:35,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-01-09 21:22:35,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-01-09 21:22:35,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:22:35,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:22:35,316 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:22:35,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-01-09 21:22:35,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-01-09 21:22:35,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:22:35,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:22:35,359 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:22:35,359 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:22:35,360 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (6 of 7 remaining) [2025-01-09 21:22:35,361 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining) [2025-01-09 21:22:35,361 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2025-01-09 21:22:35,361 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining) [2025-01-09 21:22:35,361 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining) [2025-01-09 21:22:35,361 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining) [2025-01-09 21:22:35,361 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (0 of 7 remaining) [2025-01-09 21:22:35,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:22:35,362 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1] [2025-01-09 21:22:35,402 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-09 21:22:35,403 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 21:22:35,406 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 09:22:35 BasicIcfg [2025-01-09 21:22:35,406 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 21:22:35,406 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 21:22:35,406 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 21:22:35,406 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 21:22:35,407 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:22:29" (3/4) ... [2025-01-09 21:22:35,407 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-01-09 21:22:35,471 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 12. [2025-01-09 21:22:35,522 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 21:22:35,523 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 21:22:35,523 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 21:22:35,523 INFO L158 Benchmark]: Toolchain (without parser) took 6586.58ms. Allocated memory was 142.6MB in the beginning and 444.6MB in the end (delta: 302.0MB). Free memory was 109.5MB in the beginning and 331.6MB in the end (delta: -222.1MB). Peak memory consumption was 77.2MB. Max. memory is 16.1GB. [2025-01-09 21:22:35,523 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 127.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:22:35,523 INFO L158 Benchmark]: CACSL2BoogieTranslator took 286.95ms. Allocated memory is still 142.6MB. Free memory was 109.5MB in the beginning and 88.1MB in the end (delta: 21.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 21:22:35,523 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.61ms. Allocated memory is still 142.6MB. Free memory was 88.1MB in the beginning and 86.1MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:22:35,524 INFO L158 Benchmark]: Boogie Preprocessor took 17.79ms. Allocated memory is still 142.6MB. Free memory was 86.1MB in the beginning and 84.2MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:22:35,524 INFO L158 Benchmark]: RCFGBuilder took 287.92ms. Allocated memory is still 142.6MB. Free memory was 84.2MB in the beginning and 65.2MB in the end (delta: 19.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 21:22:35,524 INFO L158 Benchmark]: TraceAbstraction took 5849.06ms. Allocated memory was 142.6MB in the beginning and 444.6MB in the end (delta: 302.0MB). Free memory was 63.9MB in the beginning and 344.2MB in the end (delta: -280.3MB). Peak memory consumption was 18.5MB. Max. memory is 16.1GB. [2025-01-09 21:22:35,524 INFO L158 Benchmark]: Witness Printer took 116.22ms. Allocated memory is still 444.6MB. Free memory was 344.2MB in the beginning and 331.6MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:22:35,526 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 127.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 286.95ms. Allocated memory is still 142.6MB. Free memory was 109.5MB in the beginning and 88.1MB in the end (delta: 21.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.61ms. Allocated memory is still 142.6MB. Free memory was 88.1MB in the beginning and 86.1MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 17.79ms. Allocated memory is still 142.6MB. Free memory was 86.1MB in the beginning and 84.2MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 287.92ms. Allocated memory is still 142.6MB. Free memory was 84.2MB in the beginning and 65.2MB in the end (delta: 19.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 5849.06ms. Allocated memory was 142.6MB in the beginning and 444.6MB in the end (delta: 302.0MB). Free memory was 63.9MB in the beginning and 344.2MB in the end (delta: -280.3MB). Peak memory consumption was 18.5MB. Max. memory is 16.1GB. * Witness Printer took 116.22ms. Allocated memory is still 444.6MB. Free memory was 344.2MB in the beginning and 331.6MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 693]: Data race detected Data race detected The following path leads to a data race: [L679] 0 int data[10]; VAL [data={1:0}] [L680] 0 pthread_mutex_t m[10]; VAL [data={1:0}, m={2:0}] [L688] 0 int i = 0; VAL [data={1:0}, i=0, m={2:0}] [L688] COND TRUE 0 i < 10 VAL [data={1:0}, m={2:0}] [L688] 0 i++ VAL [data={1:0}, i=1, m={2:0}] [L688] COND TRUE 0 i < 10 VAL [data={1:0}, m={2:0}] [L688] 0 i++ VAL [data={1:0}, i=2, m={2:0}] [L688] COND TRUE 0 i < 10 VAL [data={1:0}, m={2:0}] [L688] 0 i++ VAL [data={1:0}, i=3, m={2:0}] [L688] COND TRUE 0 i < 10 VAL [data={1:0}, m={2:0}] [L688] 0 i++ VAL [data={1:0}, i=4, m={2:0}] [L688] COND TRUE 0 i < 10 VAL [data={1:0}, m={2:0}] [L688] 0 i++ VAL [data={1:0}, i=5, m={2:0}] [L688] COND TRUE 0 i < 10 VAL [data={1:0}, m={2:0}] [L688] 0 i++ VAL [data={1:0}, i=6, m={2:0}] [L688] COND TRUE 0 i < 10 VAL [data={1:0}, m={2:0}] [L688] 0 i++ VAL [data={1:0}, i=7, m={2:0}] [L688] COND TRUE 0 i < 10 VAL [data={1:0}, m={2:0}] [L688] 0 i++ VAL [data={1:0}, i=8, m={2:0}] [L688] COND TRUE 0 i < 10 VAL [data={1:0}, m={2:0}] [L688] 0 i++ VAL [data={1:0}, i=9, m={2:0}] [L688] COND TRUE 0 i < 10 VAL [data={1:0}, m={2:0}] [L688] 0 i++ VAL [data={1:0}, i=10, m={2:0}] [L688] COND FALSE 0 !(i < 10) VAL [data={1:0}, m={2:0}] [L690] 0 pthread_t id; VAL [data={1:0}, m={2:0}] [L691] FCALL, FORK 0 pthread_create(&id, ((void *)0), t_fun, ((void *)0)) VAL [\old(arg)={0:0}, data={1:0}, id=-1, m={2:0}] [L683] EXPR 1 data[4] VAL [\old(arg)={0:0}, arg={0:0}, data={1:0}, m={2:0}] [L683] 1 data[4]++ VAL [\old(arg)={0:0}, arg={0:0}, data={1:0}, m={2:0}] [L693] EXPR 0 data[4] VAL [\old(arg)={0:0}, arg={0:0}, data={1:0}, id=-1, m={2:0}] [L693] 0 data[4]++ VAL [\old(arg)={0:0}, arg={0:0}, data={1:0}, id=-1, m={2:0}] [L683] 1 data[4]++ VAL [\old(arg)={0:0}, arg={0:0}, data={1:0}, m={2:0}] [L693] 0 data[4]++ VAL [\old(arg)={0:0}, arg={0:0}, data={1:0}, id=-1, m={2:0}] [L683] 1 data[4]++ VAL [\old(arg)={0:0}, arg={0:0}, data={1:0}, m={2:0}] [L693] 0 data[4]++ VAL [\old(arg)={0:0}, arg={0:0}, data={1:0}, id=-1, m={2:0}] Now there is a data race (on the heap) between C: data[4]++ [683] and C: data[4]++ [693] - UnprovableResult [Line: 693]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 691]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 683]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 683]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 165 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 5.7s, OverallIterations: 8, TraceHistogramMax: 10, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 462 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 370 mSDsluCounter, 103 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 85 mSDsCounter, 123 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1172 IncrementalHoareTripleChecker+Invalid, 1295 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 123 mSolverCounterUnsat, 18 mSDtfsCounter, 1172 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 734 GetRequests, 631 SyntacticMatches, 11 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 684 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1762occurred in iteration=7, InterpolantAutomatonStates: 81, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 1260 NumberOfCodeBlocks, 1160 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1425 ConstructedInterpolants, 0 QuantifiedInterpolants, 2042 SizeOfPredicates, 22 NumberOfNonLiveVariables, 752 ConjunctsInSsa, 28 ConjunctsInUnsatCore, 13 InterpolantComputations, 4 PerfectInterpolantSequences, 365/758 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-01-09 21:22:35,556 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(DATA-RACE)