./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/09-regions_16-arrayloop_rc.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_16-arrayloop_rc.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5810bf8f90e8e4e20451fbc06dd5039f754e5765485d12699b814c2e1d4badb7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:32:39,269 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:32:39,340 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:39,349 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:32:39,350 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:32:39,381 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:32:39,381 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:32:39,382 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:32:39,382 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:32:39,383 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:32:39,383 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:32:39,384 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:32:39,384 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:32:39,384 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:32:39,384 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:32:39,385 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:32:39,385 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:32:39,385 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:32:39,385 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:32:39,385 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:32:39,386 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:32:39,386 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:32:39,386 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:32:39,386 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:32:39,386 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:32:39,386 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:32:39,386 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:32:39,386 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:32:39,386 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:32:39,387 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:32:39,387 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:32:39,387 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:32:39,387 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:32:39,387 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:32:39,387 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:32:39,387 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:32:39,387 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:32:39,387 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:32:39,387 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:32:39,387 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:32:39,387 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:32:39,387 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:32:39,387 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 -> 5810bf8f90e8e4e20451fbc06dd5039f754e5765485d12699b814c2e1d4badb7 [2025-02-08 05:32:39,709 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:32:39,719 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:32:39,721 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:32:39,723 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:32:39,723 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:32:39,725 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/09-regions_16-arrayloop_rc.i [2025-02-08 05:32:41,127 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/420a359dd/d638cd00bf77456a838f982b0ab91d43/FLAG12fbdf2e0 [2025-02-08 05:32:41,445 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:32:41,445 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_16-arrayloop_rc.i [2025-02-08 05:32:41,467 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/420a359dd/d638cd00bf77456a838f982b0ab91d43/FLAG12fbdf2e0 [2025-02-08 05:32:41,482 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/420a359dd/d638cd00bf77456a838f982b0ab91d43 [2025-02-08 05:32:41,485 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:32:41,486 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:32:41,488 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:32:41,488 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:32:41,493 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:32:41,494 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:32:41" (1/1) ... [2025-02-08 05:32:41,496 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e7936aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:32:41, skipping insertion in model container [2025-02-08 05:32:41,496 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:32:41" (1/1) ... [2025-02-08 05:32:41,540 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:32:41,932 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:32:41,966 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:32:42,031 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:32:42,111 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:32:42,111 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:32:42 WrapperNode [2025-02-08 05:32:42,111 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:32:42,112 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:32:42,112 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:32:42,112 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:32:42,117 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:42" (1/1) ... [2025-02-08 05:32:42,132 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:42" (1/1) ... [2025-02-08 05:32:42,169 INFO L138 Inliner]: procedures = 370, calls = 86, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 283 [2025-02-08 05:32:42,173 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:32:42,173 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:32:42,173 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:32:42,173 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:32:42,180 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:42" (1/1) ... [2025-02-08 05:32:42,182 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:42" (1/1) ... [2025-02-08 05:32:42,188 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:42" (1/1) ... [2025-02-08 05:32:42,189 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:42" (1/1) ... [2025-02-08 05:32:42,208 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:42" (1/1) ... [2025-02-08 05:32:42,209 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:42" (1/1) ... [2025-02-08 05:32:42,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:42" (1/1) ... [2025-02-08 05:32:42,213 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:42" (1/1) ... [2025-02-08 05:32:42,216 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:32:42,217 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:32:42,217 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:32:42,217 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:32:42,218 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:32:42" (1/1) ... [2025-02-08 05:32:42,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:32:42,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:32:42,258 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:42,261 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:42,281 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-02-08 05:32:42,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-02-08 05:32:42,282 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-08 05:32:42,282 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 05:32:42,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 05:32:42,282 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-08 05:32:42,283 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 05:32:42,283 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:32:42,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-02-08 05:32:42,283 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-02-08 05:32:42,284 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-02-08 05:32:42,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:32:42,284 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:32:42,284 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:32:42,285 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:42,448 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:32:42,450 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:32:42,903 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1258-1: havoc main_#t~post54#1; [2025-02-08 05:32:42,904 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1258-2: main_~j~0#1 := 1 + main_#t~post54#1; [2025-02-08 05:32:42,904 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1258-3: main_#t~post54#1 := main_~j~0#1; [2025-02-08 05:32:42,904 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1260: havoc main_#t~mem48#1.base, main_#t~mem48#1.offset; [2025-02-08 05:32:42,904 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1260-1: assume { :end_inline_list_add } true;havoc main_#t~ret47#1.base, main_#t~ret47#1.offset; [2025-02-08 05:32:42,904 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1260-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:42,904 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1260-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:42,904 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1260-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:42,904 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1260-5: assume ((0 == #race[~#slot~0.base,~#slot~0.offset + 4 * main_~j~0#1] && 0 == #race[~#slot~0.base,1 + (~#slot~0.offset + 4 * main_~j~0#1)]) && 0 == #race[~#slot~0.base,2 + (~#slot~0.offset + 4 * main_~j~0#1)]) && 0 == #race[~#slot~0.base,3 + (~#slot~0.offset + 4 * main_~j~0#1)]; [2025-02-08 05:32:42,904 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1260-5: assume !(((0 == #race[~#slot~0.base,~#slot~0.offset + 4 * main_~j~0#1] && 0 == #race[~#slot~0.base,1 + (~#slot~0.offset + 4 * main_~j~0#1)]) && 0 == #race[~#slot~0.base,2 + (~#slot~0.offset + 4 * main_~j~0#1)]) && 0 == #race[~#slot~0.base,3 + (~#slot~0.offset + 4 * main_~j~0#1)]); [2025-02-08 05:32:42,904 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1260-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~ret47#1.base, main_#t~ret47#1.offset, main_#t~mem48#1.base, main_#t~mem48#1.offset; [2025-02-08 05:32:42,904 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1260-7: #race := #race[~#slot~0.base,3 + (~#slot~0.offset + 4 * main_~j~0#1) := 0]; [2025-02-08 05:32:42,905 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1260-8: #race := #race[~#slot~0.base,2 + (~#slot~0.offset + 4 * main_~j~0#1) := 0]; [2025-02-08 05:32:42,905 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1260-9: #race := #race[~#slot~0.base,1 + (~#slot~0.offset + 4 * main_~j~0#1) := 0]; [2025-02-08 05:32:42,905 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1260-10: #race := #race[~#slot~0.base,~#slot~0.offset + 4 * main_~j~0#1 := 0]; [2025-02-08 05:32:42,905 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1260-11: SUMMARY for call main_#t~mem48#1.base, main_#t~mem48#1.offset := read~$Pointer$(~#slot~0.base, ~#slot~0.offset + 4 * main_~j~0#1, 4); srcloc: null [2025-02-08 05:32:42,905 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1260-12: havoc new_#in~x#1;assume { :end_inline_new } true; [2025-02-08 05:32:42,905 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1260-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:42,905 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1260-14: main_#t~ret47#1.base, main_#t~ret47#1.offset := new_#res#1.base, new_#res#1.offset; [2025-02-08 05:32:42,905 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1261: havoc main_#t~mem50#1.base, main_#t~mem50#1.offset; [2025-02-08 05:32:42,905 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1261-1: havoc main_#t~mem49#1.base, main_#t~mem49#1.offset; [2025-02-08 05:32:42,905 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1261-2: assume ((0 == #race[main_#t~mem49#1.base,4 + main_#t~mem49#1.offset] && 0 == #race[main_#t~mem49#1.base,5 + main_#t~mem49#1.offset]) && 0 == #race[main_#t~mem49#1.base,6 + main_#t~mem49#1.offset]) && 0 == #race[main_#t~mem49#1.base,7 + main_#t~mem49#1.offset]; [2025-02-08 05:32:42,905 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1261-2: assume !(((0 == #race[main_#t~mem49#1.base,4 + main_#t~mem49#1.offset] && 0 == #race[main_#t~mem49#1.base,5 + main_#t~mem49#1.offset]) && 0 == #race[main_#t~mem49#1.base,6 + main_#t~mem49#1.offset]) && 0 == #race[main_#t~mem49#1.base,7 + main_#t~mem49#1.offset]); [2025-02-08 05:32:42,905 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1261-3: main_~p~1#1.base, main_~p~1#1.offset := main_#t~mem50#1.base, main_#t~mem50#1.offset; [2025-02-08 05:32:42,906 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1261-4: #race := #race[main_#t~mem49#1.base,7 + main_#t~mem49#1.offset := 0]; [2025-02-08 05:32:42,906 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1261-5: #race := #race[main_#t~mem49#1.base,6 + main_#t~mem49#1.offset := 0]; [2025-02-08 05:32:42,906 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1261-6: #race := #race[main_#t~mem49#1.base,5 + main_#t~mem49#1.offset := 0]; [2025-02-08 05:32:42,906 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1261-7: #race := #race[main_#t~mem49#1.base,4 + main_#t~mem49#1.offset := 0]; [2025-02-08 05:32:42,906 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1261-8: SUMMARY for call main_#t~mem50#1.base, main_#t~mem50#1.offset := read~$Pointer$(main_#t~mem49#1.base, 4 + main_#t~mem49#1.offset, 4); srcloc: null [2025-02-08 05:32:42,906 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1261-9: assume ((0 == #race[~#slot~0.base,~#slot~0.offset + 4 * main_~j~0#1] && 0 == #race[~#slot~0.base,1 + (~#slot~0.offset + 4 * main_~j~0#1)]) && 0 == #race[~#slot~0.base,2 + (~#slot~0.offset + 4 * main_~j~0#1)]) && 0 == #race[~#slot~0.base,3 + (~#slot~0.offset + 4 * main_~j~0#1)]; [2025-02-08 05:32:42,906 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1261-9: assume !(((0 == #race[~#slot~0.base,~#slot~0.offset + 4 * main_~j~0#1] && 0 == #race[~#slot~0.base,1 + (~#slot~0.offset + 4 * main_~j~0#1)]) && 0 == #race[~#slot~0.base,2 + (~#slot~0.offset + 4 * main_~j~0#1)]) && 0 == #race[~#slot~0.base,3 + (~#slot~0.offset + 4 * main_~j~0#1)]); [2025-02-08 05:32:42,906 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1261-10: #race := #race[~#slot~0.base,3 + (~#slot~0.offset + 4 * main_~j~0#1) := 0]; [2025-02-08 05:32:42,906 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1261-11: #race := #race[~#slot~0.base,2 + (~#slot~0.offset + 4 * main_~j~0#1) := 0]; [2025-02-08 05:32:42,906 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1261-12: #race := #race[~#slot~0.base,1 + (~#slot~0.offset + 4 * main_~j~0#1) := 0]; [2025-02-08 05:32:42,906 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1261-13: #race := #race[~#slot~0.base,~#slot~0.offset + 4 * main_~j~0#1 := 0]; [2025-02-08 05:32:42,906 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1261-14: SUMMARY for call main_#t~mem49#1.base, main_#t~mem49#1.offset := read~$Pointer$(~#slot~0.base, ~#slot~0.offset + 4 * main_~j~0#1, 4); srcloc: null [2025-02-08 05:32:42,906 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1262: havoc main_#t~mem52#1; [2025-02-08 05:32:42,906 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1262-1: assume ((0 == #race[main_~p~1#1.base,main_~p~1#1.offset] && 0 == #race[main_~p~1#1.base,1 + main_~p~1#1.offset]) && 0 == #race[main_~p~1#1.base,2 + main_~p~1#1.offset]) && 0 == #race[main_~p~1#1.base,3 + main_~p~1#1.offset]; [2025-02-08 05:32:42,907 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1262-1: assume !(((0 == #race[main_~p~1#1.base,main_~p~1#1.offset] && 0 == #race[main_~p~1#1.base,1 + main_~p~1#1.offset]) && 0 == #race[main_~p~1#1.base,2 + main_~p~1#1.offset]) && 0 == #race[main_~p~1#1.base,3 + main_~p~1#1.offset]); [2025-02-08 05:32:42,907 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1262-2: havoc main_#t~ret51#1; [2025-02-08 05:32:42,908 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1262-3: #race := #race[main_~p~1#1.base,3 + main_~p~1#1.offset := 0]; [2025-02-08 05:32:42,908 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1262-4: #race := #race[main_~p~1#1.base,2 + main_~p~1#1.offset := 0]; [2025-02-08 05:32:42,908 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1262-5: #race := #race[main_~p~1#1.base,1 + main_~p~1#1.offset := 0]; [2025-02-08 05:32:42,908 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1262-6: #race := #race[main_~p~1#1.base,main_~p~1#1.offset := 0]; [2025-02-08 05:32:42,908 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1262-7: SUMMARY for call main_#t~mem52#1 := read~int(main_~p~1#1.base, main_~p~1#1.offset, 4); srcloc: null [2025-02-08 05:32:42,908 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1262-8: havoc main_#t~ret51#1; [2025-02-08 05:32:42,908 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1263: havoc main_#t~ret53#1; [2025-02-08 05:32:42,908 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1263-1: [2025-02-08 05:32:42,908 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1263-2: SUMMARY for call main_#t~ret53#1 := #PthreadsMutexUnlock(~#mutex~0.base, ~#mutex~0.offset + 24 * main_~j~0#1); srcloc: null [2025-02-08 05:32:42,908 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1263-3: [2025-02-08 05:32:42,908 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1233: 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:42,908 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1233-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:42,908 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1234: havoc list_add_#t~mem33#1.base, list_add_#t~mem33#1.offset; [2025-02-08 05:32:42,908 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1234-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:42,908 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1234-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:42,908 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1234-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:42,909 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1234-3: #race := #race[list_add_~list#1.base,7 + list_add_~list#1.offset := 0]; [2025-02-08 05:32:42,909 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1234-4: #race := #race[list_add_~list#1.base,6 + list_add_~list#1.offset := 0]; [2025-02-08 05:32:42,909 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1234-5: #race := #race[list_add_~list#1.base,5 + list_add_~list#1.offset := 0]; [2025-02-08 05:32:42,909 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1234-6: #race := #race[list_add_~list#1.base,4 + list_add_~list#1.offset := 0]; [2025-02-08 05:32:42,909 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1234-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:42,909 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1235: 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:42,909 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1235: 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:42,909 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1235-1: havoc list_add_#t~nondet34#1; [2025-02-08 05:32:42,909 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1235-2: #race := #race[list_add_~list#1.base,7 + list_add_~list#1.offset := list_add_#t~nondet34#1]; [2025-02-08 05:32:42,909 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1235-3: #race := #race[list_add_~list#1.base,6 + list_add_~list#1.offset := list_add_#t~nondet34#1]; [2025-02-08 05:32:42,909 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1235-4: #race := #race[list_add_~list#1.base,5 + list_add_~list#1.offset := list_add_#t~nondet34#1]; [2025-02-08 05:32:42,909 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1235-5: #race := #race[list_add_~list#1.base,4 + list_add_~list#1.offset := list_add_#t~nondet34#1]; [2025-02-08 05:32:42,909 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1235-6: havoc list_add_#t~nondet34#1; [2025-02-08 05:32:42,909 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1235-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:42,909 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1236: 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:42,909 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1236: 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:42,909 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1236-1: havoc list_add_#t~nondet35#1; [2025-02-08 05:32:42,909 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1236-2: #race := #race[list_add_~node#1.base,7 + list_add_~node#1.offset := list_add_#t~nondet35#1]; [2025-02-08 05:32:42,909 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1236-3: #race := #race[list_add_~node#1.base,6 + list_add_~node#1.offset := list_add_#t~nondet35#1]; [2025-02-08 05:32:42,910 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1236-4: #race := #race[list_add_~node#1.base,5 + list_add_~node#1.offset := list_add_#t~nondet35#1]; [2025-02-08 05:32:42,910 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1236-5: #race := #race[list_add_~node#1.base,4 + list_add_~node#1.offset := list_add_#t~nondet35#1]; [2025-02-08 05:32:42,910 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1236-6: havoc list_add_#t~nondet35#1; [2025-02-08 05:32:42,910 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1236-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:42,910 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1253-1: havoc main_#t~post43#1; [2025-02-08 05:32:42,910 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1253-2: main_~j~0#1 := 1 + main_#t~post43#1; [2025-02-08 05:32:42,910 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1253-3: main_#t~post43#1 := main_~j~0#1; [2025-02-08 05:32:42,910 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1255: havoc main_#t~nondet42#1; [2025-02-08 05:32:42,910 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1255-1: assume ((#race[~#slot~0.base,~#slot~0.offset + 4 * main_~j~0#1] == main_#t~nondet42#1 && #race[~#slot~0.base,1 + (~#slot~0.offset + 4 * main_~j~0#1)] == main_#t~nondet42#1) && #race[~#slot~0.base,2 + (~#slot~0.offset + 4 * main_~j~0#1)] == main_#t~nondet42#1) && #race[~#slot~0.base,3 + (~#slot~0.offset + 4 * main_~j~0#1)] == main_#t~nondet42#1; [2025-02-08 05:32:42,910 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1255-1: assume !(((#race[~#slot~0.base,~#slot~0.offset + 4 * main_~j~0#1] == main_#t~nondet42#1 && #race[~#slot~0.base,1 + (~#slot~0.offset + 4 * main_~j~0#1)] == main_#t~nondet42#1) && #race[~#slot~0.base,2 + (~#slot~0.offset + 4 * main_~j~0#1)] == main_#t~nondet42#1) && #race[~#slot~0.base,3 + (~#slot~0.offset + 4 * main_~j~0#1)] == main_#t~nondet42#1); [2025-02-08 05:32:42,913 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1255-2: havoc main_#t~ret41#1.base, main_#t~ret41#1.offset; [2025-02-08 05:32:42,913 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1255-3: #race := #race[~#slot~0.base,3 + (~#slot~0.offset + 4 * main_~j~0#1) := main_#t~nondet42#1]; [2025-02-08 05:32:42,914 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1255-4: #race := #race[~#slot~0.base,2 + (~#slot~0.offset + 4 * main_~j~0#1) := main_#t~nondet42#1]; [2025-02-08 05:32:42,914 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1255-5: #race := #race[~#slot~0.base,1 + (~#slot~0.offset + 4 * main_~j~0#1) := main_#t~nondet42#1]; [2025-02-08 05:32:42,914 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1255-6: #race := #race[~#slot~0.base,~#slot~0.offset + 4 * main_~j~0#1 := main_#t~nondet42#1]; [2025-02-08 05:32:42,914 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1255-7: havoc main_#t~nondet42#1; [2025-02-08 05:32:42,914 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1255-8: SUMMARY for call write~$Pointer$(main_#t~ret41#1.base, main_#t~ret41#1.offset, ~#slot~0.base, ~#slot~0.offset + 4 * main_~j~0#1, 4); srcloc: null [2025-02-08 05:32:42,914 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1255-9: havoc new_#in~x#1;assume { :end_inline_new } true; [2025-02-08 05:32:42,914 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1255-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:42,914 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1255-11: main_#t~ret41#1.base, main_#t~ret41#1.offset := new_#res#1.base, new_#res#1.offset; [2025-02-08 05:32:43,016 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1245: havoc #t~ret39#1; [2025-02-08 05:32:43,016 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1245-1: [2025-02-08 05:32:43,017 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1245-2: SUMMARY for call #t~ret39#1 := #PthreadsMutexUnlock(~#mutex~0.base, ~#mutex~0.offset); srcloc: null [2025-02-08 05:32:43,017 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1245-3: [2025-02-08 05:32:43,017 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1233: 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:43,017 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1233-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:43,017 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1242-1: havoc #t~post40#1; [2025-02-08 05:32:43,017 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1242-2: ~i~0#1 := 1 + #t~post40#1; [2025-02-08 05:32:43,017 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1242-3: #t~post40#1 := ~i~0#1; [2025-02-08 05:32:43,017 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1234: havoc list_add_#t~mem33#1.base, list_add_#t~mem33#1.offset; [2025-02-08 05:32:43,017 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1234-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:43,017 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1234-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:43,017 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1234-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:43,017 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1234-3: #race := #race[list_add_~list#1.base,7 + list_add_~list#1.offset := 0]; [2025-02-08 05:32:43,017 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1234-4: #race := #race[list_add_~list#1.base,6 + list_add_~list#1.offset := 0]; [2025-02-08 05:32:43,017 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1234-5: #race := #race[list_add_~list#1.base,5 + list_add_~list#1.offset := 0]; [2025-02-08 05:32:43,017 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1234-6: #race := #race[list_add_~list#1.base,4 + list_add_~list#1.offset := 0]; [2025-02-08 05:32:43,017 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1234-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:43,018 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1235: 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:43,018 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1235: 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:43,018 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1235-1: havoc list_add_#t~nondet34#1; [2025-02-08 05:32:43,018 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1235-2: #race := #race[list_add_~list#1.base,7 + list_add_~list#1.offset := list_add_#t~nondet34#1]; [2025-02-08 05:32:43,018 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1235-3: #race := #race[list_add_~list#1.base,6 + list_add_~list#1.offset := list_add_#t~nondet34#1]; [2025-02-08 05:32:43,018 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1235-4: #race := #race[list_add_~list#1.base,5 + list_add_~list#1.offset := list_add_#t~nondet34#1]; [2025-02-08 05:32:43,018 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1235-5: #race := #race[list_add_~list#1.base,4 + list_add_~list#1.offset := list_add_#t~nondet34#1]; [2025-02-08 05:32:43,018 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1235-6: havoc list_add_#t~nondet34#1; [2025-02-08 05:32:43,018 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1235-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:43,018 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1244: havoc #t~mem38#1.base, #t~mem38#1.offset; [2025-02-08 05:32:43,018 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1244-1: assume { :end_inline_list_add } true;havoc #t~ret37#1.base, #t~ret37#1.offset; [2025-02-08 05:32:43,018 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1244-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:43,018 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1244-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:43,018 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1244-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:43,018 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1244-5: assume ((0 == #race[~#slot~0.base,~#slot~0.offset + 4 * ~i~0#1] && 0 == #race[~#slot~0.base,1 + (~#slot~0.offset + 4 * ~i~0#1)]) && 0 == #race[~#slot~0.base,2 + (~#slot~0.offset + 4 * ~i~0#1)]) && 0 == #race[~#slot~0.base,3 + (~#slot~0.offset + 4 * ~i~0#1)]; [2025-02-08 05:32:43,018 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1244-5: assume !(((0 == #race[~#slot~0.base,~#slot~0.offset + 4 * ~i~0#1] && 0 == #race[~#slot~0.base,1 + (~#slot~0.offset + 4 * ~i~0#1)]) && 0 == #race[~#slot~0.base,2 + (~#slot~0.offset + 4 * ~i~0#1)]) && 0 == #race[~#slot~0.base,3 + (~#slot~0.offset + 4 * ~i~0#1)]); [2025-02-08 05:32:43,018 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1244-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 := #t~ret37#1.base, #t~ret37#1.offset, #t~mem38#1.base, #t~mem38#1.offset; [2025-02-08 05:32:43,018 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1244-7: #race := #race[~#slot~0.base,3 + (~#slot~0.offset + 4 * ~i~0#1) := 0]; [2025-02-08 05:32:43,019 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1236: 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:43,019 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1236: 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:43,019 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1244-8: #race := #race[~#slot~0.base,2 + (~#slot~0.offset + 4 * ~i~0#1) := 0]; [2025-02-08 05:32:43,019 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1236-1: havoc list_add_#t~nondet35#1; [2025-02-08 05:32:43,019 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1244-9: #race := #race[~#slot~0.base,1 + (~#slot~0.offset + 4 * ~i~0#1) := 0]; [2025-02-08 05:32:43,019 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1236-2: #race := #race[list_add_~node#1.base,7 + list_add_~node#1.offset := list_add_#t~nondet35#1]; [2025-02-08 05:32:43,019 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1244-10: #race := #race[~#slot~0.base,~#slot~0.offset + 4 * ~i~0#1 := 0]; [2025-02-08 05:32:43,019 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1236-3: #race := #race[list_add_~node#1.base,6 + list_add_~node#1.offset := list_add_#t~nondet35#1]; [2025-02-08 05:32:43,019 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1244-11: SUMMARY for call #t~mem38#1.base, #t~mem38#1.offset := read~$Pointer$(~#slot~0.base, ~#slot~0.offset + 4 * ~i~0#1, 4); srcloc: null [2025-02-08 05:32:43,019 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1236-4: #race := #race[list_add_~node#1.base,5 + list_add_~node#1.offset := list_add_#t~nondet35#1]; [2025-02-08 05:32:43,019 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1244-12: havoc new_#in~x#1;assume { :end_inline_new } true; [2025-02-08 05:32:43,019 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1236-5: #race := #race[list_add_~node#1.base,4 + list_add_~node#1.offset := list_add_#t~nondet35#1]; [2025-02-08 05:32:43,019 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1244-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:43,019 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1236-6: havoc list_add_#t~nondet35#1; [2025-02-08 05:32:43,019 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1244-14: #t~ret37#1.base, #t~ret37#1.offset := new_#res#1.base, new_#res#1.offset; [2025-02-08 05:32:43,019 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1236-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:43,020 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:32:43,020 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:32:43,036 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:32:43,036 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:32:43,036 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:32:43 BoogieIcfgContainer [2025-02-08 05:32:43,036 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:32:43,039 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:32:43,039 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:32:43,043 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:32:43,043 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:32:41" (1/3) ... [2025-02-08 05:32:43,043 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@161339d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:32:43, skipping insertion in model container [2025-02-08 05:32:43,043 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:32:42" (2/3) ... [2025-02-08 05:32:43,043 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@161339d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:32:43, skipping insertion in model container [2025-02-08 05:32:43,043 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:32:43" (3/3) ... [2025-02-08 05:32:43,044 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_16-arrayloop_rc.i [2025-02-08 05:32:43,056 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:32:43,057 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09-regions_16-arrayloop_rc.i that has 2 procedures, 179 locations, 1 initial locations, 3 loop locations, and 18 error locations. [2025-02-08 05:32:43,058 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:32:43,121 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 05:32:43,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 182 places, 178 transitions, 360 flow [2025-02-08 05:32:43,242 INFO L124 PetriNetUnfolderBase]: 0/177 cut-off events. [2025-02-08 05:32:43,244 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:32:43,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 181 conditions, 177 events. 0/177 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 231 event pairs, 0 based on Foata normal form. 0/168 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2025-02-08 05:32:43,249 INFO L82 GeneralOperation]: Start removeDead. Operand has 182 places, 178 transitions, 360 flow [2025-02-08 05:32:43,253 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 178 places, 174 transitions, 351 flow [2025-02-08 05:32:43,264 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:32:43,277 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;@333a63d4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:32:43,277 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2025-02-08 05:32:43,303 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:32:43,303 INFO L124 PetriNetUnfolderBase]: 0/121 cut-off events. [2025-02-08 05:32:43,303 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:32:43,303 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:32:43,305 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] [2025-02-08 05:32:43,306 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-08 05:32:43,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:32:43,312 INFO L85 PathProgramCache]: Analyzing trace with hash -814498411, now seen corresponding path program 1 times [2025-02-08 05:32:43,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:32:43,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519520053] [2025-02-08 05:32:43,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:32:43,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:32:43,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-02-08 05:32:43,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-02-08 05:32:43,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:32:43,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:32:44,450 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:44,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:32:44,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519520053] [2025-02-08 05:32:44,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519520053] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:32:44,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:32:44,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:32:44,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008296567] [2025-02-08 05:32:44,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:32:44,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:32:44,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:32:44,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:32:44,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:32:44,793 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 178 [2025-02-08 05:32:44,802 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 174 transitions, 351 flow. Second operand has 6 states, 6 states have (on average 148.33333333333334) internal successors, (890), 6 states have internal predecessors, (890), 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:44,803 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:32:44,803 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 178 [2025-02-08 05:32:44,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:32:45,098 INFO L124 PetriNetUnfolderBase]: 132/592 cut-off events. [2025-02-08 05:32:45,098 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:32:45,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 896 conditions, 592 events. 132/592 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 2615 event pairs, 45 based on Foata normal form. 0/553 useless extension candidates. Maximal degree in co-relation 780. Up to 232 conditions per place. [2025-02-08 05:32:45,106 INFO L140 encePairwiseOnDemand]: 157/178 looper letters, 28 selfloop transitions, 43 changer transitions 0/214 dead transitions. [2025-02-08 05:32:45,107 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 214 transitions, 573 flow [2025-02-08 05:32:45,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:32:45,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:32:45,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 955 transitions. [2025-02-08 05:32:45,127 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8941947565543071 [2025-02-08 05:32:45,129 INFO L175 Difference]: Start difference. First operand has 178 places, 174 transitions, 351 flow. Second operand 6 states and 955 transitions. [2025-02-08 05:32:45,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 214 transitions, 573 flow [2025-02-08 05:32:45,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 214 transitions, 572 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:32:45,142 INFO L231 Difference]: Finished difference. Result has 186 places, 210 transitions, 622 flow [2025-02-08 05:32:45,145 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=178, PETRI_DIFFERENCE_MINUEND_FLOW=348, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=622, PETRI_PLACES=186, PETRI_TRANSITIONS=210} [2025-02-08 05:32:45,149 INFO L279 CegarLoopForPetriNet]: 178 programPoint places, 8 predicate places. [2025-02-08 05:32:45,150 INFO L471 AbstractCegarLoop]: Abstraction has has 186 places, 210 transitions, 622 flow [2025-02-08 05:32:45,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 148.33333333333334) internal successors, (890), 6 states have internal predecessors, (890), 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,151 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:32:45,151 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] [2025-02-08 05:32:45,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:32:45,152 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-08 05:32:45,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:32:45,153 INFO L85 PathProgramCache]: Analyzing trace with hash -2138428964, now seen corresponding path program 1 times [2025-02-08 05:32:45,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:32:45,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830630000] [2025-02-08 05:32:45,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:32:45,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:32:45,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-08 05:32:45,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-08 05:32:45,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:32:45,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:32:45,766 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,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:32:45,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830630000] [2025-02-08 05:32:45,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830630000] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:32:45,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:32:45,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:32:45,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638239233] [2025-02-08 05:32:45,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:32:45,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:32:45,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:32:45,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:32:45,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:32:45,993 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 178 [2025-02-08 05:32:45,994 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 210 transitions, 622 flow. Second operand has 6 states, 6 states have (on average 148.33333333333334) internal successors, (890), 6 states have internal predecessors, (890), 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,995 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:32:45,995 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 178 [2025-02-08 05:32:45,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:32:46,299 INFO L124 PetriNetUnfolderBase]: 215/805 cut-off events. [2025-02-08 05:32:46,299 INFO L125 PetriNetUnfolderBase]: For 197/200 co-relation queries the response was YES. [2025-02-08 05:32:46,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1612 conditions, 805 events. 215/805 cut-off events. For 197/200 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 3893 event pairs, 53 based on Foata normal form. 1/755 useless extension candidates. Maximal degree in co-relation 1485. Up to 314 conditions per place. [2025-02-08 05:32:46,306 INFO L140 encePairwiseOnDemand]: 158/178 looper letters, 56 selfloop transitions, 38 changer transitions 26/250 dead transitions. [2025-02-08 05:32:46,306 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 250 transitions, 968 flow [2025-02-08 05:32:46,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:32:46,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:32:46,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 953 transitions. [2025-02-08 05:32:46,309 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8923220973782772 [2025-02-08 05:32:46,309 INFO L175 Difference]: Start difference. First operand has 186 places, 210 transitions, 622 flow. Second operand 6 states and 953 transitions. [2025-02-08 05:32:46,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 250 transitions, 968 flow [2025-02-08 05:32:46,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 250 transitions, 968 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:32:46,321 INFO L231 Difference]: Finished difference. Result has 195 places, 220 transitions, 866 flow [2025-02-08 05:32:46,321 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=178, PETRI_DIFFERENCE_MINUEND_FLOW=620, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=866, PETRI_PLACES=195, PETRI_TRANSITIONS=220} [2025-02-08 05:32:46,322 INFO L279 CegarLoopForPetriNet]: 178 programPoint places, 17 predicate places. [2025-02-08 05:32:46,322 INFO L471 AbstractCegarLoop]: Abstraction has has 195 places, 220 transitions, 866 flow [2025-02-08 05:32:46,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 148.33333333333334) internal successors, (890), 6 states have internal predecessors, (890), 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,323 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:32:46,323 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:46,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:32:46,323 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-08 05:32:46,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:32:46,324 INFO L85 PathProgramCache]: Analyzing trace with hash 1023928118, now seen corresponding path program 1 times [2025-02-08 05:32:46,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:32:46,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570247015] [2025-02-08 05:32:46,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:32:46,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:32:46,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-08 05:32:46,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-08 05:32:46,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:32:46,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:32:46,431 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:46,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:32:46,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570247015] [2025-02-08 05:32:46,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570247015] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:32:46,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:32:46,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:32:46,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575971153] [2025-02-08 05:32:46,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:32:46,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:32:46,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:32:46,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:32:46,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:32:46,455 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 178 [2025-02-08 05:32:46,456 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 220 transitions, 866 flow. Second operand has 3 states, 3 states have (on average 170.0) internal successors, (510), 3 states have internal predecessors, (510), 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,456 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:32:46,456 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 178 [2025-02-08 05:32:46,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:32:46,461 INFO L124 PetriNetUnfolderBase]: 0/72 cut-off events. [2025-02-08 05:32:46,461 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:32:46,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87 conditions, 72 events. 0/72 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1. Compared 0 event pairs, 0 based on Foata normal form. 1/73 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2025-02-08 05:32:46,463 INFO L140 encePairwiseOnDemand]: 176/178 looper letters, 0 selfloop transitions, 0 changer transitions 72/72 dead transitions. [2025-02-08 05:32:46,463 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 72 transitions, 150 flow [2025-02-08 05:32:46,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:32:46,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:32:46,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 508 transitions. [2025-02-08 05:32:46,468 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.951310861423221 [2025-02-08 05:32:46,468 INFO L175 Difference]: Start difference. First operand has 195 places, 220 transitions, 866 flow. Second operand 3 states and 508 transitions. [2025-02-08 05:32:46,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 72 transitions, 150 flow [2025-02-08 05:32:46,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 72 transitions, 150 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:32:46,469 INFO L231 Difference]: Finished difference. Result has 85 places, 0 transitions, 0 flow [2025-02-08 05:32:46,469 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=178, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=85, PETRI_TRANSITIONS=0} [2025-02-08 05:32:46,472 INFO L279 CegarLoopForPetriNet]: 178 programPoint places, -93 predicate places. [2025-02-08 05:32:46,472 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 0 transitions, 0 flow [2025-02-08 05:32:46,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 170.0) internal successors, (510), 3 states have internal predecessors, (510), 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,475 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (8 of 9 remaining) [2025-02-08 05:32:46,475 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining) [2025-02-08 05:32:46,475 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining) [2025-02-08 05:32:46,475 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining) [2025-02-08 05:32:46,476 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 9 remaining) [2025-02-08 05:32:46,476 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr5ASSERT_VIOLATIONDATA_RACE (3 of 9 remaining) [2025-02-08 05:32:46,477 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr4ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining) [2025-02-08 05:32:46,477 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr5ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining) [2025-02-08 05:32:46,477 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr4ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining) [2025-02-08 05:32:46,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:32:46,477 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-02-08 05:32:46,482 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 05:32:46,482 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 05:32:46,489 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 05:32:46 BasicIcfg [2025-02-08 05:32:46,490 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 05:32:46,491 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 05:32:46,491 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 05:32:46,491 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 05:32:46,493 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:43" (3/4) ... [2025-02-08 05:32:46,494 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 05:32:46,497 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure t_fun [2025-02-08 05:32:46,501 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2025-02-08 05:32:46,502 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-08 05:32:46,502 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-08 05:32:46,582 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 05:32:46,583 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 05:32:46,583 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 05:32:46,584 INFO L158 Benchmark]: Toolchain (without parser) took 5097.57ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 110.8MB in the beginning and 262.0MB in the end (delta: -151.2MB). Peak memory consumption was 134.3MB. Max. memory is 16.1GB. [2025-02-08 05:32:46,585 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 201.3MB. Free memory is still 124.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:32:46,585 INFO L158 Benchmark]: CACSL2BoogieTranslator took 623.70ms. Allocated memory is still 142.6MB. Free memory was 110.4MB in the beginning and 70.1MB in the end (delta: 40.3MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-02-08 05:32:46,585 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.75ms. Allocated memory is still 142.6MB. Free memory was 70.1MB in the beginning and 65.6MB in the end (delta: 4.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:32:46,585 INFO L158 Benchmark]: Boogie Preprocessor took 42.91ms. Allocated memory is still 142.6MB. Free memory was 65.6MB in the beginning and 62.3MB in the end (delta: 3.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:32:46,586 INFO L158 Benchmark]: IcfgBuilder took 819.69ms. Allocated memory is still 142.6MB. Free memory was 62.3MB in the beginning and 93.4MB in the end (delta: -31.1MB). Peak memory consumption was 32.6MB. Max. memory is 16.1GB. [2025-02-08 05:32:46,586 INFO L158 Benchmark]: TraceAbstraction took 3451.92ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 92.7MB in the beginning and 266.3MB in the end (delta: -173.6MB). Peak memory consumption was 110.1MB. Max. memory is 16.1GB. [2025-02-08 05:32:46,586 INFO L158 Benchmark]: Witness Printer took 91.67ms. Allocated memory is still 427.8MB. Free memory was 266.3MB in the beginning and 262.0MB in the end (delta: 4.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:32:46,588 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.33ms. Allocated memory is still 201.3MB. Free memory is still 124.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 623.70ms. Allocated memory is still 142.6MB. Free memory was 110.4MB in the beginning and 70.1MB in the end (delta: 40.3MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.75ms. Allocated memory is still 142.6MB. Free memory was 70.1MB in the beginning and 65.6MB in the end (delta: 4.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 42.91ms. Allocated memory is still 142.6MB. Free memory was 65.6MB in the beginning and 62.3MB in the end (delta: 3.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 819.69ms. Allocated memory is still 142.6MB. Free memory was 62.3MB in the beginning and 93.4MB in the end (delta: -31.1MB). Peak memory consumption was 32.6MB. Max. memory is 16.1GB. * TraceAbstraction took 3451.92ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 92.7MB in the beginning and 266.3MB in the end (delta: -173.6MB). Peak memory consumption was 110.1MB. Max. memory is 16.1GB. * Witness Printer took 91.67ms. Allocated memory is still 427.8MB. Free memory was 266.3MB in the beginning and 262.0MB in the end (delta: 4.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1229]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1230]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1229]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1230]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1229]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1230]: 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, 216 locations, 9 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.3s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 248 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 136 mSDsluCounter, 15 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 116 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 619 IncrementalHoareTripleChecker+Invalid, 735 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 116 mSolverCounterUnsat, 15 mSDtfsCounter, 619 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=866occurred in iteration=2, InterpolantAutomatonStates: 15, 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.1s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 281 NumberOfCodeBlocks, 281 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 278 ConstructedInterpolants, 0 QuantifiedInterpolants, 450 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 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:46,604 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