./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_hash_table_eq_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_eq_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 4e984a9029981b62e4f2c0c4f313850f20633ca16be8aebe99d7cc6e2f39f6fd --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 01:48:53,218 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 01:48:53,274 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:48:53,278 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 01:48:53,278 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 01:48:53,300 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 01:48:53,300 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 01:48:53,300 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 01:48:53,300 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 01:48:53,302 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 01:48:53,302 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 01:48:53,302 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 01:48:53,302 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 01:48:53,302 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 01:48:53,303 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 01:48:53,303 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 01:48:53,303 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 01:48:53,303 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 01:48:53,303 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 01:48:53,303 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 01:48:53,303 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 01:48:53,304 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 01:48:53,304 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 01:48:53,304 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 01:48:53,304 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 01:48:53,304 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 01:48:53,304 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 01:48:53,304 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 01:48:53,304 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 01:48:53,304 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 01:48:53,304 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 01:48:53,305 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 01:48:53,305 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 01:48:53,305 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 01:48:53,305 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 01:48:53,305 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 01:48:53,305 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 01:48:53,305 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 01:48:53,305 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 01:48:53,305 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 01:48:53,305 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 -> 4e984a9029981b62e4f2c0c4f313850f20633ca16be8aebe99d7cc6e2f39f6fd [2025-02-08 01:48:53,515 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 01:48:53,522 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 01:48:53,525 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 01:48:53,526 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 01:48:53,526 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 01:48:53,527 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_eq_harness.i [2025-02-08 01:48:54,733 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9c0fe141d/664da6f2dcbd4eb6b34e62a5723bd2c1/FLAG2a6e0c789 [2025-02-08 01:48:55,228 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 01:48:55,230 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_eq_harness.i [2025-02-08 01:48:55,273 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9c0fe141d/664da6f2dcbd4eb6b34e62a5723bd2c1/FLAG2a6e0c789 [2025-02-08 01:48:55,289 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9c0fe141d/664da6f2dcbd4eb6b34e62a5723bd2c1 [2025-02-08 01:48:55,291 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 01:48:55,292 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 01:48:55,294 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 01:48:55,294 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 01:48:55,297 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 01:48:55,298 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:48:55" (1/1) ... [2025-02-08 01:48:55,299 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@617a996c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:48:55, skipping insertion in model container [2025-02-08 01:48:55,299 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:48:55" (1/1) ... [2025-02-08 01:48:55,374 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 01:48:55,579 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_eq_harness.i[4491,4504] [2025-02-08 01:48:55,588 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_eq_harness.i[4551,4564] [2025-02-08 01:48:56,625 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:48:56,626 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:48:56,626 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:48:56,626 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:48:56,627 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:48:56,647 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:48:56,651 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:48:56,653 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:48:56,653 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:48:56,658 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:48:56,660 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:48:56,661 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:48:56,661 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:48:57,154 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:48:57,155 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:48:57,168 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:48:57,168 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:48:57,172 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:48:57,172 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:48:57,184 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:48:57,185 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:48:57,185 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:48:57,186 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:48:57,186 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:48:57,186 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:48:57,186 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:48:57,218 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_eq_harness.i[228146,228159] [2025-02-08 01:48:57,219 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 01:48:57,241 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 01:48:57,251 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_eq_harness.i[4491,4504] [2025-02-08 01:48:57,252 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_eq_harness.i[4551,4564] [2025-02-08 01:48:57,281 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:48:57,282 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:48:57,282 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:48:57,282 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:48:57,283 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:48:57,287 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:48:57,288 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:48:57,289 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:48:57,289 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:48:57,290 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:48:57,290 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:48:57,290 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:48:57,290 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:48:57,382 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" : : "r"(pBuf) : "memory"); [7558-7569] [2025-02-08 01:48:57,439 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:48:57,440 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:48:57,445 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:48:57,446 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:48:57,448 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:48:57,448 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:48:57,454 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:48:57,455 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:48:57,455 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:48:57,455 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:48:57,455 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:48:57,456 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:48:57,456 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:48:57,472 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_eq_harness.i[228146,228159] [2025-02-08 01:48:57,472 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 01:48:57,652 INFO L204 MainTranslator]: Completed translation [2025-02-08 01:48:57,653 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:48:57 WrapperNode [2025-02-08 01:48:57,653 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 01:48:57,654 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 01:48:57,654 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 01:48:57,654 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 01:48:57,659 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:48:57" (1/1) ... [2025-02-08 01:48:57,718 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:48:57" (1/1) ... [2025-02-08 01:48:57,765 INFO L138 Inliner]: procedures = 763, calls = 2450, calls flagged for inlining = 69, calls inlined = 18, statements flattened = 968 [2025-02-08 01:48:57,765 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 01:48:57,766 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 01:48:57,766 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 01:48:57,766 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 01:48:57,773 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:48:57" (1/1) ... [2025-02-08 01:48:57,773 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:48:57" (1/1) ... [2025-02-08 01:48:57,780 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:48:57" (1/1) ... [2025-02-08 01:48:57,872 INFO L175 MemorySlicer]: Split 320 memory accesses to 11 slices as follows [238, 2, 3, 4, 39, 2, 5, 13, 3, 6, 5]. 74 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [6, 2, 0, 0, 0, 0, 1, 0, 0, 0, 5]. The 250 writes are split as follows [232, 0, 1, 3, 5, 1, 2, 1, 3, 2, 0]. [2025-02-08 01:48:57,872 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:48:57" (1/1) ... [2025-02-08 01:48:57,872 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:48:57" (1/1) ... [2025-02-08 01:48:57,900 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:48:57" (1/1) ... [2025-02-08 01:48:57,903 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:48:57" (1/1) ... [2025-02-08 01:48:57,912 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:48:57" (1/1) ... [2025-02-08 01:48:57,917 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:48:57" (1/1) ... [2025-02-08 01:48:57,929 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 01:48:57,930 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 01:48:57,930 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 01:48:57,930 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 01:48:57,931 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:48:57" (1/1) ... [2025-02-08 01:48:57,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 01:48:57,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:48:57,958 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:48:57,960 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:48:58,002 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-02-08 01:48:58,002 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-02-08 01:48:58,002 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-02-08 01:48:58,002 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-02-08 01:48:58,002 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-02-08 01:48:58,002 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2025-02-08 01:48:58,002 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2025-02-08 01:48:58,002 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2025-02-08 01:48:58,002 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#8 [2025-02-08 01:48:58,002 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#9 [2025-02-08 01:48:58,002 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#10 [2025-02-08 01:48:58,002 INFO L130 BoogieDeclarations]: Found specification of procedure s_hash_keys_eq [2025-02-08 01:48:58,002 INFO L138 BoogieDeclarations]: Found implementation of procedure s_hash_keys_eq [2025-02-08 01:48:58,002 INFO L130 BoogieDeclarations]: Found specification of procedure save_byte_from_hash_table [2025-02-08 01:48:58,002 INFO L138 BoogieDeclarations]: Found implementation of procedure save_byte_from_hash_table [2025-02-08 01:48:58,002 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_uninterpreted_equals [2025-02-08 01:48:58,002 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_uninterpreted_equals [2025-02-08 01:48:58,002 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 01:48:58,003 INFO L130 BoogieDeclarations]: Found specification of procedure aws_hash_table_get_entry_count [2025-02-08 01:48:58,003 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_hash_table_get_entry_count [2025-02-08 01:48:58,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-02-08 01:48:58,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-02-08 01:48:58,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-02-08 01:48:58,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-02-08 01:48:58,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-02-08 01:48:58,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-02-08 01:48:58,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-02-08 01:48:58,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-02-08 01:48:58,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-02-08 01:48:58,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-02-08 01:48:58,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2025-02-08 01:48:58,003 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 01:48:58,003 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 01:48:58,003 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-08 01:48:58,003 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-08 01:48:58,003 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-08 01:48:58,003 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-02-08 01:48:58,003 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-02-08 01:48:58,003 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-02-08 01:48:58,003 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-02-08 01:48:58,003 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-02-08 01:48:58,003 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-02-08 01:48:58,003 INFO L130 BoogieDeclarations]: Found specification of procedure aws_raise_error [2025-02-08 01:48:58,003 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_raise_error [2025-02-08 01:48:58,003 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-08 01:48:58,003 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-08 01:48:58,003 INFO L130 BoogieDeclarations]: Found specification of procedure hash_table_state_is_valid [2025-02-08 01:48:58,003 INFO L138 BoogieDeclarations]: Found implementation of procedure hash_table_state_is_valid [2025-02-08 01:48:58,003 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 01:48:58,003 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 01:48:58,003 INFO L130 BoogieDeclarations]: Found specification of procedure hash_table_state_required_bytes [2025-02-08 01:48:58,005 INFO L138 BoogieDeclarations]: Found implementation of procedure hash_table_state_required_bytes [2025-02-08 01:48:58,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-08 01:48:58,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-08 01:48:58,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-08 01:48:58,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-02-08 01:48:58,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-02-08 01:48:58,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-02-08 01:48:58,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-02-08 01:48:58,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-02-08 01:48:58,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-02-08 01:48:58,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-02-08 01:48:58,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-02-08 01:48:58,007 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_uninterpreted_hasher [2025-02-08 01:48:58,007 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_uninterpreted_hasher [2025-02-08 01:48:58,007 INFO L130 BoogieDeclarations]: Found specification of procedure s_safe_eq_check [2025-02-08 01:48:58,007 INFO L138 BoogieDeclarations]: Found implementation of procedure s_safe_eq_check [2025-02-08 01:48:58,008 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 01:48:58,008 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 01:48:58,008 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2025-02-08 01:48:58,008 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2025-02-08 01:48:58,008 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mul_size_checked [2025-02-08 01:48:58,008 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mul_size_checked [2025-02-08 01:48:58,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-02-08 01:48:58,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-02-08 01:48:58,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-02-08 01:48:58,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-02-08 01:48:58,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-02-08 01:48:58,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-02-08 01:48:58,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-02-08 01:48:58,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-02-08 01:48:58,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2025-02-08 01:48:58,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2025-02-08 01:48:58,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#10 [2025-02-08 01:48:58,009 INFO L130 BoogieDeclarations]: Found specification of procedure s_find_entry [2025-02-08 01:48:58,009 INFO L138 BoogieDeclarations]: Found implementation of procedure s_find_entry [2025-02-08 01:48:58,009 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-08 01:48:58,009 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-08 01:48:58,009 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 01:48:58,009 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_plus [2025-02-08 01:48:58,009 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_plus [2025-02-08 01:48:58,009 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-08 01:48:58,009 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-08 01:48:58,010 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-08 01:48:58,010 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-02-08 01:48:58,010 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-02-08 01:48:58,010 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-02-08 01:48:58,011 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-02-08 01:48:58,011 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-02-08 01:48:58,011 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-02-08 01:48:58,011 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-02-08 01:48:58,011 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-02-08 01:48:58,011 INFO L130 BoogieDeclarations]: Found specification of procedure aws_hash_table_is_valid [2025-02-08 01:48:58,011 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_hash_table_is_valid [2025-02-08 01:48:58,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-08 01:48:58,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-08 01:48:58,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-08 01:48:58,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-02-08 01:48:58,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-02-08 01:48:58,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-02-08 01:48:58,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-02-08 01:48:58,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-02-08 01:48:58,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-02-08 01:48:58,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-02-08 01:48:58,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-02-08 01:48:58,012 INFO L130 BoogieDeclarations]: Found specification of procedure ensure_allocated_hash_table [2025-02-08 01:48:58,012 INFO L138 BoogieDeclarations]: Found implementation of procedure ensure_allocated_hash_table [2025-02-08 01:48:58,012 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_mult [2025-02-08 01:48:58,012 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_mult [2025-02-08 01:48:58,012 INFO L130 BoogieDeclarations]: Found specification of procedure aws_add_size_checked [2025-02-08 01:48:58,012 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_add_size_checked [2025-02-08 01:48:58,012 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2025-02-08 01:48:58,012 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2025-02-08 01:48:58,012 INFO L130 BoogieDeclarations]: Found specification of procedure check_hash_table_unchanged [2025-02-08 01:48:58,012 INFO L138 BoogieDeclarations]: Found implementation of procedure check_hash_table_unchanged [2025-02-08 01:48:58,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 01:48:58,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 01:48:58,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-08 01:48:58,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-08 01:48:58,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-08 01:48:58,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-08 01:48:58,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-02-08 01:48:58,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-02-08 01:48:58,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-02-08 01:48:58,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-02-08 01:48:58,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-02-08 01:48:58,012 INFO L130 BoogieDeclarations]: Found specification of procedure s_hash_for [2025-02-08 01:48:58,012 INFO L138 BoogieDeclarations]: Found implementation of procedure s_hash_for [2025-02-08 01:48:58,012 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2025-02-08 01:48:58,012 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2025-02-08 01:48:58,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 01:48:58,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 01:48:58,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 01:48:58,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-08 01:48:58,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-08 01:48:58,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-08 01:48:58,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-02-08 01:48:58,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-02-08 01:48:58,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-02-08 01:48:58,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-02-08 01:48:58,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-02-08 01:48:58,015 INFO L130 BoogieDeclarations]: Found specification of procedure aws_is_power_of_two [2025-02-08 01:48:58,015 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_is_power_of_two [2025-02-08 01:48:58,323 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 01:48:58,325 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 01:48:58,359 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6947: havoc #t~malloc588.base, #t~malloc588.offset; [2025-02-08 01:48:58,374 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L9136-1: assume false; [2025-02-08 01:48:58,375 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L9136-1: assume !false; [2025-02-08 01:48:58,394 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2590: havoc #t~ret57#1; [2025-02-08 01:48:58,396 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L266: havoc #t~nondet9; [2025-02-08 01:48:58,486 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L9327: havoc #t~ret1201#1; [2025-02-08 01:48:58,548 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L7198: havoc save_byte_from_array_#t~mem634#1;call save_byte_from_array_#t~mem635#1 := read~int#9(save_byte_from_array_~storage#1.base, save_byte_from_array_~storage#1.offset, 8);call save_byte_from_array_#t~mem636#1 := read~int#4(save_byte_from_array_~array#1.base, save_byte_from_array_~array#1.offset + (if save_byte_from_array_#t~mem635#1 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then save_byte_from_array_#t~mem635#1 % 18446744073709551616 % 18446744073709551616 else save_byte_from_array_#t~mem635#1 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), 1);call write~int#9(save_byte_from_array_#t~mem636#1, save_byte_from_array_~storage#1.base, 8 + save_byte_from_array_~storage#1.offset, 1);havoc save_byte_from_array_#t~mem635#1;havoc save_byte_from_array_#t~mem636#1; [2025-02-08 01:48:58,549 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L7198-1: SUMMARY for call assume_abort_if_not((if 0 == (if save_byte_from_array_#t~mem634#1 % 18446744073709551616 < save_byte_from_array_~size#1 % 18446744073709551616 then 1 else 0) then 0 else 1)); srcloc: null [2025-02-08 01:48:58,549 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L263: havoc nondet_size_t_#t~nondet6#1;save_byte_from_array_#t~ret633#1 := nondet_size_t_#res#1;havoc nondet_size_t_#t~nondet6#1;assume { :end_inline_nondet_size_t } true;call write~int#9(save_byte_from_array_#t~ret633#1, save_byte_from_array_~storage#1.base, save_byte_from_array_~storage#1.offset, 8);havoc save_byte_from_array_#t~ret633#1;call save_byte_from_array_#t~mem634#1 := read~int#9(save_byte_from_array_~storage#1.base, save_byte_from_array_~storage#1.offset, 8); [2025-02-08 01:48:58,566 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L7373: havoc uninterpreted_hasher_#t~ret689#1; [2025-02-08 01:48:58,567 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L9097-1: assume false; [2025-02-08 01:48:58,567 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L9097-1: assume !false; [2025-02-08 01:48:58,603 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:48:58,629 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:48:58,639 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L9146: havoc #t~mem1150; [2025-02-08 01:48:58,681 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:48:58,681 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L7356: havoc uninterpreted_equals_assert_inputs_nonnull_#t~ret687#1;#t~ret1549#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~funptrres1547#1 := #t~ret1549#1; [2025-02-08 01:48:58,681 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L-1: #res#1 := #t~funptrres1547#1;havoc #t~funptrres1547#1;havoc #t~ret1548#1;havoc #t~ret1549#1; [2025-02-08 01:48:58,681 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L7287: havoc nondet_compare_#t~ret677#1;#t~ret1548#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~ret1548#1 && #t~ret1548#1 <= 2147483647;#t~funptrres1547#1 := #t~ret1548#1; [2025-02-08 01:48:58,681 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint ##fun~$Pointer$~X~$Pointer$~TO~intFINAL: assume true; [2025-02-08 01:48:58,681 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L262: havoc nondet_int_#t~nondet5#1;nondet_compare_#t~ret677#1 := nondet_int_#res#1;havoc nondet_int_#t~nondet5#1;assume { :end_inline_nondet_int } true;assume -2147483648 <= nondet_compare_#t~ret677#1 && nondet_compare_#t~ret677#1 <= 2147483647;nondet_compare_#res#1 := nondet_compare_#t~ret677#1;havoc nondet_compare_#t~ret677#1; [2025-02-08 01:48:58,701 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L9123: havoc #t~ret1140; [2025-02-08 01:48:58,716 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2630: havoc #t~bitwise60;havoc #t~short61; [2025-02-08 01:48:58,725 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2617: havoc #t~ret59#1; [2025-02-08 01:49:03,840 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L9773-1: assume false; [2025-02-08 01:49:03,840 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L9773-1: assume !false; [2025-02-08 01:49:03,841 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L9410-1: assume false; [2025-02-08 01:49:03,841 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L9410-1: assume !false; [2025-02-08 01:49:03,841 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L9749-1: assume false; [2025-02-08 01:49:03,841 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L9749-1: assume !false; [2025-02-08 01:49:03,841 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L9784-1: assume false; [2025-02-08 01:49:03,841 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L9784-1: assume !false; [2025-02-08 01:49:03,841 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L9779-1: assume false; [2025-02-08 01:49:03,841 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L9779-1: assume !false; [2025-02-08 01:49:03,908 INFO L? ?]: Removed 277 outVars from TransFormulas that were not future-live. [2025-02-08 01:49:03,908 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 01:49:03,924 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 01:49:03,924 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 01:49:03,925 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:49:03 BoogieIcfgContainer [2025-02-08 01:49:03,925 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 01:49:03,927 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 01:49:03,927 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 01:49:03,930 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 01:49:03,930 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 01:48:55" (1/3) ... [2025-02-08 01:49:03,931 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cd0add3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:49:03, skipping insertion in model container [2025-02-08 01:49:03,931 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:48:57" (2/3) ... [2025-02-08 01:49:03,931 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cd0add3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:49:03, skipping insertion in model container [2025-02-08 01:49:03,931 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:49:03" (3/3) ... [2025-02-08 01:49:03,932 INFO L128 eAbstractionObserver]: Analyzing ICFG aws_hash_table_eq_harness.i [2025-02-08 01:49:03,942 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 01:49:03,944 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG aws_hash_table_eq_harness.i that has 25 procedures, 306 locations, 1 initial locations, 9 loop locations, and 1 error locations. [2025-02-08 01:49:03,990 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 01:49:04,002 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;@423b32de, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 01:49:04,002 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-08 01:49:04,005 INFO L276 IsEmpty]: Start isEmpty. Operand has 305 states, 184 states have (on average 1.298913043478261) internal successors, (239), 192 states have internal predecessors, (239), 88 states have call successors, (88), 24 states have call predecessors, (88), 23 states have return successors, (87), 87 states have call predecessors, (87), 87 states have call successors, (87) [2025-02-08 01:49:04,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2025-02-08 01:49:04,018 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:49:04,019 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 7, 7, 7, 7, 7, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04,019 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:49:04,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:49:04,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1828791213, now seen corresponding path program 1 times [2025-02-08 01:49:04,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:49:04,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784042521] [2025-02-08 01:49:04,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:49:04,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:49:08,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 289 statements into 1 equivalence classes. [2025-02-08 01:49:08,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 289 of 289 statements. [2025-02-08 01:49:08,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:49:08,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:49:09,415 INFO L134 CoverageAnalysis]: Checked inductivity of 815 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 772 trivial. 0 not checked. [2025-02-08 01:49:09,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:49:09,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784042521] [2025-02-08 01:49:09,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784042521] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:49:09,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [576600683] [2025-02-08 01:49:09,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:49:09,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:49:09,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:49:09,423 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:09,424 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:13,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 289 statements into 1 equivalence classes. [2025-02-08 01:49:14,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 289 of 289 statements. [2025-02-08 01:49:14,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:49:14,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:49:14,330 INFO L256 TraceCheckSpWp]: Trace formula consists of 5304 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-08 01:49:14,341 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:49:14,372 INFO L134 CoverageAnalysis]: Checked inductivity of 815 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 776 trivial. 0 not checked. [2025-02-08 01:49:14,372 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 01:49:14,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [576600683] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:49:14,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 01:49:14,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-08 01:49:14,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314442289] [2025-02-08 01:49:14,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:49:14,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 01:49:14,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:49:14,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 01:49:14,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 01:49:14,399 INFO L87 Difference]: Start difference. First operand has 305 states, 184 states have (on average 1.298913043478261) internal successors, (239), 192 states have internal predecessors, (239), 88 states have call successors, (88), 24 states have call predecessors, (88), 23 states have return successors, (87), 87 states have call predecessors, (87), 87 states have call successors, (87) Second operand has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2025-02-08 01:49:14,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:49:14,495 INFO L93 Difference]: Finished difference Result 567 states and 822 transitions. [2025-02-08 01:49:14,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 01:49:14,499 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) Word has length 289 [2025-02-08 01:49:14,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:49:14,506 INFO L225 Difference]: With dead ends: 567 [2025-02-08 01:49:14,507 INFO L226 Difference]: Without dead ends: 230 [2025-02-08 01:49:14,511 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 290 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:14,512 INFO L435 NwaCegarLoop]: 342 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 01:49:14,513 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 342 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 01:49:14,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2025-02-08 01:49:14,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 230. [2025-02-08 01:49:14,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 144 states have (on average 1.2361111111111112) internal successors, (178), 149 states have internal predecessors, (178), 65 states have call successors, (65), 21 states have call predecessors, (65), 20 states have return successors, (59), 59 states have call predecessors, (59), 59 states have call successors, (59) [2025-02-08 01:49:14,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 302 transitions. [2025-02-08 01:49:14,568 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 302 transitions. Word has length 289 [2025-02-08 01:49:14,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:49:14,568 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 302 transitions. [2025-02-08 01:49:14,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2025-02-08 01:49:14,569 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 302 transitions. [2025-02-08 01:49:14,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2025-02-08 01:49:14,572 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:49:14,572 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 7, 7, 7, 7, 7, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14,587 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-08 01:49:14,775 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:14,779 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:49:14,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:49:14,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1157507250, now seen corresponding path program 1 times [2025-02-08 01:49:14,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:49:14,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72326469] [2025-02-08 01:49:14,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:49:14,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:49:18,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 289 statements into 1 equivalence classes. [2025-02-08 01:49:18,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 289 of 289 statements. [2025-02-08 01:49:18,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:49:18,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:49:19,631 INFO L134 CoverageAnalysis]: Checked inductivity of 815 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 790 trivial. 0 not checked. [2025-02-08 01:49:19,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:49:19,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72326469] [2025-02-08 01:49:19,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72326469] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:49:19,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [988950247] [2025-02-08 01:49:19,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:49:19,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:49:19,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:49:19,635 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:19,638 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:23,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 289 statements into 1 equivalence classes. [2025-02-08 01:49:24,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 289 of 289 statements. [2025-02-08 01:49:24,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:49:24,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:49:24,542 INFO L256 TraceCheckSpWp]: Trace formula consists of 5304 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-02-08 01:49:24,551 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:49:25,498 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:49:27,365 INFO L134 CoverageAnalysis]: Checked inductivity of 815 backedges. 320 proven. 0 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2025-02-08 01:49:27,367 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 01:49:27,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [988950247] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:49:27,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 01:49:27,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [4] total 14 [2025-02-08 01:49:27,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754466956] [2025-02-08 01:49:27,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:49:27,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-08 01:49:27,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:49:27,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-08 01:49:27,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2025-02-08 01:49:27,372 INFO L87 Difference]: Start difference. First operand 230 states and 302 transitions. Second operand has 12 states, 11 states have (on average 8.272727272727273) internal successors, (91), 9 states have internal predecessors, (91), 4 states have call successors, (43), 3 states have call predecessors, (43), 5 states have return successors, (42), 5 states have call predecessors, (42), 4 states have call successors, (42) [2025-02-08 01:49:31,440 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 01:49:44,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:49:44,697 INFO L93 Difference]: Finished difference Result 524 states and 696 transitions. [2025-02-08 01:49:44,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-08 01:49:44,697 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.272727272727273) internal successors, (91), 9 states have internal predecessors, (91), 4 states have call successors, (43), 3 states have call predecessors, (43), 5 states have return successors, (42), 5 states have call predecessors, (42), 4 states have call successors, (42) Word has length 289 [2025-02-08 01:49:44,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:49:44,706 INFO L225 Difference]: With dead ends: 524 [2025-02-08 01:49:44,707 INFO L226 Difference]: Without dead ends: 297 [2025-02-08 01:49:44,710 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 280 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2025-02-08 01:49:44,711 INFO L435 NwaCegarLoop]: 327 mSDtfsCounter, 287 mSDsluCounter, 2061 mSDsCounter, 0 mSdLazyCounter, 879 mSolverCounterSat, 12 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 2388 SdHoareTripleChecker+Invalid, 892 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 879 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.8s IncrementalHoareTripleChecker+Time [2025-02-08 01:49:44,711 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 2388 Invalid, 892 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 879 Invalid, 1 Unknown, 0 Unchecked, 15.8s Time] [2025-02-08 01:49:44,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2025-02-08 01:49:44,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 293. [2025-02-08 01:49:44,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 185 states have (on average 1.2108108108108109) internal successors, (224), 191 states have internal predecessors, (224), 77 states have call successors, (77), 31 states have call predecessors, (77), 30 states have return successors, (82), 70 states have call predecessors, (82), 71 states have call successors, (82) [2025-02-08 01:49:44,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 383 transitions. [2025-02-08 01:49:44,831 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 383 transitions. Word has length 289 [2025-02-08 01:49:44,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:49:44,831 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 383 transitions. [2025-02-08 01:49:44,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.272727272727273) internal successors, (91), 9 states have internal predecessors, (91), 4 states have call successors, (43), 3 states have call predecessors, (43), 5 states have return successors, (42), 5 states have call predecessors, (42), 4 states have call successors, (42) [2025-02-08 01:49:44,831 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 383 transitions. [2025-02-08 01:49:44,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2025-02-08 01:49:44,839 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:49:44,839 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 7, 7, 7, 7, 7, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44,856 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-08 01:49:45,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:49:45,040 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:49:45,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:49:45,043 INFO L85 PathProgramCache]: Analyzing trace with hash 2084262003, now seen corresponding path program 1 times [2025-02-08 01:49:45,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:49:45,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581469228] [2025-02-08 01:49:45,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:49:45,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:49:48,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 289 statements into 1 equivalence classes. [2025-02-08 01:49:49,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 289 of 289 statements. [2025-02-08 01:49:49,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:49:49,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:49:49,931 INFO L134 CoverageAnalysis]: Checked inductivity of 815 backedges. 6 proven. 19 refuted. 0 times theorem prover too weak. 790 trivial. 0 not checked. [2025-02-08 01:49:49,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:49:49,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581469228] [2025-02-08 01:49:49,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581469228] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:49:49,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [587814380] [2025-02-08 01:49:49,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:49:49,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:49:49,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:49:49,934 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:49:49,936 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:49:54,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 289 statements into 1 equivalence classes. [2025-02-08 01:49:54,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 289 of 289 statements. [2025-02-08 01:49:54,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:49:54,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:49:54,711 INFO L256 TraceCheckSpWp]: Trace formula consists of 5299 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 01:49:54,720 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:49:55,354 INFO L134 CoverageAnalysis]: Checked inductivity of 815 backedges. 320 proven. 0 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2025-02-08 01:49:55,358 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 01:49:55,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [587814380] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:49:55,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 01:49:55,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 7 [2025-02-08 01:49:55,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718639217] [2025-02-08 01:49:55,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:49:55,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 01:49:55,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:49:55,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 01:49:55,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-08 01:49:55,360 INFO L87 Difference]: Start difference. First operand 293 states and 383 transitions. Second operand has 5 states, 4 states have (on average 22.75) internal successors, (91), 5 states have internal predecessors, (91), 3 states have call successors, (43), 2 states have call predecessors, (43), 3 states have return successors, (42), 3 states have call predecessors, (42), 3 states have call successors, (42) [2025-02-08 01:49:56,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:49:56,383 INFO L93 Difference]: Finished difference Result 530 states and 713 transitions. [2025-02-08 01:49:56,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 01:49:56,384 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 22.75) internal successors, (91), 5 states have internal predecessors, (91), 3 states have call successors, (43), 2 states have call predecessors, (43), 3 states have return successors, (42), 3 states have call predecessors, (42), 3 states have call successors, (42) Word has length 289 [2025-02-08 01:49:56,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:49:56,387 INFO L225 Difference]: With dead ends: 530 [2025-02-08 01:49:56,387 INFO L226 Difference]: Without dead ends: 298 [2025-02-08 01:49:56,388 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 287 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-08 01:49:56,388 INFO L435 NwaCegarLoop]: 302 mSDtfsCounter, 34 mSDsluCounter, 804 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 1106 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-08 01:49:56,389 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 1106 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-08 01:49:56,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2025-02-08 01:49:56,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 298. [2025-02-08 01:49:56,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 188 states have (on average 1.2074468085106382) internal successors, (227), 195 states have internal predecessors, (227), 78 states have call successors, (78), 31 states have call predecessors, (78), 31 states have return successors, (93), 71 states have call predecessors, (93), 72 states have call successors, (93) [2025-02-08 01:49:56,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 398 transitions. [2025-02-08 01:49:56,412 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 398 transitions. Word has length 289 [2025-02-08 01:49:56,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:49:56,413 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 398 transitions. [2025-02-08 01:49:56,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 22.75) internal successors, (91), 5 states have internal predecessors, (91), 3 states have call successors, (43), 2 states have call predecessors, (43), 3 states have return successors, (42), 3 states have call predecessors, (42), 3 states have call successors, (42) [2025-02-08 01:49:56,413 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 398 transitions. [2025-02-08 01:49:56,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2025-02-08 01:49:56,417 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:49:56,418 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 7, 7, 7, 7, 7, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56,435 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-08 01:49:56,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:49:56,619 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:49:56,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:49:56,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1961789921, now seen corresponding path program 1 times [2025-02-08 01:49:56,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:49:56,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471619029] [2025-02-08 01:49:56,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:49:56,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:50:00,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 295 statements into 1 equivalence classes. [2025-02-08 01:50:00,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 295 of 295 statements. [2025-02-08 01:50:00,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:50:00,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:50:01,057 INFO L134 CoverageAnalysis]: Checked inductivity of 815 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 790 trivial. 0 not checked. [2025-02-08 01:50:01,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:50:01,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471619029] [2025-02-08 01:50:01,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471619029] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:50:01,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [626866550] [2025-02-08 01:50:01,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:50:01,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:50:01,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:50:01,060 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:01,062 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:05,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 295 statements into 1 equivalence classes. [2025-02-08 01:50:05,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 295 of 295 statements. [2025-02-08 01:50:05,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:50:05,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:50:06,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 5328 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-02-08 01:50:06,036 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:50:07,133 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:10,145 INFO L134 CoverageAnalysis]: Checked inductivity of 815 backedges. 320 proven. 0 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2025-02-08 01:50:10,145 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 01:50:10,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [626866550] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:50:10,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 01:50:10,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [4] total 15 [2025-02-08 01:50:10,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971051187] [2025-02-08 01:50:10,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:50:10,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-08 01:50:10,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:50:10,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-08 01:50:10,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2025-02-08 01:50:10,147 INFO L87 Difference]: Start difference. First operand 298 states and 398 transitions. Second operand has 13 states, 11 states have (on average 8.636363636363637) internal successors, (95), 10 states have internal predecessors, (95), 5 states have call successors, (44), 3 states have call predecessors, (44), 6 states have return successors, (43), 6 states have call predecessors, (43), 5 states have call successors, (43) [2025-02-08 01:50:26,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:50:26,648 INFO L93 Difference]: Finished difference Result 549 states and 773 transitions. [2025-02-08 01:50:26,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-08 01:50:26,648 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 8.636363636363637) internal successors, (95), 10 states have internal predecessors, (95), 5 states have call successors, (44), 3 states have call predecessors, (44), 6 states have return successors, (43), 6 states have call predecessors, (43), 5 states have call successors, (43) Word has length 295 [2025-02-08 01:50:26,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:50:26,653 INFO L225 Difference]: With dead ends: 549 [2025-02-08 01:50:26,654 INFO L226 Difference]: Without dead ends: 312 [2025-02-08 01:50:26,655 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 284 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2025-02-08 01:50:26,656 INFO L435 NwaCegarLoop]: 323 mSDtfsCounter, 281 mSDsluCounter, 1945 mSDsCounter, 0 mSdLazyCounter, 1244 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 2268 SdHoareTripleChecker+Invalid, 1257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.5s IncrementalHoareTripleChecker+Time [2025-02-08 01:50:26,656 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 2268 Invalid, 1257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1244 Invalid, 0 Unknown, 0 Unchecked, 15.5s Time] [2025-02-08 01:50:26,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2025-02-08 01:50:26,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 301. [2025-02-08 01:50:26,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 190 states have (on average 1.2052631578947368) internal successors, (229), 197 states have internal predecessors, (229), 78 states have call successors, (78), 31 states have call predecessors, (78), 32 states have return successors, (98), 72 states have call predecessors, (98), 72 states have call successors, (98) [2025-02-08 01:50:26,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 405 transitions. [2025-02-08 01:50:26,692 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 405 transitions. Word has length 295 [2025-02-08 01:50:26,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:50:26,692 INFO L471 AbstractCegarLoop]: Abstraction has 301 states and 405 transitions. [2025-02-08 01:50:26,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 8.636363636363637) internal successors, (95), 10 states have internal predecessors, (95), 5 states have call successors, (44), 3 states have call predecessors, (44), 6 states have return successors, (43), 6 states have call predecessors, (43), 5 states have call successors, (43) [2025-02-08 01:50:26,693 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 405 transitions. [2025-02-08 01:50:26,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2025-02-08 01:50:26,696 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:50:26,697 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 7, 7, 7, 7, 7, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26,721 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-08 01:50:26,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:50:26,901 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:50:26,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:50:26,902 INFO L85 PathProgramCache]: Analyzing trace with hash -812659215, now seen corresponding path program 1 times [2025-02-08 01:50:26,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:50:26,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106710369] [2025-02-08 01:50:26,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:50:26,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:50:30,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 302 statements into 1 equivalence classes. [2025-02-08 01:50:30,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 302 of 302 statements. [2025-02-08 01:50:30,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:50:30,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat