./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/09-regions_11-arraylist_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_11-arraylist_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 c4f9d381010c40c0aeec814019363f065d1b11569cf33ee927950bcd4ef29f20 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:32:28,838 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:32:28,898 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:28,902 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:32:28,902 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:32:28,925 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:32:28,926 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:32:28,926 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:32:28,927 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:32:28,927 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:32:28,927 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:32:28,928 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:32:28,928 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:32:28,928 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:32:28,928 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:32:28,929 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:32:28,929 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:32:28,929 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:32:28,929 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:32:28,929 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:32:28,929 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:32:28,929 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:32:28,929 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:32:28,930 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:32:28,930 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:32:28,930 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:32:28,930 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:32:28,930 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:32:28,930 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:32:28,930 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:32:28,930 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:32:28,930 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:32:28,930 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:32:28,930 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:32:28,930 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:32:28,931 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:32:28,931 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:32:28,931 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:32:28,931 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:32:28,931 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:32:28,931 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:32:28,931 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:32:28,931 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 -> c4f9d381010c40c0aeec814019363f065d1b11569cf33ee927950bcd4ef29f20 [2025-02-08 05:32:29,137 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:32:29,143 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:32:29,144 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:32:29,145 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:32:29,145 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:32:29,146 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/09-regions_11-arraylist_nr.i [2025-02-08 05:32:30,277 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dbdb21712/2c757a612a8f4e6ab46a0bd285f144d1/FLAGab6ef1746 [2025-02-08 05:32:30,608 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:32:30,609 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_11-arraylist_nr.i [2025-02-08 05:32:30,627 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dbdb21712/2c757a612a8f4e6ab46a0bd285f144d1/FLAGab6ef1746 [2025-02-08 05:32:30,637 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dbdb21712/2c757a612a8f4e6ab46a0bd285f144d1 [2025-02-08 05:32:30,639 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:32:30,640 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:32:30,641 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:32:30,641 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:32:30,644 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:32:30,645 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:32:30" (1/1) ... [2025-02-08 05:32:30,646 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5867074e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:32:30, skipping insertion in model container [2025-02-08 05:32:30,646 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:32:30" (1/1) ... [2025-02-08 05:32:30,671 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:32:30,994 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:32:31,031 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:32:31,090 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:32:31,149 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:32:31,149 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:32:31 WrapperNode [2025-02-08 05:32:31,150 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:32:31,150 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:32:31,150 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:32:31,151 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:32:31,156 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:31" (1/1) ... [2025-02-08 05:32:31,179 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:31" (1/1) ... [2025-02-08 05:32:31,209 INFO L138 Inliner]: procedures = 372, calls = 88, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 294 [2025-02-08 05:32:31,210 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:32:31,210 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:32:31,210 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:32:31,210 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:32:31,215 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:31" (1/1) ... [2025-02-08 05:32:31,216 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:31" (1/1) ... [2025-02-08 05:32:31,220 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:31" (1/1) ... [2025-02-08 05:32:31,221 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:31" (1/1) ... [2025-02-08 05:32:31,234 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:31" (1/1) ... [2025-02-08 05:32:31,235 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:31" (1/1) ... [2025-02-08 05:32:31,239 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:31" (1/1) ... [2025-02-08 05:32:31,240 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:31" (1/1) ... [2025-02-08 05:32:31,243 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:32:31,244 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:32:31,244 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:32:31,244 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:32:31,245 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:32:31" (1/1) ... [2025-02-08 05:32:31,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:32:31,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:32:31,273 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:31,283 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:31,300 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-02-08 05:32:31,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-02-08 05:32:31,300 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-08 05:32:31,300 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 05:32:31,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 05:32:31,301 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-08 05:32:31,301 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 05:32:31,301 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:32:31,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-02-08 05:32:31,301 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-02-08 05:32:31,301 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-02-08 05:32:31,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:32:31,301 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:32:31,301 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:32:31,303 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:31,431 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:32:31,432 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:32:31,832 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1241: 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:31,833 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1241: 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:31,833 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1241-1: havoc list_add_#t~nondet35#1; [2025-02-08 05:32:31,833 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1241-2: #race := #race[list_add_~node#1.base,7 + list_add_~node#1.offset := list_add_#t~nondet35#1]; [2025-02-08 05:32:31,833 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1241-3: #race := #race[list_add_~node#1.base,6 + list_add_~node#1.offset := list_add_#t~nondet35#1]; [2025-02-08 05:32:31,833 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1241-4: #race := #race[list_add_~node#1.base,5 + list_add_~node#1.offset := list_add_#t~nondet35#1]; [2025-02-08 05:32:31,833 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1241-5: #race := #race[list_add_~node#1.base,4 + list_add_~node#1.offset := list_add_#t~nondet35#1]; [2025-02-08 05:32:31,833 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1241-6: havoc list_add_#t~nondet35#1; [2025-02-08 05:32:31,833 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1241-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:31,833 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1260-1: havoc main_#t~post47#1; [2025-02-08 05:32:31,833 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1260-2: main_~k~0#1 := 1 + main_#t~post47#1; [2025-02-08 05:32:31,833 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1260-3: main_#t~post47#1 := main_~k~0#1; [2025-02-08 05:32:31,833 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1261: havoc main_#t~nondet44#1; [2025-02-08 05:32:31,833 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1261-1: assume ((#race[~#slot~0.base,~#slot~0.offset + 4 * main_~k~0#1] == main_#t~nondet44#1 && #race[~#slot~0.base,1 + (~#slot~0.offset + 4 * main_~k~0#1)] == main_#t~nondet44#1) && #race[~#slot~0.base,2 + (~#slot~0.offset + 4 * main_~k~0#1)] == main_#t~nondet44#1) && #race[~#slot~0.base,3 + (~#slot~0.offset + 4 * main_~k~0#1)] == main_#t~nondet44#1; [2025-02-08 05:32:31,833 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1261-1: assume !(((#race[~#slot~0.base,~#slot~0.offset + 4 * main_~k~0#1] == main_#t~nondet44#1 && #race[~#slot~0.base,1 + (~#slot~0.offset + 4 * main_~k~0#1)] == main_#t~nondet44#1) && #race[~#slot~0.base,2 + (~#slot~0.offset + 4 * main_~k~0#1)] == main_#t~nondet44#1) && #race[~#slot~0.base,3 + (~#slot~0.offset + 4 * main_~k~0#1)] == main_#t~nondet44#1); [2025-02-08 05:32:31,833 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1261-2: havoc main_#t~ret43#1.base, main_#t~ret43#1.offset; [2025-02-08 05:32:31,833 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1261-3: #race := #race[~#slot~0.base,3 + (~#slot~0.offset + 4 * main_~k~0#1) := main_#t~nondet44#1]; [2025-02-08 05:32:31,834 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1261-4: #race := #race[~#slot~0.base,2 + (~#slot~0.offset + 4 * main_~k~0#1) := main_#t~nondet44#1]; [2025-02-08 05:32:31,834 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1261-5: #race := #race[~#slot~0.base,1 + (~#slot~0.offset + 4 * main_~k~0#1) := main_#t~nondet44#1]; [2025-02-08 05:32:31,834 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1261-6: #race := #race[~#slot~0.base,~#slot~0.offset + 4 * main_~k~0#1 := main_#t~nondet44#1]; [2025-02-08 05:32:31,834 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1261-7: havoc main_#t~nondet44#1; [2025-02-08 05:32:31,834 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1261-8: SUMMARY for call write~$Pointer$(main_#t~ret43#1.base, main_#t~ret43#1.offset, ~#slot~0.base, ~#slot~0.offset + 4 * main_~k~0#1, 4); srcloc: null [2025-02-08 05:32:31,834 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1261-9: havoc new_#in~x#1;assume { :end_inline_new } true; [2025-02-08 05:32:31,834 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1261-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:31,834 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1261-11: main_#t~ret43#1.base, main_#t~ret43#1.offset := new_#res#1.base, new_#res#1.offset; [2025-02-08 05:32:31,834 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1262: havoc main_#t~mem46#1.base, main_#t~mem46#1.offset; [2025-02-08 05:32:31,834 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1262-1: assume { :end_inline_list_add } true;havoc main_#t~ret45#1.base, main_#t~ret45#1.offset; [2025-02-08 05:32:31,834 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1262-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:31,834 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1262-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:31,834 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1262-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:31,834 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1262-5: assume ((0 == #race[~#slot~0.base,~#slot~0.offset + 4 * main_~k~0#1] && 0 == #race[~#slot~0.base,1 + (~#slot~0.offset + 4 * main_~k~0#1)]) && 0 == #race[~#slot~0.base,2 + (~#slot~0.offset + 4 * main_~k~0#1)]) && 0 == #race[~#slot~0.base,3 + (~#slot~0.offset + 4 * main_~k~0#1)]; [2025-02-08 05:32:31,834 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1262-5: assume !(((0 == #race[~#slot~0.base,~#slot~0.offset + 4 * main_~k~0#1] && 0 == #race[~#slot~0.base,1 + (~#slot~0.offset + 4 * main_~k~0#1)]) && 0 == #race[~#slot~0.base,2 + (~#slot~0.offset + 4 * main_~k~0#1)]) && 0 == #race[~#slot~0.base,3 + (~#slot~0.offset + 4 * main_~k~0#1)]); [2025-02-08 05:32:31,834 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1262-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:31,834 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1262-7: #race := #race[~#slot~0.base,3 + (~#slot~0.offset + 4 * main_~k~0#1) := 0]; [2025-02-08 05:32:31,834 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1262-8: #race := #race[~#slot~0.base,2 + (~#slot~0.offset + 4 * main_~k~0#1) := 0]; [2025-02-08 05:32:31,834 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1262-9: #race := #race[~#slot~0.base,1 + (~#slot~0.offset + 4 * main_~k~0#1) := 0]; [2025-02-08 05:32:31,834 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1262-10: #race := #race[~#slot~0.base,~#slot~0.offset + 4 * main_~k~0#1 := 0]; [2025-02-08 05:32:31,834 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1262-11: SUMMARY for call main_#t~mem46#1.base, main_#t~mem46#1.offset := read~$Pointer$(~#slot~0.base, ~#slot~0.offset + 4 * main_~k~0#1, 4); srcloc: null [2025-02-08 05:32:31,834 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1262-12: havoc new_#in~x#1;assume { :end_inline_new } true; [2025-02-08 05:32:31,834 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1262-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:31,834 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1262-14: main_#t~ret45#1.base, main_#t~ret45#1.offset := new_#res#1.base, new_#res#1.offset; [2025-02-08 05:32:31,834 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1262-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:31,834 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1262-16: havoc new_#res#1.base, new_#res#1.offset; [2025-02-08 05:32:31,835 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1262-17: assume { :begin_inline_new } true;new_#in~x#1 := 2; [2025-02-08 05:32:31,835 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1232: new_~x#1 := new_#in~x#1; [2025-02-08 05:32:31,835 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1233: havoc new_#t~malloc30#1.base, new_#t~malloc30#1.offset; [2025-02-08 05:32:31,835 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1233-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:31,835 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1233-2: SUMMARY for call new_#t~malloc30#1.base, new_#t~malloc30#1.offset := #Ultimate.allocOnHeap(8); srcloc: null [2025-02-08 05:32:31,835 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1234: 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:31,835 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1234: 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:31,835 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1234-1: havoc new_#t~nondet31#1; [2025-02-08 05:32:31,835 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1234-2: #race := #race[new_~p~0#1.base,3 + new_~p~0#1.offset := new_#t~nondet31#1]; [2025-02-08 05:32:31,835 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1234-3: #race := #race[new_~p~0#1.base,2 + new_~p~0#1.offset := new_#t~nondet31#1]; [2025-02-08 05:32:31,835 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1234-4: #race := #race[new_~p~0#1.base,1 + new_~p~0#1.offset := new_#t~nondet31#1]; [2025-02-08 05:32:31,835 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1234-5: #race := #race[new_~p~0#1.base,new_~p~0#1.offset := new_#t~nondet31#1]; [2025-02-08 05:32:31,835 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1234-6: havoc new_#t~nondet31#1; [2025-02-08 05:32:31,835 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1234-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:31,835 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1235: 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:31,835 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1235: 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:31,835 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1235-1: havoc new_#t~nondet32#1; [2025-02-08 05:32:31,835 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1235-2: #race := #race[new_~p~0#1.base,7 + new_~p~0#1.offset := new_#t~nondet32#1]; [2025-02-08 05:32:31,835 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1235-3: #race := #race[new_~p~0#1.base,6 + new_~p~0#1.offset := new_#t~nondet32#1]; [2025-02-08 05:32:31,835 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1235-4: #race := #race[new_~p~0#1.base,5 + new_~p~0#1.offset := new_#t~nondet32#1]; [2025-02-08 05:32:31,836 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1235-5: #race := #race[new_~p~0#1.base,4 + new_~p~0#1.offset := new_#t~nondet32#1]; [2025-02-08 05:32:31,837 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1235-6: havoc new_#t~nondet32#1; [2025-02-08 05:32:31,837 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1235-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:31,837 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1236-1: new_#res#1.base, new_#res#1.offset := new_~p~0#1.base, new_~p~0#1.offset; [2025-02-08 05:32:31,837 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1238: 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:31,837 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1238-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:31,837 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1239: havoc list_add_#t~mem33#1.base, list_add_#t~mem33#1.offset; [2025-02-08 05:32:31,837 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1239-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:31,837 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1239-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:31,837 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1239-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:31,837 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1239-3: #race := #race[list_add_~list#1.base,7 + list_add_~list#1.offset := 0]; [2025-02-08 05:32:31,837 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1239-4: #race := #race[list_add_~list#1.base,6 + list_add_~list#1.offset := 0]; [2025-02-08 05:32:31,837 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1239-5: #race := #race[list_add_~list#1.base,5 + list_add_~list#1.offset := 0]; [2025-02-08 05:32:31,837 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1239-6: #race := #race[list_add_~list#1.base,4 + list_add_~list#1.offset := 0]; [2025-02-08 05:32:31,837 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1239-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:31,837 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1240: 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:31,837 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1240: 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:31,837 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1240-1: havoc list_add_#t~nondet34#1; [2025-02-08 05:32:31,837 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1240-2: #race := #race[list_add_~list#1.base,7 + list_add_~list#1.offset := list_add_#t~nondet34#1]; [2025-02-08 05:32:31,837 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1240-3: #race := #race[list_add_~list#1.base,6 + list_add_~list#1.offset := list_add_#t~nondet34#1]; [2025-02-08 05:32:31,837 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1240-4: #race := #race[list_add_~list#1.base,5 + list_add_~list#1.offset := list_add_#t~nondet34#1]; [2025-02-08 05:32:31,837 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1240-5: #race := #race[list_add_~list#1.base,4 + list_add_~list#1.offset := list_add_#t~nondet34#1]; [2025-02-08 05:32:31,837 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1240-6: havoc list_add_#t~nondet34#1; [2025-02-08 05:32:31,837 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1240-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:31,912 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:32:31,912 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:32:31,929 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:32:31,929 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:32:31,929 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:32:31 BoogieIcfgContainer [2025-02-08 05:32:31,929 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:32:31,931 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:32:31,931 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:32:31,935 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:32:31,935 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:32:30" (1/3) ... [2025-02-08 05:32:31,935 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63a234ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:32:31, skipping insertion in model container [2025-02-08 05:32:31,935 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:32:31" (2/3) ... [2025-02-08 05:32:31,936 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63a234ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:32:31, skipping insertion in model container [2025-02-08 05:32:31,936 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:32:31" (3/3) ... [2025-02-08 05:32:31,936 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_11-arraylist_nr.i [2025-02-08 05:32:31,946 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:32:31,947 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09-regions_11-arraylist_nr.i that has 2 procedures, 250 locations, 1 initial locations, 2 loop locations, and 18 error locations. [2025-02-08 05:32:31,948 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:32:32,005 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 05:32:32,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 253 places, 252 transitions, 508 flow [2025-02-08 05:32:32,086 INFO L124 PetriNetUnfolderBase]: 3/251 cut-off events. [2025-02-08 05:32:32,088 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:32:32,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 255 conditions, 251 events. 3/251 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 219 event pairs, 0 based on Foata normal form. 0/236 useless extension candidates. Maximal degree in co-relation 127. Up to 2 conditions per place. [2025-02-08 05:32:32,092 INFO L82 GeneralOperation]: Start removeDead. Operand has 253 places, 252 transitions, 508 flow [2025-02-08 05:32:32,095 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 249 places, 248 transitions, 499 flow [2025-02-08 05:32:32,100 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:32:32,107 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;@14b82e49, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:32:32,108 INFO L334 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2025-02-08 05:32:32,125 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:32:32,126 INFO L124 PetriNetUnfolderBase]: 2/128 cut-off events. [2025-02-08 05:32:32,126 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:32:32,126 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:32:32,126 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:32:32,127 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:32,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:32:32,131 INFO L85 PathProgramCache]: Analyzing trace with hash 35533917, now seen corresponding path program 1 times [2025-02-08 05:32:32,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:32:32,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898281016] [2025-02-08 05:32:32,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:32:32,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:32:32,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-08 05:32:32,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-08 05:32:32,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:32:32,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:32:32,453 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:32,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:32:32,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898281016] [2025-02-08 05:32:32,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898281016] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:32:32,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:32:32,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:32:32,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036722340] [2025-02-08 05:32:32,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:32:32,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:32:32,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:32:32,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:32:32,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:32:32,502 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 239 out of 252 [2025-02-08 05:32:32,508 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 248 transitions, 499 flow. Second operand has 3 states, 3 states have (on average 240.33333333333334) internal successors, (721), 3 states have internal predecessors, (721), 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:32,508 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:32:32,508 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 239 of 252 [2025-02-08 05:32:32,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:32:32,574 INFO L124 PetriNetUnfolderBase]: 7/326 cut-off events. [2025-02-08 05:32:32,574 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:32:32,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 355 conditions, 326 events. 7/326 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 501 event pairs, 6 based on Foata normal form. 5/308 useless extension candidates. Maximal degree in co-relation 219. Up to 24 conditions per place. [2025-02-08 05:32:32,576 INFO L140 encePairwiseOnDemand]: 247/252 looper letters, 10 selfloop transitions, 2 changer transitions 1/247 dead transitions. [2025-02-08 05:32:32,576 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 247 transitions, 521 flow [2025-02-08 05:32:32,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:32:32,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:32:32,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 732 transitions. [2025-02-08 05:32:32,586 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9682539682539683 [2025-02-08 05:32:32,587 INFO L175 Difference]: Start difference. First operand has 249 places, 248 transitions, 499 flow. Second operand 3 states and 732 transitions. [2025-02-08 05:32:32,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 247 transitions, 521 flow [2025-02-08 05:32:32,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 247 transitions, 520 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:32:32,596 INFO L231 Difference]: Finished difference. Result has 251 places, 246 transitions, 504 flow [2025-02-08 05:32:32,598 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=494, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=244, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=504, PETRI_PLACES=251, PETRI_TRANSITIONS=246} [2025-02-08 05:32:32,601 INFO L279 CegarLoopForPetriNet]: 249 programPoint places, 2 predicate places. [2025-02-08 05:32:32,601 INFO L471 AbstractCegarLoop]: Abstraction has has 251 places, 246 transitions, 504 flow [2025-02-08 05:32:32,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 240.33333333333334) internal successors, (721), 3 states have internal predecessors, (721), 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:32,601 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:32:32,602 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:32:32,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:32:32,602 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:32,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:32:32,605 INFO L85 PathProgramCache]: Analyzing trace with hash -2130272886, now seen corresponding path program 1 times [2025-02-08 05:32:32,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:32:32,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979493005] [2025-02-08 05:32:32,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:32:32,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:32:32,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-08 05:32:32,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-08 05:32:32,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:32:32,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:32:32,767 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:32,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:32:32,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979493005] [2025-02-08 05:32:32,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979493005] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:32:32,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [395363476] [2025-02-08 05:32:32,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:32:32,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:32:32,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:32:32,772 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:32,777 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:32,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-08 05:32:32,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-08 05:32:32,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:32:32,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:32:32,866 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 05:32:32,870 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:32:32,910 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:32,910 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 05:32:32,943 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:32,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [395363476] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 05:32:32,943 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 05:32:32,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-02-08 05:32:32,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672385248] [2025-02-08 05:32:32,946 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 05:32:32,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 05:32:32,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:32:32,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 05:32:32,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-08 05:32:32,971 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 252 [2025-02-08 05:32:32,974 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 246 transitions, 504 flow. Second operand has 10 states, 10 states have (on average 237.8) internal successors, (2378), 10 states have internal predecessors, (2378), 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:32,974 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:32:32,974 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 252 [2025-02-08 05:32:32,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:32:33,054 INFO L124 PetriNetUnfolderBase]: 7/332 cut-off events. [2025-02-08 05:32:33,054 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:32:33,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 379 conditions, 332 events. 7/332 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. 2/312 useless extension candidates. Maximal degree in co-relation 294. Up to 24 conditions per place. [2025-02-08 05:32:33,056 INFO L140 encePairwiseOnDemand]: 246/252 looper letters, 14 selfloop transitions, 9 changer transitions 0/254 dead transitions. [2025-02-08 05:32:33,056 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 254 transitions, 568 flow [2025-02-08 05:32:33,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 05:32:33,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-08 05:32:33,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2149 transitions. [2025-02-08 05:32:33,060 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9475308641975309 [2025-02-08 05:32:33,060 INFO L175 Difference]: Start difference. First operand has 251 places, 246 transitions, 504 flow. Second operand 9 states and 2149 transitions. [2025-02-08 05:32:33,060 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 254 transitions, 568 flow [2025-02-08 05:32:33,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 254 transitions, 566 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:32:33,064 INFO L231 Difference]: Finished difference. Result has 260 places, 252 transitions, 552 flow [2025-02-08 05:32:33,065 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=502, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=552, PETRI_PLACES=260, PETRI_TRANSITIONS=252} [2025-02-08 05:32:33,065 INFO L279 CegarLoopForPetriNet]: 249 programPoint places, 11 predicate places. [2025-02-08 05:32:33,065 INFO L471 AbstractCegarLoop]: Abstraction has has 260 places, 252 transitions, 552 flow [2025-02-08 05:32:33,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 237.8) internal successors, (2378), 10 states have internal predecessors, (2378), 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:33,067 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:32:33,067 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:32:33,077 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-08 05:32:33,271 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:33,271 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:33,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:32:33,273 INFO L85 PathProgramCache]: Analyzing trace with hash -2094105238, now seen corresponding path program 2 times [2025-02-08 05:32:33,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:32:33,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160875873] [2025-02-08 05:32:33,273 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 05:32:33,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:32:33,300 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 114 statements into 2 equivalence classes. [2025-02-08 05:32:33,315 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 99 of 114 statements. [2025-02-08 05:32:33,317 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 05:32:33,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:32:33,828 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:33,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:32:33,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160875873] [2025-02-08 05:32:33,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160875873] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:32:33,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:32:33,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:32:33,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398774071] [2025-02-08 05:32:33,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:32:33,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:32:33,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:32:33,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:32:33,832 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:32:34,052 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 252 [2025-02-08 05:32:34,054 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 252 transitions, 552 flow. Second operand has 6 states, 6 states have (on average 200.33333333333334) internal successors, (1202), 6 states have internal predecessors, (1202), 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:34,055 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:32:34,055 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 252 [2025-02-08 05:32:34,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:32:34,372 INFO L124 PetriNetUnfolderBase]: 365/1617 cut-off events. [2025-02-08 05:32:34,373 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-02-08 05:32:34,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2428 conditions, 1617 events. 365/1617 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 9320 event pairs, 364 based on Foata normal form. 0/1498 useless extension candidates. Maximal degree in co-relation 2315. Up to 774 conditions per place. [2025-02-08 05:32:34,388 INFO L140 encePairwiseOnDemand]: 246/252 looper letters, 45 selfloop transitions, 5 changer transitions 0/251 dead transitions. [2025-02-08 05:32:34,388 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 251 transitions, 650 flow [2025-02-08 05:32:34,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:32:34,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:32:34,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1245 transitions. [2025-02-08 05:32:34,393 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8234126984126984 [2025-02-08 05:32:34,393 INFO L175 Difference]: Start difference. First operand has 260 places, 252 transitions, 552 flow. Second operand 6 states and 1245 transitions. [2025-02-08 05:32:34,393 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 264 places, 251 transitions, 650 flow [2025-02-08 05:32:34,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 251 transitions, 644 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-02-08 05:32:34,403 INFO L231 Difference]: Finished difference. Result has 263 places, 251 transitions, 554 flow [2025-02-08 05:32:34,404 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=544, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=251, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=246, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=554, PETRI_PLACES=263, PETRI_TRANSITIONS=251} [2025-02-08 05:32:34,405 INFO L279 CegarLoopForPetriNet]: 249 programPoint places, 14 predicate places. [2025-02-08 05:32:34,405 INFO L471 AbstractCegarLoop]: Abstraction has has 263 places, 251 transitions, 554 flow [2025-02-08 05:32:34,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 200.33333333333334) internal successors, (1202), 6 states have internal predecessors, (1202), 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:34,406 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:32:34,407 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:32:34,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:32:34,407 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:34,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:32:34,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1639147499, now seen corresponding path program 1 times [2025-02-08 05:32:34,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:32:34,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785674458] [2025-02-08 05:32:34,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:32:34,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:32:34,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-02-08 05:32:34,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-02-08 05:32:34,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:32:34,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:32:34,509 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:34,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:32:34,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785674458] [2025-02-08 05:32:34,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785674458] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:32:34,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:32:34,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:32:34,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584475917] [2025-02-08 05:32:34,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:32:34,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:32:34,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:32:34,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:32:34,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:32:34,519 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 240 out of 252 [2025-02-08 05:32:34,520 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 251 transitions, 554 flow. Second operand has 3 states, 3 states have (on average 242.0) internal successors, (726), 3 states have internal predecessors, (726), 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:34,520 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:32:34,520 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 240 of 252 [2025-02-08 05:32:34,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:32:34,531 INFO L124 PetriNetUnfolderBase]: 1/123 cut-off events. [2025-02-08 05:32:34,532 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-08 05:32:34,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159 conditions, 123 events. 1/123 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/124 useless extension candidates. Maximal degree in co-relation 134. Up to 5 conditions per place. [2025-02-08 05:32:34,532 INFO L140 encePairwiseOnDemand]: 250/252 looper letters, 1 selfloop transitions, 1 changer transitions 0/119 dead transitions. [2025-02-08 05:32:34,532 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 119 transitions, 292 flow [2025-02-08 05:32:34,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:32:34,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:32:34,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 723 transitions. [2025-02-08 05:32:34,534 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9563492063492064 [2025-02-08 05:32:34,534 INFO L175 Difference]: Start difference. First operand has 263 places, 251 transitions, 554 flow. Second operand 3 states and 723 transitions. [2025-02-08 05:32:34,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 119 transitions, 292 flow [2025-02-08 05:32:34,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 119 transitions, 282 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:32:34,537 INFO L231 Difference]: Finished difference. Result has 126 places, 119 transitions, 280 flow [2025-02-08 05:32:34,537 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=280, PETRI_PLACES=126, PETRI_TRANSITIONS=119} [2025-02-08 05:32:34,537 INFO L279 CegarLoopForPetriNet]: 249 programPoint places, -123 predicate places. [2025-02-08 05:32:34,537 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 119 transitions, 280 flow [2025-02-08 05:32:34,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 242.0) internal successors, (726), 3 states have internal predecessors, (726), 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:34,538 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:32:34,538 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:32:34,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:32:34,538 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:34,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:32:34,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1287890993, now seen corresponding path program 1 times [2025-02-08 05:32:34,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:32:34,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070452136] [2025-02-08 05:32:34,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:32:34,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:32:34,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-02-08 05:32:34,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-02-08 05:32:34,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:32:34,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:32:34,674 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:34,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:32:34,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070452136] [2025-02-08 05:32:34,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070452136] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:32:34,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1787347870] [2025-02-08 05:32:34,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:32:34,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:32:34,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:32:34,681 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:34,682 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:34,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-02-08 05:32:34,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-02-08 05:32:34,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:32:34,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:32:34,771 INFO L256 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-08 05:32:34,773 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:32:34,808 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:34,808 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 05:32:34,884 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:34,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1787347870] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 05:32:34,885 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 05:32:34,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-02-08 05:32:34,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019613368] [2025-02-08 05:32:34,885 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 05:32:34,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-08 05:32:34,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:32:34,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-08 05:32:34,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-02-08 05:32:34,911 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 252 [2025-02-08 05:32:34,915 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 119 transitions, 280 flow. Second operand has 18 states, 18 states have (on average 237.88888888888889) internal successors, (4282), 18 states have internal predecessors, (4282), 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:34,915 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:32:34,915 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 252 [2025-02-08 05:32:34,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:32:35,051 INFO L124 PetriNetUnfolderBase]: 1/143 cut-off events. [2025-02-08 05:32:35,051 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2025-02-08 05:32:35,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 230 conditions, 143 events. 1/143 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/147 useless extension candidates. Maximal degree in co-relation 198. Up to 11 conditions per place. [2025-02-08 05:32:35,052 INFO L140 encePairwiseOnDemand]: 246/252 looper letters, 12 selfloop transitions, 21 changer transitions 0/137 dead transitions. [2025-02-08 05:32:35,052 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 137 transitions, 434 flow [2025-02-08 05:32:35,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-08 05:32:35,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-02-08 05:32:35,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 4993 transitions. [2025-02-08 05:32:35,059 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9434996220710506 [2025-02-08 05:32:35,059 INFO L175 Difference]: Start difference. First operand has 126 places, 119 transitions, 280 flow. Second operand 21 states and 4993 transitions. [2025-02-08 05:32:35,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 137 transitions, 434 flow [2025-02-08 05:32:35,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 137 transitions, 433 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:32:35,061 INFO L231 Difference]: Finished difference. Result has 150 places, 132 transitions, 409 flow [2025-02-08 05:32:35,062 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=279, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=409, PETRI_PLACES=150, PETRI_TRANSITIONS=132} [2025-02-08 05:32:35,062 INFO L279 CegarLoopForPetriNet]: 249 programPoint places, -99 predicate places. [2025-02-08 05:32:35,062 INFO L471 AbstractCegarLoop]: Abstraction has has 150 places, 132 transitions, 409 flow [2025-02-08 05:32:35,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 237.88888888888889) internal successors, (4282), 18 states have internal predecessors, (4282), 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:35,065 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:32:35,065 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:32:35,074 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-08 05:32:35,269 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:35,269 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:35,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:32:35,270 INFO L85 PathProgramCache]: Analyzing trace with hash -1560109071, now seen corresponding path program 2 times [2025-02-08 05:32:35,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:32:35,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729914105] [2025-02-08 05:32:35,270 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 05:32:35,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:32:35,283 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 142 statements into 2 equivalence classes. [2025-02-08 05:32:35,289 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 107 of 142 statements. [2025-02-08 05:32:35,289 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 05:32:35,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:32:35,565 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-02-08 05:32:35,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:32:35,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729914105] [2025-02-08 05:32:35,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729914105] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:32:35,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:32:35,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:32:35,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357914756] [2025-02-08 05:32:35,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:32:35,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:32:35,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:32:35,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:32:35,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:32:35,758 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 252 [2025-02-08 05:32:35,760 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 132 transitions, 409 flow. Second operand has 6 states, 6 states have (on average 200.33333333333334) internal successors, (1202), 6 states have internal predecessors, (1202), 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:35,760 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:32:35,760 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 252 [2025-02-08 05:32:35,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:32:35,774 INFO L124 PetriNetUnfolderBase]: 1/142 cut-off events. [2025-02-08 05:32:35,774 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2025-02-08 05:32:35,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 244 conditions, 142 events. 1/142 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/143 useless extension candidates. Maximal degree in co-relation 207. Up to 11 conditions per place. [2025-02-08 05:32:35,775 INFO L140 encePairwiseOnDemand]: 247/252 looper letters, 0 selfloop transitions, 0 changer transitions 131/131 dead transitions. [2025-02-08 05:32:35,775 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 131 transitions, 421 flow [2025-02-08 05:32:35,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:32:35,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:32:35,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1202 transitions. [2025-02-08 05:32:35,777 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.794973544973545 [2025-02-08 05:32:35,777 INFO L175 Difference]: Start difference. First operand has 150 places, 132 transitions, 409 flow. Second operand 6 states and 1202 transitions. [2025-02-08 05:32:35,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 131 transitions, 421 flow [2025-02-08 05:32:35,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 131 transitions, 397 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-02-08 05:32:35,780 INFO L231 Difference]: Finished difference. Result has 148 places, 0 transitions, 0 flow [2025-02-08 05:32:35,780 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=383, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=0, PETRI_PLACES=148, PETRI_TRANSITIONS=0} [2025-02-08 05:32:35,780 INFO L279 CegarLoopForPetriNet]: 249 programPoint places, -101 predicate places. [2025-02-08 05:32:35,781 INFO L471 AbstractCegarLoop]: Abstraction has has 148 places, 0 transitions, 0 flow [2025-02-08 05:32:35,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 200.33333333333334) internal successors, (1202), 6 states have internal predecessors, (1202), 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:35,783 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (17 of 18 remaining) [2025-02-08 05:32:35,784 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (16 of 18 remaining) [2025-02-08 05:32:35,784 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (15 of 18 remaining) [2025-02-08 05:32:35,784 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (14 of 18 remaining) [2025-02-08 05:32:35,784 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (13 of 18 remaining) [2025-02-08 05:32:35,784 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 18 remaining) [2025-02-08 05:32:35,784 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr5ASSERT_VIOLATIONDATA_RACE (11 of 18 remaining) [2025-02-08 05:32:35,784 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr4ASSERT_VIOLATIONDATA_RACE (10 of 18 remaining) [2025-02-08 05:32:35,784 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr3ASSERT_VIOLATIONDATA_RACE (9 of 18 remaining) [2025-02-08 05:32:35,784 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONDATA_RACE (8 of 18 remaining) [2025-02-08 05:32:35,784 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (7 of 18 remaining) [2025-02-08 05:32:35,784 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (6 of 18 remaining) [2025-02-08 05:32:35,784 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr5ASSERT_VIOLATIONDATA_RACE (5 of 18 remaining) [2025-02-08 05:32:35,784 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr4ASSERT_VIOLATIONDATA_RACE (4 of 18 remaining) [2025-02-08 05:32:35,784 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr3ASSERT_VIOLATIONDATA_RACE (3 of 18 remaining) [2025-02-08 05:32:35,784 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONDATA_RACE (2 of 18 remaining) [2025-02-08 05:32:35,784 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (1 of 18 remaining) [2025-02-08 05:32:35,784 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 18 remaining) [2025-02-08 05:32:35,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:32:35,785 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1] [2025-02-08 05:32:35,788 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 05:32:35,789 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 05:32:35,792 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 05:32:35 BasicIcfg [2025-02-08 05:32:35,792 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 05:32:35,793 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 05:32:35,793 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 05:32:35,793 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 05:32:35,793 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:31" (3/4) ... [2025-02-08 05:32:35,794 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 05:32:35,797 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure t_fun [2025-02-08 05:32:35,799 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2025-02-08 05:32:35,800 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-02-08 05:32:35,800 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-02-08 05:32:35,851 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 05:32:35,851 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 05:32:35,851 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 05:32:35,852 INFO L158 Benchmark]: Toolchain (without parser) took 5211.59ms. Allocated memory was 142.6MB in the beginning and 310.4MB in the end (delta: 167.8MB). Free memory was 105.8MB in the beginning and 120.4MB in the end (delta: -14.6MB). Peak memory consumption was 151.6MB. Max. memory is 16.1GB. [2025-02-08 05:32:35,852 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 116.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:32:35,852 INFO L158 Benchmark]: CACSL2BoogieTranslator took 508.59ms. Allocated memory is still 142.6MB. Free memory was 105.8MB in the beginning and 65.1MB in the end (delta: 40.6MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-02-08 05:32:35,852 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.51ms. Allocated memory is still 142.6MB. Free memory was 65.1MB in the beginning and 60.7MB in the end (delta: 4.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:32:35,853 INFO L158 Benchmark]: Boogie Preprocessor took 33.41ms. Allocated memory is still 142.6MB. Free memory was 60.7MB in the beginning and 57.4MB in the end (delta: 3.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:32:35,853 INFO L158 Benchmark]: IcfgBuilder took 685.19ms. Allocated memory is still 142.6MB. Free memory was 57.4MB in the beginning and 86.7MB in the end (delta: -29.3MB). Peak memory consumption was 33.0MB. Max. memory is 16.1GB. [2025-02-08 05:32:35,853 INFO L158 Benchmark]: TraceAbstraction took 3860.74ms. Allocated memory was 142.6MB in the beginning and 310.4MB in the end (delta: 167.8MB). Free memory was 86.2MB in the beginning and 128.8MB in the end (delta: -42.5MB). Peak memory consumption was 127.0MB. Max. memory is 16.1GB. [2025-02-08 05:32:35,853 INFO L158 Benchmark]: Witness Printer took 58.67ms. Allocated memory is still 310.4MB. Free memory was 128.8MB in the beginning and 120.4MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:32:35,854 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 116.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 508.59ms. Allocated memory is still 142.6MB. Free memory was 105.8MB in the beginning and 65.1MB in the end (delta: 40.6MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.51ms. Allocated memory is still 142.6MB. Free memory was 65.1MB in the beginning and 60.7MB in the end (delta: 4.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 33.41ms. Allocated memory is still 142.6MB. Free memory was 60.7MB in the beginning and 57.4MB in the end (delta: 3.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 685.19ms. Allocated memory is still 142.6MB. Free memory was 57.4MB in the beginning and 86.7MB in the end (delta: -29.3MB). Peak memory consumption was 33.0MB. Max. memory is 16.1GB. * TraceAbstraction took 3860.74ms. Allocated memory was 142.6MB in the beginning and 310.4MB in the end (delta: 167.8MB). Free memory was 86.2MB in the beginning and 128.8MB in the end (delta: -42.5MB). Peak memory consumption was 127.0MB. Max. memory is 16.1GB. * Witness Printer took 58.67ms. Allocated memory is still 310.4MB. Free memory was 128.8MB in the beginning and 120.4MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1234]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1266]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1266]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1235]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1267]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1234]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1235]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1249]: 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: 1240]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1241]: 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, 341 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.8s, OverallIterations: 6, TraceHistogramMax: 7, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 421 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 246 mSDsluCounter, 58 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 38 mSDsCounter, 45 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 702 IncrementalHoareTripleChecker+Invalid, 747 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 45 mSolverCounterUnsat, 20 mSDtfsCounter, 702 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 496 GetRequests, 446 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=554occurred 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, 922 NumberOfCodeBlocks, 872 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1138 ConstructedInterpolants, 0 QuantifiedInterpolants, 1444 SizeOfPredicates, 8 NumberOfNonLiveVariables, 556 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 10 InterpolantComputations, 4 PerfectInterpolantSequences, 148/205 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:35,868 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE