./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_hash_table_foreach_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability 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/aws-c-common/aws_hash_table_foreach_harness.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 73d0fc2a1532f0dbe88956ef9fb1a19856bd3ec52801d3ed611d85534d86cd8d --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 01:49:08,159 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 01:49:08,221 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-08 01:49:08,226 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 01:49:08,228 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 01:49:08,242 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 01:49:08,242 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 01:49:08,243 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 01:49:08,243 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 01:49:08,243 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 01:49:08,243 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 01:49:08,243 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 01:49:08,243 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 01:49:08,244 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 01:49:08,244 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 01:49:08,244 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 01:49:08,244 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 01:49:08,244 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 01:49:08,244 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 01:49:08,244 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 01:49:08,244 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 01:49:08,244 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 01:49:08,244 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 01:49:08,244 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 01:49:08,245 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 01:49:08,245 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 01:49:08,245 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 01:49:08,245 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 01:49:08,245 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 01:49:08,245 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 01:49:08,245 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 01:49:08,245 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 01:49:08,245 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 01:49:08,245 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 01:49:08,246 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 01:49:08,246 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 01:49:08,246 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 01:49:08,246 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 01:49:08,246 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 01:49:08,246 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 01:49:08,246 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 ! call(reach_error())) ) 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 73d0fc2a1532f0dbe88956ef9fb1a19856bd3ec52801d3ed611d85534d86cd8d [2025-02-08 01:49:08,489 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 01:49:08,498 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 01:49:08,499 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 01:49:08,500 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 01:49:08,500 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 01:49:08,503 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_hash_table_foreach_harness.i [2025-02-08 01:49:09,633 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/77ff7f86a/253a7e9f0ec045e18df4aadb3f43511f/FLAG51f7e969e [2025-02-08 01:49:10,141 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 01:49:10,143 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_foreach_harness.i [2025-02-08 01:49:10,184 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/77ff7f86a/253a7e9f0ec045e18df4aadb3f43511f/FLAG51f7e969e [2025-02-08 01:49:10,225 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/77ff7f86a/253a7e9f0ec045e18df4aadb3f43511f [2025-02-08 01:49:10,227 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 01:49:10,228 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 01:49:10,230 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 01:49:10,231 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 01:49:10,235 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 01:49:10,236 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:49:10" (1/1) ... [2025-02-08 01:49:10,238 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38ece31b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:49:10, skipping insertion in model container [2025-02-08 01:49:10,239 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:49:10" (1/1) ... [2025-02-08 01:49:10,323 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 01:49:10,518 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_foreach_harness.i[4496,4509] [2025-02-08 01:49:10,526 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_foreach_harness.i[4556,4569] [2025-02-08 01:49:11,150 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:49:11,150 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:49:11,151 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:49:11,151 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:49:11,152 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:49:11,159 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:49:11,160 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:49:11,161 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:49:11,161 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:49:11,163 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:49:11,163 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:49:11,164 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:49:11,164 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:49:12,154 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:49:12,155 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:49:12,178 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:49:12,179 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:49:12,186 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:49:12,187 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:49:12,197 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:49:12,198 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:49:12,198 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:49:12,199 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:49:12,199 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:49:12,199 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:49:12,199 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:49:12,230 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_foreach_harness.i[227600,227613] [2025-02-08 01:49:12,231 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 01:49:12,255 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 01:49:12,265 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_foreach_harness.i[4496,4509] [2025-02-08 01:49:12,268 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_foreach_harness.i[4556,4569] [2025-02-08 01:49:12,297 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:49:12,298 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:49:12,298 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:49:12,298 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:49:12,298 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:49:12,305 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:49:12,305 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:49:12,305 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:49:12,306 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:49:12,307 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:49:12,307 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:49:12,307 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:49:12,307 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:49:12,376 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" : : "r"(pBuf) : "memory"); [7558-7569] [2025-02-08 01:49:12,440 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:49:12,440 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:49:12,488 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:49:12,488 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:49:12,490 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:49:12,490 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:49:12,497 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:49:12,498 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:49:12,498 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:49:12,498 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:49:12,498 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:49:12,498 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:49:12,498 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:49:12,514 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_foreach_harness.i[227600,227613] [2025-02-08 01:49:12,514 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 01:49:12,678 INFO L204 MainTranslator]: Completed translation [2025-02-08 01:49:12,679 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:49:12 WrapperNode [2025-02-08 01:49:12,679 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 01:49:12,680 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 01:49:12,680 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 01:49:12,680 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 01:49:12,686 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:49:12" (1/1) ... [2025-02-08 01:49:12,759 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:49:12" (1/1) ... [2025-02-08 01:49:12,851 INFO L138 Inliner]: procedures = 764, calls = 2430, calls flagged for inlining = 70, calls inlined = 18, statements flattened = 967 [2025-02-08 01:49:12,854 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 01:49:12,854 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 01:49:12,854 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 01:49:12,854 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 01:49:12,861 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:49:12" (1/1) ... [2025-02-08 01:49:12,861 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:49:12" (1/1) ... [2025-02-08 01:49:12,867 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:49:12" (1/1) ... [2025-02-08 01:49:12,941 INFO L175 MemorySlicer]: Split 377 memory accesses to 7 slices as follows [2, 249, 2, 44, 73, 5, 2]. 66 percent of accesses are in the largest equivalence class. The 22 initializations are split as follows [2, 6, 0, 0, 9, 5, 0]. The 257 writes are split as follows [0, 233, 1, 8, 14, 0, 1]. [2025-02-08 01:49:12,946 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:49:12" (1/1) ... [2025-02-08 01:49:12,946 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:49:12" (1/1) ... [2025-02-08 01:49:12,999 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:49:12" (1/1) ... [2025-02-08 01:49:13,006 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:49:12" (1/1) ... [2025-02-08 01:49:13,017 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:49:12" (1/1) ... [2025-02-08 01:49:13,026 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:49:12" (1/1) ... [2025-02-08 01:49:13,039 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 01:49:13,044 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 01:49:13,044 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 01:49:13,044 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 01:49:13,045 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:49:12" (1/1) ... [2025-02-08 01:49:13,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 01:49:13,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:49:13,071 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 01:49:13,074 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 01:49:13,092 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-02-08 01:49:13,093 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-02-08 01:49:13,093 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-02-08 01:49:13,093 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-02-08 01:49:13,093 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-02-08 01:49:13,093 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2025-02-08 01:49:13,093 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2025-02-08 01:49:13,093 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_uninterpreted_equals [2025-02-08 01:49:13,093 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_uninterpreted_equals [2025-02-08 01:49:13,093 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 01:49:13,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-02-08 01:49:13,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-02-08 01:49:13,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-02-08 01:49:13,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-02-08 01:49:13,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-02-08 01:49:13,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-02-08 01:49:13,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-02-08 01:49:13,094 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 01:49:13,094 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 01:49:13,094 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-08 01:49:13,094 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-08 01:49:13,094 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-08 01:49:13,096 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-02-08 01:49:13,096 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-02-08 01:49:13,096 INFO L130 BoogieDeclarations]: Found specification of procedure aws_raise_error [2025-02-08 01:49:13,096 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_raise_error [2025-02-08 01:49:13,096 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-08 01:49:13,096 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-08 01:49:13,096 INFO L130 BoogieDeclarations]: Found specification of procedure hash_table_state_is_valid [2025-02-08 01:49:13,096 INFO L138 BoogieDeclarations]: Found implementation of procedure hash_table_state_is_valid [2025-02-08 01:49:13,096 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 01:49:13,096 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 01:49:13,096 INFO L130 BoogieDeclarations]: Found specification of procedure hash_table_state_required_bytes [2025-02-08 01:49:13,096 INFO L138 BoogieDeclarations]: Found implementation of procedure hash_table_state_required_bytes [2025-02-08 01:49:13,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-08 01:49:13,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-08 01:49:13,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-08 01:49:13,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-02-08 01:49:13,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-02-08 01:49:13,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-02-08 01:49:13,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-02-08 01:49:13,097 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2025-02-08 01:49:13,097 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2025-02-08 01:49:13,097 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_uninterpreted_hasher [2025-02-08 01:49:13,097 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_uninterpreted_hasher [2025-02-08 01:49:13,097 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 01:49:13,097 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 01:49:13,097 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2025-02-08 01:49:13,097 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2025-02-08 01:49:13,097 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mul_size_checked [2025-02-08 01:49:13,097 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mul_size_checked [2025-02-08 01:49:13,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-02-08 01:49:13,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-02-08 01:49:13,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-02-08 01:49:13,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-02-08 01:49:13,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-02-08 01:49:13,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-02-08 01:49:13,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-02-08 01:49:13,097 INFO L130 BoogieDeclarations]: Found specification of procedure s_get_next_element [2025-02-08 01:49:13,097 INFO L138 BoogieDeclarations]: Found implementation of procedure s_get_next_element [2025-02-08 01:49:13,097 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-02-08 01:49:13,097 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-02-08 01:49:13,097 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-02-08 01:49:13,097 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#3 [2025-02-08 01:49:13,097 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#4 [2025-02-08 01:49:13,097 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#5 [2025-02-08 01:49:13,097 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#6 [2025-02-08 01:49:13,097 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-02-08 01:49:13,097 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-02-08 01:49:13,097 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-02-08 01:49:13,097 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#3 [2025-02-08 01:49:13,097 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#4 [2025-02-08 01:49:13,097 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#5 [2025-02-08 01:49:13,097 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#6 [2025-02-08 01:49:13,097 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-08 01:49:13,097 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-08 01:49:13,097 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_int [2025-02-08 01:49:13,098 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_int [2025-02-08 01:49:13,098 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 01:49:13,098 INFO L130 BoogieDeclarations]: Found specification of procedure aws_hash_iter_is_valid [2025-02-08 01:49:13,098 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_hash_iter_is_valid [2025-02-08 01:49:13,098 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_plus [2025-02-08 01:49:13,098 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_plus [2025-02-08 01:49:13,098 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-08 01:49:13,098 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-08 01:49:13,098 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-08 01:49:13,098 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-02-08 01:49:13,098 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-02-08 01:49:13,098 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-02-08 01:49:13,098 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-02-08 01:49:13,098 INFO L130 BoogieDeclarations]: Found specification of procedure aws_hash_table_is_valid [2025-02-08 01:49:13,098 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_hash_table_is_valid [2025-02-08 01:49:13,098 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-08 01:49:13,098 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-08 01:49:13,098 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-08 01:49:13,098 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-02-08 01:49:13,098 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-02-08 01:49:13,098 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-02-08 01:49:13,098 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-02-08 01:49:13,098 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_mult [2025-02-08 01:49:13,099 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_mult [2025-02-08 01:49:13,100 INFO L130 BoogieDeclarations]: Found specification of procedure aws_add_size_checked [2025-02-08 01:49:13,100 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_add_size_checked [2025-02-08 01:49:13,100 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2025-02-08 01:49:13,100 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2025-02-08 01:49:13,100 INFO L130 BoogieDeclarations]: Found specification of procedure s_remove_entry [2025-02-08 01:49:13,101 INFO L138 BoogieDeclarations]: Found implementation of procedure s_remove_entry [2025-02-08 01:49:13,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 01:49:13,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 01:49:13,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-08 01:49:13,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-08 01:49:13,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-08 01:49:13,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-08 01:49:13,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-02-08 01:49:13,101 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2025-02-08 01:49:13,101 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2025-02-08 01:49:13,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 01:49:13,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 01:49:13,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 01:49:13,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-08 01:49:13,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-08 01:49:13,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-08 01:49:13,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-02-08 01:49:13,102 INFO L130 BoogieDeclarations]: Found specification of procedure aws_is_power_of_two [2025-02-08 01:49:13,102 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_is_power_of_two [2025-02-08 01:49:13,454 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 01:49:13,459 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 01:49:13,516 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6947: havoc #t~malloc588.base, #t~malloc588.offset; [2025-02-08 01:49:13,523 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L262: havoc #t~nondet5; [2025-02-08 01:49:13,554 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L10103: call ULTIMATE.dealloc(~#elemsize~0.base, ~#elemsize~0.offset);havoc ~#elemsize~0.base, ~#elemsize~0.offset; [2025-02-08 01:49:13,632 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2590: havoc #t~ret57#1; [2025-02-08 01:49:13,633 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L266: havoc #t~nondet9; [2025-02-08 01:49:13,684 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L9990: havoc #t~mem1489.base, #t~mem1489.offset;havoc #t~short1490;havoc #t~mem1491.base, #t~mem1491.offset;havoc #t~ret1492;havoc #t~short1493; [2025-02-08 01:49:13,762 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L9142-1: assume false; [2025-02-08 01:49:13,762 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L9142-1: assume !false; [2025-02-08 01:49:13,762 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L9640-1: assume false; [2025-02-08 01:49:13,762 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L9640-1: assume !false; [2025-02-08 01:49:13,854 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L7356-2: uninterpreted_equals_assert_inputs_nonnull_#t~ret687#1 := uninterpreted_equals_#res#1;havoc uninterpreted_equals_#t~ret683#1, uninterpreted_equals_#t~ret684#1, uninterpreted_equals_#t~ret685#1, uninterpreted_equals_#t~ret686#1, uninterpreted_equals_~a#1.base, uninterpreted_equals_~a#1.offset, uninterpreted_equals_~b#1.base, uninterpreted_equals_~b#1.offset, uninterpreted_equals_~rval~9#1;havoc uninterpreted_equals_#in~a#1.base, uninterpreted_equals_#in~a#1.offset, uninterpreted_equals_#in~b#1.base, uninterpreted_equals_#in~b#1.offset;assume { :end_inline_uninterpreted_equals } true;uninterpreted_equals_assert_inputs_nonnull_#res#1 := (if 0 == uninterpreted_equals_assert_inputs_nonnull_#t~ret687#1 % 256 then 0 else 1);havoc uninterpreted_equals_assert_inputs_nonnull_#t~ret687#1; [2025-02-08 01:49:13,854 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L7356: havoc uninterpreted_equals_assert_inputs_nonnull_#t~ret687#1;#t~ret1544#1 := uninterpreted_equals_assert_inputs_nonnull_#res#1;havoc uninterpreted_equals_assert_inputs_nonnull_#t~ret687#1, uninterpreted_equals_assert_inputs_nonnull_~a#1.base, uninterpreted_equals_assert_inputs_nonnull_~a#1.offset, uninterpreted_equals_assert_inputs_nonnull_~b#1.base, uninterpreted_equals_assert_inputs_nonnull_~b#1.offset;havoc uninterpreted_equals_assert_inputs_nonnull_#in~a#1.base, uninterpreted_equals_assert_inputs_nonnull_#in~a#1.offset, uninterpreted_equals_assert_inputs_nonnull_#in~b#1.base, uninterpreted_equals_assert_inputs_nonnull_#in~b#1.offset;assume { :end_inline_uninterpreted_equals_assert_inputs_nonnull } true;#t~funptrres1542#1 := #t~ret1544#1; [2025-02-08 01:49:13,854 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L-1: #res#1 := #t~funptrres1542#1;havoc #t~funptrres1542#1;havoc #t~ret1543#1;havoc #t~ret1544#1;havoc #t~ret1545#1; [2025-02-08 01:49:13,854 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L7287: havoc nondet_compare_#t~ret677#1;#t~ret1543#1 := nondet_compare_#res#1;havoc nondet_compare_#t~ret677#1, nondet_compare_~a#1.base, nondet_compare_~a#1.offset, nondet_compare_~b#1.base, nondet_compare_~b#1.offset;havoc nondet_compare_#in~a#1.base, nondet_compare_#in~a#1.offset, nondet_compare_#in~b#1.base, nondet_compare_#in~b#1.offset;assume { :end_inline_nondet_compare } true;assume -2147483648 <= #t~ret1543#1 && #t~ret1543#1 <= 2147483647;#t~funptrres1542#1 := #t~ret1543#1; [2025-02-08 01:49:13,855 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint ##fun~$Pointer$~X~$Pointer$~TO~intFINAL: assume true; [2025-02-08 01:49:13,855 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L10116: havoc hash_table_foreach_proof_callback_#t~ret1533#1;#t~ret1545#1 := hash_table_foreach_proof_callback_#res#1;havoc hash_table_foreach_proof_callback_#t~ret1533#1, hash_table_foreach_proof_callback_~context#1.base, hash_table_foreach_proof_callback_~context#1.offset, hash_table_foreach_proof_callback_~pElement#1.base, hash_table_foreach_proof_callback_~pElement#1.offset;havoc hash_table_foreach_proof_callback_#in~context#1.base, hash_table_foreach_proof_callback_#in~context#1.offset, hash_table_foreach_proof_callback_#in~pElement#1.base, hash_table_foreach_proof_callback_#in~pElement#1.offset;assume { :end_inline_hash_table_foreach_proof_callback } true;assume -2147483648 <= #t~ret1545#1 && #t~ret1545#1 <= 2147483647;#t~funptrres1542#1 := #t~ret1545#1; [2025-02-08 01:49:13,935 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2630: havoc #t~bitwise60;havoc #t~short61; [2025-02-08 01:49:13,948 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2617: havoc #t~ret59#1; [2025-02-08 01:49:19,000 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L9722: assume 0 != aws_hash_table_foreach_#t~bitwise1351#1;havoc aws_hash_table_foreach_#t~bitwise1351#1;assume { :begin_inline_aws_hash_iter_delete } true;aws_hash_iter_delete_#in~iter#1.base, aws_hash_iter_delete_#in~iter#1.offset, aws_hash_iter_delete_#in~destroy_contents#1 := aws_hash_table_foreach_~#iter~0#1.base, aws_hash_table_foreach_~#iter~0#1.offset, 0;havoc aws_hash_iter_delete_#t~mem1426#1, aws_hash_iter_delete_#t~ret1427#1, aws_hash_iter_delete_#t~mem1428#1.base, aws_hash_iter_delete_#t~mem1428#1.offset, aws_hash_iter_delete_#t~mem1429#1.base, aws_hash_iter_delete_#t~mem1429#1.offset, aws_hash_iter_delete_#t~mem1430#1, aws_hash_iter_delete_#t~mem1431#1.base, aws_hash_iter_delete_#t~mem1431#1.offset, aws_hash_iter_delete_#t~mem1432#1.base, aws_hash_iter_delete_#t~mem1432#1.offset, aws_hash_iter_delete_#t~mem1433#1.base, aws_hash_iter_delete_#t~mem1433#1.offset, aws_hash_iter_delete_#t~mem1434#1.base, aws_hash_iter_delete_#t~mem1434#1.offset, aws_hash_iter_delete_#t~mem1435#1.base, aws_hash_iter_delete_#t~mem1435#1.offset, aws_hash_iter_delete_#t~mem1436#1.base, aws_hash_iter_delete_#t~mem1436#1.offset, aws_hash_iter_delete_#t~mem1437#1.base, aws_hash_iter_delete_#t~mem1437#1.offset, aws_hash_iter_delete_#t~mem1438#1.base, aws_hash_iter_delete_#t~mem1438#1.offset, aws_hash_iter_delete_#t~mem1439#1, aws_hash_iter_delete_#t~ret1440#1, aws_hash_iter_delete_#t~mem1441#1, aws_hash_iter_delete_#t~mem1442#1, aws_hash_iter_delete_#t~short1443#1, aws_hash_iter_delete_#t~mem1444#1, aws_hash_iter_delete_#t~post1445#1, aws_hash_iter_delete_#t~mem1446#1, aws_hash_iter_delete_#t~post1447#1, aws_hash_iter_delete_#t~mem1448#1, aws_hash_iter_delete_#t~ret1449#1, aws_hash_iter_delete_~iter#1.base, aws_hash_iter_delete_~iter#1.offset, aws_hash_iter_delete_~destroy_contents#1, aws_hash_iter_delete_~state~12#1.base, aws_hash_iter_delete_~state~12#1.offset, aws_hash_iter_delete_~last_index~0#1;aws_hash_iter_delete_~iter#1.base, aws_hash_iter_delete_~iter#1.offset := aws_hash_iter_delete_#in~iter#1.base, aws_hash_iter_delete_#in~iter#1.offset;aws_hash_iter_delete_~destroy_contents#1 := aws_hash_iter_delete_#in~destroy_contents#1;call aws_hash_iter_delete_#t~mem1426#1 := read~int#4(aws_hash_iter_delete_~iter#1.base, 40 + aws_hash_iter_delete_~iter#1.offset, 4); [2025-02-08 01:49:19,001 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L9722: assume !(0 != aws_hash_table_foreach_#t~bitwise1351#1);havoc aws_hash_table_foreach_#t~bitwise1351#1; [2025-02-08 01:49:19,001 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L9887: havoc aws_hash_iter_delete_#t~mem1437#1.base, aws_hash_iter_delete_#t~mem1437#1.offset;havoc aws_hash_iter_delete_#t~mem1438#1.base, aws_hash_iter_delete_#t~mem1438#1.offset; [2025-02-08 01:49:19,001 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L9887-1: SUMMARY for call ##fun~$Pointer$~TO~VOID(aws_hash_iter_delete_#t~mem1437#1.base, aws_hash_iter_delete_#t~mem1437#1.offset, aws_hash_iter_delete_#t~mem1438#1.base, aws_hash_iter_delete_#t~mem1438#1.offset); srcloc: null [2025-02-08 01:49:19,001 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L9722-1: [2025-02-08 01:49:19,002 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L9722-2: havoc aws_hash_table_foreach_#t~bitwise1351#1;assume ((((aws_hash_table_foreach_~rv~4#1 < 0 || aws_hash_table_foreach_#t~bitwise1351#1 <= aws_hash_table_foreach_~rv~4#1) && aws_hash_table_foreach_#t~bitwise1351#1 <= 2) && aws_hash_table_foreach_#t~bitwise1351#1 >= 0) && (aws_hash_table_foreach_~rv~4#1 >= 0 || aws_hash_table_foreach_#t~bitwise1351#1 > 2 + aws_hash_table_foreach_~rv~4#1)) && aws_hash_table_foreach_#t~bitwise1351#1 >= -2147483648; [2025-02-08 01:49:19,002 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L9722-3: assume 2 == aws_hash_table_foreach_~rv~4#1;aws_hash_table_foreach_#t~bitwise1351#1 := aws_hash_table_foreach_~rv~4#1; [2025-02-08 01:49:19,002 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L9722-3: assume !(2 == aws_hash_table_foreach_~rv~4#1); [2025-02-08 01:49:19,002 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L9722-4: assume 0 == aws_hash_table_foreach_~rv~4#1;aws_hash_table_foreach_#t~bitwise1351#1 := 0; [2025-02-08 01:49:19,002 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L9722-4: assume !(0 == aws_hash_table_foreach_~rv~4#1); [2025-02-08 01:49:19,002 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L9896: call aws_hash_iter_delete_#t~mem1446#1 := read~int#4(aws_hash_iter_delete_~iter#1.base, 24 + aws_hash_iter_delete_~iter#1.offset, 8);aws_hash_iter_delete_#t~post1447#1 := aws_hash_iter_delete_#t~mem1446#1;call write~int#4(aws_hash_iter_delete_#t~post1447#1 - 1, aws_hash_iter_delete_~iter#1.base, 24 + aws_hash_iter_delete_~iter#1.offset, 8);havoc aws_hash_iter_delete_#t~mem1446#1;havoc aws_hash_iter_delete_#t~post1447#1;call write~int#4(1, aws_hash_iter_delete_~iter#1.base, 40 + aws_hash_iter_delete_~iter#1.offset, 4);call aws_hash_iter_delete_#t~mem1448#1 := read~int#4(aws_hash_iter_delete_~iter#1.base, 40 + aws_hash_iter_delete_~iter#1.offset, 4); [2025-02-08 01:49:19,002 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L9865: havoc aws_hash_iter_next_#t~mem1422#1;havoc aws_hash_iter_next_#t~mem1423#1;havoc aws_hash_iter_next_#t~short1424#1; [2025-02-08 01:49:19,002 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L9865-1: SUMMARY for call __VERIFIER_assert((if 0 == (if aws_hash_iter_next_#t~short1424#1 then 1 else 0) then 0 else 1)); srcloc: null [2025-02-08 01:49:19,002 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L9865-2: assume aws_hash_iter_next_#t~short1424#1; [2025-02-08 01:49:19,002 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L9865-2: assume !aws_hash_iter_next_#t~short1424#1;call aws_hash_iter_next_#t~mem1423#1 := read~int#4(aws_hash_iter_next_~iter#1.base, 40 + aws_hash_iter_next_~iter#1.offset, 4);aws_hash_iter_next_#t~short1424#1 := 2 == aws_hash_iter_next_#t~mem1423#1; [2025-02-08 01:49:19,003 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L9882: assume 0 != aws_hash_iter_delete_~destroy_contents#1 % 256;call aws_hash_iter_delete_#t~mem1433#1.base, aws_hash_iter_delete_#t~mem1433#1.offset := read~$Pointer$#3(aws_hash_iter_delete_~state~12#1.base, 16 + aws_hash_iter_delete_~state~12#1.offset, 8); [2025-02-08 01:49:19,003 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L9882: assume !(0 != aws_hash_iter_delete_~destroy_contents#1 % 256); [2025-02-08 01:49:19,003 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L9874: havoc aws_hash_iter_delete_#t~mem1426#1; [2025-02-08 01:49:19,003 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L9874-1: SUMMARY for call assume_abort_if_not((if 0 == (if 2 == aws_hash_iter_delete_#t~mem1426#1 then 1 else 0) then 0 else 1)); srcloc: null [2025-02-08 01:49:19,003 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L9891: aws_hash_iter_delete_~last_index~0#1 := aws_hash_iter_delete_#t~ret1440#1;havoc aws_hash_iter_delete_#t~mem1439#1;havoc aws_hash_iter_delete_#t~ret1440#1;call aws_hash_iter_delete_#t~mem1441#1 := read~int#4(aws_hash_iter_delete_~iter#1.base, 24 + aws_hash_iter_delete_~iter#1.offset, 8);aws_hash_iter_delete_#t~short1443#1 := aws_hash_iter_delete_~last_index~0#1 % 18446744073709551616 < aws_hash_iter_delete_#t~mem1441#1 % 18446744073709551616; [2025-02-08 01:49:19,003 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L9891-1: SUMMARY for call aws_hash_iter_delete_#t~ret1440#1 := s_remove_entry(aws_hash_iter_delete_~state~12#1.base, aws_hash_iter_delete_~state~12#1.offset, aws_hash_iter_delete_~state~12#1.base, 80 + aws_hash_iter_delete_~state~12#1.offset + 24 * (if aws_hash_iter_delete_#t~mem1439#1 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then aws_hash_iter_delete_#t~mem1439#1 % 18446744073709551616 % 18446744073709551616 else aws_hash_iter_delete_#t~mem1439#1 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616)); srcloc: null [2025-02-08 01:49:19,003 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L9883: assume aws_hash_iter_delete_#t~mem1433#1.base != 0 || aws_hash_iter_delete_#t~mem1433#1.offset != 0;havoc aws_hash_iter_delete_#t~mem1433#1.base, aws_hash_iter_delete_#t~mem1433#1.offset;call aws_hash_iter_delete_#t~mem1434#1.base, aws_hash_iter_delete_#t~mem1434#1.offset := read~$Pointer$#4(aws_hash_iter_delete_~iter#1.base, 8 + aws_hash_iter_delete_~iter#1.offset, 8);call aws_hash_iter_delete_#t~mem1435#1.base, aws_hash_iter_delete_#t~mem1435#1.offset := read~$Pointer$#3(aws_hash_iter_delete_~state~12#1.base, 16 + aws_hash_iter_delete_~state~12#1.offset, 8); [2025-02-08 01:49:19,003 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L9883: assume !(aws_hash_iter_delete_#t~mem1433#1.base != 0 || aws_hash_iter_delete_#t~mem1433#1.offset != 0);havoc aws_hash_iter_delete_#t~mem1433#1.base, aws_hash_iter_delete_#t~mem1433#1.offset; [2025-02-08 01:49:19,003 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L9891-2: call aws_hash_iter_delete_#t~mem1439#1 := read~int#4(aws_hash_iter_delete_~iter#1.base, 24 + aws_hash_iter_delete_~iter#1.offset, 8); [2025-02-08 01:49:19,003 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L9825-1: assume false; [2025-02-08 01:49:19,003 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L9825-1: assume !false; [2025-02-08 01:49:19,003 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L9825-2: havoc aws_hash_iter_begin_#t~mem1400#1.base, aws_hash_iter_begin_#t~mem1400#1.offset;havoc aws_hash_iter_begin_#t~mem1401#1.base, aws_hash_iter_begin_#t~mem1401#1.offset;havoc aws_hash_iter_begin_#t~mem1402#1.base, aws_hash_iter_begin_#t~mem1402#1.offset;havoc aws_hash_iter_begin_#t~mem1403#1;havoc aws_hash_iter_begin_#t~mem1404#1;havoc aws_hash_iter_begin_#t~mem1405#1;havoc aws_hash_iter_begin_#t~mem1406#1;havoc aws_hash_iter_begin_#t~mem1407#1.base, aws_hash_iter_begin_#t~mem1407#1.offset;havoc aws_hash_iter_begin_#t~mem1408#1.base, aws_hash_iter_begin_#t~mem1408#1.offset; [2025-02-08 01:49:19,004 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L9900: havoc aws_hash_iter_delete_#t~mem1448#1; [2025-02-08 01:49:19,004 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L9900-1: SUMMARY for call __VERIFIER_assert((if 0 == (if 1 == aws_hash_iter_delete_#t~mem1448#1 then 1 else 0) then 0 else 1)); srcloc: null [2025-02-08 01:49:19,004 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L9892: assume aws_hash_iter_delete_#t~short1443#1;havoc aws_hash_iter_delete_#t~mem1441#1;havoc aws_hash_iter_delete_#t~mem1442#1;havoc aws_hash_iter_delete_#t~short1443#1;call aws_hash_iter_delete_#t~mem1444#1 := read~int#4(aws_hash_iter_delete_~iter#1.base, 32 + aws_hash_iter_delete_~iter#1.offset, 8);aws_hash_iter_delete_#t~post1445#1 := aws_hash_iter_delete_#t~mem1444#1;call write~int#4(aws_hash_iter_delete_#t~post1445#1 - 1, aws_hash_iter_delete_~iter#1.base, 32 + aws_hash_iter_delete_~iter#1.offset, 8);havoc aws_hash_iter_delete_#t~mem1444#1;havoc aws_hash_iter_delete_#t~post1445#1; [2025-02-08 01:49:19,004 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L9892: assume !aws_hash_iter_delete_#t~short1443#1;havoc aws_hash_iter_delete_#t~mem1441#1;havoc aws_hash_iter_delete_#t~mem1442#1;havoc aws_hash_iter_delete_#t~short1443#1; [2025-02-08 01:49:19,004 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L9859: havoc aws_hash_iter_next_#t~ret1420#1;call aws_hash_iter_next_#t~mem1421#1 := read~int#4(aws_hash_iter_next_~iter#1.base, 24 + aws_hash_iter_next_~iter#1.offset, 8); [2025-02-08 01:49:19,004 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L9892-1: assume aws_hash_iter_delete_#t~short1443#1; [2025-02-08 01:49:19,004 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L9892-1: assume !aws_hash_iter_delete_#t~short1443#1;call aws_hash_iter_delete_#t~mem1442#1 := read~int#4(aws_hash_iter_delete_~iter#1.base, 32 + aws_hash_iter_delete_~iter#1.offset, 8);aws_hash_iter_delete_#t~short1443#1 := aws_hash_iter_delete_~last_index~0#1 % 18446744073709551616 >= aws_hash_iter_delete_#t~mem1442#1 % 18446744073709551616; [2025-02-08 01:49:19,004 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L9859-1: SUMMARY for call assume_abort_if_not((if 0 == aws_hash_iter_next_#t~ret1420#1 % 256 then 0 else 1)); srcloc: null [2025-02-08 01:49:19,004 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L9884: havoc aws_hash_iter_delete_#t~mem1434#1.base, aws_hash_iter_delete_#t~mem1434#1.offset;havoc aws_hash_iter_delete_#t~mem1435#1.base, aws_hash_iter_delete_#t~mem1435#1.offset; [2025-02-08 01:49:19,004 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L9884-1: SUMMARY for call ##fun~$Pointer$~TO~VOID(aws_hash_iter_delete_#t~mem1434#1.base, aws_hash_iter_delete_#t~mem1434#1.offset, aws_hash_iter_delete_#t~mem1435#1.base, aws_hash_iter_delete_#t~mem1435#1.offset); srcloc: null [2025-02-08 01:49:19,004 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L9859-2: SUMMARY for call aws_hash_iter_next_#t~ret1420#1 := aws_hash_iter_is_valid(aws_hash_iter_next_~iter#1.base, aws_hash_iter_next_~iter#1.offset); srcloc: null [2025-02-08 01:49:19,005 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L9876: havoc aws_hash_iter_delete_#t~ret1427#1;call aws_hash_iter_delete_#t~mem1428#1.base, aws_hash_iter_delete_#t~mem1428#1.offset := read~$Pointer$#4(aws_hash_iter_delete_~iter#1.base, aws_hash_iter_delete_~iter#1.offset, 8);call aws_hash_iter_delete_#t~mem1429#1.base, aws_hash_iter_delete_#t~mem1429#1.offset := read~$Pointer$#1(aws_hash_iter_delete_#t~mem1428#1.base, aws_hash_iter_delete_#t~mem1428#1.offset, 8);call aws_hash_iter_delete_#t~mem1430#1 := read~int#3(aws_hash_iter_delete_#t~mem1429#1.base, 48 + aws_hash_iter_delete_#t~mem1429#1.offset, 8); [2025-02-08 01:49:19,005 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L9719-3: assume 0 == aws_hash_table_foreach_#t~ret1349#1 % 256;havoc aws_hash_table_foreach_#t~ret1349#1; [2025-02-08 01:49:19,005 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L9719-3: assume !(0 == aws_hash_table_foreach_#t~ret1349#1 % 256);havoc aws_hash_table_foreach_#t~ret1349#1; [2025-02-08 01:49:19,005 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L9876-1: SUMMARY for call assume_abort_if_not((if 0 == aws_hash_iter_delete_#t~ret1427#1 % 256 then 0 else 1)); srcloc: null [2025-02-08 01:49:19,005 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L9719-4: aws_hash_table_foreach_#t~ret1349#1 := aws_hash_iter_done_#res#1;havoc aws_hash_iter_done_#t~ret1409#1, aws_hash_iter_done_#t~mem1410#1, aws_hash_iter_done_#t~mem1411#1, aws_hash_iter_done_#t~short1412#1, aws_hash_iter_done_#t~mem1413#1, aws_hash_iter_done_#t~mem1414#1, aws_hash_iter_done_#t~mem1415#1, aws_hash_iter_done_#t~mem1416#1, aws_hash_iter_done_#t~short1417#1, aws_hash_iter_done_#t~mem1418#1, aws_hash_iter_done_#t~ret1419#1, aws_hash_iter_done_~iter#1.base, aws_hash_iter_done_~iter#1.offset, aws_hash_iter_done_~rval~12#1;havoc aws_hash_iter_done_#in~iter#1.base, aws_hash_iter_done_#in~iter#1.offset;assume { :end_inline_aws_hash_iter_done } true; [2025-02-08 01:49:19,005 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L9876-2: SUMMARY for call aws_hash_iter_delete_#t~ret1427#1 := aws_hash_iter_is_valid(aws_hash_iter_delete_~iter#1.base, aws_hash_iter_delete_~iter#1.offset); srcloc: null [2025-02-08 01:49:19,005 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L9868: havoc aws_hash_iter_next_#t~ret1425#1;havoc aws_hash_iter_next_#t~ret1420#1, aws_hash_iter_next_#t~mem1421#1, aws_hash_iter_next_#t~mem1422#1, aws_hash_iter_next_#t~mem1423#1, aws_hash_iter_next_#t~short1424#1, aws_hash_iter_next_#t~ret1425#1, aws_hash_iter_next_~iter#1.base, aws_hash_iter_next_~iter#1.offset;havoc aws_hash_iter_next_#in~iter#1.base, aws_hash_iter_next_#in~iter#1.offset;assume { :end_inline_aws_hash_iter_next } true;call ULTIMATE.dealloc(aws_hash_table_foreach_~#iter~0#1.base, aws_hash_table_foreach_~#iter~0#1.offset);havoc aws_hash_table_foreach_~#iter~0#1.base, aws_hash_table_foreach_~#iter~0#1.offset; [2025-02-08 01:49:19,005 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L9868-1: SUMMARY for call __VERIFIER_assert((if 0 == aws_hash_iter_next_#t~ret1425#1 % 256 then 0 else 1)); srcloc: null [2025-02-08 01:49:19,005 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L9868-2: SUMMARY for call aws_hash_iter_next_#t~ret1425#1 := aws_hash_iter_is_valid(aws_hash_iter_next_~iter#1.base, aws_hash_iter_next_~iter#1.offset); srcloc: null [2025-02-08 01:49:19,005 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L9728: assume 0 == aws_hash_table_foreach_~rv~4#1 % 2; [2025-02-08 01:49:19,005 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L9728: assume !(0 == aws_hash_table_foreach_~rv~4#1 % 2);havoc aws_hash_table_foreach_~rv~4#1;assume { :begin_inline_aws_hash_iter_next } true;aws_hash_iter_next_#in~iter#1.base, aws_hash_iter_next_#in~iter#1.offset := aws_hash_table_foreach_~#iter~0#1.base, aws_hash_table_foreach_~#iter~0#1.offset;havoc aws_hash_iter_next_#t~ret1420#1, aws_hash_iter_next_#t~mem1421#1, aws_hash_iter_next_#t~mem1422#1, aws_hash_iter_next_#t~mem1423#1, aws_hash_iter_next_#t~short1424#1, aws_hash_iter_next_#t~ret1425#1, aws_hash_iter_next_~iter#1.base, aws_hash_iter_next_~iter#1.offset;aws_hash_iter_next_~iter#1.base, aws_hash_iter_next_~iter#1.offset := aws_hash_iter_next_#in~iter#1.base, aws_hash_iter_next_#in~iter#1.offset; [2025-02-08 01:49:19,005 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L9877: havoc aws_hash_iter_delete_#t~mem1428#1.base, aws_hash_iter_delete_#t~mem1428#1.offset;havoc aws_hash_iter_delete_#t~mem1429#1.base, aws_hash_iter_delete_#t~mem1429#1.offset;havoc aws_hash_iter_delete_#t~mem1430#1;call aws_hash_iter_delete_#t~mem1431#1.base, aws_hash_iter_delete_#t~mem1431#1.offset := read~$Pointer$#4(aws_hash_iter_delete_~iter#1.base, aws_hash_iter_delete_~iter#1.offset, 8);call aws_hash_iter_delete_#t~mem1432#1.base, aws_hash_iter_delete_#t~mem1432#1.offset := read~$Pointer$#1(aws_hash_iter_delete_#t~mem1431#1.base, aws_hash_iter_delete_#t~mem1431#1.offset, 8);aws_hash_iter_delete_~state~12#1.base, aws_hash_iter_delete_~state~12#1.offset := aws_hash_iter_delete_#t~mem1432#1.base, aws_hash_iter_delete_#t~mem1432#1.offset;havoc aws_hash_iter_delete_#t~mem1431#1.base, aws_hash_iter_delete_#t~mem1431#1.offset;havoc aws_hash_iter_delete_#t~mem1432#1.base, aws_hash_iter_delete_#t~mem1432#1.offset; [2025-02-08 01:49:19,005 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L9877-1: SUMMARY for call assume_abort_if_not((if 0 == (if aws_hash_iter_delete_#t~mem1430#1 % 18446744073709551616 > 0 then 1 else 0) then 0 else 1)); srcloc: null [2025-02-08 01:49:19,005 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L9720: assume -2147483648 <= aws_hash_table_foreach_#t~ret1350#1 && aws_hash_table_foreach_#t~ret1350#1 <= 2147483647;aws_hash_table_foreach_~rv~4#1 := aws_hash_table_foreach_#t~ret1350#1;havoc aws_hash_table_foreach_#t~ret1350#1; [2025-02-08 01:49:19,006 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L9720-1: SUMMARY for call aws_hash_table_foreach_#t~ret1350#1 := ##fun~$Pointer$~X~$Pointer$~TO~int(aws_hash_table_foreach_~context#1.base, aws_hash_table_foreach_~context#1.offset, aws_hash_table_foreach_~#iter~0#1.base, 8 + aws_hash_table_foreach_~#iter~0#1.offset, aws_hash_table_foreach_~callback#1.base, aws_hash_table_foreach_~callback#1.offset); srcloc: null [2025-02-08 01:49:19,006 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L9886-1: call aws_hash_iter_delete_#t~mem1436#1.base, aws_hash_iter_delete_#t~mem1436#1.offset := read~$Pointer$#3(aws_hash_iter_delete_~state~12#1.base, 24 + aws_hash_iter_delete_~state~12#1.offset, 8); [2025-02-08 01:49:19,006 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L9886: assume aws_hash_iter_delete_#t~mem1436#1.base != 0 || aws_hash_iter_delete_#t~mem1436#1.offset != 0;havoc aws_hash_iter_delete_#t~mem1436#1.base, aws_hash_iter_delete_#t~mem1436#1.offset;call aws_hash_iter_delete_#t~mem1437#1.base, aws_hash_iter_delete_#t~mem1437#1.offset := read~$Pointer$#4(aws_hash_iter_delete_~iter#1.base, 16 + aws_hash_iter_delete_~iter#1.offset, 8);call aws_hash_iter_delete_#t~mem1438#1.base, aws_hash_iter_delete_#t~mem1438#1.offset := read~$Pointer$#3(aws_hash_iter_delete_~state~12#1.base, 24 + aws_hash_iter_delete_~state~12#1.offset, 8); [2025-02-08 01:49:19,006 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L9886: assume !(aws_hash_iter_delete_#t~mem1436#1.base != 0 || aws_hash_iter_delete_#t~mem1436#1.offset != 0);havoc aws_hash_iter_delete_#t~mem1436#1.base, aws_hash_iter_delete_#t~mem1436#1.offset; [2025-02-08 01:49:19,006 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L9903-2: SUMMARY for call aws_hash_iter_delete_#t~ret1449#1 := aws_hash_iter_is_valid(aws_hash_iter_delete_~iter#1.base, aws_hash_iter_delete_~iter#1.offset); srcloc: null [2025-02-08 01:49:19,006 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L9903: havoc aws_hash_iter_delete_#t~ret1449#1;havoc aws_hash_iter_delete_#t~mem1426#1, aws_hash_iter_delete_#t~ret1427#1, aws_hash_iter_delete_#t~mem1428#1.base, aws_hash_iter_delete_#t~mem1428#1.offset, aws_hash_iter_delete_#t~mem1429#1.base, aws_hash_iter_delete_#t~mem1429#1.offset, aws_hash_iter_delete_#t~mem1430#1, aws_hash_iter_delete_#t~mem1431#1.base, aws_hash_iter_delete_#t~mem1431#1.offset, aws_hash_iter_delete_#t~mem1432#1.base, aws_hash_iter_delete_#t~mem1432#1.offset, aws_hash_iter_delete_#t~mem1433#1.base, aws_hash_iter_delete_#t~mem1433#1.offset, aws_hash_iter_delete_#t~mem1434#1.base, aws_hash_iter_delete_#t~mem1434#1.offset, aws_hash_iter_delete_#t~mem1435#1.base, aws_hash_iter_delete_#t~mem1435#1.offset, aws_hash_iter_delete_#t~mem1436#1.base, aws_hash_iter_delete_#t~mem1436#1.offset, aws_hash_iter_delete_#t~mem1437#1.base, aws_hash_iter_delete_#t~mem1437#1.offset, aws_hash_iter_delete_#t~mem1438#1.base, aws_hash_iter_delete_#t~mem1438#1.offset, aws_hash_iter_delete_#t~mem1439#1, aws_hash_iter_delete_#t~ret1440#1, aws_hash_iter_delete_#t~mem1441#1, aws_hash_iter_delete_#t~mem1442#1, aws_hash_iter_delete_#t~short1443#1, aws_hash_iter_delete_#t~mem1444#1, aws_hash_iter_delete_#t~post1445#1, aws_hash_iter_delete_#t~mem1446#1, aws_hash_iter_delete_#t~post1447#1, aws_hash_iter_delete_#t~mem1448#1, aws_hash_iter_delete_#t~ret1449#1, aws_hash_iter_delete_~iter#1.base, aws_hash_iter_delete_~iter#1.offset, aws_hash_iter_delete_~destroy_contents#1, aws_hash_iter_delete_~state~12#1.base, aws_hash_iter_delete_~state~12#1.offset, aws_hash_iter_delete_~last_index~0#1;havoc aws_hash_iter_delete_#in~iter#1.base, aws_hash_iter_delete_#in~iter#1.offset, aws_hash_iter_delete_#in~destroy_contents#1;assume { :end_inline_aws_hash_iter_delete } true; [2025-02-08 01:49:19,006 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L9903-1: SUMMARY for call __VERIFIER_assert((if 0 == aws_hash_iter_delete_#t~ret1449#1 % 256 then 0 else 1)); srcloc: null [2025-02-08 01:49:19,006 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L9862-1: SUMMARY for call s_get_next_element(aws_hash_iter_next_~iter#1.base, aws_hash_iter_next_~iter#1.offset, 1 + aws_hash_iter_next_#t~mem1421#1); srcloc: null [2025-02-08 01:49:19,006 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L9862: havoc aws_hash_iter_next_#t~mem1421#1;call aws_hash_iter_next_#t~mem1422#1 := read~int#4(aws_hash_iter_next_~iter#1.base, 40 + aws_hash_iter_next_~iter#1.offset, 4);aws_hash_iter_next_#t~short1424#1 := 0 == aws_hash_iter_next_#t~mem1422#1; [2025-02-08 01:49:19,186 INFO L? ?]: Removed 263 outVars from TransFormulas that were not future-live. [2025-02-08 01:49:19,187 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 01:49:19,214 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 01:49:19,215 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 01:49:19,215 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:49:19 BoogieIcfgContainer [2025-02-08 01:49:19,215 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 01:49:19,218 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 01:49:19,219 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 01:49:19,222 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 01:49:19,222 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 01:49:10" (1/3) ... [2025-02-08 01:49:19,223 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dab121a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:49:19, skipping insertion in model container [2025-02-08 01:49:19,223 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:49:12" (2/3) ... [2025-02-08 01:49:19,223 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dab121a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:49:19, skipping insertion in model container [2025-02-08 01:49:19,223 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:49:19" (3/3) ... [2025-02-08 01:49:19,224 INFO L128 eAbstractionObserver]: Analyzing ICFG aws_hash_table_foreach_harness.i [2025-02-08 01:49:19,234 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 01:49:19,235 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG aws_hash_table_foreach_harness.i that has 29 procedures, 272 locations, 1 initial locations, 15 loop locations, and 1 error locations. [2025-02-08 01:49:19,270 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 01:49:19,277 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@77c33e39, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 01:49:19,278 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-08 01:49:19,281 INFO L276 IsEmpty]: Start isEmpty. Operand has 240 states, 149 states have (on average 1.3288590604026846) internal successors, (198), 155 states have internal predecessors, (198), 60 states have call successors, (60), 20 states have call predecessors, (60), 20 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-02-08 01:49:19,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-02-08 01:49:19,288 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:49:19,288 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 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] [2025-02-08 01:49:19,289 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:49:19,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:49:19,292 INFO L85 PathProgramCache]: Analyzing trace with hash 2050717331, now seen corresponding path program 1 times [2025-02-08 01:49:19,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:49:19,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935369319] [2025-02-08 01:49:19,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:49:19,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:49:23,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-08 01:49:24,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-08 01:49:24,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:49:24,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:49:24,576 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2025-02-08 01:49:24,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:49:24,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935369319] [2025-02-08 01:49:24,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935369319] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:49:24,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [724618999] [2025-02-08 01:49:24,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:49:24,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:49:24,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:49:24,582 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 01:49:24,593 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 01:49:29,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-08 01:49:29,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-08 01:49:29,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:49:29,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:49:29,580 INFO L256 TraceCheckSpWp]: Trace formula consists of 4354 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-08 01:49:29,589 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:49:29,609 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2025-02-08 01:49:29,609 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 01:49:29,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [724618999] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:49:29,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 01:49:29,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-08 01:49:29,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478810125] [2025-02-08 01:49:29,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:49:29,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 01:49:29,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:49:29,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 01:49:29,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 01:49:29,630 INFO L87 Difference]: Start difference. First operand has 240 states, 149 states have (on average 1.3288590604026846) internal successors, (198), 155 states have internal predecessors, (198), 60 states have call successors, (60), 20 states have call predecessors, (60), 20 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-08 01:49:29,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:49:29,682 INFO L93 Difference]: Finished difference Result 300 states and 410 transitions. [2025-02-08 01:49:29,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 01:49:29,684 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 118 [2025-02-08 01:49:29,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:49:29,692 INFO L225 Difference]: With dead ends: 300 [2025-02-08 01:49:29,692 INFO L226 Difference]: Without dead ends: 131 [2025-02-08 01:49:29,695 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 01:49:29,697 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 01:49:29,697 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 175 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 01:49:29,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-02-08 01:49:29,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2025-02-08 01:49:29,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 87 states have (on average 1.2528735632183907) internal successors, (109), 88 states have internal predecessors, (109), 28 states have call successors, (28), 15 states have call predecessors, (28), 15 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-02-08 01:49:29,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 164 transitions. [2025-02-08 01:49:29,724 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 164 transitions. Word has length 118 [2025-02-08 01:49:29,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:49:29,725 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 164 transitions. [2025-02-08 01:49:29,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-08 01:49:29,725 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 164 transitions. [2025-02-08 01:49:29,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-02-08 01:49:29,728 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:49:29,728 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 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] [2025-02-08 01:49:29,746 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-08 01:49:29,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-08 01:49:29,930 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:49:29,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:49:29,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1761042096, now seen corresponding path program 1 times [2025-02-08 01:49:29,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:49:29,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596617503] [2025-02-08 01:49:29,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:49:29,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:49:34,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-02-08 01:49:34,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-02-08 01:49:34,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:49:34,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:49:35,291 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2025-02-08 01:49:35,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:49:35,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596617503] [2025-02-08 01:49:35,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596617503] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:49:35,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:49:35,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 01:49:35,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941977580] [2025-02-08 01:49:35,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:49:35,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 01:49:35,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:49:35,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 01:49:35,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 01:49:35,293 INFO L87 Difference]: Start difference. First operand 131 states and 164 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (19), 3 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-08 01:49:35,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:49:35,412 INFO L93 Difference]: Finished difference Result 228 states and 289 transitions. [2025-02-08 01:49:35,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 01:49:35,412 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (19), 3 states have call predecessors, (19), 2 states have call successors, (19) Word has length 125 [2025-02-08 01:49:35,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:49:35,414 INFO L225 Difference]: With dead ends: 228 [2025-02-08 01:49:35,414 INFO L226 Difference]: Without dead ends: 131 [2025-02-08 01:49:35,414 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 01:49:35,415 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 0 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 01:49:35,415 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 477 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 01:49:35,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-02-08 01:49:35,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2025-02-08 01:49:35,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 87 states have (on average 1.2413793103448276) internal successors, (108), 88 states have internal predecessors, (108), 28 states have call successors, (28), 15 states have call predecessors, (28), 15 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-02-08 01:49:35,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 163 transitions. [2025-02-08 01:49:35,423 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 163 transitions. Word has length 125 [2025-02-08 01:49:35,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:49:35,423 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 163 transitions. [2025-02-08 01:49:35,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (19), 3 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-08 01:49:35,424 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 163 transitions. [2025-02-08 01:49:35,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-02-08 01:49:35,426 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:49:35,427 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 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] [2025-02-08 01:49:35,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 01:49:35,427 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:49:35,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:49:35,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1374927243, now seen corresponding path program 1 times [2025-02-08 01:49:35,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:49:35,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946241282] [2025-02-08 01:49:35,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:49:35,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:49:39,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-02-08 01:49:39,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-02-08 01:49:39,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:49:39,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:49:43,053 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2025-02-08 01:49:43,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:49:43,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946241282] [2025-02-08 01:49:43,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946241282] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:49:43,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1571690074] [2025-02-08 01:49:43,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:49:43,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:49:43,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:49:43,057 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 01:49:43,059 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 01:49:47,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-02-08 01:49:48,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-02-08 01:49:48,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:49:48,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:49:48,126 INFO L256 TraceCheckSpWp]: Trace formula consists of 4474 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-08 01:49:48,142 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:49:51,459 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2025-02-08 01:49:51,460 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 01:49:54,669 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2025-02-08 01:49:54,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1571690074] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-08 01:49:54,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-08 01:49:54,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10, 8] total 21 [2025-02-08 01:49:54,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769247756] [2025-02-08 01:49:54,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:49:54,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 01:49:54,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:49:54,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 01:49:54,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=372, Unknown=0, NotChecked=0, Total=420 [2025-02-08 01:49:54,671 INFO L87 Difference]: Start difference. First operand 131 states and 163 transitions. Second operand has 8 states, 8 states have (on average 7.375) internal successors, (59), 7 states have internal predecessors, (59), 5 states have call successors, (23), 3 states have call predecessors, (23), 2 states have return successors, (21), 5 states have call predecessors, (21), 4 states have call successors, (21) [2025-02-08 01:49:57,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:49:57,059 INFO L93 Difference]: Finished difference Result 195 states and 245 transitions. [2025-02-08 01:49:57,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 01:49:57,060 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 7 states have internal predecessors, (59), 5 states have call successors, (23), 3 states have call predecessors, (23), 2 states have return successors, (21), 5 states have call predecessors, (21), 4 states have call successors, (21) Word has length 136 [2025-02-08 01:49:57,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:49:57,063 INFO L225 Difference]: With dead ends: 195 [2025-02-08 01:49:57,063 INFO L226 Difference]: Without dead ends: 137 [2025-02-08 01:49:57,064 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 260 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=72, Invalid=578, Unknown=0, NotChecked=0, Total=650 [2025-02-08 01:49:57,064 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 173 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-08 01:49:57,064 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 645 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-08 01:49:57,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-02-08 01:49:57,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 131. [2025-02-08 01:49:57,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 87 states have (on average 1.2298850574712643) internal successors, (107), 88 states have internal predecessors, (107), 28 states have call successors, (28), 15 states have call predecessors, (28), 15 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-02-08 01:49:57,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 162 transitions. [2025-02-08 01:49:57,079 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 162 transitions. Word has length 136 [2025-02-08 01:49:57,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:49:57,079 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 162 transitions. [2025-02-08 01:49:57,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 7 states have internal predecessors, (59), 5 states have call successors, (23), 3 states have call predecessors, (23), 2 states have return successors, (21), 5 states have call predecessors, (21), 4 states have call successors, (21) [2025-02-08 01:49:57,080 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 162 transitions. [2025-02-08 01:49:57,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-02-08 01:49:57,083 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:49:57,086 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 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] [2025-02-08 01:49:57,105 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-08 01:49:57,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:49:57,287 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:49:57,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:49:57,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1550938626, now seen corresponding path program 1 times [2025-02-08 01:49:57,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:49:57,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778384371] [2025-02-08 01:49:57,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:49:57,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:50:00,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-02-08 01:50:01,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-02-08 01:50:01,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:50:01,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:50:03,807 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2025-02-08 01:50:03,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:50:03,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778384371] [2025-02-08 01:50:03,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778384371] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:50:03,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [275730758] [2025-02-08 01:50:03,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:50:03,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:50:03,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:50:03,811 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 01:50:03,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 01:50:08,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-02-08 01:50:08,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-02-08 01:50:08,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:50:08,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:50:08,710 INFO L256 TraceCheckSpWp]: Trace formula consists of 4479 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-08 01:50:08,716 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:50:09,176 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2025-02-08 01:50:09,176 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 01:50:09,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [275730758] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:50:09,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 01:50:09,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2025-02-08 01:50:09,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997360225] [2025-02-08 01:50:09,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:50:09,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 01:50:09,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:50:09,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 01:50:09,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-02-08 01:50:09,178 INFO L87 Difference]: Start difference. First operand 131 states and 162 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (21), 3 states have call predecessors, (21), 2 states have call successors, (21) [2025-02-08 01:50:09,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:50:09,277 INFO L93 Difference]: Finished difference Result 228 states and 286 transitions. [2025-02-08 01:50:09,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 01:50:09,278 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (21), 3 states have call predecessors, (21), 2 states have call successors, (21) Word has length 137 [2025-02-08 01:50:09,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:50:09,279 INFO L225 Difference]: With dead ends: 228 [2025-02-08 01:50:09,280 INFO L226 Difference]: Without dead ends: 131 [2025-02-08 01:50:09,280 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-02-08 01:50:09,281 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 0 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 01:50:09,281 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 471 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 01:50:09,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-02-08 01:50:09,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2025-02-08 01:50:09,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 87 states have (on average 1.2183908045977012) internal successors, (106), 88 states have internal predecessors, (106), 28 states have call successors, (28), 15 states have call predecessors, (28), 15 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-02-08 01:50:09,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 161 transitions. [2025-02-08 01:50:09,296 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 161 transitions. Word has length 137 [2025-02-08 01:50:09,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:50:09,296 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 161 transitions. [2025-02-08 01:50:09,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (21), 3 states have call predecessors, (21), 2 states have call successors, (21) [2025-02-08 01:50:09,296 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 161 transitions. [2025-02-08 01:50:09,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-02-08 01:50:09,298 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:50:09,298 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 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] [2025-02-08 01:50:09,317 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-08 01:50:09,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:50:09,502 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:50:09,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:50:09,502 INFO L85 PathProgramCache]: Analyzing trace with hash 803446656, now seen corresponding path program 1 times [2025-02-08 01:50:09,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:50:09,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990625636] [2025-02-08 01:50:09,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:50:09,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:50:13,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-02-08 01:50:13,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-02-08 01:50:13,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:50:13,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:50:16,905 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2025-02-08 01:50:16,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:50:16,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990625636] [2025-02-08 01:50:16,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990625636] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:50:16,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [738033231] [2025-02-08 01:50:16,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:50:16,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:50:16,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:50:16,909 INFO L229 MonitoredProcess]: Starting monitored process 5 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 01:50:16,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-08 01:50:21,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-02-08 01:50:22,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-02-08 01:50:22,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:50:22,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:50:22,451 INFO L256 TraceCheckSpWp]: Trace formula consists of 4480 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-02-08 01:50:22,459 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:50:23,796 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-08 01:50:27,729 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-02-08 01:50:27,729 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 01:50:27,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [738033231] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:50:27,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 01:50:27,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [10] total 19 [2025-02-08 01:50:27,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886770480] [2025-02-08 01:50:27,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:50:27,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-08 01:50:27,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:50:27,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-08 01:50:27,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2025-02-08 01:50:27,735 INFO L87 Difference]: Start difference. First operand 131 states and 161 transitions. Second operand has 12 states, 11 states have (on average 7.090909090909091) internal successors, (78), 11 states have internal predecessors, (78), 5 states have call successors, (23), 3 states have call predecessors, (23), 5 states have return successors, (21), 5 states have call predecessors, (21), 5 states have call successors, (21) [2025-02-08 01:50:31,824 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 01:50:36,221 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.40s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-08 01:50:40,620 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.40s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]