./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_hash_table_create_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/aws-c-common/aws_hash_table_create_harness.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 74836a87661fce5875ab1ae94a73cbe51ee04e76d05fc1828decf2341972d635 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 02:54:13,011 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 02:54:13,062 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-04 02:54:13,066 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 02:54:13,066 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 02:54:13,086 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 02:54:13,087 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 02:54:13,087 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 02:54:13,088 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 02:54:13,088 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 02:54:13,088 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 02:54:13,088 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 02:54:13,088 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 02:54:13,088 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 02:54:13,089 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 02:54:13,089 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 02:54:13,089 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 02:54:13,089 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 02:54:13,089 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 02:54:13,089 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 02:54:13,089 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 02:54:13,090 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 02:54:13,090 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 02:54:13,090 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 02:54:13,090 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 02:54:13,090 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 02:54:13,090 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 02:54:13,090 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 02:54:13,090 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 02:54:13,091 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:54:13,091 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 02:54:13,091 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 02:54:13,091 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 02:54:13,091 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 02:54:13,091 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 02:54:13,092 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 02:54:13,092 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 02:54:13,092 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 02:54:13,092 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 02:54:13,092 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 02:54:13,092 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/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 -> 74836a87661fce5875ab1ae94a73cbe51ee04e76d05fc1828decf2341972d635 [2025-03-04 02:54:13,308 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 02:54:13,315 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 02:54:13,318 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 02:54:13,319 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 02:54:13,319 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 02:54:13,320 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_hash_table_create_harness.i [2025-03-04 02:54:14,477 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28cd6e2cc/dd104a73a834447ca60cf23a04549bd1/FLAG87a16750f [2025-03-04 02:54:14,992 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 02:54:14,994 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_create_harness.i [2025-03-04 02:54:15,033 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28cd6e2cc/dd104a73a834447ca60cf23a04549bd1/FLAG87a16750f [2025-03-04 02:54:15,535 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28cd6e2cc/dd104a73a834447ca60cf23a04549bd1 [2025-03-04 02:54:15,538 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 02:54:15,539 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 02:54:15,540 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 02:54:15,540 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 02:54:15,543 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 02:54:15,544 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:54:15" (1/1) ... [2025-03-04 02:54:15,546 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@613e098 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:54:15, skipping insertion in model container [2025-03-04 02:54:15,546 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:54:15" (1/1) ... [2025-03-04 02:54:15,618 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 02:54:15,879 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_create_harness.i[4495,4508] [2025-03-04 02:54:15,889 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_create_harness.i[4555,4568] [2025-03-04 02:54:16,639 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:16,640 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:16,640 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:16,640 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:16,641 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:16,651 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:16,651 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:16,653 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:16,654 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:16,655 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:16,656 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:16,656 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:16,656 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:17,522 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:17,523 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:17,549 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:17,550 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:17,558 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:17,559 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:17,575 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:17,576 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:17,577 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:17,577 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:17,577 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:17,578 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:17,578 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:17,608 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_create_harness.i[229089,229102] [2025-03-04 02:54:17,609 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:54:17,628 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 02:54:17,636 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_create_harness.i[4495,4508] [2025-03-04 02:54:17,637 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_create_harness.i[4555,4568] [2025-03-04 02:54:17,663 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:17,663 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:17,663 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:17,664 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:17,664 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:17,668 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:17,669 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:17,669 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:17,669 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:17,670 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:17,670 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:17,670 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:17,671 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:17,733 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" : : "r"(pBuf) : "memory"); [7576-7587] [2025-03-04 02:54:17,839 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:17,840 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:17,847 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:17,849 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:17,850 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:17,851 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:17,857 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:17,859 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:17,860 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:17,860 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:17,860 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:17,861 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:17,862 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:17,877 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_create_harness.i[229089,229102] [2025-03-04 02:54:17,878 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:54:18,006 INFO L204 MainTranslator]: Completed translation [2025-03-04 02:54:18,007 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:54:18 WrapperNode [2025-03-04 02:54:18,007 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 02:54:18,008 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 02:54:18,008 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 02:54:18,008 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 02:54:18,014 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:54:18" (1/1) ... [2025-03-04 02:54:18,087 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:54:18" (1/1) ... [2025-03-04 02:54:18,147 INFO L138 Inliner]: procedures = 764, calls = 2484, calls flagged for inlining = 68, calls inlined = 21, statements flattened = 1368 [2025-03-04 02:54:18,148 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 02:54:18,148 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 02:54:18,148 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 02:54:18,148 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 02:54:18,160 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:54:18" (1/1) ... [2025-03-04 02:54:18,161 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:54:18" (1/1) ... [2025-03-04 02:54:18,175 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:54:18" (1/1) ... [2025-03-04 02:54:18,183 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-03-04 02:54:18,184 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:54:18" (1/1) ... [2025-03-04 02:54:18,185 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:54:18" (1/1) ... [2025-03-04 02:54:18,230 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:54:18" (1/1) ... [2025-03-04 02:54:18,233 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:54:18" (1/1) ... [2025-03-04 02:54:18,238 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:54:18" (1/1) ... [2025-03-04 02:54:18,241 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:54:18" (1/1) ... [2025-03-04 02:54:18,248 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 02:54:18,250 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 02:54:18,250 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 02:54:18,251 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 02:54:18,251 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:54:18" (1/1) ... [2025-03-04 02:54:18,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:54:18,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:54:18,279 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 02:54:18,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 02:54:18,297 INFO L130 BoogieDeclarations]: Found specification of procedure s_update_template_size [2025-03-04 02:54:18,297 INFO L138 BoogieDeclarations]: Found implementation of procedure s_update_template_size [2025-03-04 02:54:18,297 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-03-04 02:54:18,297 INFO L130 BoogieDeclarations]: Found specification of procedure s_hash_keys_eq [2025-03-04 02:54:18,297 INFO L138 BoogieDeclarations]: Found implementation of procedure s_hash_keys_eq [2025-03-04 02:54:18,297 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_uninterpreted_equals [2025-03-04 02:54:18,297 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_uninterpreted_equals [2025-03-04 02:54:18,297 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 02:54:18,297 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2025-03-04 02:54:18,297 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2025-03-04 02:54:18,297 INFO L130 BoogieDeclarations]: Found specification of procedure aws_allocator_is_valid [2025-03-04 02:54:18,297 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_allocator_is_valid [2025-03-04 02:54:18,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2025-03-04 02:54:18,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-03-04 02:54:18,297 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_calloc [2025-03-04 02:54:18,297 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_calloc [2025-03-04 02:54:18,297 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-04 02:54:18,297 INFO L130 BoogieDeclarations]: Found specification of procedure aws_raise_error [2025-03-04 02:54:18,297 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_raise_error [2025-03-04 02:54:18,297 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-04 02:54:18,298 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-04 02:54:18,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-03-04 02:54:18,298 INFO L130 BoogieDeclarations]: Found specification of procedure aws_hash_table_create [2025-03-04 02:54:18,298 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_hash_table_create [2025-03-04 02:54:18,298 INFO L130 BoogieDeclarations]: Found specification of procedure hash_table_state_is_valid [2025-03-04 02:54:18,298 INFO L138 BoogieDeclarations]: Found implementation of procedure hash_table_state_is_valid [2025-03-04 02:54:18,298 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 02:54:18,298 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 02:54:18,298 INFO L130 BoogieDeclarations]: Found specification of procedure hash_table_state_required_bytes [2025-03-04 02:54:18,298 INFO L138 BoogieDeclarations]: Found implementation of procedure hash_table_state_required_bytes [2025-03-04 02:54:18,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-04 02:54:18,298 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_uninterpreted_hasher [2025-03-04 02:54:18,298 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_uninterpreted_hasher [2025-03-04 02:54:18,298 INFO L130 BoogieDeclarations]: Found specification of procedure s_safe_eq_check [2025-03-04 02:54:18,298 INFO L138 BoogieDeclarations]: Found implementation of procedure s_safe_eq_check [2025-03-04 02:54:18,298 INFO L130 BoogieDeclarations]: Found specification of procedure s_emplace_item [2025-03-04 02:54:18,298 INFO L138 BoogieDeclarations]: Found implementation of procedure s_emplace_item [2025-03-04 02:54:18,298 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 02:54:18,298 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 02:54:18,298 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2025-03-04 02:54:18,298 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2025-03-04 02:54:18,298 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mul_size_checked [2025-03-04 02:54:18,298 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mul_size_checked [2025-03-04 02:54:18,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-03-04 02:54:18,298 INFO L130 BoogieDeclarations]: Found specification of procedure s_find_entry [2025-03-04 02:54:18,298 INFO L138 BoogieDeclarations]: Found implementation of procedure s_find_entry [2025-03-04 02:54:18,298 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mem_release [2025-03-04 02:54:18,298 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mem_release [2025-03-04 02:54:18,298 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 02:54:18,298 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 02:54:18,298 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 02:54:18,301 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_plus [2025-03-04 02:54:18,301 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_plus [2025-03-04 02:54:18,301 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-03-04 02:54:18,301 INFO L130 BoogieDeclarations]: Found specification of procedure aws_hash_table_is_valid [2025-03-04 02:54:18,301 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_hash_table_is_valid [2025-03-04 02:54:18,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-03-04 02:54:18,301 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2025-03-04 02:54:18,301 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2025-03-04 02:54:18,302 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_mult [2025-03-04 02:54:18,302 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_mult [2025-03-04 02:54:18,302 INFO L130 BoogieDeclarations]: Found specification of procedure aws_add_size_checked [2025-03-04 02:54:18,302 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_add_size_checked [2025-03-04 02:54:18,302 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2025-03-04 02:54:18,302 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2025-03-04 02:54:18,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-04 02:54:18,302 INFO L130 BoogieDeclarations]: Found specification of procedure s_hash_for [2025-03-04 02:54:18,302 INFO L138 BoogieDeclarations]: Found implementation of procedure s_hash_for [2025-03-04 02:54:18,302 INFO L130 BoogieDeclarations]: Found specification of procedure s_alloc_state [2025-03-04 02:54:18,302 INFO L138 BoogieDeclarations]: Found implementation of procedure s_alloc_state [2025-03-04 02:54:18,302 INFO L130 BoogieDeclarations]: Found specification of procedure uninterpreted_equals [2025-03-04 02:54:18,302 INFO L138 BoogieDeclarations]: Found implementation of procedure uninterpreted_equals [2025-03-04 02:54:18,302 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2025-03-04 02:54:18,302 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2025-03-04 02:54:18,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-04 02:54:18,302 INFO L130 BoogieDeclarations]: Found specification of procedure aws_is_power_of_two [2025-03-04 02:54:18,302 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_is_power_of_two [2025-03-04 02:54:18,625 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 02:54:18,627 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 02:54:18,681 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6947: havoc #t~malloc588.base, #t~malloc588.offset; [2025-03-04 02:54:18,699 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10008: havoc #t~mem1491.base, #t~mem1491.offset;havoc #t~short1492;havoc #t~mem1493.base, #t~mem1493.offset;havoc #t~ret1494;havoc #t~short1495; [2025-03-04 02:54:18,705 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L261: havoc #t~nondet4; [2025-03-04 02:54:18,731 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10121: call ULTIMATE.dealloc(~#elemsize~0.base, ~#elemsize~0.offset);havoc ~#elemsize~0.base, ~#elemsize~0.offset; [2025-03-04 02:54:18,758 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6940: havoc bounded_calloc_#t~malloc587#1.base, bounded_calloc_#t~malloc587#1.offset;call ULTIMATE.dealloc(bounded_calloc_~#required_bytes~1#1.base, bounded_calloc_~#required_bytes~1#1.offset);havoc bounded_calloc_~#required_bytes~1#1.base, bounded_calloc_~#required_bytes~1#1.offset; [2025-03-04 02:54:18,758 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6955: havoc #t~ret589#1;havoc #t~ite591#1.base, #t~ite591#1.offset;havoc #t~ret590#1.base, #t~ret590#1.offset; [2025-03-04 02:54:18,867 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2643: havoc aws_round_up_to_power_of_two_#t~ret62#1; [2025-03-04 02:54:18,867 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9201: call ULTIMATE.dealloc(~#size~0#1.base, ~#size~0#1.offset);havoc ~#size~0#1.base, ~#size~0#1.offset; [2025-03-04 02:54:18,870 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6986: havoc #t~ret600.base, #t~ret600.offset; [2025-03-04 02:54:18,889 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9154-1: assume false; [2025-03-04 02:54:18,890 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9154-1: assume !false; [2025-03-04 02:54:18,899 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2590: havoc #t~ret57#1; [2025-03-04 02:54:18,900 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L266: havoc #t~nondet9; [2025-03-04 02:54:18,913 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9115-1: assume false; [2025-03-04 02:54:18,913 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9115-1: assume !false; [2025-03-04 02:54:18,913 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7373: havoc uninterpreted_hasher_#t~ret689#1; [2025-03-04 02:54:18,929 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7356: havoc uninterpreted_equals_assert_inputs_nonnull_#t~ret687#1; [2025-03-04 02:54:18,930 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7287: havoc nondet_compare_#t~ret677#1; [2025-03-04 02:54:18,930 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L262: havoc nondet_int_#t~nondet5#1; [2025-03-04 02:54:19,019 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9524: call ULTIMATE.dealloc(~#entry~4#1.base, ~#entry~4#1.offset);havoc ~#entry~4#1.base, ~#entry~4#1.offset;call ULTIMATE.dealloc(~#probe_idx~1#1.base, ~#probe_idx~1#1.offset);havoc ~#probe_idx~1#1.base, ~#probe_idx~1#1.offset;call ULTIMATE.dealloc(~#ignored~0#1.base, ~#ignored~0#1.offset);havoc ~#ignored~0#1.base, ~#ignored~0#1.offset;call ULTIMATE.dealloc(~#incr_entry_count~0#1.base, ~#incr_entry_count~0#1.offset);havoc ~#incr_entry_count~0#1.base, ~#incr_entry_count~0#1.offset;call ULTIMATE.dealloc(~#new_entry~0#1.base, ~#new_entry~0#1.offset);havoc ~#new_entry~0#1.base, ~#new_entry~0#1.offset; [2025-03-04 02:54:19,019 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9486: call ULTIMATE.dealloc(s_expand_table_~#template~1#1.base, s_expand_table_~#template~1#1.offset);havoc s_expand_table_~#template~1#1.base, s_expand_table_~#template~1#1.offset;call ULTIMATE.dealloc(s_expand_table_~#new_size~0#1.base, s_expand_table_~#new_size~0#1.offset);havoc s_expand_table_~#new_size~0#1.base, s_expand_table_~#new_size~0#1.offset; [2025-03-04 02:54:19,044 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9141: havoc #t~ret1142; [2025-03-04 02:54:19,154 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7009: call ULTIMATE.dealloc(aws_mem_calloc_~#required_bytes~2#1.base, aws_mem_calloc_~#required_bytes~2#1.offset);havoc aws_mem_calloc_~#required_bytes~2#1.base, aws_mem_calloc_~#required_bytes~2#1.offset; [2025-03-04 02:54:19,154 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9172: call ULTIMATE.dealloc(~#required_bytes~3#1.base, ~#required_bytes~3#1.offset);havoc ~#required_bytes~3#1.base, ~#required_bytes~3#1.offset; [2025-03-04 02:54:19,244 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9437-1: assume false; [2025-03-04 02:54:19,244 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9437-1: assume !false; [2025-03-04 02:54:19,244 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9478-1: assume false; [2025-03-04 02:54:19,244 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9478-1: assume !false; [2025-03-04 02:54:19,356 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9345: havoc #t~ret1203#1; [2025-03-04 02:54:19,373 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2630: havoc #t~bitwise60;havoc #t~short61; [2025-03-04 02:54:19,391 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2617: havoc #t~ret59#1; [2025-03-04 02:54:24,493 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6833: havoc aws_hash_table_has_an_empty_slot_#t~mem566#1.base, aws_hash_table_has_an_empty_slot_#t~mem566#1.offset;havoc aws_hash_table_has_an_empty_slot_#t~ret567#1; [2025-03-04 02:54:24,493 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6843: havoc hash_table_state_has_an_empty_slot_#t~mem571#1; [2025-03-04 02:54:24,631 INFO L? ?]: Removed 393 outVars from TransFormulas that were not future-live. [2025-03-04 02:54:24,631 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 02:54:24,668 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 02:54:24,672 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 02:54:24,672 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:54:24 BoogieIcfgContainer [2025-03-04 02:54:24,672 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 02:54:24,674 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 02:54:24,674 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 02:54:24,678 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 02:54:24,679 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:54:15" (1/3) ... [2025-03-04 02:54:24,679 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1171948a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:54:24, skipping insertion in model container [2025-03-04 02:54:24,679 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:54:18" (2/3) ... [2025-03-04 02:54:24,680 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1171948a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:54:24, skipping insertion in model container [2025-03-04 02:54:24,680 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:54:24" (3/3) ... [2025-03-04 02:54:24,681 INFO L128 eAbstractionObserver]: Analyzing ICFG aws_hash_table_create_harness.i [2025-03-04 02:54:24,693 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 02:54:24,695 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG aws_hash_table_create_harness.i that has 31 procedures, 399 locations, 1 initial locations, 7 loop locations, and 1 error locations. [2025-03-04 02:54:24,745 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 02:54:24,756 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;@720eec27, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 02:54:24,757 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 02:54:24,761 INFO L276 IsEmpty]: Start isEmpty. Operand has 399 states, 285 states have (on average 1.3017543859649123) internal successors, (371), 282 states have internal predecessors, (371), 86 states have call successors, (86), 30 states have call predecessors, (86), 30 states have return successors, (86), 86 states have call predecessors, (86), 86 states have call successors, (86) [2025-03-04 02:54:24,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-04 02:54:24,771 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:54:24,772 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 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, 1, 1, 1, 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-03-04 02:54:24,773 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:54:24,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:54:24,778 INFO L85 PathProgramCache]: Analyzing trace with hash -2053792542, now seen corresponding path program 1 times [2025-03-04 02:54:24,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:54:24,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687668108] [2025-03-04 02:54:24,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:54:24,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:54:29,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-04 02:54:29,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-04 02:54:29,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:54:29,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:54:30,811 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-03-04 02:54:30,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:54:30,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687668108] [2025-03-04 02:54:30,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687668108] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:54:30,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:54:30,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:54:30,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648417774] [2025-03-04 02:54:30,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:54:30,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:54:30,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:54:30,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:54:30,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:54:30,836 INFO L87 Difference]: Start difference. First operand has 399 states, 285 states have (on average 1.3017543859649123) internal successors, (371), 282 states have internal predecessors, (371), 86 states have call successors, (86), 30 states have call predecessors, (86), 30 states have return successors, (86), 86 states have call predecessors, (86), 86 states have call successors, (86) Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (19), 3 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-04 02:54:31,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:54:31,560 INFO L93 Difference]: Finished difference Result 797 states and 1149 transitions. [2025-03-04 02:54:31,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:54:31,564 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (19), 3 states have call predecessors, (19), 2 states have call successors, (19) Word has length 124 [2025-03-04 02:54:31,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:54:31,572 INFO L225 Difference]: With dead ends: 797 [2025-03-04 02:54:31,572 INFO L226 Difference]: Without dead ends: 396 [2025-03-04 02:54:31,577 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:54:31,579 INFO L435 NwaCegarLoop]: 517 mSDtfsCounter, 0 mSDsluCounter, 1547 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2064 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 02:54:31,579 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2064 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 02:54:31,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2025-03-04 02:54:31,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 396. [2025-03-04 02:54:31,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 278 states have (on average 1.2841726618705036) internal successors, (357), 280 states have internal predecessors, (357), 86 states have call successors, (86), 30 states have call predecessors, (86), 31 states have return successors, (88), 85 states have call predecessors, (88), 84 states have call successors, (88) [2025-03-04 02:54:31,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 531 transitions. [2025-03-04 02:54:31,637 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 531 transitions. Word has length 124 [2025-03-04 02:54:31,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:54:31,638 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 531 transitions. [2025-03-04 02:54:31,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (19), 3 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-04 02:54:31,638 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 531 transitions. [2025-03-04 02:54:31,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-04 02:54:31,641 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:54:31,641 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 02:54:31,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 02:54:31,641 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:54:31,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:54:31,642 INFO L85 PathProgramCache]: Analyzing trace with hash -667232171, now seen corresponding path program 1 times [2025-03-04 02:54:31,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:54:31,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118279076] [2025-03-04 02:54:31,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:54:31,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:54:35,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-04 02:54:35,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-04 02:54:35,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:54:35,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:54:37,018 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-03-04 02:54:37,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:54:37,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118279076] [2025-03-04 02:54:37,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118279076] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:54:37,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:54:37,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:54:37,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352053676] [2025-03-04 02:54:37,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:54:37,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:54:37,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:54:37,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:54:37,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:54:37,020 INFO L87 Difference]: Start difference. First operand 396 states and 531 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 3 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-04 02:54:37,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:54:37,728 INFO L93 Difference]: Finished difference Result 778 states and 1043 transitions. [2025-03-04 02:54:37,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:54:37,729 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 3 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 130 [2025-03-04 02:54:37,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:54:37,732 INFO L225 Difference]: With dead ends: 778 [2025-03-04 02:54:37,732 INFO L226 Difference]: Without dead ends: 396 [2025-03-04 02:54:37,734 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:54:37,734 INFO L435 NwaCegarLoop]: 504 mSDtfsCounter, 23 mSDsluCounter, 962 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 1466 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 02:54:37,734 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 1466 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 02:54:37,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2025-03-04 02:54:37,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 396. [2025-03-04 02:54:37,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 278 states have (on average 1.2805755395683454) internal successors, (356), 280 states have internal predecessors, (356), 86 states have call successors, (86), 30 states have call predecessors, (86), 31 states have return successors, (88), 85 states have call predecessors, (88), 84 states have call successors, (88) [2025-03-04 02:54:37,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 530 transitions. [2025-03-04 02:54:37,764 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 530 transitions. Word has length 130 [2025-03-04 02:54:37,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:54:37,765 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 530 transitions. [2025-03-04 02:54:37,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 3 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-04 02:54:37,766 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 530 transitions. [2025-03-04 02:54:37,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-04 02:54:37,767 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:54:37,767 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 02:54:37,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 02:54:37,768 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:54:37,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:54:37,768 INFO L85 PathProgramCache]: Analyzing trace with hash -458533868, now seen corresponding path program 1 times [2025-03-04 02:54:37,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:54:37,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047666293] [2025-03-04 02:54:37,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:54:37,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:54:41,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-04 02:54:41,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-04 02:54:41,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:54:41,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:54:44,966 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-03-04 02:54:44,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:54:44,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047666293] [2025-03-04 02:54:44,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047666293] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:54:44,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:54:44,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 02:54:44,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626759959] [2025-03-04 02:54:44,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:54:44,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 02:54:44,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:54:44,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 02:54:44,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-04 02:54:44,968 INFO L87 Difference]: Start difference. First operand 396 states and 530 transitions. Second operand has 10 states, 10 states have (on average 6.1) internal successors, (61), 9 states have internal predecessors, (61), 4 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) [2025-03-04 02:54:49,021 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 02:54:53,414 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.39s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 02:54:57,784 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.37s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 02:55:02,241 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.46s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 02:55:08,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:55:08,228 INFO L93 Difference]: Finished difference Result 774 states and 1035 transitions. [2025-03-04 02:55:08,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 02:55:08,234 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 9 states have internal predecessors, (61), 4 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) Word has length 130 [2025-03-04 02:55:08,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:55:08,237 INFO L225 Difference]: With dead ends: 774 [2025-03-04 02:55:08,238 INFO L226 Difference]: Without dead ends: 399 [2025-03-04 02:55:08,239 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-03-04 02:55:08,239 INFO L435 NwaCegarLoop]: 502 mSDtfsCounter, 5 mSDsluCounter, 2827 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 1 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 3329 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.7s IncrementalHoareTripleChecker+Time [2025-03-04 02:55:08,240 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 3329 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 306 Invalid, 4 Unknown, 0 Unchecked, 22.7s Time] [2025-03-04 02:55:08,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2025-03-04 02:55:08,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 399. [2025-03-04 02:55:08,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 280 states have (on average 1.2785714285714285) internal successors, (358), 283 states have internal predecessors, (358), 86 states have call successors, (86), 30 states have call predecessors, (86), 32 states have return successors, (89), 85 states have call predecessors, (89), 84 states have call successors, (89) [2025-03-04 02:55:08,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 533 transitions. [2025-03-04 02:55:08,258 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 533 transitions. Word has length 130 [2025-03-04 02:55:08,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:55:08,259 INFO L471 AbstractCegarLoop]: Abstraction has 399 states and 533 transitions. [2025-03-04 02:55:08,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 9 states have internal predecessors, (61), 4 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) [2025-03-04 02:55:08,259 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 533 transitions. [2025-03-04 02:55:08,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-04 02:55:08,262 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:55:08,262 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 02:55:08,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 02:55:08,263 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:55:08,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:55:08,263 INFO L85 PathProgramCache]: Analyzing trace with hash 1775146737, now seen corresponding path program 1 times [2025-03-04 02:55:08,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:55:08,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143500157] [2025-03-04 02:55:08,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:55:08,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:55:12,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-04 02:55:12,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-04 02:55:12,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:55:12,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:55:14,801 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2025-03-04 02:55:14,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:55:14,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143500157] [2025-03-04 02:55:14,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143500157] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:55:14,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [13479877] [2025-03-04 02:55:14,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:55:14,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:55:14,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:55:14,804 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:55:14,805 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 02:55:19,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-04 02:55:19,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-04 02:55:19,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:55:19,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:55:19,464 INFO L256 TraceCheckSpWp]: Trace formula consists of 4440 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-04 02:55:19,477 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:55:25,180 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((v_aws_hash_table_is_valid_~map.base_4 Int) (v_aws_hash_table_is_valid_~map.offset_4 Int)) (not (= (select (select |c_#memory_$Pointer$.offset| v_aws_hash_table_is_valid_~map.base_4) v_aws_hash_table_is_valid_~map.offset_4) 0))) (exists ((v_aws_hash_table_is_valid_~map.base_4 Int) (v_aws_hash_table_is_valid_~map.offset_4 Int)) (not (= (select (select |c_#memory_$Pointer$.base| v_aws_hash_table_is_valid_~map.base_4) v_aws_hash_table_is_valid_~map.offset_4) 0)))) is different from true [2025-03-04 02:55:34,198 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-03-04 02:55:34,198 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 02:55:34,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [13479877] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:55:34,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 02:55:34,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [7] total 13 [2025-03-04 02:55:34,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365930280] [2025-03-04 02:55:34,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:55:34,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 02:55:34,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:55:34,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 02:55:34,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=105, Unknown=3, NotChecked=20, Total=156 [2025-03-04 02:55:34,200 INFO L87 Difference]: Start difference. First operand 399 states and 533 transitions. Second operand has 8 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 3 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (21), 2 states have call predecessors, (21), 3 states have call successors, (21) [2025-03-04 02:55:38,265 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 [0] [2025-03-04 02:55:42,652 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.38s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 02:55:47,053 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.40s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers []