./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/09-regions_19-nested_nr.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/09-regions_19-nested_nr.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 e4a3fff277216174585e9d802eee36c2b619da26d56e48ed5261f2ab62942b7a --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:32:41,585 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:32:41,636 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-08 05:32:41,639 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:32:41,639 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:32:41,653 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:32:41,654 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:32:41,654 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:32:41,654 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:32:41,654 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:32:41,655 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:32:41,655 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:32:41,655 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:32:41,655 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:32:41,655 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:32:41,655 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:32:41,655 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:32:41,655 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:32:41,655 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:32:41,655 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:32:41,655 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:32:41,655 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:32:41,655 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:32:41,656 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:32:41,656 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:32:41,656 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:32:41,656 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:32:41,656 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:32:41,656 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:32:41,656 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:32:41,656 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:32:41,656 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:32:41,656 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:32:41,656 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:32:41,656 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:32:41,656 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:32:41,656 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:32:41,656 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:32:41,656 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:32:41,656 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:32:41,656 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:32:41,656 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:32:41,656 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 -> e4a3fff277216174585e9d802eee36c2b619da26d56e48ed5261f2ab62942b7a [2025-02-08 05:32:41,862 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:32:41,871 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:32:41,876 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:32:41,877 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:32:41,877 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:32:41,877 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/09-regions_19-nested_nr.i [2025-02-08 05:32:43,154 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e381b3235/a6b358b63bb348ea81b424e31095905a/FLAG8ef1cbae3 [2025-02-08 05:32:43,480 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:32:43,481 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_19-nested_nr.i [2025-02-08 05:32:43,494 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e381b3235/a6b358b63bb348ea81b424e31095905a/FLAG8ef1cbae3 [2025-02-08 05:32:43,505 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e381b3235/a6b358b63bb348ea81b424e31095905a [2025-02-08 05:32:43,507 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:32:43,508 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:32:43,509 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:32:43,509 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:32:43,512 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:32:43,513 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:32:43" (1/1) ... [2025-02-08 05:32:43,513 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@608424ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:32:43, skipping insertion in model container [2025-02-08 05:32:43,513 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:32:43" (1/1) ... [2025-02-08 05:32:43,555 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:32:43,966 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:32:44,000 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:32:44,062 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:32:44,120 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:32:44,121 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:32:44 WrapperNode [2025-02-08 05:32:44,121 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:32:44,122 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:32:44,122 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:32:44,122 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:32:44,126 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:32:44" (1/1) ... [2025-02-08 05:32:44,147 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:32:44" (1/1) ... [2025-02-08 05:32:44,168 INFO L138 Inliner]: procedures = 372, calls = 87, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 292 [2025-02-08 05:32:44,169 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:32:44,169 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:32:44,169 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:32:44,169 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:32:44,176 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:32:44" (1/1) ... [2025-02-08 05:32:44,176 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:32:44" (1/1) ... [2025-02-08 05:32:44,180 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:32:44" (1/1) ... [2025-02-08 05:32:44,180 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:32:44" (1/1) ... [2025-02-08 05:32:44,205 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:32:44" (1/1) ... [2025-02-08 05:32:44,210 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:32:44" (1/1) ... [2025-02-08 05:32:44,212 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:32:44" (1/1) ... [2025-02-08 05:32:44,216 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:32:44" (1/1) ... [2025-02-08 05:32:44,218 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:32:44,219 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:32:44,219 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:32:44,219 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:32:44,223 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:32:44" (1/1) ... [2025-02-08 05:32:44,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:32:44,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:32:44,246 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 05:32:44,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 05:32:44,263 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-02-08 05:32:44,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-02-08 05:32:44,263 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-08 05:32:44,263 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 05:32:44,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 05:32:44,263 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-08 05:32:44,264 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 05:32:44,264 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:32:44,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-02-08 05:32:44,264 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-02-08 05:32:44,264 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-02-08 05:32:44,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:32:44,264 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:32:44,264 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:32:44,265 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 05:32:44,387 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:32:44,389 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:32:44,805 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1242: list_add_~list#1.base, list_add_~list#1.offset := list_add_#in~list#1.base, list_add_#in~list#1.offset; [2025-02-08 05:32:44,805 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1242-1: list_add_~node#1.base, list_add_~node#1.offset := list_add_#in~node#1.base, list_add_#in~node#1.offset; [2025-02-08 05:32:44,805 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1243: havoc list_add_#t~mem33#1.base, list_add_#t~mem33#1.offset; [2025-02-08 05:32:44,805 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1243-1: assume ((0 == #race[list_add_~list#1.base,4 + list_add_~list#1.offset] && 0 == #race[list_add_~list#1.base,5 + list_add_~list#1.offset]) && 0 == #race[list_add_~list#1.base,6 + list_add_~list#1.offset]) && 0 == #race[list_add_~list#1.base,7 + list_add_~list#1.offset]; [2025-02-08 05:32:44,805 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1243-1: assume !(((0 == #race[list_add_~list#1.base,4 + list_add_~list#1.offset] && 0 == #race[list_add_~list#1.base,5 + list_add_~list#1.offset]) && 0 == #race[list_add_~list#1.base,6 + list_add_~list#1.offset]) && 0 == #race[list_add_~list#1.base,7 + list_add_~list#1.offset]); [2025-02-08 05:32:44,805 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1243-2: list_add_~temp~0#1.base, list_add_~temp~0#1.offset := list_add_#t~mem33#1.base, list_add_#t~mem33#1.offset; [2025-02-08 05:32:44,805 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1243-3: #race := #race[list_add_~list#1.base,7 + list_add_~list#1.offset := 0]; [2025-02-08 05:32:44,806 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1243-4: #race := #race[list_add_~list#1.base,6 + list_add_~list#1.offset := 0]; [2025-02-08 05:32:44,806 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1243-5: #race := #race[list_add_~list#1.base,5 + list_add_~list#1.offset := 0]; [2025-02-08 05:32:44,806 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1243-6: #race := #race[list_add_~list#1.base,4 + list_add_~list#1.offset := 0]; [2025-02-08 05:32:44,806 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1243-7: SUMMARY for call list_add_#t~mem33#1.base, list_add_#t~mem33#1.offset := read~$Pointer$(list_add_~list#1.base, 4 + list_add_~list#1.offset, 4); srcloc: null [2025-02-08 05:32:44,806 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1244: assume ((#race[list_add_~list#1.base,4 + list_add_~list#1.offset] == list_add_#t~nondet34#1 && #race[list_add_~list#1.base,5 + list_add_~list#1.offset] == list_add_#t~nondet34#1) && #race[list_add_~list#1.base,6 + list_add_~list#1.offset] == list_add_#t~nondet34#1) && #race[list_add_~list#1.base,7 + list_add_~list#1.offset] == list_add_#t~nondet34#1; [2025-02-08 05:32:44,806 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1244: assume !(((#race[list_add_~list#1.base,4 + list_add_~list#1.offset] == list_add_#t~nondet34#1 && #race[list_add_~list#1.base,5 + list_add_~list#1.offset] == list_add_#t~nondet34#1) && #race[list_add_~list#1.base,6 + list_add_~list#1.offset] == list_add_#t~nondet34#1) && #race[list_add_~list#1.base,7 + list_add_~list#1.offset] == list_add_#t~nondet34#1); [2025-02-08 05:32:44,806 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1244-1: havoc list_add_#t~nondet34#1; [2025-02-08 05:32:44,806 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1244-2: #race := #race[list_add_~list#1.base,7 + list_add_~list#1.offset := list_add_#t~nondet34#1]; [2025-02-08 05:32:44,807 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1244-3: #race := #race[list_add_~list#1.base,6 + list_add_~list#1.offset := list_add_#t~nondet34#1]; [2025-02-08 05:32:44,807 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1244-4: #race := #race[list_add_~list#1.base,5 + list_add_~list#1.offset := list_add_#t~nondet34#1]; [2025-02-08 05:32:44,807 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1244-5: #race := #race[list_add_~list#1.base,4 + list_add_~list#1.offset := list_add_#t~nondet34#1]; [2025-02-08 05:32:44,807 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1244-6: havoc list_add_#t~nondet34#1; [2025-02-08 05:32:44,807 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1244-7: SUMMARY for call write~$Pointer$(list_add_~node#1.base, list_add_~node#1.offset, list_add_~list#1.base, 4 + list_add_~list#1.offset, 4); srcloc: null [2025-02-08 05:32:44,808 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1245: assume ((#race[list_add_~node#1.base,4 + list_add_~node#1.offset] == list_add_#t~nondet35#1 && #race[list_add_~node#1.base,5 + list_add_~node#1.offset] == list_add_#t~nondet35#1) && #race[list_add_~node#1.base,6 + list_add_~node#1.offset] == list_add_#t~nondet35#1) && #race[list_add_~node#1.base,7 + list_add_~node#1.offset] == list_add_#t~nondet35#1; [2025-02-08 05:32:44,808 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1245: assume !(((#race[list_add_~node#1.base,4 + list_add_~node#1.offset] == list_add_#t~nondet35#1 && #race[list_add_~node#1.base,5 + list_add_~node#1.offset] == list_add_#t~nondet35#1) && #race[list_add_~node#1.base,6 + list_add_~node#1.offset] == list_add_#t~nondet35#1) && #race[list_add_~node#1.base,7 + list_add_~node#1.offset] == list_add_#t~nondet35#1); [2025-02-08 05:32:44,808 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1245-1: havoc list_add_#t~nondet35#1; [2025-02-08 05:32:44,808 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1245-2: #race := #race[list_add_~node#1.base,7 + list_add_~node#1.offset := list_add_#t~nondet35#1]; [2025-02-08 05:32:44,808 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1245-3: #race := #race[list_add_~node#1.base,6 + list_add_~node#1.offset := list_add_#t~nondet35#1]; [2025-02-08 05:32:44,810 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1245-4: #race := #race[list_add_~node#1.base,5 + list_add_~node#1.offset := list_add_#t~nondet35#1]; [2025-02-08 05:32:44,810 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1245-5: #race := #race[list_add_~node#1.base,4 + list_add_~node#1.offset := list_add_#t~nondet35#1]; [2025-02-08 05:32:44,810 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1245-6: havoc list_add_#t~nondet35#1; [2025-02-08 05:32:44,811 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1245-7: SUMMARY for call write~$Pointer$(list_add_~temp~0#1.base, list_add_~temp~0#1.offset, list_add_~node#1.base, 4 + list_add_~node#1.offset, 4); srcloc: null [2025-02-08 05:32:44,811 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1262-1: havoc main_#t~post47#1; [2025-02-08 05:32:44,811 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1262-2: main_~k~0#1 := 1 + main_#t~post47#1; [2025-02-08 05:32:44,811 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1262-3: main_#t~post47#1 := main_~k~0#1; [2025-02-08 05:32:44,811 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1263: havoc main_#t~nondet44#1; [2025-02-08 05:32:44,811 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1263-1: assume ((#race[~#c~0.base,~#c~0.offset + 4 * main_~k~0#1] == main_#t~nondet44#1 && #race[~#c~0.base,1 + (~#c~0.offset + 4 * main_~k~0#1)] == main_#t~nondet44#1) && #race[~#c~0.base,2 + (~#c~0.offset + 4 * main_~k~0#1)] == main_#t~nondet44#1) && #race[~#c~0.base,3 + (~#c~0.offset + 4 * main_~k~0#1)] == main_#t~nondet44#1; [2025-02-08 05:32:44,811 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1263-1: assume !(((#race[~#c~0.base,~#c~0.offset + 4 * main_~k~0#1] == main_#t~nondet44#1 && #race[~#c~0.base,1 + (~#c~0.offset + 4 * main_~k~0#1)] == main_#t~nondet44#1) && #race[~#c~0.base,2 + (~#c~0.offset + 4 * main_~k~0#1)] == main_#t~nondet44#1) && #race[~#c~0.base,3 + (~#c~0.offset + 4 * main_~k~0#1)] == main_#t~nondet44#1); [2025-02-08 05:32:44,811 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1263-2: havoc main_#t~ret43#1.base, main_#t~ret43#1.offset; [2025-02-08 05:32:44,811 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1263-3: #race := #race[~#c~0.base,3 + (~#c~0.offset + 4 * main_~k~0#1) := main_#t~nondet44#1]; [2025-02-08 05:32:44,811 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1263-4: #race := #race[~#c~0.base,2 + (~#c~0.offset + 4 * main_~k~0#1) := main_#t~nondet44#1]; [2025-02-08 05:32:44,811 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1263-5: #race := #race[~#c~0.base,1 + (~#c~0.offset + 4 * main_~k~0#1) := main_#t~nondet44#1]; [2025-02-08 05:32:44,811 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1263-6: #race := #race[~#c~0.base,~#c~0.offset + 4 * main_~k~0#1 := main_#t~nondet44#1]; [2025-02-08 05:32:44,811 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1263-7: havoc main_#t~nondet44#1; [2025-02-08 05:32:44,811 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1263-8: SUMMARY for call write~$Pointer$(main_#t~ret43#1.base, main_#t~ret43#1.offset, ~#c~0.base, ~#c~0.offset + 4 * main_~k~0#1, 4); srcloc: null [2025-02-08 05:32:44,811 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1263-9: havoc new_#in~x#1;assume { :end_inline_new } true; [2025-02-08 05:32:44,811 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1263-10: havoc new_#t~malloc30#1.base, new_#t~malloc30#1.offset, new_#t~nondet31#1, new_#t~nondet32#1, new_~x#1, new_~p~0#1.base, new_~p~0#1.offset; [2025-02-08 05:32:44,811 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1263-11: main_#t~ret43#1.base, main_#t~ret43#1.offset := new_#res#1.base, new_#res#1.offset; [2025-02-08 05:32:44,811 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1264: havoc main_#t~mem46#1.base, main_#t~mem46#1.offset; [2025-02-08 05:32:44,811 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1264-1: assume { :end_inline_list_add } true;havoc main_#t~ret45#1.base, main_#t~ret45#1.offset; [2025-02-08 05:32:44,811 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1264-2: havoc list_add_#in~node#1.base, list_add_#in~node#1.offset, list_add_#in~list#1.base, list_add_#in~list#1.offset; [2025-02-08 05:32:44,811 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1264-3: havoc list_add_#t~mem33#1.base, list_add_#t~mem33#1.offset, list_add_#t~nondet34#1, list_add_#t~nondet35#1, list_add_~node#1.base, list_add_~node#1.offset, list_add_~list#1.base, list_add_~list#1.offset, list_add_~temp~0#1.base, list_add_~temp~0#1.offset; [2025-02-08 05:32:44,811 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1264-4: havoc list_add_#t~mem33#1.base, list_add_#t~mem33#1.offset, list_add_#t~nondet34#1, list_add_#t~nondet35#1, list_add_~node#1.base, list_add_~node#1.offset, list_add_~list#1.base, list_add_~list#1.offset, list_add_~temp~0#1.base, list_add_~temp~0#1.offset; [2025-02-08 05:32:44,812 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1264-5: assume ((0 == #race[~#c~0.base,~#c~0.offset + 4 * main_~k~0#1] && 0 == #race[~#c~0.base,1 + (~#c~0.offset + 4 * main_~k~0#1)]) && 0 == #race[~#c~0.base,2 + (~#c~0.offset + 4 * main_~k~0#1)]) && 0 == #race[~#c~0.base,3 + (~#c~0.offset + 4 * main_~k~0#1)]; [2025-02-08 05:32:44,812 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1264-5: assume !(((0 == #race[~#c~0.base,~#c~0.offset + 4 * main_~k~0#1] && 0 == #race[~#c~0.base,1 + (~#c~0.offset + 4 * main_~k~0#1)]) && 0 == #race[~#c~0.base,2 + (~#c~0.offset + 4 * main_~k~0#1)]) && 0 == #race[~#c~0.base,3 + (~#c~0.offset + 4 * main_~k~0#1)]); [2025-02-08 05:32:44,812 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1264-6: assume { :begin_inline_list_add } true;list_add_#in~node#1.base, list_add_#in~node#1.offset, list_add_#in~list#1.base, list_add_#in~list#1.offset := main_#t~ret45#1.base, main_#t~ret45#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset; [2025-02-08 05:32:44,812 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1264-7: #race := #race[~#c~0.base,3 + (~#c~0.offset + 4 * main_~k~0#1) := 0]; [2025-02-08 05:32:44,812 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1264-8: #race := #race[~#c~0.base,2 + (~#c~0.offset + 4 * main_~k~0#1) := 0]; [2025-02-08 05:32:44,812 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1264-9: #race := #race[~#c~0.base,1 + (~#c~0.offset + 4 * main_~k~0#1) := 0]; [2025-02-08 05:32:44,812 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1264-10: #race := #race[~#c~0.base,~#c~0.offset + 4 * main_~k~0#1 := 0]; [2025-02-08 05:32:44,812 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1264-11: SUMMARY for call main_#t~mem46#1.base, main_#t~mem46#1.offset := read~$Pointer$(~#c~0.base, ~#c~0.offset + 4 * main_~k~0#1, 4); srcloc: null [2025-02-08 05:32:44,812 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1264-12: havoc new_#in~x#1;assume { :end_inline_new } true; [2025-02-08 05:32:44,812 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1264-13: havoc new_#t~malloc30#1.base, new_#t~malloc30#1.offset, new_#t~nondet31#1, new_#t~nondet32#1, new_~x#1, new_~p~0#1.base, new_~p~0#1.offset; [2025-02-08 05:32:44,812 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1264-14: main_#t~ret45#1.base, main_#t~ret45#1.offset := new_#res#1.base, new_#res#1.offset; [2025-02-08 05:32:44,812 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1264-15: havoc new_#t~malloc30#1.base, new_#t~malloc30#1.offset, new_#t~nondet31#1, new_#t~nondet32#1, new_~x#1, new_~p~0#1.base, new_~p~0#1.offset; [2025-02-08 05:32:44,812 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1264-16: havoc new_#res#1.base, new_#res#1.offset; [2025-02-08 05:32:44,812 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1264-17: assume { :begin_inline_new } true;new_#in~x#1 := 2; [2025-02-08 05:32:44,812 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1236: new_~x#1 := new_#in~x#1; [2025-02-08 05:32:44,812 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1237: havoc new_#t~malloc30#1.base, new_#t~malloc30#1.offset; [2025-02-08 05:32:44,812 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1237-1: new_~p~0#1.base, new_~p~0#1.offset := new_#t~malloc30#1.base, new_#t~malloc30#1.offset; [2025-02-08 05:32:44,812 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1237-2: SUMMARY for call new_#t~malloc30#1.base, new_#t~malloc30#1.offset := #Ultimate.allocOnHeap(8); srcloc: null [2025-02-08 05:32:44,812 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1238: assume ((#race[new_~p~0#1.base,new_~p~0#1.offset] == new_#t~nondet31#1 && #race[new_~p~0#1.base,1 + new_~p~0#1.offset] == new_#t~nondet31#1) && #race[new_~p~0#1.base,2 + new_~p~0#1.offset] == new_#t~nondet31#1) && #race[new_~p~0#1.base,3 + new_~p~0#1.offset] == new_#t~nondet31#1; [2025-02-08 05:32:44,812 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1238: assume !(((#race[new_~p~0#1.base,new_~p~0#1.offset] == new_#t~nondet31#1 && #race[new_~p~0#1.base,1 + new_~p~0#1.offset] == new_#t~nondet31#1) && #race[new_~p~0#1.base,2 + new_~p~0#1.offset] == new_#t~nondet31#1) && #race[new_~p~0#1.base,3 + new_~p~0#1.offset] == new_#t~nondet31#1); [2025-02-08 05:32:44,812 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1238-1: havoc new_#t~nondet31#1; [2025-02-08 05:32:44,812 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1238-2: #race := #race[new_~p~0#1.base,3 + new_~p~0#1.offset := new_#t~nondet31#1]; [2025-02-08 05:32:44,813 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1238-3: #race := #race[new_~p~0#1.base,2 + new_~p~0#1.offset := new_#t~nondet31#1]; [2025-02-08 05:32:44,813 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1238-4: #race := #race[new_~p~0#1.base,1 + new_~p~0#1.offset := new_#t~nondet31#1]; [2025-02-08 05:32:44,813 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1238-5: #race := #race[new_~p~0#1.base,new_~p~0#1.offset := new_#t~nondet31#1]; [2025-02-08 05:32:44,813 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1238-6: havoc new_#t~nondet31#1; [2025-02-08 05:32:44,813 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1238-7: SUMMARY for call write~int(new_~x#1, new_~p~0#1.base, new_~p~0#1.offset, 4); srcloc: null [2025-02-08 05:32:44,813 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1239: assume ((#race[new_~p~0#1.base,4 + new_~p~0#1.offset] == new_#t~nondet32#1 && #race[new_~p~0#1.base,5 + new_~p~0#1.offset] == new_#t~nondet32#1) && #race[new_~p~0#1.base,6 + new_~p~0#1.offset] == new_#t~nondet32#1) && #race[new_~p~0#1.base,7 + new_~p~0#1.offset] == new_#t~nondet32#1; [2025-02-08 05:32:44,813 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1239: assume !(((#race[new_~p~0#1.base,4 + new_~p~0#1.offset] == new_#t~nondet32#1 && #race[new_~p~0#1.base,5 + new_~p~0#1.offset] == new_#t~nondet32#1) && #race[new_~p~0#1.base,6 + new_~p~0#1.offset] == new_#t~nondet32#1) && #race[new_~p~0#1.base,7 + new_~p~0#1.offset] == new_#t~nondet32#1); [2025-02-08 05:32:44,813 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1239-1: havoc new_#t~nondet32#1; [2025-02-08 05:32:44,813 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1239-2: #race := #race[new_~p~0#1.base,7 + new_~p~0#1.offset := new_#t~nondet32#1]; [2025-02-08 05:32:44,813 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1239-3: #race := #race[new_~p~0#1.base,6 + new_~p~0#1.offset := new_#t~nondet32#1]; [2025-02-08 05:32:44,813 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1239-4: #race := #race[new_~p~0#1.base,5 + new_~p~0#1.offset := new_#t~nondet32#1]; [2025-02-08 05:32:44,813 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1239-5: #race := #race[new_~p~0#1.base,4 + new_~p~0#1.offset := new_#t~nondet32#1]; [2025-02-08 05:32:44,813 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1239-6: havoc new_#t~nondet32#1; [2025-02-08 05:32:44,813 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1239-7: SUMMARY for call write~$Pointer$(0, 0, new_~p~0#1.base, 4 + new_~p~0#1.offset, 4); srcloc: null [2025-02-08 05:32:44,813 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1240-1: new_#res#1.base, new_#res#1.offset := new_~p~0#1.base, new_~p~0#1.offset; [2025-02-08 05:32:44,892 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:32:44,892 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:32:44,909 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:32:44,910 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:32:44,910 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:32:44 BoogieIcfgContainer [2025-02-08 05:32:44,910 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:32:44,911 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:32:44,911 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:32:44,914 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:32:44,914 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:32:43" (1/3) ... [2025-02-08 05:32:44,915 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5250df04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:32:44, skipping insertion in model container [2025-02-08 05:32:44,915 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:32:44" (2/3) ... [2025-02-08 05:32:44,915 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5250df04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:32:44, skipping insertion in model container [2025-02-08 05:32:44,915 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:32:44" (3/3) ... [2025-02-08 05:32:44,916 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_19-nested_nr.i [2025-02-08 05:32:44,924 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:32:44,925 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09-regions_19-nested_nr.i that has 2 procedures, 248 locations, 1 initial locations, 2 loop locations, and 18 error locations. [2025-02-08 05:32:44,925 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:32:44,998 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 05:32:45,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 251 places, 250 transitions, 504 flow [2025-02-08 05:32:45,081 INFO L124 PetriNetUnfolderBase]: 3/249 cut-off events. [2025-02-08 05:32:45,083 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:32:45,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 253 conditions, 249 events. 3/249 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 216 event pairs, 0 based on Foata normal form. 0/234 useless extension candidates. Maximal degree in co-relation 127. Up to 2 conditions per place. [2025-02-08 05:32:45,087 INFO L82 GeneralOperation]: Start removeDead. Operand has 251 places, 250 transitions, 504 flow [2025-02-08 05:32:45,090 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 247 places, 246 transitions, 495 flow [2025-02-08 05:32:45,095 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:32:45,106 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;@62ab8c75, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:32:45,106 INFO L334 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2025-02-08 05:32:45,121 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:32:45,122 INFO L124 PetriNetUnfolderBase]: 2/126 cut-off events. [2025-02-08 05:32:45,122 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:32:45,122 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:32:45,122 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:32:45,123 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2025-02-08 05:32:45,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:32:45,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1616963580, now seen corresponding path program 1 times [2025-02-08 05:32:45,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:32:45,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496099465] [2025-02-08 05:32:45,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:32:45,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:32:45,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-08 05:32:45,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-08 05:32:45,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:32:45,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:32:45,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:32:45,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:32:45,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496099465] [2025-02-08 05:32:45,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496099465] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:32:45,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:32:45,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:32:45,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754508302] [2025-02-08 05:32:45,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:32:45,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:32:45,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:32:45,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:32:45,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:32:45,551 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 237 out of 250 [2025-02-08 05:32:45,556 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 246 transitions, 495 flow. Second operand has 3 states, 3 states have (on average 238.33333333333334) internal successors, (715), 3 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:32:45,556 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:32:45,557 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 237 of 250 [2025-02-08 05:32:45,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:32:45,625 INFO L124 PetriNetUnfolderBase]: 7/324 cut-off events. [2025-02-08 05:32:45,626 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:32:45,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 353 conditions, 324 events. 7/324 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 494 event pairs, 6 based on Foata normal form. 5/306 useless extension candidates. Maximal degree in co-relation 219. Up to 24 conditions per place. [2025-02-08 05:32:45,628 INFO L140 encePairwiseOnDemand]: 245/250 looper letters, 10 selfloop transitions, 2 changer transitions 1/245 dead transitions. [2025-02-08 05:32:45,629 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 245 transitions, 517 flow [2025-02-08 05:32:45,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:32:45,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:32:45,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 726 transitions. [2025-02-08 05:32:45,648 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.968 [2025-02-08 05:32:45,651 INFO L175 Difference]: Start difference. First operand has 247 places, 246 transitions, 495 flow. Second operand 3 states and 726 transitions. [2025-02-08 05:32:45,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 245 transitions, 517 flow [2025-02-08 05:32:45,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 245 transitions, 516 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:32:45,662 INFO L231 Difference]: Finished difference. Result has 249 places, 244 transitions, 500 flow [2025-02-08 05:32:45,664 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=490, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=500, PETRI_PLACES=249, PETRI_TRANSITIONS=244} [2025-02-08 05:32:45,667 INFO L279 CegarLoopForPetriNet]: 247 programPoint places, 2 predicate places. [2025-02-08 05:32:45,669 INFO L471 AbstractCegarLoop]: Abstraction has has 249 places, 244 transitions, 500 flow [2025-02-08 05:32:45,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 238.33333333333334) internal successors, (715), 3 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:32:45,670 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:32:45,670 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:32:45,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:32:45,670 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2025-02-08 05:32:45,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:32:45,671 INFO L85 PathProgramCache]: Analyzing trace with hash 281584027, now seen corresponding path program 1 times [2025-02-08 05:32:45,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:32:45,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886919683] [2025-02-08 05:32:45,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:32:45,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:32:45,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-02-08 05:32:45,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-02-08 05:32:45,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:32:45,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:32:45,895 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:32:45,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:32:45,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886919683] [2025-02-08 05:32:45,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886919683] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:32:45,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [330399153] [2025-02-08 05:32:45,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:32:45,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:32:45,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:32:45,901 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 05:32:45,909 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 05:32:45,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-02-08 05:32:45,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-02-08 05:32:45,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:32:45,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:32:45,995 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 05:32:45,999 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:32:46,039 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:32:46,039 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 05:32:46,071 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:32:46,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [330399153] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 05:32:46,072 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 05:32:46,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-02-08 05:32:46,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304721035] [2025-02-08 05:32:46,072 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 05:32:46,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 05:32:46,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:32:46,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 05:32:46,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-08 05:32:46,094 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 234 out of 250 [2025-02-08 05:32:46,096 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 244 transitions, 500 flow. Second operand has 10 states, 10 states have (on average 235.8) internal successors, (2358), 10 states have internal predecessors, (2358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:32:46,096 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:32:46,096 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 250 [2025-02-08 05:32:46,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:32:46,195 INFO L124 PetriNetUnfolderBase]: 7/330 cut-off events. [2025-02-08 05:32:46,195 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:32:46,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 377 conditions, 330 events. 7/330 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 487 event pairs, 6 based on Foata normal form. 2/310 useless extension candidates. Maximal degree in co-relation 294. Up to 24 conditions per place. [2025-02-08 05:32:46,197 INFO L140 encePairwiseOnDemand]: 244/250 looper letters, 14 selfloop transitions, 9 changer transitions 0/252 dead transitions. [2025-02-08 05:32:46,197 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 252 transitions, 564 flow [2025-02-08 05:32:46,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 05:32:46,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-08 05:32:46,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2131 transitions. [2025-02-08 05:32:46,200 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9471111111111111 [2025-02-08 05:32:46,200 INFO L175 Difference]: Start difference. First operand has 249 places, 244 transitions, 500 flow. Second operand 9 states and 2131 transitions. [2025-02-08 05:32:46,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 252 transitions, 564 flow [2025-02-08 05:32:46,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 252 transitions, 562 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:32:46,204 INFO L231 Difference]: Finished difference. Result has 258 places, 250 transitions, 548 flow [2025-02-08 05:32:46,205 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=498, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=548, PETRI_PLACES=258, PETRI_TRANSITIONS=250} [2025-02-08 05:32:46,205 INFO L279 CegarLoopForPetriNet]: 247 programPoint places, 11 predicate places. [2025-02-08 05:32:46,205 INFO L471 AbstractCegarLoop]: Abstraction has has 258 places, 250 transitions, 548 flow [2025-02-08 05:32:46,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 235.8) internal successors, (2358), 10 states have internal predecessors, (2358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:32:46,207 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:32:46,207 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:32:46,217 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-08 05:32:46,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:32:46,408 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2025-02-08 05:32:46,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:32:46,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1551986117, now seen corresponding path program 2 times [2025-02-08 05:32:46,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:32:46,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914283941] [2025-02-08 05:32:46,410 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 05:32:46,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:32:46,428 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 112 statements into 2 equivalence classes. [2025-02-08 05:32:46,437 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 97 of 112 statements. [2025-02-08 05:32:46,437 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 05:32:46,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:32:46,906 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-08 05:32:46,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:32:46,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914283941] [2025-02-08 05:32:46,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914283941] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:32:46,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:32:46,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:32:46,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742211988] [2025-02-08 05:32:46,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:32:46,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:32:46,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:32:46,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:32:46,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:32:47,164 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 197 out of 250 [2025-02-08 05:32:47,165 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 250 transitions, 548 flow. Second operand has 6 states, 6 states have (on average 198.33333333333334) internal successors, (1190), 6 states have internal predecessors, (1190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:32:47,165 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:32:47,165 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 197 of 250 [2025-02-08 05:32:47,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:32:47,479 INFO L124 PetriNetUnfolderBase]: 365/1615 cut-off events. [2025-02-08 05:32:47,480 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-02-08 05:32:47,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2426 conditions, 1615 events. 365/1615 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 9364 event pairs, 364 based on Foata normal form. 0/1496 useless extension candidates. Maximal degree in co-relation 2315. Up to 774 conditions per place. [2025-02-08 05:32:47,490 INFO L140 encePairwiseOnDemand]: 244/250 looper letters, 45 selfloop transitions, 5 changer transitions 0/249 dead transitions. [2025-02-08 05:32:47,490 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 249 transitions, 646 flow [2025-02-08 05:32:47,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:32:47,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:32:47,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1233 transitions. [2025-02-08 05:32:47,493 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.822 [2025-02-08 05:32:47,493 INFO L175 Difference]: Start difference. First operand has 258 places, 250 transitions, 548 flow. Second operand 6 states and 1233 transitions. [2025-02-08 05:32:47,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 249 transitions, 646 flow [2025-02-08 05:32:47,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 249 transitions, 640 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-02-08 05:32:47,497 INFO L231 Difference]: Finished difference. Result has 261 places, 249 transitions, 550 flow [2025-02-08 05:32:47,497 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=540, PETRI_DIFFERENCE_MINUEND_PLACES=256, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=244, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=550, PETRI_PLACES=261, PETRI_TRANSITIONS=249} [2025-02-08 05:32:47,498 INFO L279 CegarLoopForPetriNet]: 247 programPoint places, 14 predicate places. [2025-02-08 05:32:47,498 INFO L471 AbstractCegarLoop]: Abstraction has has 261 places, 249 transitions, 550 flow [2025-02-08 05:32:47,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 198.33333333333334) internal successors, (1190), 6 states have internal predecessors, (1190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:32:47,499 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:32:47,499 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:32:47,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:32:47,499 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2025-02-08 05:32:47,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:32:47,500 INFO L85 PathProgramCache]: Analyzing trace with hash 189553954, now seen corresponding path program 1 times [2025-02-08 05:32:47,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:32:47,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883608814] [2025-02-08 05:32:47,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:32:47,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:32:47,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-02-08 05:32:47,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-02-08 05:32:47,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:32:47,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:32:47,561 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-08 05:32:47,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:32:47,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883608814] [2025-02-08 05:32:47,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883608814] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:32:47,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:32:47,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:32:47,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482317169] [2025-02-08 05:32:47,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:32:47,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:32:47,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:32:47,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:32:47,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:32:47,569 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 238 out of 250 [2025-02-08 05:32:47,570 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 249 transitions, 550 flow. Second operand has 3 states, 3 states have (on average 240.0) internal successors, (720), 3 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:32:47,570 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:32:47,570 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 238 of 250 [2025-02-08 05:32:47,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:32:47,581 INFO L124 PetriNetUnfolderBase]: 1/121 cut-off events. [2025-02-08 05:32:47,581 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-08 05:32:47,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 157 conditions, 121 events. 1/121 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 1. Compared 1 event pairs, 0 based on Foata normal form. 1/122 useless extension candidates. Maximal degree in co-relation 132. Up to 5 conditions per place. [2025-02-08 05:32:47,582 INFO L140 encePairwiseOnDemand]: 248/250 looper letters, 1 selfloop transitions, 1 changer transitions 0/117 dead transitions. [2025-02-08 05:32:47,582 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 117 transitions, 288 flow [2025-02-08 05:32:47,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:32:47,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:32:47,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 717 transitions. [2025-02-08 05:32:47,583 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.956 [2025-02-08 05:32:47,584 INFO L175 Difference]: Start difference. First operand has 261 places, 249 transitions, 550 flow. Second operand 3 states and 717 transitions. [2025-02-08 05:32:47,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 117 transitions, 288 flow [2025-02-08 05:32:47,585 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 117 transitions, 278 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:32:47,586 INFO L231 Difference]: Finished difference. Result has 124 places, 117 transitions, 276 flow [2025-02-08 05:32:47,586 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=276, PETRI_PLACES=124, PETRI_TRANSITIONS=117} [2025-02-08 05:32:47,586 INFO L279 CegarLoopForPetriNet]: 247 programPoint places, -123 predicate places. [2025-02-08 05:32:47,586 INFO L471 AbstractCegarLoop]: Abstraction has has 124 places, 117 transitions, 276 flow [2025-02-08 05:32:47,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 240.0) internal successors, (720), 3 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:32:47,587 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:32:47,587 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:32:47,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:32:47,587 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2025-02-08 05:32:47,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:32:47,588 INFO L85 PathProgramCache]: Analyzing trace with hash 2067453419, now seen corresponding path program 1 times [2025-02-08 05:32:47,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:32:47,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023937742] [2025-02-08 05:32:47,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:32:47,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:32:47,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-02-08 05:32:47,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-02-08 05:32:47,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:32:47,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:32:47,720 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:32:47,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:32:47,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023937742] [2025-02-08 05:32:47,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023937742] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:32:47,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2089254458] [2025-02-08 05:32:47,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:32:47,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:32:47,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:32:47,724 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 05:32:47,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 05:32:47,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-02-08 05:32:47,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-02-08 05:32:47,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:32:47,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:32:47,837 INFO L256 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-08 05:32:47,839 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:32:47,874 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:32:47,874 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 05:32:47,951 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:32:47,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2089254458] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 05:32:47,951 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 05:32:47,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-02-08 05:32:47,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71746522] [2025-02-08 05:32:47,951 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 05:32:47,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-08 05:32:47,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:32:47,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-08 05:32:47,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-02-08 05:32:47,980 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 234 out of 250 [2025-02-08 05:32:47,984 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 117 transitions, 276 flow. Second operand has 18 states, 18 states have (on average 235.88888888888889) internal successors, (4246), 18 states have internal predecessors, (4246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:32:47,984 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:32:47,984 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 250 [2025-02-08 05:32:47,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:32:48,129 INFO L124 PetriNetUnfolderBase]: 1/141 cut-off events. [2025-02-08 05:32:48,129 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2025-02-08 05:32:48,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 228 conditions, 141 events. 1/141 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 1. Compared 1 event pairs, 0 based on Foata normal form. 4/145 useless extension candidates. Maximal degree in co-relation 196. Up to 11 conditions per place. [2025-02-08 05:32:48,130 INFO L140 encePairwiseOnDemand]: 244/250 looper letters, 12 selfloop transitions, 21 changer transitions 0/135 dead transitions. [2025-02-08 05:32:48,130 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 135 transitions, 430 flow [2025-02-08 05:32:48,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-08 05:32:48,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-02-08 05:32:48,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 4951 transitions. [2025-02-08 05:32:48,137 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.943047619047619 [2025-02-08 05:32:48,137 INFO L175 Difference]: Start difference. First operand has 124 places, 117 transitions, 276 flow. Second operand 21 states and 4951 transitions. [2025-02-08 05:32:48,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 135 transitions, 430 flow [2025-02-08 05:32:48,138 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 135 transitions, 429 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:32:48,139 INFO L231 Difference]: Finished difference. Result has 148 places, 130 transitions, 405 flow [2025-02-08 05:32:48,140 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=275, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=405, PETRI_PLACES=148, PETRI_TRANSITIONS=130} [2025-02-08 05:32:48,140 INFO L279 CegarLoopForPetriNet]: 247 programPoint places, -99 predicate places. [2025-02-08 05:32:48,140 INFO L471 AbstractCegarLoop]: Abstraction has has 148 places, 130 transitions, 405 flow [2025-02-08 05:32:48,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 235.88888888888889) internal successors, (4246), 18 states have internal predecessors, (4246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:32:48,143 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:32:48,143 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:32:48,149 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-08 05:32:48,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:32:48,343 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2025-02-08 05:32:48,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:32:48,344 INFO L85 PathProgramCache]: Analyzing trace with hash -902914261, now seen corresponding path program 2 times [2025-02-08 05:32:48,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:32:48,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641948218] [2025-02-08 05:32:48,344 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 05:32:48,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:32:48,359 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 140 statements into 2 equivalence classes. [2025-02-08 05:32:48,368 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 103 of 140 statements. [2025-02-08 05:32:48,368 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 05:32:48,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:32:48,646 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2025-02-08 05:32:48,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:32:48,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641948218] [2025-02-08 05:32:48,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641948218] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:32:48,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:32:48,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:32:48,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552505228] [2025-02-08 05:32:48,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:32:48,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:32:48,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:32:48,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:32:48,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:32:48,862 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 197 out of 250 [2025-02-08 05:32:48,864 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 130 transitions, 405 flow. Second operand has 6 states, 6 states have (on average 198.33333333333334) internal successors, (1190), 6 states have internal predecessors, (1190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:32:48,864 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:32:48,864 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 197 of 250 [2025-02-08 05:32:48,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:32:48,875 INFO L124 PetriNetUnfolderBase]: 1/140 cut-off events. [2025-02-08 05:32:48,875 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2025-02-08 05:32:48,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 242 conditions, 140 events. 1/140 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 1. Compared 1 event pairs, 0 based on Foata normal form. 1/141 useless extension candidates. Maximal degree in co-relation 205. Up to 11 conditions per place. [2025-02-08 05:32:48,875 INFO L140 encePairwiseOnDemand]: 245/250 looper letters, 0 selfloop transitions, 0 changer transitions 129/129 dead transitions. [2025-02-08 05:32:48,875 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 129 transitions, 417 flow [2025-02-08 05:32:48,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:32:48,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:32:48,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1190 transitions. [2025-02-08 05:32:48,878 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7933333333333333 [2025-02-08 05:32:48,878 INFO L175 Difference]: Start difference. First operand has 148 places, 130 transitions, 405 flow. Second operand 6 states and 1190 transitions. [2025-02-08 05:32:48,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 129 transitions, 417 flow [2025-02-08 05:32:48,880 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 129 transitions, 393 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-02-08 05:32:48,882 INFO L231 Difference]: Finished difference. Result has 146 places, 0 transitions, 0 flow [2025-02-08 05:32:48,882 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=379, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=0, PETRI_PLACES=146, PETRI_TRANSITIONS=0} [2025-02-08 05:32:48,883 INFO L279 CegarLoopForPetriNet]: 247 programPoint places, -101 predicate places. [2025-02-08 05:32:48,883 INFO L471 AbstractCegarLoop]: Abstraction has has 146 places, 0 transitions, 0 flow [2025-02-08 05:32:48,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 198.33333333333334) internal successors, (1190), 6 states have internal predecessors, (1190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:32:48,885 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (17 of 18 remaining) [2025-02-08 05:32:48,886 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (16 of 18 remaining) [2025-02-08 05:32:48,886 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (15 of 18 remaining) [2025-02-08 05:32:48,886 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (14 of 18 remaining) [2025-02-08 05:32:48,886 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (13 of 18 remaining) [2025-02-08 05:32:48,886 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 18 remaining) [2025-02-08 05:32:48,886 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr5ASSERT_VIOLATIONDATA_RACE (11 of 18 remaining) [2025-02-08 05:32:48,886 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr4ASSERT_VIOLATIONDATA_RACE (10 of 18 remaining) [2025-02-08 05:32:48,886 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr3ASSERT_VIOLATIONDATA_RACE (9 of 18 remaining) [2025-02-08 05:32:48,886 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONDATA_RACE (8 of 18 remaining) [2025-02-08 05:32:48,887 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (7 of 18 remaining) [2025-02-08 05:32:48,887 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (6 of 18 remaining) [2025-02-08 05:32:48,887 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr5ASSERT_VIOLATIONDATA_RACE (5 of 18 remaining) [2025-02-08 05:32:48,887 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr4ASSERT_VIOLATIONDATA_RACE (4 of 18 remaining) [2025-02-08 05:32:48,888 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr3ASSERT_VIOLATIONDATA_RACE (3 of 18 remaining) [2025-02-08 05:32:48,888 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONDATA_RACE (2 of 18 remaining) [2025-02-08 05:32:48,888 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (1 of 18 remaining) [2025-02-08 05:32:48,888 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 18 remaining) [2025-02-08 05:32:48,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:32:48,888 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1] [2025-02-08 05:32:48,891 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 05:32:48,891 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 05:32:48,896 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 05:32:48 BasicIcfg [2025-02-08 05:32:48,896 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 05:32:48,897 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 05:32:48,897 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 05:32:48,897 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 05:32:48,898 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:32:44" (3/4) ... [2025-02-08 05:32:48,899 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 05:32:48,900 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure t_fun [2025-02-08 05:32:48,904 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2025-02-08 05:32:48,904 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-02-08 05:32:48,905 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-02-08 05:32:48,961 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 05:32:48,961 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 05:32:48,961 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 05:32:48,962 INFO L158 Benchmark]: Toolchain (without parser) took 5454.02ms. Allocated memory was 142.6MB in the beginning and 318.8MB in the end (delta: 176.2MB). Free memory was 113.6MB in the beginning and 227.8MB in the end (delta: -114.2MB). Peak memory consumption was 64.5MB. Max. memory is 16.1GB. [2025-02-08 05:32:48,962 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 201.3MB. Free memory is still 124.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:32:48,962 INFO L158 Benchmark]: CACSL2BoogieTranslator took 612.38ms. Allocated memory is still 142.6MB. Free memory was 113.6MB in the beginning and 71.8MB in the end (delta: 41.8MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-02-08 05:32:48,963 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.05ms. Allocated memory is still 142.6MB. Free memory was 71.8MB in the beginning and 68.2MB in the end (delta: 3.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:32:48,963 INFO L158 Benchmark]: Boogie Preprocessor took 49.33ms. Allocated memory is still 142.6MB. Free memory was 68.2MB in the beginning and 64.4MB in the end (delta: 3.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:32:48,964 INFO L158 Benchmark]: IcfgBuilder took 691.11ms. Allocated memory is still 142.6MB. Free memory was 64.4MB in the beginning and 93.5MB in the end (delta: -29.1MB). Peak memory consumption was 33.0MB. Max. memory is 16.1GB. [2025-02-08 05:32:48,964 INFO L158 Benchmark]: TraceAbstraction took 3985.12ms. Allocated memory was 142.6MB in the beginning and 318.8MB in the end (delta: 176.2MB). Free memory was 92.7MB in the beginning and 232.9MB in the end (delta: -140.1MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2025-02-08 05:32:48,964 INFO L158 Benchmark]: Witness Printer took 64.41ms. Allocated memory is still 318.8MB. Free memory was 232.9MB in the beginning and 227.8MB in the end (delta: 5.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:32:48,965 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.13ms. Allocated memory is still 201.3MB. Free memory is still 124.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 612.38ms. Allocated memory is still 142.6MB. Free memory was 113.6MB in the beginning and 71.8MB in the end (delta: 41.8MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.05ms. Allocated memory is still 142.6MB. Free memory was 71.8MB in the beginning and 68.2MB in the end (delta: 3.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.33ms. Allocated memory is still 142.6MB. Free memory was 68.2MB in the beginning and 64.4MB in the end (delta: 3.8MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 691.11ms. Allocated memory is still 142.6MB. Free memory was 64.4MB in the beginning and 93.5MB in the end (delta: -29.1MB). Peak memory consumption was 33.0MB. Max. memory is 16.1GB. * TraceAbstraction took 3985.12ms. Allocated memory was 142.6MB in the beginning and 318.8MB in the end (delta: 176.2MB). Free memory was 92.7MB in the beginning and 232.9MB in the end (delta: -140.1MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * Witness Printer took 64.41ms. Allocated memory is still 318.8MB. Free memory was 232.9MB in the beginning and 227.8MB in the end (delta: 5.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1238]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1268]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1268]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1239]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1269]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1238]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1239]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1251]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1243]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1244]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1245]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 339 locations, 18 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: 3.9s, OverallIterations: 6, TraceHistogramMax: 7, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 380 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 251 mSDsluCounter, 68 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 48 mSDsCounter, 49 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 769 IncrementalHoareTripleChecker+Invalid, 818 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 49 mSolverCounterUnsat, 20 mSDtfsCounter, 769 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 488 GetRequests, 438 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=550occurred in iteration=3, InterpolantAutomatonStates: 48, 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, 1.5s InterpolantComputationTime, 906 NumberOfCodeBlocks, 854 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1118 ConstructedInterpolants, 0 QuantifiedInterpolants, 1424 SizeOfPredicates, 8 NumberOfNonLiveVariables, 540 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 10 InterpolantComputations, 4 PerfectInterpolantSequences, 149/206 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 - AllSpecificationsHoldResult: All specifications hold 18 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 05:32:48,978 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE