./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread/stack-2.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/pthread/stack-2.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 1c5d098180a5596f0a60d3177354c69a5ee6da68b8191dc75b6c33b291ef0421 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:09:10,095 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:09:10,156 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:09:10,161 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:09:10,161 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:09:10,180 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:09:10,182 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:09:10,182 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:09:10,182 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:09:10,183 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:09:10,183 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:09:10,183 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:09:10,184 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:09:10,184 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:09:10,184 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:09:10,184 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:09:10,184 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:09:10,184 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:09:10,184 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:09:10,185 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:09:10,185 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:09:10,185 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:09:10,185 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:09:10,185 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:09:10,185 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:09:10,185 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:09:10,185 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:09:10,185 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:09:10,185 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:09:10,185 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:09:10,185 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:09:10,185 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:09:10,185 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:09:10,186 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:09:10,186 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:09:10,186 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:09:10,186 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:09:10,186 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:09:10,186 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:09:10,186 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:09:10,186 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:09:10,186 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:09:10,186 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 -> 1c5d098180a5596f0a60d3177354c69a5ee6da68b8191dc75b6c33b291ef0421 [2025-02-08 05:09:10,379 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:09:10,385 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:09:10,386 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:09:10,387 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:09:10,387 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:09:10,388 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/stack-2.i [2025-02-08 05:09:11,545 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ce420ea21/761b9b426fb24cc7b485809607191255/FLAG62b998480 [2025-02-08 05:09:11,862 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:09:11,866 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread/stack-2.i [2025-02-08 05:09:11,883 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ce420ea21/761b9b426fb24cc7b485809607191255/FLAG62b998480 [2025-02-08 05:09:12,111 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ce420ea21/761b9b426fb24cc7b485809607191255 [2025-02-08 05:09:12,113 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:09:12,114 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:09:12,115 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:09:12,115 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:09:12,120 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:09:12,121 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:09:12" (1/1) ... [2025-02-08 05:09:12,123 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f2f139c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:09:12, skipping insertion in model container [2025-02-08 05:09:12,123 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:09:12" (1/1) ... [2025-02-08 05:09:12,155 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:09:12,404 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:09:12,419 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:09:12,456 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:09:12,493 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:09:12,495 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:09:12 WrapperNode [2025-02-08 05:09:12,495 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:09:12,496 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:09:12,496 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:09:12,496 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:09:12,501 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:09:12" (1/1) ... [2025-02-08 05:09:12,518 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:09:12" (1/1) ... [2025-02-08 05:09:12,541 INFO L138 Inliner]: procedures = 277, calls = 37, calls flagged for inlining = 13, calls inlined = 14, statements flattened = 193 [2025-02-08 05:09:12,542 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:09:12,542 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:09:12,542 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:09:12,542 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:09:12,550 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:09:12" (1/1) ... [2025-02-08 05:09:12,550 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:09:12" (1/1) ... [2025-02-08 05:09:12,553 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:09:12" (1/1) ... [2025-02-08 05:09:12,553 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:09:12" (1/1) ... [2025-02-08 05:09:12,559 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:09:12" (1/1) ... [2025-02-08 05:09:12,561 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:09:12" (1/1) ... [2025-02-08 05:09:12,564 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:09:12" (1/1) ... [2025-02-08 05:09:12,565 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:09:12" (1/1) ... [2025-02-08 05:09:12,568 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:09:12,569 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:09:12,569 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:09:12,569 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:09:12,570 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:09:12" (1/1) ... [2025-02-08 05:09:12,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:09:12,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:09:12,596 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:09:12,598 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:09:12,615 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-02-08 05:09:12,615 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-02-08 05:09:12,615 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-02-08 05:09:12,615 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-02-08 05:09:12,615 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-08 05:09:12,615 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 05:09:12,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 05:09:12,616 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-08 05:09:12,616 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:09:12,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:09:12,616 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:09:12,616 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:09:12,617 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:09:12,735 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:09:12,740 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:09:13,029 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L969: havoc push_#t~nondet37#1; [2025-02-08 05:09:13,029 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L969-1: assume ((#race[push_~stack#1.base,push_~stack#1.offset + 4 * push_#t~ret36#1] == push_#t~nondet37#1 && #race[push_~stack#1.base,1 + (push_~stack#1.offset + 4 * push_#t~ret36#1)] == push_#t~nondet37#1) && #race[push_~stack#1.base,2 + (push_~stack#1.offset + 4 * push_#t~ret36#1)] == push_#t~nondet37#1) && #race[push_~stack#1.base,3 + (push_~stack#1.offset + 4 * push_#t~ret36#1)] == push_#t~nondet37#1; [2025-02-08 05:09:13,030 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L969-1: assume !(((#race[push_~stack#1.base,push_~stack#1.offset + 4 * push_#t~ret36#1] == push_#t~nondet37#1 && #race[push_~stack#1.base,1 + (push_~stack#1.offset + 4 * push_#t~ret36#1)] == push_#t~nondet37#1) && #race[push_~stack#1.base,2 + (push_~stack#1.offset + 4 * push_#t~ret36#1)] == push_#t~nondet37#1) && #race[push_~stack#1.base,3 + (push_~stack#1.offset + 4 * push_#t~ret36#1)] == push_#t~nondet37#1); [2025-02-08 05:09:13,030 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L969-2: havoc push_#t~ret36#1; [2025-02-08 05:09:13,030 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L969-3: #race := #race[push_~stack#1.base,3 + (push_~stack#1.offset + 4 * push_#t~ret36#1) := push_#t~nondet37#1]; [2025-02-08 05:09:13,030 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L969-4: #race := #race[push_~stack#1.base,2 + (push_~stack#1.offset + 4 * push_#t~ret36#1) := push_#t~nondet37#1]; [2025-02-08 05:09:13,030 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L969-5: #race := #race[push_~stack#1.base,1 + (push_~stack#1.offset + 4 * push_#t~ret36#1) := push_#t~nondet37#1]; [2025-02-08 05:09:13,030 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L969-6: #race := #race[push_~stack#1.base,push_~stack#1.offset + 4 * push_#t~ret36#1 := push_#t~nondet37#1]; [2025-02-08 05:09:13,030 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L969-7: havoc push_#t~nondet37#1; [2025-02-08 05:09:13,031 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L969-8: SUMMARY for call write~int(push_~x#1, push_~stack#1.base, push_~stack#1.offset + 4 * push_#t~ret36#1, 4); srcloc: null [2025-02-08 05:09:13,031 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L969-9: assume { :end_inline_get_top } true;assume -2147483648 <= push_#t~ret36#1 && push_#t~ret36#1 <= 2147483647; [2025-02-08 05:09:13,031 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L969-10: push_#t~ret36#1 := get_top_#res#1; [2025-02-08 05:09:13,032 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L20: assume false; [2025-02-08 05:09:13,032 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L20: assume !false; [2025-02-08 05:09:13,032 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L20-1: assume false; [2025-02-08 05:09:13,032 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L970: havoc inc_top_#t~post31#1, inc_top_#t~nondet32#1;assume { :end_inline_inc_top } true; [2025-02-08 05:09:13,033 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L970-1: assume { :begin_inline_inc_top } true;havoc inc_top_#t~post31#1, inc_top_#t~nondet32#1; [2025-02-08 05:09:13,033 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L946: havoc inc_top_#t~nondet32#1; [2025-02-08 05:09:13,033 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L946-1: assume #race~top~0 == inc_top_#t~nondet32#1; [2025-02-08 05:09:13,033 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L946-1: assume !(#race~top~0 == inc_top_#t~nondet32#1); [2025-02-08 05:09:13,033 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L946-2: havoc inc_top_#t~post31#1; [2025-02-08 05:09:13,033 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L946-3: #race~top~0 := inc_top_#t~nondet32#1; [2025-02-08 05:09:13,033 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L946-4: havoc inc_top_#t~nondet32#1; [2025-02-08 05:09:13,033 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L946-5: ~top~0 := 1 + inc_top_#t~post31#1; [2025-02-08 05:09:13,033 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L946-6: assume 0 == #race~top~0; [2025-02-08 05:09:13,033 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L946-6: assume !(0 == #race~top~0); [2025-02-08 05:09:13,033 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L946-7: inc_top_#t~post31#1 := ~top~0; [2025-02-08 05:09:13,033 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L946-8: #race~top~0 := 0; [2025-02-08 05:09:13,033 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L972-1: push_#res#1 := 0; [2025-02-08 05:09:13,033 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L997: assume -1 == #t~ret44#1; [2025-02-08 05:09:13,033 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L997: assume !(-1 == #t~ret44#1); [2025-02-08 05:09:13,033 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L997-1: havoc #t~ret44#1; [2025-02-08 05:09:13,033 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L997-2: havoc #t~ret44#1; [2025-02-08 05:09:13,034 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L997-3: assume { :end_inline_push } true;assume -2147483648 <= #t~ret44#1 && #t~ret44#1 <= 2147483647; [2025-02-08 05:09:13,034 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L997-4: havoc push_#in~stack#1.base, push_#in~stack#1.offset, push_#in~x#1; [2025-02-08 05:09:13,034 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L997-5: havoc push_#t~ret35#1, push_#t~ret36#1, push_#t~nondet37#1, push_~stack#1.base, push_~stack#1.offset, push_~x#1; [2025-02-08 05:09:13,034 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L997-6: #t~ret44#1 := push_#res#1; [2025-02-08 05:09:13,034 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L998: assume { :end_inline_error } true; [2025-02-08 05:09:13,034 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L998-1: assume { :begin_inline_error } true;assume { :begin_inline_reach_error } true;havoc reach_error_#t~nondet0#1.base, reach_error_#t~nondet0#1.offset; [2025-02-08 05:09:13,034 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L941: assume { :end_inline_reach_error } true;assume false; [2025-02-08 05:09:13,034 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L941-1: havoc reach_error_#t~nondet0#1.base, reach_error_#t~nondet0#1.offset; [2025-02-08 05:09:13,034 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L999: assume #race~flag~0 == #t~nondet45#1; [2025-02-08 05:09:13,034 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L999: assume !(#race~flag~0 == #t~nondet45#1); [2025-02-08 05:09:13,034 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L999-1: havoc #t~nondet45#1; [2025-02-08 05:09:13,034 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L999-2: #race~flag~0 := #t~nondet45#1; [2025-02-08 05:09:13,034 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L999-3: havoc #t~nondet45#1; [2025-02-08 05:09:13,034 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L999-4: ~flag~0 := 1; [2025-02-08 05:09:13,034 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1000: havoc #t~ret46#1; [2025-02-08 05:09:13,034 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1000-1: [2025-02-08 05:09:13,034 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1000-2: SUMMARY for call #t~ret46#1 := #PthreadsMutexUnlock(~#m~0.base, ~#m~0.offset); srcloc: null [2025-02-08 05:09:13,036 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1000-3: [2025-02-08 05:09:13,036 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L992-1: havoc #t~post47#1; [2025-02-08 05:09:13,036 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L992-2: ~i~0#1 := 1 + #t~post47#1; [2025-02-08 05:09:13,036 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L992-3: #t~post47#1 := ~i~0#1; [2025-02-08 05:09:13,120 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L986-1: pop_#res#1 := 0; [2025-02-08 05:09:13,120 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L20: assume false; [2025-02-08 05:09:13,120 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L20: assume !false; [2025-02-08 05:09:13,120 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L20-1: assume false; [2025-02-08 05:09:13,120 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L978: havoc pop_#t~ret39#1; [2025-02-08 05:09:13,120 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L978-1: havoc pop_#t~ret39#1; [2025-02-08 05:09:13,120 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L941: assume { :end_inline_reach_error } true;assume false; [2025-02-08 05:09:13,120 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L941-1: havoc reach_error_#t~nondet0#1.base, reach_error_#t~nondet0#1.offset; [2025-02-08 05:09:13,121 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L954-1: assume 0 == #race~top~0; [2025-02-08 05:09:13,121 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L954-1: assume !(0 == #race~top~0); [2025-02-08 05:09:13,121 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L954-2: get_top_#res#1 := ~top~0; [2025-02-08 05:09:13,121 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L954-3: #race~top~0 := 0; [2025-02-08 05:09:13,121 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L983: assume { :end_inline_dec_top } true;assume { :begin_inline_get_top } true;havoc get_top_#res#1; [2025-02-08 05:09:13,121 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L983-1: havoc dec_top_#t~post33#1, dec_top_#t~nondet34#1; [2025-02-08 05:09:13,121 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L950: havoc dec_top_#t~nondet34#1; [2025-02-08 05:09:13,121 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L950-1: assume #race~top~0 == dec_top_#t~nondet34#1; [2025-02-08 05:09:13,121 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L950-1: assume !(#race~top~0 == dec_top_#t~nondet34#1); [2025-02-08 05:09:13,121 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L983-2: assume { :begin_inline_dec_top } true;havoc dec_top_#t~post33#1, dec_top_#t~nondet34#1; [2025-02-08 05:09:13,121 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1012: assume !(-2 != #t~ret49#1); [2025-02-08 05:09:13,121 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1012: assume !!(-2 != #t~ret49#1); [2025-02-08 05:09:13,122 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L950-2: havoc dec_top_#t~post33#1; [2025-02-08 05:09:13,122 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1012-1: havoc #t~ret49#1; [2025-02-08 05:09:13,122 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L950-3: #race~top~0 := dec_top_#t~nondet34#1; [2025-02-08 05:09:13,122 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1012-2: havoc #t~ret49#1; [2025-02-08 05:09:13,122 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L979-1: pop_#res#1 := -2; [2025-02-08 05:09:13,122 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L950-4: havoc dec_top_#t~nondet34#1; [2025-02-08 05:09:13,122 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1012-3: assume { :end_inline_pop } true;assume -2147483648 <= #t~ret49#1 && #t~ret49#1 <= 2147483647; [2025-02-08 05:09:13,122 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L950-5: ~top~0 := dec_top_#t~post33#1 - 1; [2025-02-08 05:09:13,122 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1012-4: havoc pop_#in~stack#1.base, pop_#in~stack#1.offset; [2025-02-08 05:09:13,122 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L950-6: assume 0 == #race~top~0; [2025-02-08 05:09:13,122 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L950-6: assume !(0 == #race~top~0); [2025-02-08 05:09:13,122 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1012-5: havoc pop_#t~ret38#1, pop_#t~ret39#1, pop_#t~ret40#1, pop_#t~mem41#1, pop_~stack#1.base, pop_~stack#1.offset; [2025-02-08 05:09:13,122 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L950-7: dec_top_#t~post33#1 := ~top~0; [2025-02-08 05:09:13,122 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1012-6: #t~ret49#1 := pop_#res#1; [2025-02-08 05:09:13,122 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L950-8: #race~top~0 := 0; [2025-02-08 05:09:13,122 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L984: havoc pop_#t~mem41#1; [2025-02-08 05:09:13,122 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L984-1: havoc pop_#t~ret40#1; [2025-02-08 05:09:13,122 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1013: assume { :end_inline_error } true; [2025-02-08 05:09:13,123 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L984-3: havoc pop_#t~mem41#1; [2025-02-08 05:09:13,123 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1013-1: assume { :begin_inline_error } true;assume { :begin_inline_reach_error } true;havoc reach_error_#t~nondet0#1.base, reach_error_#t~nondet0#1.offset; [2025-02-08 05:09:13,123 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L984-4: havoc pop_#t~ret40#1; [2025-02-08 05:09:13,123 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L984-5: assume ((0 == #race[pop_~stack#1.base,pop_~stack#1.offset + 4 * pop_#t~ret40#1] && 0 == #race[pop_~stack#1.base,1 + (pop_~stack#1.offset + 4 * pop_#t~ret40#1)]) && 0 == #race[pop_~stack#1.base,2 + (pop_~stack#1.offset + 4 * pop_#t~ret40#1)]) && 0 == #race[pop_~stack#1.base,3 + (pop_~stack#1.offset + 4 * pop_#t~ret40#1)]; [2025-02-08 05:09:13,123 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L984-5: assume !(((0 == #race[pop_~stack#1.base,pop_~stack#1.offset + 4 * pop_#t~ret40#1] && 0 == #race[pop_~stack#1.base,1 + (pop_~stack#1.offset + 4 * pop_#t~ret40#1)]) && 0 == #race[pop_~stack#1.base,2 + (pop_~stack#1.offset + 4 * pop_#t~ret40#1)]) && 0 == #race[pop_~stack#1.base,3 + (pop_~stack#1.offset + 4 * pop_#t~ret40#1)]); [2025-02-08 05:09:13,123 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L984-6: pop_#res#1 := (if pop_#t~mem41#1 % 4294967296 % 4294967296 <= 2147483647 then pop_#t~mem41#1 % 4294967296 % 4294967296 else pop_#t~mem41#1 % 4294967296 % 4294967296 - 4294967296); [2025-02-08 05:09:13,123 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L984-7: #race := #race[pop_~stack#1.base,3 + (pop_~stack#1.offset + 4 * pop_#t~ret40#1) := 0]; [2025-02-08 05:09:13,123 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L984-8: #race := #race[pop_~stack#1.base,2 + (pop_~stack#1.offset + 4 * pop_#t~ret40#1) := 0]; [2025-02-08 05:09:13,123 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L976: assume 0 == pop_#t~ret38#1; [2025-02-08 05:09:13,123 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L976: assume !(0 == pop_#t~ret38#1); [2025-02-08 05:09:13,123 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L984-9: #race := #race[pop_~stack#1.base,1 + (pop_~stack#1.offset + 4 * pop_#t~ret40#1) := 0]; [2025-02-08 05:09:13,123 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L976-1: havoc pop_#t~ret38#1; [2025-02-08 05:09:13,123 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L984-10: #race := #race[pop_~stack#1.base,pop_~stack#1.offset + 4 * pop_#t~ret40#1 := 0]; [2025-02-08 05:09:13,123 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L976-2: havoc pop_#t~ret38#1; [2025-02-08 05:09:13,123 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L984-11: SUMMARY for call pop_#t~mem41#1 := read~int(pop_~stack#1.base, pop_~stack#1.offset + 4 * pop_#t~ret40#1, 4); srcloc: null [2025-02-08 05:09:13,123 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L976-3: assume { :end_inline_get_top } true;assume -2147483648 <= pop_#t~ret38#1 && pop_#t~ret38#1 <= 2147483647; [2025-02-08 05:09:13,123 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L984-12: assume { :end_inline_get_top } true;assume -2147483648 <= pop_#t~ret40#1 && pop_#t~ret40#1 <= 2147483647; [2025-02-08 05:09:13,124 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L976-4: pop_#t~ret38#1 := get_top_#res#1; [2025-02-08 05:09:13,124 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L984-13: pop_#t~ret40#1 := get_top_#res#1; [2025-02-08 05:09:13,125 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:09:13,125 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:09:13,142 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:09:13,142 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:09:13,142 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:09:13 BoogieIcfgContainer [2025-02-08 05:09:13,143 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:09:13,144 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:09:13,144 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:09:13,148 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:09:13,149 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:09:12" (1/3) ... [2025-02-08 05:09:13,149 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a244dc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:09:13, skipping insertion in model container [2025-02-08 05:09:13,149 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:09:12" (2/3) ... [2025-02-08 05:09:13,149 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a244dc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:09:13, skipping insertion in model container [2025-02-08 05:09:13,149 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:09:13" (3/3) ... [2025-02-08 05:09:13,151 INFO L128 eAbstractionObserver]: Analyzing ICFG stack-2.i [2025-02-08 05:09:13,164 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:09:13,165 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG stack-2.i that has 3 procedures, 113 locations, 1 initial locations, 2 loop locations, and 12 error locations. [2025-02-08 05:09:13,165 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:09:13,245 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-08 05:09:13,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 119 places, 114 transitions, 242 flow [2025-02-08 05:09:13,352 INFO L124 PetriNetUnfolderBase]: 2/112 cut-off events. [2025-02-08 05:09:13,354 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 05:09:13,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 112 events. 2/112 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 204 event pairs, 0 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 77. Up to 2 conditions per place. [2025-02-08 05:09:13,359 INFO L82 GeneralOperation]: Start removeDead. Operand has 119 places, 114 transitions, 242 flow [2025-02-08 05:09:13,362 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 112 places, 107 transitions, 223 flow [2025-02-08 05:09:13,368 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:09:13,376 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;@6d0736bf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:09:13,377 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-02-08 05:09:13,397 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:09:13,397 INFO L124 PetriNetUnfolderBase]: 0/66 cut-off events. [2025-02-08 05:09:13,397 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:09:13,397 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:09:13,398 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] [2025-02-08 05:09:13,398 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t2Err5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2025-02-08 05:09:13,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:09:13,403 INFO L85 PathProgramCache]: Analyzing trace with hash 73780381, now seen corresponding path program 1 times [2025-02-08 05:09:13,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:09:13,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258641786] [2025-02-08 05:09:13,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:09:13,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:09:13,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-08 05:09:13,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-08 05:09:13,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:09:13,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:09:13,634 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:09:13,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:09:13,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258641786] [2025-02-08 05:09:13,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258641786] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:09:13,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:09:13,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:09:13,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981821210] [2025-02-08 05:09:13,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:09:13,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:09:13,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:09:13,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:09:13,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:09:13,670 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 114 [2025-02-08 05:09:13,672 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 107 transitions, 223 flow. Second operand has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 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:09:13,673 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:09:13,674 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 114 [2025-02-08 05:09:13,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:09:13,759 INFO L124 PetriNetUnfolderBase]: 14/234 cut-off events. [2025-02-08 05:09:13,760 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2025-02-08 05:09:13,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 284 conditions, 234 events. 14/234 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 975 event pairs, 3 based on Foata normal form. 5/216 useless extension candidates. Maximal degree in co-relation 202. Up to 23 conditions per place. [2025-02-08 05:09:13,763 INFO L140 encePairwiseOnDemand]: 111/114 looper letters, 11 selfloop transitions, 1 changer transitions 0/109 dead transitions. [2025-02-08 05:09:13,764 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 109 transitions, 254 flow [2025-02-08 05:09:13,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:09:13,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:09:13,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 324 transitions. [2025-02-08 05:09:13,776 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9473684210526315 [2025-02-08 05:09:13,778 INFO L175 Difference]: Start difference. First operand has 112 places, 107 transitions, 223 flow. Second operand 3 states and 324 transitions. [2025-02-08 05:09:13,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 109 transitions, 254 flow [2025-02-08 05:09:13,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 109 transitions, 247 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 05:09:13,786 INFO L231 Difference]: Finished difference. Result has 111 places, 106 transitions, 221 flow [2025-02-08 05:09:13,789 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=221, PETRI_PLACES=111, PETRI_TRANSITIONS=106} [2025-02-08 05:09:13,793 INFO L279 CegarLoopForPetriNet]: 112 programPoint places, -1 predicate places. [2025-02-08 05:09:13,793 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 106 transitions, 221 flow [2025-02-08 05:09:13,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 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:09:13,794 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:09:13,794 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] [2025-02-08 05:09:13,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:09:13,794 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2025-02-08 05:09:13,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:09:13,795 INFO L85 PathProgramCache]: Analyzing trace with hash -809374556, now seen corresponding path program 1 times [2025-02-08 05:09:13,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:09:13,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665932060] [2025-02-08 05:09:13,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:09:13,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:09:13,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-02-08 05:09:13,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-02-08 05:09:13,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:09:13,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:09:13,877 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:09:13,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:09:13,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665932060] [2025-02-08 05:09:13,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665932060] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:09:13,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:09:13,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:09:13,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241530470] [2025-02-08 05:09:13,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:09:13,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:09:13,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:09:13,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:09:13,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:09:13,897 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 114 [2025-02-08 05:09:13,898 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 106 transitions, 221 flow. Second operand has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 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:09:13,898 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:09:13,898 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 114 [2025-02-08 05:09:13,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:09:13,968 INFO L124 PetriNetUnfolderBase]: 36/288 cut-off events. [2025-02-08 05:09:13,969 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-08 05:09:13,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 390 conditions, 288 events. 36/288 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1261 event pairs, 11 based on Foata normal form. 0/270 useless extension candidates. Maximal degree in co-relation 292. Up to 62 conditions per place. [2025-02-08 05:09:13,972 INFO L140 encePairwiseOnDemand]: 109/114 looper letters, 0 selfloop transitions, 0 changer transitions 110/110 dead transitions. [2025-02-08 05:09:13,972 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 110 transitions, 270 flow [2025-02-08 05:09:13,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:09:13,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:09:13,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 313 transitions. [2025-02-08 05:09:13,975 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9152046783625731 [2025-02-08 05:09:13,975 INFO L175 Difference]: Start difference. First operand has 111 places, 106 transitions, 221 flow. Second operand 3 states and 313 transitions. [2025-02-08 05:09:13,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 110 transitions, 270 flow [2025-02-08 05:09:13,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 110 transitions, 270 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:09:13,977 INFO L231 Difference]: Finished difference. Result has 110 places, 0 transitions, 0 flow [2025-02-08 05:09:13,977 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=215, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=110, PETRI_TRANSITIONS=0} [2025-02-08 05:09:13,978 INFO L279 CegarLoopForPetriNet]: 112 programPoint places, -2 predicate places. [2025-02-08 05:09:13,978 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 0 transitions, 0 flow [2025-02-08 05:09:13,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 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:09:13,983 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining) [2025-02-08 05:09:13,983 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 10 remaining) [2025-02-08 05:09:13,983 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err5ASSERT_VIOLATIONDATA_RACE (7 of 10 remaining) [2025-02-08 05:09:13,983 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err4ASSERT_VIOLATIONDATA_RACE (6 of 10 remaining) [2025-02-08 05:09:13,983 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err5ASSERT_VIOLATIONDATA_RACE (5 of 10 remaining) [2025-02-08 05:09:13,983 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err4ASSERT_VIOLATIONDATA_RACE (4 of 10 remaining) [2025-02-08 05:09:13,983 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err5ASSERT_VIOLATIONDATA_RACE (3 of 10 remaining) [2025-02-08 05:09:13,984 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err4ASSERT_VIOLATIONDATA_RACE (2 of 10 remaining) [2025-02-08 05:09:13,984 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err5ASSERT_VIOLATIONDATA_RACE (1 of 10 remaining) [2025-02-08 05:09:13,984 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err4ASSERT_VIOLATIONDATA_RACE (0 of 10 remaining) [2025-02-08 05:09:13,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:09:13,984 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-02-08 05:09:13,989 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 05:09:13,990 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 05:09:13,995 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 05:09:13 BasicIcfg [2025-02-08 05:09:13,997 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 05:09:13,998 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 05:09:13,998 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 05:09:13,998 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 05:09:13,998 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:09:13" (3/4) ... [2025-02-08 05:09:13,999 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 05:09:14,002 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure t1 [2025-02-08 05:09:14,002 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure t2 [2025-02-08 05:09:14,005 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-02-08 05:09:14,005 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-02-08 05:09:14,005 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-08 05:09:14,005 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 05:09:14,058 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 05:09:14,061 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 05:09:14,061 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 05:09:14,062 INFO L158 Benchmark]: Toolchain (without parser) took 1947.51ms. Allocated memory is still 142.6MB. Free memory was 112.4MB in the beginning and 51.4MB in the end (delta: 61.0MB). Peak memory consumption was 57.6MB. Max. memory is 16.1GB. [2025-02-08 05:09:14,062 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 122.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:09:14,062 INFO L158 Benchmark]: CACSL2BoogieTranslator took 380.77ms. Allocated memory is still 142.6MB. Free memory was 111.9MB in the beginning and 82.7MB in the end (delta: 29.2MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-02-08 05:09:14,063 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.51ms. Allocated memory is still 142.6MB. Free memory was 82.7MB in the beginning and 80.0MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:09:14,063 INFO L158 Benchmark]: Boogie Preprocessor took 26.35ms. Allocated memory is still 142.6MB. Free memory was 80.0MB in the beginning and 78.7MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:09:14,063 INFO L158 Benchmark]: IcfgBuilder took 573.76ms. Allocated memory is still 142.6MB. Free memory was 78.7MB in the beginning and 56.3MB in the end (delta: 22.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-08 05:09:14,064 INFO L158 Benchmark]: TraceAbstraction took 852.84ms. Allocated memory is still 142.6MB. Free memory was 55.8MB in the beginning and 56.7MB in the end (delta: -821.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:09:14,065 INFO L158 Benchmark]: Witness Printer took 63.48ms. Allocated memory is still 142.6MB. Free memory was 56.7MB in the beginning and 51.4MB in the end (delta: 5.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:09:14,065 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.19ms. Allocated memory is still 201.3MB. Free memory is still 122.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 380.77ms. Allocated memory is still 142.6MB. Free memory was 111.9MB in the beginning and 82.7MB in the end (delta: 29.2MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.51ms. Allocated memory is still 142.6MB. Free memory was 82.7MB in the beginning and 80.0MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 26.35ms. Allocated memory is still 142.6MB. Free memory was 80.0MB in the beginning and 78.7MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 573.76ms. Allocated memory is still 142.6MB. Free memory was 78.7MB in the beginning and 56.3MB in the end (delta: 22.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 852.84ms. Allocated memory is still 142.6MB. Free memory was 55.8MB in the beginning and 56.7MB in the end (delta: -821.2kB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 63.48ms. Allocated memory is still 142.6MB. Free memory was 56.7MB in the beginning and 51.4MB in the end (delta: 5.3MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 962]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 954]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1010]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 954]: 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 5 procedures, 182 locations, 10 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: 0.7s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 27 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 15 mSDsluCounter, 4 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 35 IncrementalHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 4 mSDtfsCounter, 35 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=223occurred in iteration=0, InterpolantAutomatonStates: 6, 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.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 98 NumberOfCodeBlocks, 98 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 96 ConstructedInterpolants, 0 QuantifiedInterpolants, 100 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 12 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 05:09:14,080 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