./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_hash_table_find_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fcb8e130 Calling Ultimate with: /usr/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.5.800.v20200727-1323.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_find_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.graphml --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 b2aa49e297f60cfce052f243c4868c3f21a4b7a15679d0734b9f9fae5c35ea17 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-fcb8e13 [2021-11-22 20:06:46,298 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-22 20:06:46,299 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-22 20:06:46,353 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-22 20:06:46,354 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-22 20:06:46,356 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-22 20:06:46,357 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-22 20:06:46,361 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-22 20:06:46,362 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-22 20:06:46,366 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-22 20:06:46,366 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-22 20:06:46,367 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-22 20:06:46,367 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-22 20:06:46,369 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-22 20:06:46,370 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-22 20:06:46,373 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-22 20:06:46,374 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-22 20:06:46,375 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-22 20:06:46,376 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-22 20:06:46,381 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-22 20:06:46,382 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-22 20:06:46,383 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-22 20:06:46,384 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-22 20:06:46,384 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-22 20:06:46,389 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-22 20:06:46,389 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-22 20:06:46,389 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-22 20:06:46,390 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-22 20:06:46,391 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-22 20:06:46,391 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-22 20:06:46,392 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-22 20:06:46,392 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-22 20:06:46,393 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-22 20:06:46,395 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-22 20:06:46,395 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-22 20:06:46,396 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-22 20:06:46,396 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-22 20:06:46,396 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-22 20:06:46,396 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-22 20:06:46,397 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-22 20:06:46,397 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-22 20:06:46,398 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-22 20:06:46,427 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-22 20:06:46,427 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-22 20:06:46,428 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-22 20:06:46,428 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-22 20:06:46,429 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-22 20:06:46,429 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-22 20:06:46,429 INFO L138 SettingsManager]: * Use SBE=true [2021-11-22 20:06:46,430 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-22 20:06:46,430 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-22 20:06:46,430 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-22 20:06:46,431 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-22 20:06:46,431 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-22 20:06:46,431 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-22 20:06:46,431 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-22 20:06:46,431 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-22 20:06:46,431 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-22 20:06:46,431 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-22 20:06:46,432 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-22 20:06:46,432 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-22 20:06:46,432 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-22 20:06:46,432 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-22 20:06:46,432 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-22 20:06:46,432 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-22 20:06:46,432 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-22 20:06:46,433 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-22 20:06:46,433 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-22 20:06:46,433 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-22 20:06:46,433 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-22 20:06:46,433 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-22 20:06:46,433 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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.graphml 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 -> b2aa49e297f60cfce052f243c4868c3f21a4b7a15679d0734b9f9fae5c35ea17 [2021-11-22 20:06:46,642 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-22 20:06:46,656 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-22 20:06:46,658 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-22 20:06:46,659 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-22 20:06:46,660 INFO L275 PluginConnector]: CDTParser initialized [2021-11-22 20:06:46,661 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_hash_table_find_harness.i [2021-11-22 20:06:46,718 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/acd566227/cbbbe61b445a45978713f83c64c98c56/FLAG78aff36e8 [2021-11-22 20:06:47,365 INFO L306 CDTParser]: Found 1 translation units. [2021-11-22 20:06:47,366 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_find_harness.i [2021-11-22 20:06:47,396 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/acd566227/cbbbe61b445a45978713f83c64c98c56/FLAG78aff36e8 [2021-11-22 20:06:47,741 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/acd566227/cbbbe61b445a45978713f83c64c98c56 [2021-11-22 20:06:47,743 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-22 20:06:47,744 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-22 20:06:47,745 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-22 20:06:47,745 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-22 20:06:47,750 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-22 20:06:47,750 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 08:06:47" (1/1) ... [2021-11-22 20:06:47,751 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f146dc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:06:47, skipping insertion in model container [2021-11-22 20:06:47,751 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 08:06:47" (1/1) ... [2021-11-22 20:06:47,755 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-22 20:06:47,833 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-22 20:06:48,082 WARN L230 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_find_harness.i[4493,4506] [2021-11-22 20:06:48,089 WARN L230 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_find_harness.i[4553,4566] [2021-11-22 20:06:48,957 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:06:48,958 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:06:48,959 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:06:48,959 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:06:48,961 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:06:48,977 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:06:48,978 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:06:48,980 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:06:48,981 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:06:48,983 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:06:48,983 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:06:48,984 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:06:48,984 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:06:49,241 WARN L610 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-22 20:06:49,244 WARN L610 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-22 20:06:49,245 WARN L610 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-22 20:06:49,246 WARN L610 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-22 20:06:49,248 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-22 20:06:49,249 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-22 20:06:49,249 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-22 20:06:49,249 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-22 20:06:49,250 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-22 20:06:49,251 WARN L610 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-22 20:06:49,414 WARN L610 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-22 20:06:49,625 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:06:49,625 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:06:49,641 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:06:49,643 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:06:49,648 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:06:49,649 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:06:49,663 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:06:49,664 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:06:49,664 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:06:49,664 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:06:49,665 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:06:49,666 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:06:49,666 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:06:49,698 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-22 20:06:49,727 INFO L203 MainTranslator]: Completed pre-run [2021-11-22 20:06:49,744 WARN L230 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_find_harness.i[4493,4506] [2021-11-22 20:06:49,744 WARN L230 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_find_harness.i[4553,4566] [2021-11-22 20:06:49,772 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:06:49,773 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:06:49,773 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:06:49,773 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:06:49,774 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:06:49,780 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:06:49,780 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:06:49,781 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:06:49,781 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:06:49,810 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:06:49,811 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:06:49,811 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:06:49,811 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:06:49,829 WARN L610 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-22 20:06:49,829 WARN L610 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-22 20:06:49,830 WARN L610 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-22 20:06:49,830 WARN L610 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-22 20:06:49,831 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-22 20:06:49,831 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-22 20:06:49,833 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-22 20:06:49,833 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-22 20:06:49,834 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-22 20:06:49,834 WARN L610 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-22 20:06:49,852 WARN L610 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-22 20:06:49,917 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:06:49,918 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:06:49,921 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:06:49,922 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:06:49,923 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:06:49,923 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:06:49,931 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:06:49,932 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:06:49,932 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:06:49,932 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:06:49,932 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:06:49,933 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:06:49,933 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:06:49,963 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-22 20:06:50,136 INFO L208 MainTranslator]: Completed translation [2021-11-22 20:06:50,136 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:06:50 WrapperNode [2021-11-22 20:06:50,136 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-22 20:06:50,137 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-22 20:06:50,137 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-22 20:06:50,137 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-22 20:06:50,142 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:06:50" (1/1) ... [2021-11-22 20:06:50,230 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:06:50" (1/1) ... [2021-11-22 20:06:50,314 INFO L137 Inliner]: procedures = 774, calls = 2455, calls flagged for inlining = 758, calls inlined = 140, statements flattened = 1954 [2021-11-22 20:06:50,315 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-22 20:06:50,315 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-22 20:06:50,315 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-22 20:06:50,316 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-22 20:06:50,324 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:06:50" (1/1) ... [2021-11-22 20:06:50,324 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:06:50" (1/1) ... [2021-11-22 20:06:50,337 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:06:50" (1/1) ... [2021-11-22 20:06:50,338 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:06:50" (1/1) ... [2021-11-22 20:06:50,392 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:06:50" (1/1) ... [2021-11-22 20:06:50,407 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:06:50" (1/1) ... [2021-11-22 20:06:50,416 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:06:50" (1/1) ... [2021-11-22 20:06:50,432 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-22 20:06:50,433 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-22 20:06:50,433 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-22 20:06:50,434 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-22 20:06:50,435 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:06:50" (1/1) ... [2021-11-22 20:06:50,440 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-22 20:06:50,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-22 20:06:50,489 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-22 20:06:50,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-22 20:06:50,556 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2021-11-22 20:06:50,557 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-22 20:06:50,557 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-22 20:06:50,557 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-22 20:06:50,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-22 20:06:50,557 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-22 20:06:50,557 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-22 20:06:50,557 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-22 20:06:50,558 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-22 20:06:50,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-22 20:06:50,559 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-22 20:06:50,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-22 20:06:50,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-22 20:06:50,908 INFO L236 CfgBuilder]: Building ICFG [2021-11-22 20:06:50,909 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-22 20:06:52,152 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##211: assume !true; [2021-11-22 20:06:52,152 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !true; [2021-11-22 20:06:52,152 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##185: assume !true; [2021-11-22 20:06:52,152 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##132: assume !true; [2021-11-22 20:06:52,152 INFO L277 CfgBuilder]: Performing block encoding [2021-11-22 20:06:52,158 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-22 20:06:52,159 INFO L301 CfgBuilder]: Removed 9 assume(true) statements. [2021-11-22 20:06:52,160 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 08:06:52 BoogieIcfgContainer [2021-11-22 20:06:52,160 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-22 20:06:52,161 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-22 20:06:52,166 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-22 20:06:52,168 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-22 20:06:52,169 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 08:06:47" (1/3) ... [2021-11-22 20:06:52,169 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d491c73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 08:06:52, skipping insertion in model container [2021-11-22 20:06:52,169 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:06:50" (2/3) ... [2021-11-22 20:06:52,170 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d491c73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 08:06:52, skipping insertion in model container [2021-11-22 20:06:52,183 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 08:06:52" (3/3) ... [2021-11-22 20:06:52,184 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_hash_table_find_harness.i [2021-11-22 20:06:52,188 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-22 20:06:52,188 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2021-11-22 20:06:52,237 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-22 20:06:52,246 INFO L339 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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, mLoopAccelerationTechnique=FAST_UPR [2021-11-22 20:06:52,247 INFO L340 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2021-11-22 20:06:52,261 INFO L276 IsEmpty]: Start isEmpty. Operand has 305 states, 286 states have (on average 1.4265734265734267) internal successors, (408), 304 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:06:52,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-11-22 20:06:52,268 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:06:52,268 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:06:52,269 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2021-11-22 20:06:52,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:06:52,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1627669557, now seen corresponding path program 1 times [2021-11-22 20:06:52,278 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:06:52,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419829046] [2021-11-22 20:06:52,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:06:52,279 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:06:52,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:06:52,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:06:52,694 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:06:52,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419829046] [2021-11-22 20:06:52,695 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419829046] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:06:52,696 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:06:52,696 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-22 20:06:52,697 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132717516] [2021-11-22 20:06:52,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:06:52,700 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-22 20:06:52,701 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:06:52,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-22 20:06:52,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-22 20:06:52,736 INFO L87 Difference]: Start difference. First operand has 305 states, 286 states have (on average 1.4265734265734267) internal successors, (408), 304 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 36.5) internal successors, (73), 2 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:06:52,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:06:52,772 INFO L93 Difference]: Finished difference Result 605 states and 810 transitions. [2021-11-22 20:06:52,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-22 20:06:52,774 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 36.5) internal successors, (73), 2 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2021-11-22 20:06:52,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:06:52,781 INFO L225 Difference]: With dead ends: 605 [2021-11-22 20:06:52,786 INFO L226 Difference]: Without dead ends: 298 [2021-11-22 20:06:52,790 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-22 20:06:52,792 INFO L933 BasicCegarLoop]: 357 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 20:06:52,792 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 20:06:52,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2021-11-22 20:06:52,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 298. [2021-11-22 20:06:52,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 280 states have (on average 1.2535714285714286) internal successors, (351), 297 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:06:52,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 351 transitions. [2021-11-22 20:06:52,832 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 351 transitions. Word has length 73 [2021-11-22 20:06:52,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:06:52,832 INFO L470 AbstractCegarLoop]: Abstraction has 298 states and 351 transitions. [2021-11-22 20:06:52,833 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 36.5) internal successors, (73), 2 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:06:52,833 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 351 transitions. [2021-11-22 20:06:52,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-11-22 20:06:52,834 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:06:52,834 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:06:52,834 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-22 20:06:52,835 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2021-11-22 20:06:52,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:06:52,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1368680527, now seen corresponding path program 1 times [2021-11-22 20:06:52,839 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:06:52,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800823480] [2021-11-22 20:06:52,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:06:52,839 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:06:52,903 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-22 20:06:52,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1982153808] [2021-11-22 20:06:52,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:06:52,904 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 20:06:52,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-22 20:06:52,905 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) [2021-11-22 20:06:52,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-22 20:06:53,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:06:53,379 INFO L263 TraceCheckSpWp]: Trace formula consists of 2513 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-22 20:06:53,384 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 20:06:53,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:06:53,510 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-22 20:06:53,510 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:06:53,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800823480] [2021-11-22 20:06:53,510 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-22 20:06:53,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1982153808] [2021-11-22 20:06:53,511 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1982153808] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:06:53,511 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:06:53,511 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-22 20:06:53,512 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846018372] [2021-11-22 20:06:53,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:06:53,513 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-22 20:06:53,513 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:06:53,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-22 20:06:53,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-22 20:06:53,514 INFO L87 Difference]: Start difference. First operand 298 states and 351 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:06:53,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:06:53,580 INFO L93 Difference]: Finished difference Result 856 states and 1009 transitions. [2021-11-22 20:06:53,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-22 20:06:53,581 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2021-11-22 20:06:53,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:06:53,583 INFO L225 Difference]: With dead ends: 856 [2021-11-22 20:06:53,583 INFO L226 Difference]: Without dead ends: 580 [2021-11-22 20:06:53,584 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-22 20:06:53,585 INFO L933 BasicCegarLoop]: 652 mSDtfsCounter, 654 mSDsluCounter, 1335 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 654 SdHoareTripleChecker+Valid, 1987 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 20:06:53,586 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [654 Valid, 1987 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 20:06:53,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2021-11-22 20:06:53,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 304. [2021-11-22 20:06:53,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 286 states have (on average 1.2482517482517483) internal successors, (357), 303 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:06:53,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 357 transitions. [2021-11-22 20:06:53,601 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 357 transitions. Word has length 73 [2021-11-22 20:06:53,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:06:53,601 INFO L470 AbstractCegarLoop]: Abstraction has 304 states and 357 transitions. [2021-11-22 20:06:53,601 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:06:53,601 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 357 transitions. [2021-11-22 20:06:53,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-11-22 20:06:53,602 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:06:53,602 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:06:53,638 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-22 20:06:53,829 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 20:06:53,830 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2021-11-22 20:06:53,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:06:53,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1351260279, now seen corresponding path program 1 times [2021-11-22 20:06:53,831 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:06:53,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693988211] [2021-11-22 20:06:53,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:06:53,831 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:06:53,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:06:54,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:06:54,016 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:06:54,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693988211] [2021-11-22 20:06:54,016 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693988211] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:06:54,016 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:06:54,016 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-22 20:06:54,016 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639509411] [2021-11-22 20:06:54,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:06:54,017 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-22 20:06:54,017 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:06:54,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-22 20:06:54,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-11-22 20:06:54,017 INFO L87 Difference]: Start difference. First operand 304 states and 357 transitions. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:06:54,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:06:54,290 INFO L93 Difference]: Finished difference Result 576 states and 677 transitions. [2021-11-22 20:06:54,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-22 20:06:54,291 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2021-11-22 20:06:54,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:06:54,292 INFO L225 Difference]: With dead ends: 576 [2021-11-22 20:06:54,292 INFO L226 Difference]: Without dead ends: 310 [2021-11-22 20:06:54,293 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2021-11-22 20:06:54,294 INFO L933 BasicCegarLoop]: 339 mSDtfsCounter, 406 mSDsluCounter, 1214 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 1553 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-22 20:06:54,294 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [406 Valid, 1553 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-22 20:06:54,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2021-11-22 20:06:54,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 306. [2021-11-22 20:06:54,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 288 states have (on average 1.2465277777777777) internal successors, (359), 305 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:06:54,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 359 transitions. [2021-11-22 20:06:54,302 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 359 transitions. Word has length 77 [2021-11-22 20:06:54,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:06:54,303 INFO L470 AbstractCegarLoop]: Abstraction has 306 states and 359 transitions. [2021-11-22 20:06:54,303 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:06:54,303 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 359 transitions. [2021-11-22 20:06:54,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-11-22 20:06:54,304 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:06:54,304 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:06:54,305 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-22 20:06:54,305 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2021-11-22 20:06:54,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:06:54,305 INFO L85 PathProgramCache]: Analyzing trace with hash -1556921607, now seen corresponding path program 1 times [2021-11-22 20:06:54,305 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:06:54,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498125576] [2021-11-22 20:06:54,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:06:54,306 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:06:54,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:06:54,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:06:54,442 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:06:54,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498125576] [2021-11-22 20:06:54,443 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498125576] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:06:54,443 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:06:54,443 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-22 20:06:54,443 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634917400] [2021-11-22 20:06:54,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:06:54,444 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-22 20:06:54,445 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:06:54,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-22 20:06:54,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-22 20:06:54,445 INFO L87 Difference]: Start difference. First operand 306 states and 359 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:06:54,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:06:54,493 INFO L93 Difference]: Finished difference Result 575 states and 675 transitions. [2021-11-22 20:06:54,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-22 20:06:54,493 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2021-11-22 20:06:54,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:06:54,494 INFO L225 Difference]: With dead ends: 575 [2021-11-22 20:06:54,494 INFO L226 Difference]: Without dead ends: 304 [2021-11-22 20:06:54,495 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-22 20:06:54,496 INFO L933 BasicCegarLoop]: 335 mSDtfsCounter, 321 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 658 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 20:06:54,496 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [321 Valid, 658 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 20:06:54,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2021-11-22 20:06:54,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 304. [2021-11-22 20:06:54,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 286 states have (on average 1.2307692307692308) internal successors, (352), 303 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:06:54,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 352 transitions. [2021-11-22 20:06:54,503 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 352 transitions. Word has length 77 [2021-11-22 20:06:54,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:06:54,503 INFO L470 AbstractCegarLoop]: Abstraction has 304 states and 352 transitions. [2021-11-22 20:06:54,503 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:06:54,504 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 352 transitions. [2021-11-22 20:06:54,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-11-22 20:06:54,504 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:06:54,504 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:06:54,505 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-22 20:06:54,505 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2021-11-22 20:06:54,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:06:54,505 INFO L85 PathProgramCache]: Analyzing trace with hash 49481554, now seen corresponding path program 1 times [2021-11-22 20:06:54,505 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:06:54,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686408698] [2021-11-22 20:06:54,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:06:54,505 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:06:54,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:06:54,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:06:54,664 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:06:54,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686408698] [2021-11-22 20:06:54,664 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686408698] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:06:54,664 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:06:54,664 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-22 20:06:54,664 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889688124] [2021-11-22 20:06:54,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:06:54,664 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-22 20:06:54,665 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:06:54,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-22 20:06:54,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-22 20:06:54,665 INFO L87 Difference]: Start difference. First operand 304 states and 352 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:06:54,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:06:54,983 INFO L93 Difference]: Finished difference Result 762 states and 880 transitions. [2021-11-22 20:06:54,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-22 20:06:54,984 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2021-11-22 20:06:54,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:06:54,985 INFO L225 Difference]: With dead ends: 762 [2021-11-22 20:06:54,985 INFO L226 Difference]: Without dead ends: 495 [2021-11-22 20:06:54,986 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-22 20:06:54,986 INFO L933 BasicCegarLoop]: 514 mSDtfsCounter, 330 mSDsluCounter, 1116 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 1630 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-22 20:06:54,987 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [330 Valid, 1630 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-22 20:06:54,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2021-11-22 20:06:54,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 304. [2021-11-22 20:06:54,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 286 states have (on average 1.2132867132867133) internal successors, (347), 303 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:06:54,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 347 transitions. [2021-11-22 20:06:54,995 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 347 transitions. Word has length 79 [2021-11-22 20:06:54,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:06:54,996 INFO L470 AbstractCegarLoop]: Abstraction has 304 states and 347 transitions. [2021-11-22 20:06:54,996 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:06:54,996 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 347 transitions. [2021-11-22 20:06:54,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-11-22 20:06:54,996 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:06:54,997 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:06:54,997 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-22 20:06:54,997 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2021-11-22 20:06:54,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:06:54,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1515133635, now seen corresponding path program 1 times [2021-11-22 20:06:54,997 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:06:54,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143374750] [2021-11-22 20:06:54,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:06:54,997 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:06:55,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:06:55,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:06:55,162 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:06:55,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143374750] [2021-11-22 20:06:55,162 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143374750] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:06:55,162 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:06:55,162 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-22 20:06:55,162 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807900529] [2021-11-22 20:06:55,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:06:55,163 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-22 20:06:55,163 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:06:55,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-22 20:06:55,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-22 20:06:55,163 INFO L87 Difference]: Start difference. First operand 304 states and 347 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:06:55,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:06:55,323 INFO L93 Difference]: Finished difference Result 589 states and 677 transitions. [2021-11-22 20:06:55,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-22 20:06:55,323 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2021-11-22 20:06:55,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:06:55,325 INFO L225 Difference]: With dead ends: 589 [2021-11-22 20:06:55,325 INFO L226 Difference]: Without dead ends: 384 [2021-11-22 20:06:55,325 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-22 20:06:55,325 INFO L933 BasicCegarLoop]: 418 mSDtfsCounter, 94 mSDsluCounter, 669 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 1087 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 20:06:55,326 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [94 Valid, 1087 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 20:06:55,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2021-11-22 20:06:55,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 304. [2021-11-22 20:06:55,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 286 states have (on average 1.2027972027972027) internal successors, (344), 303 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:06:55,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 344 transitions. [2021-11-22 20:06:55,334 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 344 transitions. Word has length 80 [2021-11-22 20:06:55,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:06:55,334 INFO L470 AbstractCegarLoop]: Abstraction has 304 states and 344 transitions. [2021-11-22 20:06:55,334 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:06:55,334 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 344 transitions. [2021-11-22 20:06:55,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-11-22 20:06:55,335 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:06:55,335 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:06:55,336 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-22 20:06:55,336 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2021-11-22 20:06:55,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:06:55,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1012099414, now seen corresponding path program 1 times [2021-11-22 20:06:55,336 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:06:55,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857359530] [2021-11-22 20:06:55,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:06:55,337 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:06:55,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:06:55,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:06:55,535 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:06:55,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857359530] [2021-11-22 20:06:55,535 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857359530] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:06:55,535 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:06:55,535 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-22 20:06:55,536 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830312848] [2021-11-22 20:06:55,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:06:55,536 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-22 20:06:55,536 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:06:55,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-22 20:06:55,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-11-22 20:06:55,537 INFO L87 Difference]: Start difference. First operand 304 states and 344 transitions. Second operand has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:06:55,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:06:55,998 INFO L93 Difference]: Finished difference Result 786 states and 896 transitions. [2021-11-22 20:06:55,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-22 20:06:55,999 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2021-11-22 20:06:55,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:06:56,002 INFO L225 Difference]: With dead ends: 786 [2021-11-22 20:06:56,002 INFO L226 Difference]: Without dead ends: 558 [2021-11-22 20:06:56,002 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2021-11-22 20:06:56,003 INFO L933 BasicCegarLoop]: 375 mSDtfsCounter, 1195 mSDsluCounter, 1374 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1195 SdHoareTripleChecker+Valid, 1749 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-22 20:06:56,003 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1195 Valid, 1749 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-22 20:06:56,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2021-11-22 20:06:56,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 304. [2021-11-22 20:06:56,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 286 states have (on average 1.1993006993006994) internal successors, (343), 303 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:06:56,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 343 transitions. [2021-11-22 20:06:56,033 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 343 transitions. Word has length 81 [2021-11-22 20:06:56,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:06:56,034 INFO L470 AbstractCegarLoop]: Abstraction has 304 states and 343 transitions. [2021-11-22 20:06:56,034 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:06:56,034 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 343 transitions. [2021-11-22 20:06:56,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-11-22 20:06:56,034 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:06:56,035 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:06:56,035 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-22 20:06:56,035 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2021-11-22 20:06:56,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:06:56,035 INFO L85 PathProgramCache]: Analyzing trace with hash -1407230914, now seen corresponding path program 1 times [2021-11-22 20:06:56,036 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:06:56,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003738582] [2021-11-22 20:06:56,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:06:56,036 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:06:56,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:06:56,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:06:56,337 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:06:56,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003738582] [2021-11-22 20:06:56,337 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003738582] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:06:56,337 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:06:56,337 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-22 20:06:56,337 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146557937] [2021-11-22 20:06:56,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:06:56,338 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-22 20:06:56,338 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:06:56,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-22 20:06:56,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-11-22 20:06:56,338 INFO L87 Difference]: Start difference. First operand 304 states and 343 transitions. Second operand has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:06:56,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:06:56,765 INFO L93 Difference]: Finished difference Result 576 states and 649 transitions. [2021-11-22 20:06:56,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-22 20:06:56,766 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2021-11-22 20:06:56,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:06:56,767 INFO L225 Difference]: With dead ends: 576 [2021-11-22 20:06:56,767 INFO L226 Difference]: Without dead ends: 367 [2021-11-22 20:06:56,768 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=161, Unknown=0, NotChecked=0, Total=240 [2021-11-22 20:06:56,768 INFO L933 BasicCegarLoop]: 346 mSDtfsCounter, 1270 mSDsluCounter, 1139 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1270 SdHoareTripleChecker+Valid, 1485 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-22 20:06:56,768 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1270 Valid, 1485 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-22 20:06:56,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2021-11-22 20:06:56,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 342. [2021-11-22 20:06:56,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 324 states have (on average 1.2006172839506173) internal successors, (389), 341 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:06:56,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 389 transitions. [2021-11-22 20:06:56,795 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 389 transitions. Word has length 84 [2021-11-22 20:06:56,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:06:56,796 INFO L470 AbstractCegarLoop]: Abstraction has 342 states and 389 transitions. [2021-11-22 20:06:56,796 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:06:56,796 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 389 transitions. [2021-11-22 20:06:56,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-11-22 20:06:56,797 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:06:56,797 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:06:56,797 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-22 20:06:56,797 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2021-11-22 20:06:56,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:06:56,798 INFO L85 PathProgramCache]: Analyzing trace with hash -906125413, now seen corresponding path program 1 times [2021-11-22 20:06:56,798 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:06:56,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750233108] [2021-11-22 20:06:56,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:06:56,798 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:06:57,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:06:57,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:06:57,327 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:06:57,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750233108] [2021-11-22 20:06:57,328 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750233108] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:06:57,328 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:06:57,328 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-22 20:06:57,328 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929495602] [2021-11-22 20:06:57,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:06:57,329 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-22 20:06:57,329 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:06:57,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-22 20:06:57,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 20:06:57,330 INFO L87 Difference]: Start difference. First operand 342 states and 389 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:06:57,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:06:57,379 INFO L93 Difference]: Finished difference Result 342 states and 389 transitions. [2021-11-22 20:06:57,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-22 20:06:57,379 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2021-11-22 20:06:57,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:06:57,380 INFO L225 Difference]: With dead ends: 342 [2021-11-22 20:06:57,380 INFO L226 Difference]: Without dead ends: 340 [2021-11-22 20:06:57,381 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 20:06:57,382 INFO L933 BasicCegarLoop]: 333 mSDtfsCounter, 7 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 609 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 20:06:57,383 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 609 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 20:06:57,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2021-11-22 20:06:57,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2021-11-22 20:06:57,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 323 states have (on average 1.1981424148606812) internal successors, (387), 339 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:06:57,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 387 transitions. [2021-11-22 20:06:57,398 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 387 transitions. Word has length 87 [2021-11-22 20:06:57,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:06:57,398 INFO L470 AbstractCegarLoop]: Abstraction has 340 states and 387 transitions. [2021-11-22 20:06:57,399 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:06:57,399 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 387 transitions. [2021-11-22 20:06:57,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-11-22 20:06:57,400 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:06:57,400 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:06:57,400 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-22 20:06:57,401 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2021-11-22 20:06:57,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:06:57,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1919810315, now seen corresponding path program 1 times [2021-11-22 20:06:57,402 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:06:57,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767289182] [2021-11-22 20:06:57,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:06:57,402 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:06:57,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:06:57,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:06:57,588 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:06:57,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767289182] [2021-11-22 20:06:57,589 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767289182] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:06:57,589 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:06:57,589 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-22 20:06:57,589 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188592149] [2021-11-22 20:06:57,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:06:57,589 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-22 20:06:57,590 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:06:57,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-22 20:06:57,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-22 20:06:57,590 INFO L87 Difference]: Start difference. First operand 340 states and 387 transitions. Second operand has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:06:57,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:06:57,707 INFO L93 Difference]: Finished difference Result 614 states and 713 transitions. [2021-11-22 20:06:57,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-22 20:06:57,707 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2021-11-22 20:06:57,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:06:57,709 INFO L225 Difference]: With dead ends: 614 [2021-11-22 20:06:57,709 INFO L226 Difference]: Without dead ends: 612 [2021-11-22 20:06:57,709 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-22 20:06:57,710 INFO L933 BasicCegarLoop]: 540 mSDtfsCounter, 345 mSDsluCounter, 749 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 1289 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 20:06:57,710 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [345 Valid, 1289 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 20:06:57,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2021-11-22 20:06:57,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 342. [2021-11-22 20:06:57,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 325 states have (on average 1.196923076923077) internal successors, (389), 341 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:06:57,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 389 transitions. [2021-11-22 20:06:57,725 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 389 transitions. Word has length 94 [2021-11-22 20:06:57,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:06:57,725 INFO L470 AbstractCegarLoop]: Abstraction has 342 states and 389 transitions. [2021-11-22 20:06:57,725 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:06:57,725 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 389 transitions. [2021-11-22 20:06:57,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-11-22 20:06:57,725 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:06:57,726 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:06:57,726 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-22 20:06:57,726 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2021-11-22 20:06:57,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:06:57,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1919869897, now seen corresponding path program 1 times [2021-11-22 20:06:57,726 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:06:57,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445556979] [2021-11-22 20:06:57,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:06:57,726 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:06:57,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:06:57,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:06:57,964 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:06:57,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445556979] [2021-11-22 20:06:57,964 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445556979] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:06:57,964 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:06:57,964 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-22 20:06:57,964 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186646511] [2021-11-22 20:06:57,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:06:57,964 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-22 20:06:57,964 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:06:57,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-22 20:06:57,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-22 20:06:57,965 INFO L87 Difference]: Start difference. First operand 342 states and 389 transitions. Second operand has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:06:58,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:06:58,093 INFO L93 Difference]: Finished difference Result 611 states and 710 transitions. [2021-11-22 20:06:58,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-22 20:06:58,095 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2021-11-22 20:06:58,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:06:58,096 INFO L225 Difference]: With dead ends: 611 [2021-11-22 20:06:58,096 INFO L226 Difference]: Without dead ends: 609 [2021-11-22 20:06:58,096 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-22 20:06:58,097 INFO L933 BasicCegarLoop]: 538 mSDtfsCounter, 345 mSDsluCounter, 744 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 1282 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 20:06:58,097 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [345 Valid, 1282 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 20:06:58,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2021-11-22 20:06:58,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 338. [2021-11-22 20:06:58,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 322 states have (on average 1.1956521739130435) internal successors, (385), 337 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:06:58,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 385 transitions. [2021-11-22 20:06:58,113 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 385 transitions. Word has length 94 [2021-11-22 20:06:58,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:06:58,114 INFO L470 AbstractCegarLoop]: Abstraction has 338 states and 385 transitions. [2021-11-22 20:06:58,114 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:06:58,114 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 385 transitions. [2021-11-22 20:06:58,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-11-22 20:06:58,114 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:06:58,114 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:06:58,114 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-22 20:06:58,115 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2021-11-22 20:06:58,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:06:58,115 INFO L85 PathProgramCache]: Analyzing trace with hash 2051848882, now seen corresponding path program 1 times [2021-11-22 20:06:58,115 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:06:58,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478503713] [2021-11-22 20:06:58,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:06:58,115 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:06:58,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:06:58,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:06:58,309 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:06:58,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478503713] [2021-11-22 20:06:58,309 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478503713] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:06:58,309 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:06:58,310 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-22 20:06:58,310 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710273076] [2021-11-22 20:06:58,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:06:58,310 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-22 20:06:58,310 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:06:58,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-22 20:06:58,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-22 20:06:58,311 INFO L87 Difference]: Start difference. First operand 338 states and 385 transitions. Second operand has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:06:58,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:06:58,436 INFO L93 Difference]: Finished difference Result 850 states and 985 transitions. [2021-11-22 20:06:58,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-22 20:06:58,436 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2021-11-22 20:06:58,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:06:58,438 INFO L225 Difference]: With dead ends: 850 [2021-11-22 20:06:58,438 INFO L226 Difference]: Without dead ends: 641 [2021-11-22 20:06:58,439 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2021-11-22 20:06:58,439 INFO L933 BasicCegarLoop]: 415 mSDtfsCounter, 943 mSDsluCounter, 1401 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 943 SdHoareTripleChecker+Valid, 1816 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 20:06:58,439 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [943 Valid, 1816 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 20:06:58,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2021-11-22 20:06:58,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 348. [2021-11-22 20:06:58,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 332 states have (on average 1.1987951807228916) internal successors, (398), 347 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:06:58,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 398 transitions. [2021-11-22 20:06:58,458 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 398 transitions. Word has length 98 [2021-11-22 20:06:58,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:06:58,459 INFO L470 AbstractCegarLoop]: Abstraction has 348 states and 398 transitions. [2021-11-22 20:06:58,459 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:06:58,459 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 398 transitions. [2021-11-22 20:06:58,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-11-22 20:06:58,460 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:06:58,460 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:06:58,460 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-22 20:06:58,460 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2021-11-22 20:06:58,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:06:58,460 INFO L85 PathProgramCache]: Analyzing trace with hash 225332406, now seen corresponding path program 1 times [2021-11-22 20:06:58,461 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:06:58,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563175540] [2021-11-22 20:06:58,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:06:58,461 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:06:58,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:06:58,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:06:58,625 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:06:58,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563175540] [2021-11-22 20:06:58,625 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563175540] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:06:58,625 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:06:58,626 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-22 20:06:58,626 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895105123] [2021-11-22 20:06:58,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:06:58,626 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-22 20:06:58,626 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:06:58,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-22 20:06:58,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 20:06:58,627 INFO L87 Difference]: Start difference. First operand 348 states and 398 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:06:58,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:06:58,658 INFO L93 Difference]: Finished difference Result 450 states and 516 transitions. [2021-11-22 20:06:58,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-22 20:06:58,659 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2021-11-22 20:06:58,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:06:58,661 INFO L225 Difference]: With dead ends: 450 [2021-11-22 20:06:58,661 INFO L226 Difference]: Without dead ends: 348 [2021-11-22 20:06:58,661 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 20:06:58,662 INFO L933 BasicCegarLoop]: 327 mSDtfsCounter, 206 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 20:06:58,662 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [206 Valid, 449 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 20:06:58,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2021-11-22 20:06:58,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 348. [2021-11-22 20:06:58,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 332 states have (on average 1.1927710843373494) internal successors, (396), 347 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:06:58,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 396 transitions. [2021-11-22 20:06:58,690 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 396 transitions. Word has length 99 [2021-11-22 20:06:58,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:06:58,690 INFO L470 AbstractCegarLoop]: Abstraction has 348 states and 396 transitions. [2021-11-22 20:06:58,690 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:06:58,691 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 396 transitions. [2021-11-22 20:06:58,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-11-22 20:06:58,692 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:06:58,692 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:06:58,692 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-22 20:06:58,692 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2021-11-22 20:06:58,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:06:58,693 INFO L85 PathProgramCache]: Analyzing trace with hash 483497844, now seen corresponding path program 1 times [2021-11-22 20:06:58,693 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:06:58,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026293118] [2021-11-22 20:06:58,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:06:58,693 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:06:58,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:06:58,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:06:58,924 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:06:58,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026293118] [2021-11-22 20:06:58,924 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026293118] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:06:58,924 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:06:58,924 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-22 20:06:58,924 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240470144] [2021-11-22 20:06:58,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:06:58,925 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-22 20:06:58,925 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:06:58,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-22 20:06:58,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-22 20:06:58,926 INFO L87 Difference]: Start difference. First operand 348 states and 396 transitions. Second operand has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:06:58,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:06:58,964 INFO L93 Difference]: Finished difference Result 546 states and 625 transitions. [2021-11-22 20:06:58,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-22 20:06:58,965 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2021-11-22 20:06:58,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:06:58,966 INFO L225 Difference]: With dead ends: 546 [2021-11-22 20:06:58,966 INFO L226 Difference]: Without dead ends: 448 [2021-11-22 20:06:58,967 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-22 20:06:58,967 INFO L933 BasicCegarLoop]: 328 mSDtfsCounter, 135 mSDsluCounter, 651 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 979 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 20:06:58,967 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [135 Valid, 979 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 20:06:58,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2021-11-22 20:06:58,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 350. [2021-11-22 20:06:58,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 334 states have (on average 1.1916167664670658) internal successors, (398), 349 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:06:58,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 398 transitions. [2021-11-22 20:06:58,987 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 398 transitions. Word has length 99 [2021-11-22 20:06:58,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:06:58,988 INFO L470 AbstractCegarLoop]: Abstraction has 350 states and 398 transitions. [2021-11-22 20:06:58,988 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:06:58,988 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 398 transitions. [2021-11-22 20:06:58,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-11-22 20:06:58,989 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:06:58,989 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:06:58,989 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-22 20:06:58,989 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2021-11-22 20:06:58,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:06:58,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1163556214, now seen corresponding path program 1 times [2021-11-22 20:06:58,990 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:06:58,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764626448] [2021-11-22 20:06:58,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:06:58,990 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:06:59,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:07:00,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:07:00,145 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:07:00,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764626448] [2021-11-22 20:07:00,145 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764626448] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:07:00,145 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:07:00,145 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2021-11-22 20:07:00,145 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083162276] [2021-11-22 20:07:00,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:07:00,145 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-11-22 20:07:00,146 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:07:00,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-11-22 20:07:00,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=580, Unknown=0, NotChecked=0, Total=650 [2021-11-22 20:07:00,146 INFO L87 Difference]: Start difference. First operand 350 states and 398 transitions. Second operand has 26 states, 26 states have (on average 3.8076923076923075) internal successors, (99), 26 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:07:02,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:07:02,693 INFO L93 Difference]: Finished difference Result 739 states and 843 transitions. [2021-11-22 20:07:02,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-11-22 20:07:02,694 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.8076923076923075) internal successors, (99), 26 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2021-11-22 20:07:02,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:07:02,697 INFO L225 Difference]: With dead ends: 739 [2021-11-22 20:07:02,697 INFO L226 Difference]: Without dead ends: 686 [2021-11-22 20:07:02,699 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 519 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=458, Invalid=2298, Unknown=0, NotChecked=0, Total=2756 [2021-11-22 20:07:02,700 INFO L933 BasicCegarLoop]: 268 mSDtfsCounter, 2784 mSDsluCounter, 4885 mSDsCounter, 0 mSdLazyCounter, 1424 mSolverCounterSat, 169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2784 SdHoareTripleChecker+Valid, 5153 SdHoareTripleChecker+Invalid, 1593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 1424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-11-22 20:07:02,700 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2784 Valid, 5153 Invalid, 1593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 1424 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2021-11-22 20:07:02,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2021-11-22 20:07:02,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 471. [2021-11-22 20:07:02,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 471 states, 455 states have (on average 1.1912087912087912) internal successors, (542), 470 states have internal predecessors, (542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:07:02,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 542 transitions. [2021-11-22 20:07:02,729 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 542 transitions. Word has length 99 [2021-11-22 20:07:02,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:07:02,729 INFO L470 AbstractCegarLoop]: Abstraction has 471 states and 542 transitions. [2021-11-22 20:07:02,730 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.8076923076923075) internal successors, (99), 26 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:07:02,730 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 542 transitions. [2021-11-22 20:07:02,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-11-22 20:07:02,730 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:07:02,730 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:07:02,731 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-22 20:07:02,731 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2021-11-22 20:07:02,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:07:02,731 INFO L85 PathProgramCache]: Analyzing trace with hash -1356403720, now seen corresponding path program 1 times [2021-11-22 20:07:02,731 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:07:02,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904755274] [2021-11-22 20:07:02,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:07:02,732 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:07:02,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:07:02,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:07:02,926 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:07:02,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904755274] [2021-11-22 20:07:02,926 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904755274] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:07:02,926 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:07:02,926 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-22 20:07:02,926 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363450690] [2021-11-22 20:07:02,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:07:02,927 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-22 20:07:02,927 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:07:02,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-22 20:07:02,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-22 20:07:02,928 INFO L87 Difference]: Start difference. First operand 471 states and 542 transitions. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:07:02,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:07:02,994 INFO L93 Difference]: Finished difference Result 524 states and 599 transitions. [2021-11-22 20:07:02,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-22 20:07:02,995 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2021-11-22 20:07:02,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:07:02,996 INFO L225 Difference]: With dead ends: 524 [2021-11-22 20:07:02,997 INFO L226 Difference]: Without dead ends: 433 [2021-11-22 20:07:02,997 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-22 20:07:02,998 INFO L933 BasicCegarLoop]: 315 mSDtfsCounter, 471 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 471 SdHoareTripleChecker+Valid, 706 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 20:07:02,998 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [471 Valid, 706 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 20:07:02,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2021-11-22 20:07:03,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 433. [2021-11-22 20:07:03,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 433 states, 417 states have (on average 1.1822541966426858) internal successors, (493), 432 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:07:03,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 493 transitions. [2021-11-22 20:07:03,036 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 493 transitions. Word has length 99 [2021-11-22 20:07:03,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:07:03,036 INFO L470 AbstractCegarLoop]: Abstraction has 433 states and 493 transitions. [2021-11-22 20:07:03,036 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:07:03,036 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 493 transitions. [2021-11-22 20:07:03,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-11-22 20:07:03,037 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:07:03,037 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:07:03,037 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-22 20:07:03,037 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2021-11-22 20:07:03,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:07:03,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1297589499, now seen corresponding path program 1 times [2021-11-22 20:07:03,038 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:07:03,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263859717] [2021-11-22 20:07:03,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:07:03,039 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:07:03,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:07:03,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:07:03,236 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:07:03,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263859717] [2021-11-22 20:07:03,236 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263859717] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:07:03,236 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:07:03,236 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-22 20:07:03,236 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388552621] [2021-11-22 20:07:03,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:07:03,237 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-22 20:07:03,237 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:07:03,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-22 20:07:03,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-11-22 20:07:03,238 INFO L87 Difference]: Start difference. First operand 433 states and 493 transitions. Second operand has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:07:03,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:07:03,524 INFO L93 Difference]: Finished difference Result 797 states and 913 transitions. [2021-11-22 20:07:03,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-22 20:07:03,525 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2021-11-22 20:07:03,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:07:03,527 INFO L225 Difference]: With dead ends: 797 [2021-11-22 20:07:03,527 INFO L226 Difference]: Without dead ends: 652 [2021-11-22 20:07:03,527 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2021-11-22 20:07:03,528 INFO L933 BasicCegarLoop]: 453 mSDtfsCounter, 1224 mSDsluCounter, 1321 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1224 SdHoareTripleChecker+Valid, 1774 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-22 20:07:03,528 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1224 Valid, 1774 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-22 20:07:03,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2021-11-22 20:07:03,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 433. [2021-11-22 20:07:03,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 433 states, 417 states have (on average 1.1774580335731415) internal successors, (491), 432 states have internal predecessors, (491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:07:03,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 491 transitions. [2021-11-22 20:07:03,555 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 491 transitions. Word has length 100 [2021-11-22 20:07:03,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:07:03,556 INFO L470 AbstractCegarLoop]: Abstraction has 433 states and 491 transitions. [2021-11-22 20:07:03,556 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:07:03,556 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 491 transitions. [2021-11-22 20:07:03,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-11-22 20:07:03,557 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:07:03,557 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:07:03,557 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-22 20:07:03,557 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2021-11-22 20:07:03,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:07:03,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1572353847, now seen corresponding path program 1 times [2021-11-22 20:07:03,558 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:07:03,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987592921] [2021-11-22 20:07:03,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:07:03,559 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:07:04,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:07:04,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:07:04,321 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:07:04,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987592921] [2021-11-22 20:07:04,321 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987592921] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:07:04,321 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:07:04,321 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-22 20:07:04,321 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77596289] [2021-11-22 20:07:04,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:07:04,322 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-22 20:07:04,322 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:07:04,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-22 20:07:04,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-22 20:07:04,322 INFO L87 Difference]: Start difference. First operand 433 states and 491 transitions. Second operand has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:07:04,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:07:04,419 INFO L93 Difference]: Finished difference Result 845 states and 957 transitions. [2021-11-22 20:07:04,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-22 20:07:04,420 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2021-11-22 20:07:04,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:07:04,421 INFO L225 Difference]: With dead ends: 845 [2021-11-22 20:07:04,421 INFO L226 Difference]: Without dead ends: 433 [2021-11-22 20:07:04,422 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-22 20:07:04,422 INFO L933 BasicCegarLoop]: 326 mSDtfsCounter, 2 mSDsluCounter, 594 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 920 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 20:07:04,422 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 920 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 20:07:04,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2021-11-22 20:07:04,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 430. [2021-11-22 20:07:04,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 414 states have (on average 1.1666666666666667) internal successors, (483), 429 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:07:04,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 483 transitions. [2021-11-22 20:07:04,449 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 483 transitions. Word has length 101 [2021-11-22 20:07:04,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:07:04,449 INFO L470 AbstractCegarLoop]: Abstraction has 430 states and 483 transitions. [2021-11-22 20:07:04,449 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:07:04,449 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 483 transitions. [2021-11-22 20:07:04,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-11-22 20:07:04,450 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:07:04,450 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:07:04,450 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-22 20:07:04,450 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2021-11-22 20:07:04,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:07:04,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1448092559, now seen corresponding path program 1 times [2021-11-22 20:07:04,451 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:07:04,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561925048] [2021-11-22 20:07:04,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:07:04,451 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:07:04,494 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-22 20:07:04,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2030486245] [2021-11-22 20:07:04,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:07:04,494 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 20:07:04,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-22 20:07:04,495 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-22 20:07:04,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-22 20:07:05,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:07:05,494 INFO L263 TraceCheckSpWp]: Trace formula consists of 2949 conjuncts, 232 conjunts are in the unsatisfiable core [2021-11-22 20:07:05,503 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 20:07:05,537 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-22 20:07:05,711 INFO L354 Elim1Store]: treesize reduction 129, result has 17.8 percent of original size [2021-11-22 20:07:05,712 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 45 treesize of output 57 [2021-11-22 20:07:05,912 INFO L354 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2021-11-22 20:07:05,913 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 27 treesize of output 33 [2021-11-22 20:07:06,116 INFO L354 Elim1Store]: treesize reduction 78, result has 20.4 percent of original size [2021-11-22 20:07:06,116 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 35 treesize of output 45 [2021-11-22 20:07:06,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 20:07:06,256 INFO L354 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2021-11-22 20:07:06,256 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 38 [2021-11-22 20:07:06,317 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 55 [2021-11-22 20:07:06,357 INFO L354 Elim1Store]: treesize reduction 106, result has 20.9 percent of original size [2021-11-22 20:07:06,357 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 64 treesize of output 78 [2021-11-22 20:07:06,789 INFO L354 Elim1Store]: treesize reduction 45, result has 19.6 percent of original size [2021-11-22 20:07:06,789 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 141 treesize of output 132 [2021-11-22 20:07:06,820 INFO L354 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2021-11-22 20:07:06,821 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 143 treesize of output 144 [2021-11-22 20:07:06,832 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 157 treesize of output 145 [2021-11-22 20:07:06,837 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 145 treesize of output 147 [2021-11-22 20:07:06,896 INFO L354 Elim1Store]: treesize reduction 86, result has 35.8 percent of original size [2021-11-22 20:07:06,897 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 147 treesize of output 181 [2021-11-22 20:07:06,929 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-11-22 20:07:07,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 20:07:07,038 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 20:07:07,039 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 54 [2021-11-22 20:07:07,080 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-11-22 20:07:07,545 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-22 20:07:07,545 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 68 [2021-11-22 20:07:08,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 20:07:08,520 INFO L354 Elim1Store]: treesize reduction 559, result has 23.3 percent of original size [2021-11-22 20:07:08,521 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 2 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 37 case distinctions, treesize of input 117 treesize of output 256 [2021-11-22 20:07:12,876 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2021-11-22 20:07:13,202 INFO L354 Elim1Store]: treesize reduction 112, result has 24.8 percent of original size [2021-11-22 20:07:13,203 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 13 case distinctions, treesize of input 60 treesize of output 85 [2021-11-22 20:07:13,592 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2021-11-22 20:07:13,927 INFO L354 Elim1Store]: treesize reduction 96, result has 17.9 percent of original size [2021-11-22 20:07:13,928 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 63 treesize of output 74 [2021-11-22 20:07:14,454 INFO L354 Elim1Store]: treesize reduction 90, result has 15.1 percent of original size [2021-11-22 20:07:14,454 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 51 treesize of output 57 [2021-11-22 20:07:14,568 INFO L354 Elim1Store]: treesize reduction 36, result has 26.5 percent of original size [2021-11-22 20:07:14,568 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 37 [2021-11-22 20:07:15,065 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-11-22 20:07:15,066 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 30 [2021-11-22 20:07:15,068 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 34 [2021-11-22 20:07:15,124 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-22 20:07:15,125 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 34 [2021-11-22 20:07:15,132 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2021-11-22 20:07:15,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:07:15,246 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-22 20:07:15,246 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:07:15,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561925048] [2021-11-22 20:07:15,246 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-22 20:07:15,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2030486245] [2021-11-22 20:07:15,247 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2030486245] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:07:15,247 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:07:15,247 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2021-11-22 20:07:15,247 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064302884] [2021-11-22 20:07:15,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:07:15,247 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-11-22 20:07:15,247 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:07:15,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-11-22 20:07:15,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=521, Unknown=0, NotChecked=0, Total=600 [2021-11-22 20:07:15,248 INFO L87 Difference]: Start difference. First operand 430 states and 483 transitions. Second operand has 25 states, 25 states have (on average 4.2) internal successors, (105), 25 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:07:16,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:07:16,175 INFO L93 Difference]: Finished difference Result 732 states and 822 transitions. [2021-11-22 20:07:16,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-11-22 20:07:16,180 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 4.2) internal successors, (105), 25 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2021-11-22 20:07:16,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:07:16,182 INFO L225 Difference]: With dead ends: 732 [2021-11-22 20:07:16,182 INFO L226 Difference]: Without dead ends: 679 [2021-11-22 20:07:16,183 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 405 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=193, Invalid=1213, Unknown=0, NotChecked=0, Total=1406 [2021-11-22 20:07:16,184 INFO L933 BasicCegarLoop]: 264 mSDtfsCounter, 1152 mSDsluCounter, 3818 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1152 SdHoareTripleChecker+Valid, 4082 SdHoareTripleChecker+Invalid, 803 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 345 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-22 20:07:16,184 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1152 Valid, 4082 Invalid, 803 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 421 Invalid, 0 Unknown, 345 Unchecked, 0.4s Time] [2021-11-22 20:07:16,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states. [2021-11-22 20:07:16,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 416. [2021-11-22 20:07:16,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 400 states have (on average 1.1675) internal successors, (467), 415 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:07:16,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 467 transitions. [2021-11-22 20:07:16,211 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 467 transitions. Word has length 105 [2021-11-22 20:07:16,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:07:16,212 INFO L470 AbstractCegarLoop]: Abstraction has 416 states and 467 transitions. [2021-11-22 20:07:16,212 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 4.2) internal successors, (105), 25 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:07:16,212 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 467 transitions. [2021-11-22 20:07:16,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-11-22 20:07:16,212 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:07:16,213 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:07:16,245 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-22 20:07:16,419 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 20:07:16,419 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2021-11-22 20:07:16,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:07:16,420 INFO L85 PathProgramCache]: Analyzing trace with hash 38783858, now seen corresponding path program 1 times [2021-11-22 20:07:16,420 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:07:16,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418312175] [2021-11-22 20:07:16,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:07:16,420 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:07:16,470 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-22 20:07:16,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1224546854] [2021-11-22 20:07:16,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:07:16,471 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 20:07:16,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-22 20:07:16,472 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-22 20:07:16,474 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-22 20:07:47,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:07:47,201 INFO L263 TraceCheckSpWp]: Trace formula consists of 3039 conjuncts, 515 conjunts are in the unsatisfiable core [2021-11-22 20:07:47,215 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 20:07:47,231 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-22 20:07:47,481 INFO L354 Elim1Store]: treesize reduction 129, result has 17.8 percent of original size [2021-11-22 20:07:47,481 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 45 treesize of output 57 [2021-11-22 20:07:47,797 INFO L354 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2021-11-22 20:07:47,797 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 27 treesize of output 33 [2021-11-22 20:07:48,085 INFO L354 Elim1Store]: treesize reduction 78, result has 20.4 percent of original size [2021-11-22 20:07:48,086 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 35 treesize of output 45 [2021-11-22 20:07:48,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 20:07:48,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 20:07:48,313 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-11-22 20:07:48,313 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 34 [2021-11-22 20:07:48,395 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-22 20:07:48,403 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 70 [2021-11-22 20:07:48,409 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 69 [2021-11-22 20:07:48,421 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-11-22 20:07:48,422 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 78 [2021-11-22 20:07:48,444 INFO L354 Elim1Store]: treesize reduction 72, result has 17.2 percent of original size [2021-11-22 20:07:48,444 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 74 treesize of output 77 [2021-11-22 20:07:48,939 INFO L354 Elim1Store]: treesize reduction 45, result has 19.6 percent of original size [2021-11-22 20:07:48,940 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 400 treesize of output 357 [2021-11-22 20:07:48,992 INFO L354 Elim1Store]: treesize reduction 484, result has 10.5 percent of original size [2021-11-22 20:07:48,992 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 402 treesize of output 383 [2021-11-22 20:07:49,020 INFO L354 Elim1Store]: treesize reduction 63, result has 14.9 percent of original size [2021-11-22 20:07:49,021 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 399 treesize of output 377 [2021-11-22 20:07:49,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 20:07:49,046 INFO L354 Elim1Store]: treesize reduction 37, result has 31.5 percent of original size [2021-11-22 20:07:49,046 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 401 treesize of output 417 [2021-11-22 20:07:49,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 20:07:49,075 INFO L354 Elim1Store]: treesize reduction 37, result has 31.5 percent of original size [2021-11-22 20:07:49,075 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 411 treesize of output 427 [2021-11-22 20:07:49,090 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 421 treesize of output 423 [2021-11-22 20:07:49,103 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 423 treesize of output 425 [2021-11-22 20:07:49,139 INFO L354 Elim1Store]: treesize reduction 68, result has 21.8 percent of original size [2021-11-22 20:07:49,139 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 425 treesize of output 432 [2021-11-22 20:07:49,187 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-11-22 20:07:49,224 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-11-22 20:07:49,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 20:07:49,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 20:07:49,275 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 20:07:49,276 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 38 [2021-11-22 20:07:49,293 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-11-22 20:07:49,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 20:07:49,353 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-11-22 20:07:49,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 20:07:49,415 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-11-22 20:07:49,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 20:07:49,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 20:07:49,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 20:07:49,450 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 26 [2021-11-22 20:07:49,458 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2021-11-22 20:07:49,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 20:07:49,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 20:07:49,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 20:07:49,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 20:07:49,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 20:07:49,514 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 20:07:49,514 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 127 treesize of output 93 [2021-11-22 20:07:49,818 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-22 20:07:49,818 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 83 [2021-11-22 20:07:49,834 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-22 20:07:49,834 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 85 [2021-11-22 20:07:49,849 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-11-22 20:07:49,849 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 73 [2021-11-22 20:07:50,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 20:07:50,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 20:07:50,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 20:07:50,184 INFO L354 Elim1Store]: treesize reduction 80, result has 23.8 percent of original size [2021-11-22 20:07:50,186 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 78 treesize of output 86 [2021-11-22 20:07:51,130 INFO L354 Elim1Store]: treesize reduction 51, result has 15.0 percent of original size [2021-11-22 20:07:51,131 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 248 treesize of output 242 [2021-11-22 20:07:51,139 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 244 treesize of output 226 [2021-11-22 20:07:51,380 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2021-11-22 20:07:53,715 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2021-11-22 20:07:53,730 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 272 treesize of output 254 [2021-11-22 20:07:53,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 20:07:53,740 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-22 20:07:53,752 INFO L354 Elim1Store]: treesize reduction 31, result has 18.4 percent of original size [2021-11-22 20:07:53,752 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 266 treesize of output 259 [2021-11-22 20:08:03,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:08:03,308 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-22 20:08:03,308 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:08:03,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418312175] [2021-11-22 20:08:03,308 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-22 20:08:03,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1224546854] [2021-11-22 20:08:03,308 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1224546854] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:08:03,308 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:08:03,308 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-11-22 20:08:03,309 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467372951] [2021-11-22 20:08:03,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:08:03,309 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-11-22 20:08:03,309 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:08:03,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-11-22 20:08:03,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2021-11-22 20:08:03,310 INFO L87 Difference]: Start difference. First operand 416 states and 467 transitions. Second operand has 20 states, 20 states have (on average 5.35) internal successors, (107), 19 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:08:05,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:08:05,862 INFO L93 Difference]: Finished difference Result 679 states and 761 transitions. [2021-11-22 20:08:05,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-22 20:08:05,864 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 5.35) internal successors, (107), 19 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2021-11-22 20:08:05,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:08:05,865 INFO L225 Difference]: With dead ends: 679 [2021-11-22 20:08:05,865 INFO L226 Difference]: Without dead ends: 436 [2021-11-22 20:08:05,866 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=166, Invalid=826, Unknown=0, NotChecked=0, Total=992 [2021-11-22 20:08:05,866 INFO L933 BasicCegarLoop]: 302 mSDtfsCounter, 214 mSDsluCounter, 2379 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 2681 SdHoareTripleChecker+Invalid, 716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 366 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-22 20:08:05,866 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [214 Valid, 2681 Invalid, 716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 318 Invalid, 0 Unknown, 366 Unchecked, 0.6s Time] [2021-11-22 20:08:05,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2021-11-22 20:08:05,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 428. [2021-11-22 20:08:05,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 412 states have (on average 1.1650485436893203) internal successors, (480), 427 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:08:05,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 480 transitions. [2021-11-22 20:08:05,896 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 480 transitions. Word has length 107 [2021-11-22 20:08:05,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:08:05,896 INFO L470 AbstractCegarLoop]: Abstraction has 428 states and 480 transitions. [2021-11-22 20:08:05,896 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.35) internal successors, (107), 19 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:08:05,897 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 480 transitions. [2021-11-22 20:08:05,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2021-11-22 20:08:05,897 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:08:05,897 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:08:05,985 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-22 20:08:06,111 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 20:08:06,111 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2021-11-22 20:08:06,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:08:06,112 INFO L85 PathProgramCache]: Analyzing trace with hash 430393157, now seen corresponding path program 1 times [2021-11-22 20:08:06,112 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:08:06,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650477114] [2021-11-22 20:08:06,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:08:06,112 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:08:06,159 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-22 20:08:06,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1125029116] [2021-11-22 20:08:06,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:08:06,159 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 20:08:06,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-22 20:08:06,160 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-22 20:08:06,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-22 20:08:07,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:08:07,249 INFO L263 TraceCheckSpWp]: Trace formula consists of 2990 conjuncts, 278 conjunts are in the unsatisfiable core [2021-11-22 20:08:07,266 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 20:08:07,276 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-22 20:08:07,407 INFO L354 Elim1Store]: treesize reduction 133, result has 15.3 percent of original size [2021-11-22 20:08:07,407 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 45 treesize of output 53 [2021-11-22 20:08:07,625 INFO L354 Elim1Store]: treesize reduction 112, result has 15.8 percent of original size [2021-11-22 20:08:07,625 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 32 treesize of output 41 [2021-11-22 20:08:07,815 INFO L354 Elim1Store]: treesize reduction 78, result has 20.4 percent of original size [2021-11-22 20:08:07,816 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 35 treesize of output 45 [2021-11-22 20:08:07,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 20:08:07,961 INFO L354 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2021-11-22 20:08:07,961 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 38 [2021-11-22 20:08:08,014 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 55 [2021-11-22 20:08:08,039 INFO L354 Elim1Store]: treesize reduction 106, result has 20.9 percent of original size [2021-11-22 20:08:08,039 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 64 treesize of output 78 [2021-11-22 20:08:08,411 INFO L354 Elim1Store]: treesize reduction 45, result has 19.6 percent of original size [2021-11-22 20:08:08,412 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 141 treesize of output 132 [2021-11-22 20:08:08,433 INFO L354 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2021-11-22 20:08:08,433 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 143 treesize of output 144 [2021-11-22 20:08:08,437 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 157 treesize of output 145 [2021-11-22 20:08:08,478 INFO L354 Elim1Store]: treesize reduction 86, result has 35.8 percent of original size [2021-11-22 20:08:08,479 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 145 treesize of output 179 [2021-11-22 20:08:08,488 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 173 treesize of output 175 [2021-11-22 20:08:08,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 20:08:08,525 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2021-11-22 20:08:08,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 20:08:08,549 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-11-22 20:08:08,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 20:08:08,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 20:08:08,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 20:08:08,580 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 18 [2021-11-22 20:08:08,600 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-11-22 20:08:09,015 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-22 20:08:09,016 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 68 [2021-11-22 20:08:09,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 20:08:09,896 INFO L354 Elim1Store]: treesize reduction 513, result has 23.3 percent of original size [2021-11-22 20:08:09,897 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 3 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 29 case distinctions, treesize of input 112 treesize of output 239 [2021-11-22 20:08:10,938 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2021-11-22 20:08:11,211 INFO L354 Elim1Store]: treesize reduction 154, result has 23.0 percent of original size [2021-11-22 20:08:11,211 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 5 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 18 case distinctions, treesize of input 53 treesize of output 85 [2021-11-22 20:08:11,454 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2021-11-22 20:08:11,670 INFO L354 Elim1Store]: treesize reduction 88, result has 19.3 percent of original size [2021-11-22 20:08:11,671 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 51 treesize of output 62 [2021-11-22 20:08:11,958 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-11-22 20:08:11,959 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 28 [2021-11-22 20:08:11,965 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2021-11-22 20:08:12,080 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-11-22 20:08:12,081 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 42 [2021-11-22 20:08:12,158 INFO L354 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2021-11-22 20:08:12,158 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 34 treesize of output 37 [2021-11-22 20:08:12,211 INFO L354 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2021-11-22 20:08:12,212 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 37 [2021-11-22 20:08:13,026 INFO L354 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-11-22 20:08:13,026 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 26 [2021-11-22 20:08:13,115 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-11-22 20:08:13,115 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 38 [2021-11-22 20:08:13,122 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-22 20:08:13,123 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 41 [2021-11-22 20:08:13,202 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-22 20:08:13,202 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 55 [2021-11-22 20:08:13,218 INFO L354 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2021-11-22 20:08:13,218 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 54 [2021-11-22 20:08:13,227 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2021-11-22 20:08:13,317 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-11-22 20:08:13,318 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2021-11-22 20:08:13,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:08:13,378 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-22 20:08:13,378 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:08:13,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650477114] [2021-11-22 20:08:13,378 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-22 20:08:13,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1125029116] [2021-11-22 20:08:13,379 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1125029116] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:08:13,379 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:08:13,379 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2021-11-22 20:08:13,379 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648261140] [2021-11-22 20:08:13,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:08:13,379 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2021-11-22 20:08:13,380 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:08:13,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-11-22 20:08:13,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=816, Unknown=0, NotChecked=0, Total=930 [2021-11-22 20:08:13,380 INFO L87 Difference]: Start difference. First operand 428 states and 480 transitions. Second operand has 31 states, 31 states have (on average 3.4838709677419355) internal successors, (108), 31 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:08:13,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:08:13,948 INFO L93 Difference]: Finished difference Result 666 states and 743 transitions. [2021-11-22 20:08:13,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-11-22 20:08:13,950 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 3.4838709677419355) internal successors, (108), 31 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2021-11-22 20:08:13,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:08:13,951 INFO L225 Difference]: With dead ends: 666 [2021-11-22 20:08:13,951 INFO L226 Difference]: Without dead ends: 613 [2021-11-22 20:08:13,952 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 529 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=175, Invalid=1465, Unknown=0, NotChecked=0, Total=1640 [2021-11-22 20:08:13,953 INFO L933 BasicCegarLoop]: 504 mSDtfsCounter, 320 mSDsluCounter, 5715 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 6219 SdHoareTripleChecker+Invalid, 639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 373 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-22 20:08:13,953 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [320 Valid, 6219 Invalid, 639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 259 Invalid, 0 Unknown, 373 Unchecked, 0.2s Time] [2021-11-22 20:08:13,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2021-11-22 20:08:14,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 441. [2021-11-22 20:08:14,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 425 states have (on average 1.1670588235294117) internal successors, (496), 440 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:08:14,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 496 transitions. [2021-11-22 20:08:14,005 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 496 transitions. Word has length 108 [2021-11-22 20:08:14,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:08:14,005 INFO L470 AbstractCegarLoop]: Abstraction has 441 states and 496 transitions. [2021-11-22 20:08:14,006 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 3.4838709677419355) internal successors, (108), 31 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:08:14,006 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 496 transitions. [2021-11-22 20:08:14,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-11-22 20:08:14,006 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:08:14,006 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:08:14,037 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-22 20:08:14,215 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 20:08:14,215 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2021-11-22 20:08:14,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:08:14,216 INFO L85 PathProgramCache]: Analyzing trace with hash 713009654, now seen corresponding path program 1 times [2021-11-22 20:08:14,216 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:08:14,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50090408] [2021-11-22 20:08:14,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:08:14,216 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:08:14,290 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-22 20:08:14,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [846622170] [2021-11-22 20:08:14,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:08:14,291 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 20:08:14,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-22 20:08:14,292 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-22 20:08:14,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-22 20:08:14,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:08:14,902 INFO L263 TraceCheckSpWp]: Trace formula consists of 3036 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-22 20:08:14,905 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 20:08:15,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:08:15,028 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-22 20:08:15,028 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:08:15,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50090408] [2021-11-22 20:08:15,028 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-22 20:08:15,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [846622170] [2021-11-22 20:08:15,028 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [846622170] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:08:15,028 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:08:15,028 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-22 20:08:15,028 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560113203] [2021-11-22 20:08:15,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:08:15,029 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-22 20:08:15,029 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:08:15,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-22 20:08:15,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-22 20:08:15,029 INFO L87 Difference]: Start difference. First operand 441 states and 496 transitions. Second operand has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 6 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:08:15,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:08:15,211 INFO L93 Difference]: Finished difference Result 1172 states and 1313 transitions. [2021-11-22 20:08:15,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-22 20:08:15,212 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 6 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2021-11-22 20:08:15,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:08:15,214 INFO L225 Difference]: With dead ends: 1172 [2021-11-22 20:08:15,214 INFO L226 Difference]: Without dead ends: 736 [2021-11-22 20:08:15,215 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-11-22 20:08:15,216 INFO L933 BasicCegarLoop]: 367 mSDtfsCounter, 311 mSDsluCounter, 1390 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 1757 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 20:08:15,216 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [311 Valid, 1757 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 20:08:15,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2021-11-22 20:08:15,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 432. [2021-11-22 20:08:15,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 416 states have (on average 1.1634615384615385) internal successors, (484), 431 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:08:15,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 484 transitions. [2021-11-22 20:08:15,249 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 484 transitions. Word has length 109 [2021-11-22 20:08:15,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:08:15,250 INFO L470 AbstractCegarLoop]: Abstraction has 432 states and 484 transitions. [2021-11-22 20:08:15,250 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 6 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:08:15,250 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 484 transitions. [2021-11-22 20:08:15,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-11-22 20:08:15,251 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:08:15,251 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:08:15,273 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-11-22 20:08:15,467 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2021-11-22 20:08:15,467 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2021-11-22 20:08:15,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:08:15,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1542573294, now seen corresponding path program 1 times [2021-11-22 20:08:15,468 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:08:15,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58352628] [2021-11-22 20:08:15,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:08:15,468 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:08:15,515 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-22 20:08:15,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1454931152] [2021-11-22 20:08:15,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:08:15,516 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 20:08:15,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-22 20:08:15,517 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-22 20:08:15,518 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-22 20:08:16,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:08:16,143 INFO L263 TraceCheckSpWp]: Trace formula consists of 3036 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-22 20:08:16,146 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 20:08:16,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:08:16,265 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-22 20:08:16,266 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:08:16,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58352628] [2021-11-22 20:08:16,266 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-22 20:08:16,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1454931152] [2021-11-22 20:08:16,266 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1454931152] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:08:16,266 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:08:16,266 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-22 20:08:16,266 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846405812] [2021-11-22 20:08:16,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:08:16,266 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-22 20:08:16,266 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:08:16,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-22 20:08:16,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-22 20:08:16,267 INFO L87 Difference]: Start difference. First operand 432 states and 484 transitions. Second operand has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 6 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:08:16,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:08:16,332 INFO L93 Difference]: Finished difference Result 741 states and 825 transitions. [2021-11-22 20:08:16,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-22 20:08:16,333 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 6 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2021-11-22 20:08:16,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:08:16,334 INFO L225 Difference]: With dead ends: 741 [2021-11-22 20:08:16,334 INFO L226 Difference]: Without dead ends: 319 [2021-11-22 20:08:16,337 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-11-22 20:08:16,338 INFO L933 BasicCegarLoop]: 315 mSDtfsCounter, 12 mSDsluCounter, 1238 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1553 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 20:08:16,338 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 1553 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 20:08:16,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2021-11-22 20:08:16,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 319. [2021-11-22 20:08:16,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 303 states have (on average 1.155115511551155) internal successors, (350), 318 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:08:16,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 350 transitions. [2021-11-22 20:08:16,364 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 350 transitions. Word has length 109 [2021-11-22 20:08:16,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:08:16,365 INFO L470 AbstractCegarLoop]: Abstraction has 319 states and 350 transitions. [2021-11-22 20:08:16,365 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 6 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:08:16,365 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 350 transitions. [2021-11-22 20:08:16,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2021-11-22 20:08:16,365 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:08:16,380 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:08:16,405 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-11-22 20:08:16,595 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 20:08:16,595 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2021-11-22 20:08:16,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:08:16,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1377292614, now seen corresponding path program 1 times [2021-11-22 20:08:16,596 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:08:16,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818547209] [2021-11-22 20:08:16,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:08:16,596 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:08:16,649 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-22 20:08:16,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1447714155] [2021-11-22 20:08:16,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:08:16,651 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 20:08:16,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-22 20:08:16,652 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-22 20:08:16,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-11-22 20:10:58,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:10:58,264 INFO L263 TraceCheckSpWp]: Trace formula consists of 3080 conjuncts, 590 conjunts are in the unsatisfiable core [2021-11-22 20:10:58,275 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 20:10:58,287 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-22 20:10:58,523 INFO L354 Elim1Store]: treesize reduction 129, result has 17.8 percent of original size [2021-11-22 20:10:58,523 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 45 treesize of output 57 [2021-11-22 20:10:58,676 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-22 20:10:58,865 INFO L354 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2021-11-22 20:10:58,866 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 27 treesize of output 45 [2021-11-22 20:10:59,010 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2021-11-22 20:10:59,173 INFO L354 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2021-11-22 20:10:59,174 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 39 treesize of output 42 [2021-11-22 20:10:59,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:10:59,541 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-22 20:10:59,541 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:10:59,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818547209] [2021-11-22 20:10:59,541 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-22 20:10:59,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1447714155] [2021-11-22 20:10:59,541 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1447714155] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:10:59,541 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:10:59,541 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-22 20:10:59,541 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421263848] [2021-11-22 20:10:59,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:10:59,542 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-22 20:10:59,542 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:10:59,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-22 20:10:59,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2021-11-22 20:10:59,542 INFO L87 Difference]: Start difference. First operand 319 states and 350 transitions. Second operand has 11 states, 11 states have (on average 10.0) internal successors, (110), 11 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:11:00,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:11:00,019 INFO L93 Difference]: Finished difference Result 319 states and 350 transitions. [2021-11-22 20:11:00,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-22 20:11:00,019 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 10.0) internal successors, (110), 11 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2021-11-22 20:11:00,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:11:00,019 INFO L225 Difference]: With dead ends: 319 [2021-11-22 20:11:00,019 INFO L226 Difference]: Without dead ends: 0 [2021-11-22 20:11:00,020 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2021-11-22 20:11:00,020 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 35 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 23 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 20:11:00,020 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 54 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 45 Invalid, 0 Unknown, 23 Unchecked, 0.1s Time] [2021-11-22 20:11:00,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-11-22 20:11:00,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-11-22 20:11:00,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:11:00,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-11-22 20:11:00,021 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 110 [2021-11-22 20:11:00,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:11:00,021 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-11-22 20:11:00,021 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.0) internal successors, (110), 11 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:11:00,021 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-11-22 20:11:00,021 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-11-22 20:11:00,023 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (17 of 18 remaining) [2021-11-22 20:11:00,023 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (16 of 18 remaining) [2021-11-22 20:11:00,024 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (15 of 18 remaining) [2021-11-22 20:11:00,024 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (14 of 18 remaining) [2021-11-22 20:11:00,024 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (13 of 18 remaining) [2021-11-22 20:11:00,024 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (12 of 18 remaining) [2021-11-22 20:11:00,024 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (11 of 18 remaining) [2021-11-22 20:11:00,024 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (10 of 18 remaining) [2021-11-22 20:11:00,024 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (9 of 18 remaining) [2021-11-22 20:11:00,024 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION (8 of 18 remaining) [2021-11-22 20:11:00,024 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION (7 of 18 remaining) [2021-11-22 20:11:00,024 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION (6 of 18 remaining) [2021-11-22 20:11:00,024 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION (5 of 18 remaining) [2021-11-22 20:11:00,024 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION (4 of 18 remaining) [2021-11-22 20:11:00,024 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION (3 of 18 remaining) [2021-11-22 20:11:00,025 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION (2 of 18 remaining) [2021-11-22 20:11:00,025 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION (1 of 18 remaining) [2021-11-22 20:11:00,025 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION (0 of 18 remaining) [2021-11-22 20:11:00,121 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-11-22 20:11:00,242 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 20:11:00,244 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-11-22 20:11:06,051 INFO L861 garLoopResultBuilder]: At program point L10143(line 10143) the Hoare annotation is: true [2021-11-22 20:11:06,051 INFO L858 garLoopResultBuilder]: For program point L9086(lines 9086 9091) no Hoare annotation was computed. [2021-11-22 20:11:06,051 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-22 20:11:06,051 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-22 20:11:06,051 INFO L854 garLoopResultBuilder]: At program point L6843(lines 6837 6844) the Hoare annotation is: false [2021-11-22 20:11:06,051 INFO L858 garLoopResultBuilder]: For program point L9354(lines 9354 9357) no Hoare annotation was computed. [2021-11-22 20:11:06,051 INFO L854 garLoopResultBuilder]: At program point L238(line 238) the Hoare annotation is: false [2021-11-22 20:11:06,051 INFO L854 garLoopResultBuilder]: At program point L238-1(line 238) the Hoare annotation is: false [2021-11-22 20:11:06,051 INFO L854 garLoopResultBuilder]: At program point L238-2(line 238) the Hoare annotation is: false [2021-11-22 20:11:06,051 INFO L854 garLoopResultBuilder]: At program point L238-3(line 238) the Hoare annotation is: false [2021-11-22 20:11:06,052 INFO L854 garLoopResultBuilder]: At program point L7373(lines 7369 7374) the Hoare annotation is: false [2021-11-22 20:11:06,052 INFO L854 garLoopResultBuilder]: At program point L238-4(line 238) the Hoare annotation is: false [2021-11-22 20:11:06,052 INFO L854 garLoopResultBuilder]: At program point L238-5(line 238) the Hoare annotation is: false [2021-11-22 20:11:06,052 INFO L854 garLoopResultBuilder]: At program point L238-6(line 238) the Hoare annotation is: false [2021-11-22 20:11:06,052 INFO L854 garLoopResultBuilder]: At program point L2617-1(lines 2613 2621) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base|) |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.offset|))) (and (<= (+ |ULTIMATE.start_aws_raise_error_#res#1| 1) 0) (not (= |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base| 0)) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset| |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.offset|) (= |ULTIMATE.start_aws_hash_table_is_valid_~map#1.offset| |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.offset|) (<= (+ |ULTIMATE.start_aws_add_u64_checked_#res#1| 1) 0) (= (select |#valid| |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base|) 1) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base| |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base|) (exists ((|ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base| Int) (|ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base| Int)) (and (not (= |ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base| |ULTIMATE.start_save_byte_from_hash_table_~#size_in_bytes~0#1.base|)) (not (= |ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base| |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base|)) (not (= |ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base| |ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base|)) (= (select |#valid| |ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base|) 1) (not (= |ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|)) (not (= |ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base| |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base|)) (not (= |ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|)) (= (select |#valid| |ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base|) 1) (not (= |ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base| |ULTIMATE.start_save_byte_from_hash_table_~#size_in_bytes~0#1.base|)))) (or (not (= |ULTIMATE.start_hash_table_state_is_valid_~map#1.offset| 0)) (not (= |ULTIMATE.start_hash_table_state_is_valid_~map#1.base| 0))) (< (+ .cse0 1) |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base|) (not (= |ULTIMATE.start_save_byte_from_hash_table_~storage#1.base| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|)) (= |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.offset| 0) (not (= |ULTIMATE.start_save_byte_from_hash_table_~#size_in_bytes~0#1.base| |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base|)) (not (= |ULTIMATE.start_bounded_malloc_#res#1.base| 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base|) (not (= .cse0 0)) (not (= |ULTIMATE.start_save_byte_from_hash_table_~#size_in_bytes~0#1.base| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|)) (<= (+ |ULTIMATE.start_aws_add_size_checked_#res#1| 1) 0) (= (select |#valid| |ULTIMATE.start_save_byte_from_hash_table_~#size_in_bytes~0#1.base|) 1) (not (= |ULTIMATE.start_save_byte_from_hash_table_~storage#1.base| |ULTIMATE.start_save_byte_from_hash_table_~#size_in_bytes~0#1.base|)) (= (select |#valid| |ULTIMATE.start_save_byte_from_hash_table_~storage#1.base|) 1) (= |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base| |ULTIMATE.start_aws_hash_table_is_valid_~map#1.base|) (not (= |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|)))) [2021-11-22 20:11:06,052 INFO L854 garLoopResultBuilder]: At program point L2617(lines 2613 2621) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset| |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.offset|)) (.cse1 (< |#StackHeapBarrier| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base|)) (.cse2 (not (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base| |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base|))) (.cse3 (= (select |#valid| |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base|) 1)) (.cse4 (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base| |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base|)) (.cse5 (not (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|))) (.cse6 (= |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.offset| 0)) (.cse7 (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base| |ULTIMATE.start_hash_table_state_required_bytes_~required_bytes#1.base|)) (.cse8 (= (select |#valid| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|) 1)) (.cse9 (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base|)) (.cse10 (= (select |#valid| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base|) 1)) (.cse11 (<= (mod |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1| 18446744073709551616) 8)) (.cse12 (< 0 |#StackHeapBarrier|)) (.cse13 (not (= |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|))) (.cse14 (exists ((|v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0#1.base_19| Int)) (= (select |#valid| |v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0#1.base_19|) 0))) (.cse15 (= |ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries#1| 8))) (or (and (<= (+ |ULTIMATE.start_aws_raise_error_#res#1| 1) 0) .cse0 .cse1 .cse2 (<= (+ |ULTIMATE.start_aws_add_u64_checked_#res#1| 1) 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= (+ |ULTIMATE.start_aws_add_size_checked_#res#1| 1) 0) .cse11 .cse12 .cse13 .cse14 .cse15) (let ((.cse16 (select |#memory_int| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|))) (let ((.cse17 (select .cse16 0))) (and (= |ULTIMATE.start_aws_mul_u64_checked_~b#1| 24) (= |ULTIMATE.start_hash_table_state_required_bytes_~required_bytes#1.offset| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.offset|) (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.offset| |ULTIMATE.start_aws_add_u64_checked_~r#1.offset|) (= |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.offset| 0) .cse0 .cse1 .cse2 (= |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1| |ULTIMATE.start_aws_mul_u64_checked_~a#1|) (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base| |ULTIMATE.start_aws_add_u64_checked_~r#1.base|) (= |ULTIMATE.start_aws_mul_u64_checked_~r#1.base| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|) .cse3 .cse4 (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.offset| 0) (= |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.offset| |ULTIMATE.start_aws_mul_u64_checked_~r#1.offset|) .cse5 .cse6 .cse7 .cse8 .cse9 (= (* 24 |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1|) (select .cse16 |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.offset|)) (= (+ 29629528 (select (select |#memory_int| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base|) |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.offset|)) .cse17) (= |ULTIMATE.start_aws_add_u64_checked_~a#1| .cse17) .cse10 .cse11 (= (+ |ULTIMATE.start_aws_add_u64_checked_~b#1| 29629528) 0) .cse12 .cse13 .cse14 .cse15))))) [2021-11-22 20:11:06,052 INFO L854 garLoopResultBuilder]: At program point L239(line 239) the Hoare annotation is: false [2021-11-22 20:11:06,053 INFO L854 garLoopResultBuilder]: At program point L239-1(line 239) the Hoare annotation is: false [2021-11-22 20:11:06,053 INFO L854 garLoopResultBuilder]: At program point L239-2(line 239) the Hoare annotation is: false [2021-11-22 20:11:06,053 INFO L854 garLoopResultBuilder]: At program point L239-3(line 239) the Hoare annotation is: false [2021-11-22 20:11:06,053 INFO L854 garLoopResultBuilder]: At program point L239-4(line 239) the Hoare annotation is: false [2021-11-22 20:11:06,053 INFO L854 garLoopResultBuilder]: At program point L239-5(line 239) the Hoare annotation is: false [2021-11-22 20:11:06,053 INFO L858 garLoopResultBuilder]: For program point L9094(lines 9094 9096) no Hoare annotation was computed. [2021-11-22 20:11:06,053 INFO L858 garLoopResultBuilder]: For program point L9359-2(lines 9359 9362) no Hoare annotation was computed. [2021-11-22 20:11:06,053 INFO L858 garLoopResultBuilder]: For program point L9359(line 9359) no Hoare annotation was computed. [2021-11-22 20:11:06,053 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-22 20:11:06,053 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-22 20:11:06,054 INFO L858 garLoopResultBuilder]: For program point L9097-1(lines 9082 9098) no Hoare annotation was computed. [2021-11-22 20:11:06,054 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-22 20:11:06,054 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-22 20:11:06,054 INFO L854 garLoopResultBuilder]: At program point L250(lines 248 251) the Hoare annotation is: (let ((.cse0 (select |#memory_int| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|))) (and (= |ULTIMATE.start_aws_mul_u64_checked_~b#1| 24) (= |ULTIMATE.start_hash_table_state_required_bytes_~required_bytes#1.offset| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.offset|) (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.offset| |ULTIMATE.start_aws_add_u64_checked_~r#1.offset|) (= |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.offset| 0) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset| |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.offset|) (< |#StackHeapBarrier| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base|) (not (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base| |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base|)) (= |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1| |ULTIMATE.start_aws_mul_u64_checked_~a#1|) (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base| |ULTIMATE.start_aws_add_u64_checked_~r#1.base|) (= |ULTIMATE.start_aws_mul_u64_checked_~r#1.base| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|) (= (select |#valid| |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base|) 1) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base| |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base|) (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.offset| 0) (= |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.offset| |ULTIMATE.start_aws_mul_u64_checked_~r#1.offset|) (not (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|)) (= |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.offset| 0) (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base| |ULTIMATE.start_hash_table_state_required_bytes_~required_bytes#1.base|) (= (select |#valid| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base|) (= (* 24 |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1|) (select .cse0 |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.offset|)) (= |ULTIMATE.start_aws_add_u64_checked_~a#1| (select .cse0 0)) (= (select |#valid| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base|) 1) (<= (mod |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1| 18446744073709551616) 8) (= (+ |ULTIMATE.start_aws_add_u64_checked_~b#1| 29629528) 0) (< 0 |#StackHeapBarrier|) (not (= |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|)) (exists ((|v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0#1.base_19| Int)) (= (select |#valid| |v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0#1.base_19|) 0)) (= |ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries#1| 8))) [2021-11-22 20:11:06,054 INFO L854 garLoopResultBuilder]: At program point L250-1(lines 248 251) the Hoare annotation is: false [2021-11-22 20:11:06,054 INFO L858 garLoopResultBuilder]: For program point L7385-3(lines 7385 7387) no Hoare annotation was computed. [2021-11-22 20:11:06,054 INFO L858 garLoopResultBuilder]: For program point L7385-2(lines 7385 7387) no Hoare annotation was computed. [2021-11-22 20:11:06,054 INFO L858 garLoopResultBuilder]: For program point L7385-1(lines 7385 7387) no Hoare annotation was computed. [2021-11-22 20:11:06,054 INFO L858 garLoopResultBuilder]: For program point L7385(lines 7385 7387) no Hoare annotation was computed. [2021-11-22 20:11:06,055 INFO L854 garLoopResultBuilder]: At program point L2630(lines 2626 2631) the Hoare annotation is: (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset| |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.offset|) (= (select |#valid| |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base|) 1) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base| |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base|) (= |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.offset| 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base|) (<= (mod |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1| 18446744073709551616) 8) (< 0 |#StackHeapBarrier|) (= |ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries#1| 8)) [2021-11-22 20:11:06,055 INFO L854 garLoopResultBuilder]: At program point L2630-2(lines 2626 2631) the Hoare annotation is: false [2021-11-22 20:11:06,055 INFO L854 garLoopResultBuilder]: At program point L2630-1(lines 2626 2631) the Hoare annotation is: false [2021-11-22 20:11:06,055 INFO L858 garLoopResultBuilder]: For program point L2498(lines 2498 2499) no Hoare annotation was computed. [2021-11-22 20:11:06,055 INFO L854 garLoopResultBuilder]: At program point L2630-4(lines 2626 2631) the Hoare annotation is: false [2021-11-22 20:11:06,055 INFO L854 garLoopResultBuilder]: At program point L2630-3(lines 2626 2631) the Hoare annotation is: false [2021-11-22 20:11:06,055 INFO L854 garLoopResultBuilder]: At program point L2630-6(lines 2626 2631) the Hoare annotation is: false [2021-11-22 20:11:06,055 INFO L858 garLoopResultBuilder]: For program point L2498-1(lines 2498 2499) no Hoare annotation was computed. [2021-11-22 20:11:06,055 INFO L854 garLoopResultBuilder]: At program point L2630-5(lines 2626 2631) the Hoare annotation is: false [2021-11-22 20:11:06,055 INFO L854 garLoopResultBuilder]: At program point L2630-8(lines 2626 2631) the Hoare annotation is: false [2021-11-22 20:11:06,055 INFO L854 garLoopResultBuilder]: At program point L2630-7(lines 2626 2631) the Hoare annotation is: false [2021-11-22 20:11:06,055 INFO L854 garLoopResultBuilder]: At program point L2630-10(lines 2626 2631) the Hoare annotation is: false [2021-11-22 20:11:06,055 INFO L854 garLoopResultBuilder]: At program point L2630-9(lines 2626 2631) the Hoare annotation is: false [2021-11-22 20:11:06,055 INFO L858 garLoopResultBuilder]: For program point L9370(lines 9370 9378) no Hoare annotation was computed. [2021-11-22 20:11:06,055 INFO L858 garLoopResultBuilder]: For program point L9107(lines 9107 9111) no Hoare annotation was computed. [2021-11-22 20:11:06,055 INFO L858 garLoopResultBuilder]: For program point L9107-1(lines 9107 9111) no Hoare annotation was computed. [2021-11-22 20:11:06,055 INFO L854 garLoopResultBuilder]: At program point L2501-1(lines 2497 2502) the Hoare annotation is: (let ((.cse1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base|) |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.offset|))) (let ((.cse2 (+ .cse1 1)) (.cse3 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base|) |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.offset|))) (and (<= (+ |ULTIMATE.start_aws_raise_error_#res#1| 1) 0) (= |ULTIMATE.start_aws_mul_u64_checked_~b#1| 24) (let ((.cse0 (select (select |#memory_int| .cse1) 40))) (<= (div (+ (* .cse0 (- 1)) 8) (- 18446744073709551616)) (div .cse0 18446744073709551616))) (< .cse2 |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|) (= |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.offset| 0) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset| |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.offset|) (= |ULTIMATE.start_hash_table_state_is_valid_~map#1.base| .cse1) (= |ULTIMATE.start_aws_hash_table_is_valid_~map#1.offset| |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.offset|) (< .cse1 |#StackHeapBarrier|) (= .cse3 0) (= .cse3 |ULTIMATE.start_hash_table_state_is_valid_~map#1.offset|) (= |ULTIMATE.start_aws_mul_u64_checked_~r#1.base| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|) (not (= |ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base| |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base|)) (let ((.cse8 (+ |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base| 1)) (.cse7 (+ |ULTIMATE.start_save_byte_from_hash_table_~#size_in_bytes~0#1.base| 1))) (let ((.cse5 (< |ULTIMATE.start_save_byte_from_hash_table_~#size_in_bytes~0#1.base| |ULTIMATE.start_save_byte_from_hash_table_~storage#1.base|)) (.cse6 (< .cse7 |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base|)) (.cse4 (< .cse8 |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base|))) (or (and .cse4 .cse5 .cse6) (and .cse5 (< .cse7 |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|) .cse6) (and .cse4 (< .cse8 |ULTIMATE.start_save_byte_from_hash_table_~#size_in_bytes~0#1.base|) (< |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base| |ULTIMATE.start_save_byte_from_hash_table_~storage#1.base|)) (let ((.cse9 (+ 2 .cse1))) (and (< .cse9 |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|) (< .cse9 |ULTIMATE.start_save_byte_from_hash_table_~#size_in_bytes~0#1.base|) (< 2 |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|) (< .cse9 |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base|) (< 2 |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base|) (< .cse2 |ULTIMATE.start_save_byte_from_hash_table_~storage#1.base|) (< 1 |ULTIMATE.start_save_byte_from_hash_table_~storage#1.base|) (< 2 |ULTIMATE.start_save_byte_from_hash_table_~#size_in_bytes~0#1.base|))) (< |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base| |ULTIMATE.start_save_byte_from_hash_table_~storage#1.base|)))) (= (select |#valid| |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base|) 1) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base| |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base|) (exists ((|v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_63| Int)) (and (not (= |v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_63| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|)) (= (select |#valid| |v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_63|) 0))) (= (select |#valid| .cse1) 1) (= |ULTIMATE.start_save_byte_from_hash_table_~state~0#1.base| .cse1) (exists ((|ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base| Int) (|ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base| Int)) (and (not (= |ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base| |ULTIMATE.start_save_byte_from_hash_table_~#size_in_bytes~0#1.base|)) (not (= |ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base| |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base|)) (not (= |ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base| |ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base|)) (= (select |#valid| |ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base|) 1) (not (= |ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|)) (not (= |ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base| |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base|)) (not (= |ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|)) (= (select |#valid| |ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base|) 1) (not (= |ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base| |ULTIMATE.start_save_byte_from_hash_table_~#size_in_bytes~0#1.base|)))) (= |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.offset| |ULTIMATE.start_aws_mul_u64_checked_~r#1.offset|) (= (select (select |#memory_int| |ULTIMATE.start_save_byte_from_hash_table_~state~0#1.base|) (+ 40 |ULTIMATE.start_save_byte_from_hash_table_~state~0#1.offset|)) |ULTIMATE.start_aws_mul_u64_checked_~a#1|) (not (= |ULTIMATE.start_save_byte_from_hash_table_~storage#1.base| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|)) (= |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.offset| 0) (<= (+ |ULTIMATE.start_aws_mul_u64_checked_#res#1| 1) 0) (< 1 |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|) (not (= |ULTIMATE.start_save_byte_from_hash_table_~#size_in_bytes~0#1.base| |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base|)) (= |ULTIMATE.start_hash_table_state_required_bytes_~required_bytes#1.base| |ULTIMATE.start_save_byte_from_hash_table_~#size_in_bytes~0#1.base|) (< .cse2 |ULTIMATE.start_save_byte_from_hash_table_~#size_in_bytes~0#1.base|) (not (= |ULTIMATE.start_bounded_malloc_#res#1.base| 0)) (= .cse3 |ULTIMATE.start_save_byte_from_hash_table_~state~0#1.offset|) (= |ULTIMATE.start_save_byte_from_hash_table_~#size_in_bytes~0#1.offset| 0) (not (= .cse1 0)) (not (= |ULTIMATE.start_save_byte_from_hash_table_~#size_in_bytes~0#1.base| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|)) (= (select |#valid| |ULTIMATE.start_save_byte_from_hash_table_~#size_in_bytes~0#1.base|) 1) (not (= |ULTIMATE.start_save_byte_from_hash_table_~storage#1.base| |ULTIMATE.start_save_byte_from_hash_table_~#size_in_bytes~0#1.base|)) (<= (mod |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1| 18446744073709551616) 8) (= (select |#valid| |ULTIMATE.start_save_byte_from_hash_table_~storage#1.base|) 1) (= |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base| |ULTIMATE.start_aws_hash_table_is_valid_~map#1.base|) (= |ULTIMATE.start_save_byte_from_hash_table_~#size_in_bytes~0#1.offset| |ULTIMATE.start_hash_table_state_required_bytes_~required_bytes#1.offset|) (< 0 |#StackHeapBarrier|) (not (= |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|)) (< 1 |ULTIMATE.start_save_byte_from_hash_table_~#size_in_bytes~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base|)))) [2021-11-22 20:11:06,055 INFO L854 garLoopResultBuilder]: At program point L2501(lines 2497 2502) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset| |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.offset|)) (.cse1 (< |#StackHeapBarrier| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base|)) (.cse2 (exists ((|v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_62| Int)) (= (select |#valid| |v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_62|) 0))) (.cse3 (not (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base| |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base|))) (.cse4 (= (select |#valid| |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base|) 1)) (.cse5 (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base| |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base|)) (.cse6 (not (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|))) (.cse7 (= |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.offset| 0)) (.cse8 (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base| |ULTIMATE.start_hash_table_state_required_bytes_~required_bytes#1.base|)) (.cse9 (= (select |#valid| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|) 1)) (.cse10 (= (select |#valid| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base|) 1)) (.cse11 (<= (mod |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1| 18446744073709551616) 8)) (.cse12 (< 0 |#StackHeapBarrier|)) (.cse13 (not (= |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|))) (.cse14 (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base|)) (.cse15 (= |ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries#1| 8))) (or (and (<= (+ |ULTIMATE.start_aws_raise_error_#res#1| 1) 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= (+ |ULTIMATE.start_aws_mul_u64_checked_#res#1| 1) 0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and (= |ULTIMATE.start_aws_mul_u64_checked_~b#1| 24) (= |ULTIMATE.start_hash_table_state_required_bytes_~required_bytes#1.offset| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.offset|) (= |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.offset| 0) .cse0 .cse1 .cse2 .cse3 (= |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1| |ULTIMATE.start_aws_mul_u64_checked_~a#1|) (= |ULTIMATE.start_aws_mul_u64_checked_~r#1.base| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|) .cse4 .cse5 (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.offset| 0) (= |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.offset| |ULTIMATE.start_aws_mul_u64_checked_~r#1.offset|) .cse6 .cse7 .cse8 .cse9 (= (* 24 |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1|) (select (select |#memory_int| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|) |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.offset|)) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2021-11-22 20:11:06,056 INFO L854 garLoopResultBuilder]: At program point L255(lines 253 256) the Hoare annotation is: (and (= |ULTIMATE.start_aws_mul_u64_checked_~b#1| 24) (= |ULTIMATE.start_hash_table_state_required_bytes_~required_bytes#1.offset| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.offset|) (= |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.offset| 0) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset| |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.offset|) (< |#StackHeapBarrier| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base|) (exists ((|v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_62| Int)) (= (select |#valid| |v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_62|) 0)) (not (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base| |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base|)) (= |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1| |ULTIMATE.start_aws_mul_u64_checked_~a#1|) (= |ULTIMATE.start_aws_mul_u64_checked_~r#1.base| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|) (= (select |#valid| |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base|) 1) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base| |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base|) (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.offset| 0) (= |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.offset| |ULTIMATE.start_aws_mul_u64_checked_~r#1.offset|) (not (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|)) (= |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.offset| 0) (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base| |ULTIMATE.start_hash_table_state_required_bytes_~required_bytes#1.base|) (= (select |#valid| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base|) (= (select |#valid| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base|) 1) (<= (mod |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1| 18446744073709551616) 8) (< 0 |#StackHeapBarrier|) (not (= |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|)) (= |ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries#1| 8)) [2021-11-22 20:11:06,056 INFO L854 garLoopResultBuilder]: At program point L255-1(lines 253 256) the Hoare annotation is: false [2021-11-22 20:11:06,056 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-11-22 20:11:06,056 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-22 20:11:06,056 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-22 20:11:06,056 INFO L858 garLoopResultBuilder]: For program point L7195(lines 7195 7201) no Hoare annotation was computed. [2021-11-22 20:11:06,056 INFO L858 garLoopResultBuilder]: For program point L7196(lines 7196 7200) no Hoare annotation was computed. [2021-11-22 20:11:06,056 INFO L858 garLoopResultBuilder]: For program point L9311(lines 9311 9317) no Hoare annotation was computed. [2021-11-22 20:11:06,056 INFO L858 garLoopResultBuilder]: For program point L9113(lines 9113 9121) no Hoare annotation was computed. [2021-11-22 20:11:06,056 INFO L858 garLoopResultBuilder]: For program point L10104(lines 10104 10106) no Hoare annotation was computed. [2021-11-22 20:11:06,056 INFO L858 garLoopResultBuilder]: For program point L9113-1(lines 9113 9121) no Hoare annotation was computed. [2021-11-22 20:11:06,056 INFO L858 garLoopResultBuilder]: For program point L10104-1(lines 10104 10106) no Hoare annotation was computed. [2021-11-22 20:11:06,056 INFO L858 garLoopResultBuilder]: For program point L9312(lines 9312 9314) no Hoare annotation was computed. [2021-11-22 20:11:06,056 INFO L858 garLoopResultBuilder]: For program point L9312-2(lines 9312 9314) no Hoare annotation was computed. [2021-11-22 20:11:06,056 INFO L854 garLoopResultBuilder]: At program point L262(line 262) the Hoare annotation is: false [2021-11-22 20:11:06,056 INFO L854 garLoopResultBuilder]: At program point L262-1(line 262) the Hoare annotation is: false [2021-11-22 20:11:06,056 INFO L854 garLoopResultBuilder]: At program point L263(line 263) the Hoare annotation is: false [2021-11-22 20:11:06,056 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-11-22 20:11:06,056 INFO L854 garLoopResultBuilder]: At program point L-1-1(line -1) the Hoare annotation is: false [2021-11-22 20:11:06,056 INFO L858 garLoopResultBuilder]: For program point L-1-2(line -1) no Hoare annotation was computed. [2021-11-22 20:11:06,056 INFO L858 garLoopResultBuilder]: For program point L-1-4(line -1) no Hoare annotation was computed. [2021-11-22 20:11:06,056 INFO L854 garLoopResultBuilder]: At program point L-1-5(line -1) the Hoare annotation is: false [2021-11-22 20:11:06,056 INFO L858 garLoopResultBuilder]: For program point L-1-6(line -1) no Hoare annotation was computed. [2021-11-22 20:11:06,056 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-22 20:11:06,056 INFO L858 garLoopResultBuilder]: For program point L-1-8(line -1) no Hoare annotation was computed. [2021-11-22 20:11:06,056 INFO L854 garLoopResultBuilder]: At program point L-1-9(line -1) the Hoare annotation is: false [2021-11-22 20:11:06,056 INFO L858 garLoopResultBuilder]: For program point L7267(lines 7267 7272) no Hoare annotation was computed. [2021-11-22 20:11:06,057 INFO L858 garLoopResultBuilder]: For program point L10108(lines 10108 10110) no Hoare annotation was computed. [2021-11-22 20:11:06,057 INFO L858 garLoopResultBuilder]: For program point L10108-1(lines 10108 10110) no Hoare annotation was computed. [2021-11-22 20:11:06,057 INFO L854 garLoopResultBuilder]: At program point L266(line 266) the Hoare annotation is: (and (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset| |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.offset|) (= (select |#valid| |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base|) 1) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base| |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base|) (= |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.offset| 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base|) (< 0 |#StackHeapBarrier|) (= |ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries#1| 8)) [2021-11-22 20:11:06,057 INFO L854 garLoopResultBuilder]: At program point L266-1(line 266) the Hoare annotation is: false [2021-11-22 20:11:06,057 INFO L854 garLoopResultBuilder]: At program point L10044(lines 9999 10046) the Hoare annotation is: false [2021-11-22 20:11:06,057 INFO L854 garLoopResultBuilder]: At program point L10044-1(lines 9999 10046) the Hoare annotation is: false [2021-11-22 20:11:06,057 INFO L854 garLoopResultBuilder]: At program point L10044-2(lines 9999 10046) the Hoare annotation is: false [2021-11-22 20:11:06,057 INFO L854 garLoopResultBuilder]: At program point L10044-7(lines 9999 10046) the Hoare annotation is: false [2021-11-22 20:11:06,057 INFO L854 garLoopResultBuilder]: At program point L10044-8(lines 9999 10046) the Hoare annotation is: false [2021-11-22 20:11:06,057 INFO L854 garLoopResultBuilder]: At program point L10044-9(lines 9999 10046) the Hoare annotation is: false [2021-11-22 20:11:06,057 INFO L854 garLoopResultBuilder]: At program point L10044-3(lines 9999 10046) the Hoare annotation is: (and (not (= |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base| 0)) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset| |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.offset|) (= |ULTIMATE.start_hash_table_state_is_valid_#res#1| 0) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base| |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base|) (not (= |ULTIMATE.start_bounded_malloc_#res#1.base| 0))) [2021-11-22 20:11:06,057 INFO L854 garLoopResultBuilder]: At program point L10044-4(lines 9999 10046) the Hoare annotation is: (and (not (= |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base| 0)) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset| |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.offset|) (= |ULTIMATE.start_hash_table_state_is_valid_#res#1| 0) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base| |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base|) (not (= |ULTIMATE.start_bounded_malloc_#res#1.base| 0))) [2021-11-22 20:11:06,057 INFO L854 garLoopResultBuilder]: At program point L10044-5(lines 9999 10046) the Hoare annotation is: false [2021-11-22 20:11:06,057 INFO L854 garLoopResultBuilder]: At program point L10044-6(lines 9999 10046) the Hoare annotation is: (and (not (= |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base| 0)) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset| |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.offset|) (= |ULTIMATE.start_hash_table_state_is_valid_#res#1| 0) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base| |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base|) (not (= |ULTIMATE.start_bounded_malloc_#res#1.base| 0))) [2021-11-22 20:11:06,057 INFO L858 garLoopResultBuilder]: For program point L9384(lines 9384 9386) no Hoare annotation was computed. [2021-11-22 20:11:06,057 INFO L858 garLoopResultBuilder]: For program point L9384-2(lines 9384 9386) no Hoare annotation was computed. [2021-11-22 20:11:06,058 INFO L858 garLoopResultBuilder]: For program point L9319-2(lines 9319 9325) no Hoare annotation was computed. [2021-11-22 20:11:06,058 INFO L858 garLoopResultBuilder]: For program point L9319(line 9319) no Hoare annotation was computed. [2021-11-22 20:11:06,058 INFO L854 garLoopResultBuilder]: At program point L10112(lines 10101 10113) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset| |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.offset|)) (.cse1 (not (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base| |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base|))) (.cse2 (= (select |#valid| |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base|) 1)) (.cse3 (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base| |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base|)) (.cse4 (= |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.offset| 0))) (or (and (not (= |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base| 0)) .cse0 .cse1 .cse2 .cse3 .cse4 (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base|) (<= (+ |ULTIMATE.start_hash_table_state_required_bytes_#res#1| 1) 0)) (and .cse0 (< |#StackHeapBarrier| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base|) .cse1 .cse2 .cse3 (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.offset| 0) .cse4 (exists ((|v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base_24| Int)) (and (not (= |v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base_24| |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base|)) (= (+ 29629528 (select (select |#memory_int| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base|) |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.offset|)) (select (select |#memory_int| |v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base_24|) 0)))) (= (* 24 |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1|) (+ 29629528 (select (select |#memory_int| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base|) |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.offset|))) (= (select |#valid| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base|) 1) (<= (mod |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1| 18446744073709551616) 8) (< 0 |#StackHeapBarrier|) (exists ((|v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0#1.base_19| Int)) (= (select |#valid| |v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0#1.base_19|) 0)) (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base|) (= |ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries#1| 8)))) [2021-11-22 20:11:06,058 INFO L854 garLoopResultBuilder]: At program point L10112-1(lines 10101 10113) the Hoare annotation is: (and (not (= |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base| 0)) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset| |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.offset|) (= |ULTIMATE.start_aws_hash_table_is_valid_~map#1.offset| |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.offset|) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base| |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base|) (or (not (= |ULTIMATE.start_hash_table_state_is_valid_~map#1.offset| 0)) (not (= |ULTIMATE.start_hash_table_state_is_valid_~map#1.base| 0))) (not (= |ULTIMATE.start_bounded_malloc_#res#1.base| 0)) (= |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base| |ULTIMATE.start_aws_hash_table_is_valid_~map#1.base|) (<= (+ |ULTIMATE.start_hash_table_state_required_bytes_#res#1| 1) 0)) [2021-11-22 20:11:06,058 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-22 20:11:06,058 INFO L858 garLoopResultBuilder]: For program point L6809(lines 6809 6819) no Hoare annotation was computed. [2021-11-22 20:11:06,058 INFO L858 garLoopResultBuilder]: For program point L9320(lines 9320 9322) no Hoare annotation was computed. [2021-11-22 20:11:06,058 INFO L858 garLoopResultBuilder]: For program point L9320-2(lines 9320 9322) no Hoare annotation was computed. [2021-11-22 20:11:06,058 INFO L854 garLoopResultBuilder]: At program point L9123(lines 9103 9124) the Hoare annotation is: false [2021-11-22 20:11:06,058 INFO L854 garLoopResultBuilder]: At program point L9123-1(lines 9103 9124) the Hoare annotation is: false [2021-11-22 20:11:06,058 INFO L858 garLoopResultBuilder]: For program point L10114(lines 10114 10142) no Hoare annotation was computed. [2021-11-22 20:11:06,058 INFO L854 garLoopResultBuilder]: At program point L9388(lines 9330 9389) the Hoare annotation is: false [2021-11-22 20:11:06,058 INFO L858 garLoopResultBuilder]: For program point L7274(lines 7274 7278) no Hoare annotation was computed. [2021-11-22 20:11:06,058 INFO L858 garLoopResultBuilder]: For program point L7341-3(lines 7341 7343) no Hoare annotation was computed. [2021-11-22 20:11:06,058 INFO L858 garLoopResultBuilder]: For program point L7341-2(lines 7341 7343) no Hoare annotation was computed. [2021-11-22 20:11:06,058 INFO L858 garLoopResultBuilder]: For program point L7341(lines 7341 7343) no Hoare annotation was computed. [2021-11-22 20:11:06,058 INFO L858 garLoopResultBuilder]: For program point L7341-6(lines 7341 7343) no Hoare annotation was computed. [2021-11-22 20:11:06,058 INFO L858 garLoopResultBuilder]: For program point L7341-5(lines 7341 7343) no Hoare annotation was computed. [2021-11-22 20:11:06,058 INFO L858 garLoopResultBuilder]: For program point L7341-8(lines 7341 7343) no Hoare annotation was computed. [2021-11-22 20:11:06,058 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-22 20:11:06,058 INFO L854 garLoopResultBuilder]: At program point L9391(lines 9391 9411) the Hoare annotation is: false [2021-11-22 20:11:06,058 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-22 20:11:06,058 INFO L854 garLoopResultBuilder]: At program point L6947(lines 6943 6948) the Hoare annotation is: false [2021-11-22 20:11:06,058 INFO L854 garLoopResultBuilder]: At program point L7344-2(lines 7331 7345) the Hoare annotation is: false [2021-11-22 20:11:06,059 INFO L854 garLoopResultBuilder]: At program point L7344-1(lines 7331 7345) the Hoare annotation is: false [2021-11-22 20:11:06,059 INFO L854 garLoopResultBuilder]: At program point L7344(lines 7331 7345) the Hoare annotation is: false [2021-11-22 20:11:06,059 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-22 20:11:06,059 INFO L858 garLoopResultBuilder]: For program point L210(lines 210 212) no Hoare annotation was computed. [2021-11-22 20:11:06,059 INFO L858 garLoopResultBuilder]: For program point L210-1(lines 210 212) no Hoare annotation was computed. [2021-11-22 20:11:06,059 INFO L858 garLoopResultBuilder]: For program point L210-2(lines 210 212) no Hoare annotation was computed. [2021-11-22 20:11:06,059 INFO L858 garLoopResultBuilder]: For program point L210-3(lines 210 212) no Hoare annotation was computed. [2021-11-22 20:11:06,059 INFO L858 garLoopResultBuilder]: For program point L210-4(lines 210 212) no Hoare annotation was computed. [2021-11-22 20:11:06,059 INFO L858 garLoopResultBuilder]: For program point L210-5(lines 210 212) no Hoare annotation was computed. [2021-11-22 20:11:06,059 INFO L858 garLoopResultBuilder]: For program point L210-6(lines 210 212) no Hoare annotation was computed. [2021-11-22 20:11:06,060 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-22 20:11:06,060 INFO L858 garLoopResultBuilder]: For program point L210-7(lines 210 212) no Hoare annotation was computed. [2021-11-22 20:11:06,060 INFO L854 garLoopResultBuilder]: At program point L9327(lines 9303 9328) the Hoare annotation is: false [2021-11-22 20:11:06,060 INFO L858 garLoopResultBuilder]: For program point L210-8(lines 210 212) no Hoare annotation was computed. [2021-11-22 20:11:06,060 INFO L858 garLoopResultBuilder]: For program point L210-9(lines 210 212) no Hoare annotation was computed. [2021-11-22 20:11:06,060 INFO L858 garLoopResultBuilder]: For program point L210-10(lines 210 212) no Hoare annotation was computed. [2021-11-22 20:11:06,060 INFO L858 garLoopResultBuilder]: For program point L210-11(lines 210 212) no Hoare annotation was computed. [2021-11-22 20:11:06,060 INFO L858 garLoopResultBuilder]: For program point L210-12(lines 210 212) no Hoare annotation was computed. [2021-11-22 20:11:06,060 INFO L858 garLoopResultBuilder]: For program point L210-13(lines 210 212) no Hoare annotation was computed. [2021-11-22 20:11:06,060 INFO L854 garLoopResultBuilder]: At program point L9129(lines 9129 9137) the Hoare annotation is: false [2021-11-22 20:11:06,060 INFO L858 garLoopResultBuilder]: For program point L210-14(lines 210 212) no Hoare annotation was computed. [2021-11-22 20:11:06,061 INFO L854 garLoopResultBuilder]: At program point L9129-1(lines 9129 9137) the Hoare annotation is: false [2021-11-22 20:11:06,061 INFO L858 garLoopResultBuilder]: For program point L210-15(lines 210 212) no Hoare annotation was computed. [2021-11-22 20:11:06,061 INFO L858 garLoopResultBuilder]: For program point L210-16(lines 210 212) no Hoare annotation was computed. [2021-11-22 20:11:06,061 INFO L858 garLoopResultBuilder]: For program point L210-17(lines 210 212) no Hoare annotation was computed. [2021-11-22 20:11:06,061 INFO L858 garLoopResultBuilder]: For program point L210-18(lines 210 212) no Hoare annotation was computed. [2021-11-22 20:11:06,061 INFO L858 garLoopResultBuilder]: For program point L210-19(lines 210 212) no Hoare annotation was computed. [2021-11-22 20:11:06,061 INFO L858 garLoopResultBuilder]: For program point L210-20(lines 210 212) no Hoare annotation was computed. [2021-11-22 20:11:06,061 INFO L858 garLoopResultBuilder]: For program point L210-21(lines 210 212) no Hoare annotation was computed. [2021-11-22 20:11:06,061 INFO L858 garLoopResultBuilder]: For program point L210-22(lines 210 212) no Hoare annotation was computed. [2021-11-22 20:11:06,061 INFO L858 garLoopResultBuilder]: For program point L210-23(lines 210 212) no Hoare annotation was computed. [2021-11-22 20:11:06,062 INFO L858 garLoopResultBuilder]: For program point L210-24(lines 210 212) no Hoare annotation was computed. [2021-11-22 20:11:06,062 INFO L858 garLoopResultBuilder]: For program point L210-25(lines 210 212) no Hoare annotation was computed. [2021-11-22 20:11:06,062 INFO L858 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2021-11-22 20:11:06,062 INFO L858 garLoopResultBuilder]: For program point L211-2(line 211) no Hoare annotation was computed. [2021-11-22 20:11:06,062 INFO L858 garLoopResultBuilder]: For program point L211-4(line 211) no Hoare annotation was computed. [2021-11-22 20:11:06,062 INFO L858 garLoopResultBuilder]: For program point L211-6(line 211) no Hoare annotation was computed. [2021-11-22 20:11:06,062 INFO L858 garLoopResultBuilder]: For program point L211-8(line 211) no Hoare annotation was computed. [2021-11-22 20:11:06,062 INFO L858 garLoopResultBuilder]: For program point L211-10(line 211) no Hoare annotation was computed. [2021-11-22 20:11:06,062 INFO L858 garLoopResultBuilder]: For program point L211-12(line 211) no Hoare annotation was computed. [2021-11-22 20:11:06,062 INFO L858 garLoopResultBuilder]: For program point L211-14(line 211) no Hoare annotation was computed. [2021-11-22 20:11:06,062 INFO L858 garLoopResultBuilder]: For program point L211-16(line 211) no Hoare annotation was computed. [2021-11-22 20:11:06,063 INFO L858 garLoopResultBuilder]: For program point L211-18(line 211) no Hoare annotation was computed. [2021-11-22 20:11:06,063 INFO L854 garLoopResultBuilder]: At program point L2590(lines 2586 2594) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset| |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.offset|)) (.cse1 (< |#StackHeapBarrier| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base|)) (.cse2 (exists ((|v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_62| Int)) (= (select |#valid| |v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_62|) 0))) (.cse3 (not (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base| |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base|))) (.cse4 (= (select |#valid| |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base|) 1)) (.cse5 (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base| |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base|)) (.cse6 (not (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|))) (.cse7 (= |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.offset| 0)) (.cse8 (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base| |ULTIMATE.start_hash_table_state_required_bytes_~required_bytes#1.base|)) (.cse9 (= (select |#valid| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|) 1)) (.cse10 (= (select |#valid| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base|) 1)) (.cse11 (<= (mod |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1| 18446744073709551616) 8)) (.cse12 (< 0 |#StackHeapBarrier|)) (.cse13 (not (= |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|))) (.cse14 (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base|)) (.cse15 (= |ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries#1| 8))) (or (and (<= (+ |ULTIMATE.start_aws_raise_error_#res#1| 1) 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= (+ |ULTIMATE.start_aws_mul_u64_checked_#res#1| 1) 0) .cse8 .cse9 .cse10 .cse11 (<= (+ |ULTIMATE.start_aws_mul_size_checked_#res#1| 1) 0) .cse12 .cse13 .cse14 .cse15) (and (= |ULTIMATE.start_aws_mul_u64_checked_~b#1| 24) (= |ULTIMATE.start_hash_table_state_required_bytes_~required_bytes#1.offset| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.offset|) (= |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.offset| 0) .cse0 .cse1 .cse2 .cse3 (= |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1| |ULTIMATE.start_aws_mul_u64_checked_~a#1|) (= |ULTIMATE.start_aws_mul_u64_checked_~r#1.base| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|) .cse4 .cse5 (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.offset| 0) (= |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.offset| |ULTIMATE.start_aws_mul_u64_checked_~r#1.offset|) .cse6 .cse7 .cse8 .cse9 (= (* 24 |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1|) (select (select |#memory_int| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|) |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.offset|)) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2021-11-22 20:11:06,063 INFO L858 garLoopResultBuilder]: For program point L211-20(line 211) no Hoare annotation was computed. [2021-11-22 20:11:06,063 INFO L858 garLoopResultBuilder]: For program point L211-22(line 211) no Hoare annotation was computed. [2021-11-22 20:11:06,063 INFO L854 garLoopResultBuilder]: At program point L2590-1(lines 2586 2594) the Hoare annotation is: (let ((.cse1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base|) |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.offset|))) (let ((.cse2 (+ .cse1 1)) (.cse3 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base|) |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.offset|))) (and (<= (+ |ULTIMATE.start_aws_raise_error_#res#1| 1) 0) (= |ULTIMATE.start_aws_mul_u64_checked_~b#1| 24) (let ((.cse0 (select (select |#memory_int| .cse1) 40))) (<= (div (+ (* .cse0 (- 1)) 8) (- 18446744073709551616)) (div .cse0 18446744073709551616))) (< .cse2 |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|) (= |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.offset| 0) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset| |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.offset|) (= |ULTIMATE.start_hash_table_state_is_valid_~map#1.base| .cse1) (= |ULTIMATE.start_aws_hash_table_is_valid_~map#1.offset| |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.offset|) (< .cse1 |#StackHeapBarrier|) (= .cse3 0) (= .cse3 |ULTIMATE.start_hash_table_state_is_valid_~map#1.offset|) (= |ULTIMATE.start_aws_mul_u64_checked_~r#1.base| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|) (not (= |ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base| |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base|)) (let ((.cse8 (+ |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base| 1)) (.cse7 (+ |ULTIMATE.start_save_byte_from_hash_table_~#size_in_bytes~0#1.base| 1))) (let ((.cse5 (< |ULTIMATE.start_save_byte_from_hash_table_~#size_in_bytes~0#1.base| |ULTIMATE.start_save_byte_from_hash_table_~storage#1.base|)) (.cse6 (< .cse7 |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base|)) (.cse4 (< .cse8 |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base|))) (or (and .cse4 .cse5 .cse6) (and .cse5 (< .cse7 |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|) .cse6) (and .cse4 (< .cse8 |ULTIMATE.start_save_byte_from_hash_table_~#size_in_bytes~0#1.base|) (< |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base| |ULTIMATE.start_save_byte_from_hash_table_~storage#1.base|)) (let ((.cse9 (+ 2 .cse1))) (and (< .cse9 |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|) (< .cse9 |ULTIMATE.start_save_byte_from_hash_table_~#size_in_bytes~0#1.base|) (< 2 |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|) (< .cse9 |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base|) (< 2 |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base|) (< .cse2 |ULTIMATE.start_save_byte_from_hash_table_~storage#1.base|) (< 1 |ULTIMATE.start_save_byte_from_hash_table_~storage#1.base|) (< 2 |ULTIMATE.start_save_byte_from_hash_table_~#size_in_bytes~0#1.base|))) (< |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base| |ULTIMATE.start_save_byte_from_hash_table_~storage#1.base|)))) (= (select |#valid| |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base|) 1) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base| |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base|) (exists ((|v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_63| Int)) (and (not (= |v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_63| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|)) (= (select |#valid| |v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_63|) 0))) (= (select |#valid| .cse1) 1) (= |ULTIMATE.start_save_byte_from_hash_table_~state~0#1.base| .cse1) (exists ((|ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base| Int) (|ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base| Int)) (and (not (= |ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base| |ULTIMATE.start_save_byte_from_hash_table_~#size_in_bytes~0#1.base|)) (not (= |ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base| |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base|)) (not (= |ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base| |ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base|)) (= (select |#valid| |ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base|) 1) (not (= |ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|)) (not (= |ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base| |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base|)) (not (= |ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|)) (= (select |#valid| |ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base|) 1) (not (= |ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base| |ULTIMATE.start_save_byte_from_hash_table_~#size_in_bytes~0#1.base|)))) (= |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.offset| |ULTIMATE.start_aws_mul_u64_checked_~r#1.offset|) (= (select (select |#memory_int| |ULTIMATE.start_save_byte_from_hash_table_~state~0#1.base|) (+ 40 |ULTIMATE.start_save_byte_from_hash_table_~state~0#1.offset|)) |ULTIMATE.start_aws_mul_u64_checked_~a#1|) (not (= |ULTIMATE.start_save_byte_from_hash_table_~storage#1.base| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|)) (= |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.offset| 0) (<= (+ |ULTIMATE.start_aws_mul_u64_checked_#res#1| 1) 0) (< 1 |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|) (not (= |ULTIMATE.start_save_byte_from_hash_table_~#size_in_bytes~0#1.base| |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base|)) (= |ULTIMATE.start_hash_table_state_required_bytes_~required_bytes#1.base| |ULTIMATE.start_save_byte_from_hash_table_~#size_in_bytes~0#1.base|) (< .cse2 |ULTIMATE.start_save_byte_from_hash_table_~#size_in_bytes~0#1.base|) (not (= |ULTIMATE.start_bounded_malloc_#res#1.base| 0)) (= .cse3 |ULTIMATE.start_save_byte_from_hash_table_~state~0#1.offset|) (= |ULTIMATE.start_save_byte_from_hash_table_~#size_in_bytes~0#1.offset| 0) (not (= .cse1 0)) (not (= |ULTIMATE.start_save_byte_from_hash_table_~#size_in_bytes~0#1.base| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|)) (= (select |#valid| |ULTIMATE.start_save_byte_from_hash_table_~#size_in_bytes~0#1.base|) 1) (not (= |ULTIMATE.start_save_byte_from_hash_table_~storage#1.base| |ULTIMATE.start_save_byte_from_hash_table_~#size_in_bytes~0#1.base|)) (<= (mod |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1| 18446744073709551616) 8) (= (select |#valid| |ULTIMATE.start_save_byte_from_hash_table_~storage#1.base|) 1) (= |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base| |ULTIMATE.start_aws_hash_table_is_valid_~map#1.base|) (<= (+ |ULTIMATE.start_aws_mul_size_checked_#res#1| 1) 0) (= |ULTIMATE.start_save_byte_from_hash_table_~#size_in_bytes~0#1.offset| |ULTIMATE.start_hash_table_state_required_bytes_~required_bytes#1.offset|) (< 0 |#StackHeapBarrier|) (not (= |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|)) (< 1 |ULTIMATE.start_save_byte_from_hash_table_~#size_in_bytes~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base|)))) [2021-11-22 20:11:06,063 INFO L858 garLoopResultBuilder]: For program point L211-24(line 211) no Hoare annotation was computed. [2021-11-22 20:11:06,064 INFO L858 garLoopResultBuilder]: For program point L211-26(line 211) no Hoare annotation was computed. [2021-11-22 20:11:06,064 INFO L858 garLoopResultBuilder]: For program point L211-28(line 211) no Hoare annotation was computed. [2021-11-22 20:11:06,064 INFO L858 garLoopResultBuilder]: For program point L211-30(line 211) no Hoare annotation was computed. [2021-11-22 20:11:06,064 INFO L858 garLoopResultBuilder]: For program point L211-32(line 211) no Hoare annotation was computed. [2021-11-22 20:11:06,064 INFO L858 garLoopResultBuilder]: For program point L211-34(line 211) no Hoare annotation was computed. [2021-11-22 20:11:06,064 INFO L858 garLoopResultBuilder]: For program point L211-36(line 211) no Hoare annotation was computed. [2021-11-22 20:11:06,064 INFO L858 garLoopResultBuilder]: For program point L211-38(line 211) no Hoare annotation was computed. [2021-11-22 20:11:06,064 INFO L858 garLoopResultBuilder]: For program point L211-40(line 211) no Hoare annotation was computed. [2021-11-22 20:11:06,064 INFO L858 garLoopResultBuilder]: For program point L211-42(line 211) no Hoare annotation was computed. [2021-11-22 20:11:06,064 INFO L858 garLoopResultBuilder]: For program point L9990-2(line 9990) no Hoare annotation was computed. [2021-11-22 20:11:06,064 INFO L858 garLoopResultBuilder]: For program point L9990-3(line 9990) no Hoare annotation was computed. [2021-11-22 20:11:06,065 INFO L858 garLoopResultBuilder]: For program point L211-44(line 211) no Hoare annotation was computed. [2021-11-22 20:11:06,065 INFO L858 garLoopResultBuilder]: For program point L211-46(line 211) no Hoare annotation was computed. [2021-11-22 20:11:06,065 INFO L858 garLoopResultBuilder]: For program point L211-48(line 211) no Hoare annotation was computed. [2021-11-22 20:11:06,065 INFO L858 garLoopResultBuilder]: For program point L9990(line 9990) no Hoare annotation was computed. [2021-11-22 20:11:06,065 INFO L858 garLoopResultBuilder]: For program point L9990-9(line 9990) no Hoare annotation was computed. [2021-11-22 20:11:06,065 INFO L858 garLoopResultBuilder]: For program point L211-50(line 211) no Hoare annotation was computed. [2021-11-22 20:11:06,065 INFO L858 garLoopResultBuilder]: For program point L9990-10(line 9990) no Hoare annotation was computed. [2021-11-22 20:11:06,065 INFO L858 garLoopResultBuilder]: For program point L9990-12(line 9990) no Hoare annotation was computed. [2021-11-22 20:11:06,065 INFO L858 garLoopResultBuilder]: For program point L9990-5(line 9990) no Hoare annotation was computed. [2021-11-22 20:11:06,065 INFO L854 garLoopResultBuilder]: At program point L9990-6(lines 9988 9991) the Hoare annotation is: false [2021-11-22 20:11:06,065 INFO L858 garLoopResultBuilder]: For program point L9990-7(line 9990) no Hoare annotation was computed. [2021-11-22 20:11:06,066 INFO L858 garLoopResultBuilder]: For program point L9990-17(line 9990) no Hoare annotation was computed. [2021-11-22 20:11:06,066 INFO L858 garLoopResultBuilder]: For program point L9990-19(line 9990) no Hoare annotation was computed. [2021-11-22 20:11:06,066 INFO L854 garLoopResultBuilder]: At program point L9990-20(lines 9988 9991) the Hoare annotation is: (and (not (= |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base| 0)) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset| |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.offset|) (= |ULTIMATE.start_aws_hash_table_is_valid_~map#1.offset| |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.offset|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base|) |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_hash_table_find_~map#1.base|) |ULTIMATE.start_aws_hash_table_find_~map#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_hash_table_find_~map#1.base|) |ULTIMATE.start_aws_hash_table_find_~map#1.offset|) 0) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base| |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base|) (or (not (= |ULTIMATE.start_hash_table_state_is_valid_~map#1.offset| 0)) (not (= |ULTIMATE.start_hash_table_state_is_valid_~map#1.base| 0))) (not (= |ULTIMATE.start_bounded_malloc_#res#1.base| 0)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base|) |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.offset|) 0) (= |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base| |ULTIMATE.start_aws_hash_table_is_valid_~map#1.base|)) [2021-11-22 20:11:06,066 INFO L854 garLoopResultBuilder]: At program point L9990-13(lines 9988 9991) the Hoare annotation is: (and (not (= |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base| 0)) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset| |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.offset|) (= |ULTIMATE.start_aws_hash_table_is_valid_~map#1.offset| |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.offset|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base|) |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.offset|) 0) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base| |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base|) (or (not (= |ULTIMATE.start_hash_table_state_is_valid_~map#1.offset| 0)) (not (= |ULTIMATE.start_hash_table_state_is_valid_~map#1.base| 0))) (not (= |ULTIMATE.start_bounded_malloc_#res#1.base| 0)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base|) |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.offset|) 0) (= |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base| |ULTIMATE.start_aws_hash_table_is_valid_~map#1.base|)) [2021-11-22 20:11:06,066 INFO L858 garLoopResultBuilder]: For program point L9990-14(line 9990) no Hoare annotation was computed. [2021-11-22 20:11:06,066 INFO L858 garLoopResultBuilder]: For program point L9990-16(line 9990) no Hoare annotation was computed. [2021-11-22 20:11:06,066 INFO L858 garLoopResultBuilder]: For program point L9990-26(line 9990) no Hoare annotation was computed. [2021-11-22 20:11:06,066 INFO L854 garLoopResultBuilder]: At program point L9990-27(lines 9988 9991) the Hoare annotation is: false [2021-11-22 20:11:06,066 INFO L858 garLoopResultBuilder]: For program point L9990-28(line 9990) no Hoare annotation was computed. [2021-11-22 20:11:06,066 INFO L858 garLoopResultBuilder]: For program point L9990-21(line 9990) no Hoare annotation was computed. [2021-11-22 20:11:06,067 INFO L858 garLoopResultBuilder]: For program point L9990-23(line 9990) no Hoare annotation was computed. [2021-11-22 20:11:06,067 INFO L858 garLoopResultBuilder]: For program point L9990-24(line 9990) no Hoare annotation was computed. [2021-11-22 20:11:06,067 INFO L858 garLoopResultBuilder]: For program point L9990-33(line 9990) no Hoare annotation was computed. [2021-11-22 20:11:06,067 INFO L854 garLoopResultBuilder]: At program point L9990-34(lines 9988 9991) the Hoare annotation is: false [2021-11-22 20:11:06,067 INFO L858 garLoopResultBuilder]: For program point L9990-30(line 9990) no Hoare annotation was computed. [2021-11-22 20:11:06,067 INFO L858 garLoopResultBuilder]: For program point L9990-31(line 9990) no Hoare annotation was computed. [2021-11-22 20:11:06,067 INFO L858 garLoopResultBuilder]: For program point L9067(lines 9067 9075) no Hoare annotation was computed. [2021-11-22 20:11:06,068 INFO L854 garLoopResultBuilder]: At program point L1998(lines 1988 1999) the Hoare annotation is: (and (<= (+ |ULTIMATE.start_aws_raise_error_#res#1| 1) 0) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset| |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.offset|) (< |#StackHeapBarrier| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base|) (exists ((|v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_62| Int)) (= (select |#valid| |v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_62|) 0)) (not (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base| |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base|)) (= (select |#valid| |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base|) 1) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base| |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base|) (not (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|)) (= |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.offset| 0) (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base| |ULTIMATE.start_hash_table_state_required_bytes_~required_bytes#1.base|) (= (select |#valid| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base|) (= (select |#valid| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base|) 1) (<= (mod |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1| 18446744073709551616) 8) (< 0 |#StackHeapBarrier|) (not (= |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|)) (= |ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries#1| 8)) [2021-11-22 20:11:06,068 INFO L854 garLoopResultBuilder]: At program point L1998-1(lines 1988 1999) the Hoare annotation is: (and (<= (+ |ULTIMATE.start_aws_raise_error_#res#1| 1) 0) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset| |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.offset|) (< |#StackHeapBarrier| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base|) (not (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base| |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base|)) (= (select |#valid| |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base|) 1) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base| |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base|) (not (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|)) (= |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.offset| 0) (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base| |ULTIMATE.start_hash_table_state_required_bytes_~required_bytes#1.base|) (= (select |#valid| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base|) (= (select |#valid| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base|) 1) (<= (mod |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1| 18446744073709551616) 8) (< 0 |#StackHeapBarrier|) (not (= |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|)) (exists ((|v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0#1.base_19| Int)) (= (select |#valid| |v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0#1.base_19|) 0)) (= |ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries#1| 8)) [2021-11-22 20:11:06,068 INFO L854 garLoopResultBuilder]: At program point L1998-2(lines 1988 1999) the Hoare annotation is: (let ((.cse1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base|) |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.offset|))) (let ((.cse2 (+ .cse1 1)) (.cse3 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base|) |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.offset|))) (and (<= (+ |ULTIMATE.start_aws_raise_error_#res#1| 1) 0) (= |ULTIMATE.start_aws_mul_u64_checked_~b#1| 24) (let ((.cse0 (select (select |#memory_int| .cse1) 40))) (<= (div (+ (* .cse0 (- 1)) 8) (- 18446744073709551616)) (div .cse0 18446744073709551616))) (< .cse2 |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|) (= |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.offset| 0) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset| |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.offset|) (= |ULTIMATE.start_hash_table_state_is_valid_~map#1.base| .cse1) (= |ULTIMATE.start_aws_hash_table_is_valid_~map#1.offset| |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.offset|) (< .cse1 |#StackHeapBarrier|) (= .cse3 0) (= .cse3 |ULTIMATE.start_hash_table_state_is_valid_~map#1.offset|) (= |ULTIMATE.start_aws_mul_u64_checked_~r#1.base| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|) (not (= |ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base| |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base|)) (let ((.cse8 (+ |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base| 1)) (.cse7 (+ |ULTIMATE.start_save_byte_from_hash_table_~#size_in_bytes~0#1.base| 1))) (let ((.cse5 (< |ULTIMATE.start_save_byte_from_hash_table_~#size_in_bytes~0#1.base| |ULTIMATE.start_save_byte_from_hash_table_~storage#1.base|)) (.cse6 (< .cse7 |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base|)) (.cse4 (< .cse8 |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base|))) (or (and .cse4 .cse5 .cse6) (and .cse5 (< .cse7 |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|) .cse6) (and .cse4 (< .cse8 |ULTIMATE.start_save_byte_from_hash_table_~#size_in_bytes~0#1.base|) (< |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base| |ULTIMATE.start_save_byte_from_hash_table_~storage#1.base|)) (let ((.cse9 (+ 2 .cse1))) (and (< .cse9 |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|) (< .cse9 |ULTIMATE.start_save_byte_from_hash_table_~#size_in_bytes~0#1.base|) (< 2 |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|) (< .cse9 |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base|) (< 2 |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base|) (< .cse2 |ULTIMATE.start_save_byte_from_hash_table_~storage#1.base|) (< 1 |ULTIMATE.start_save_byte_from_hash_table_~storage#1.base|) (< 2 |ULTIMATE.start_save_byte_from_hash_table_~#size_in_bytes~0#1.base|))) (< |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base| |ULTIMATE.start_save_byte_from_hash_table_~storage#1.base|)))) (= (select |#valid| |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base|) 1) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base| |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base|) (exists ((|v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_63| Int)) (and (not (= |v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_63| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|)) (= (select |#valid| |v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_63|) 0))) (= (select |#valid| .cse1) 1) (= |ULTIMATE.start_save_byte_from_hash_table_~state~0#1.base| .cse1) (exists ((|ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base| Int) (|ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base| Int)) (and (not (= |ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base| |ULTIMATE.start_save_byte_from_hash_table_~#size_in_bytes~0#1.base|)) (not (= |ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base| |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base|)) (not (= |ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base| |ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base|)) (= (select |#valid| |ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base|) 1) (not (= |ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|)) (not (= |ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base| |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base|)) (not (= |ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|)) (= (select |#valid| |ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base|) 1) (not (= |ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base| |ULTIMATE.start_save_byte_from_hash_table_~#size_in_bytes~0#1.base|)))) (= |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.offset| |ULTIMATE.start_aws_mul_u64_checked_~r#1.offset|) (= (select (select |#memory_int| |ULTIMATE.start_save_byte_from_hash_table_~state~0#1.base|) (+ 40 |ULTIMATE.start_save_byte_from_hash_table_~state~0#1.offset|)) |ULTIMATE.start_aws_mul_u64_checked_~a#1|) (not (= |ULTIMATE.start_save_byte_from_hash_table_~storage#1.base| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|)) (= |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.offset| 0) (< 1 |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|) (not (= |ULTIMATE.start_save_byte_from_hash_table_~#size_in_bytes~0#1.base| |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base|)) (= |ULTIMATE.start_hash_table_state_required_bytes_~required_bytes#1.base| |ULTIMATE.start_save_byte_from_hash_table_~#size_in_bytes~0#1.base|) (< .cse2 |ULTIMATE.start_save_byte_from_hash_table_~#size_in_bytes~0#1.base|) (not (= |ULTIMATE.start_bounded_malloc_#res#1.base| 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base|) (= .cse3 |ULTIMATE.start_save_byte_from_hash_table_~state~0#1.offset|) (= |ULTIMATE.start_save_byte_from_hash_table_~#size_in_bytes~0#1.offset| 0) (not (= .cse1 0)) (not (= |ULTIMATE.start_save_byte_from_hash_table_~#size_in_bytes~0#1.base| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|)) (= (select |#valid| |ULTIMATE.start_save_byte_from_hash_table_~#size_in_bytes~0#1.base|) 1) (not (= |ULTIMATE.start_save_byte_from_hash_table_~storage#1.base| |ULTIMATE.start_save_byte_from_hash_table_~#size_in_bytes~0#1.base|)) (<= (mod |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1| 18446744073709551616) 8) (= (select |#valid| |ULTIMATE.start_save_byte_from_hash_table_~storage#1.base|) 1) (= |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base| |ULTIMATE.start_aws_hash_table_is_valid_~map#1.base|) (= |ULTIMATE.start_save_byte_from_hash_table_~#size_in_bytes~0#1.offset| |ULTIMATE.start_hash_table_state_required_bytes_~required_bytes#1.offset|) (< 0 |#StackHeapBarrier|) (not (= |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|)) (< 1 |ULTIMATE.start_save_byte_from_hash_table_~#size_in_bytes~0#1.base|)))) [2021-11-22 20:11:06,068 INFO L854 garLoopResultBuilder]: At program point L1998-3(lines 1988 1999) the Hoare annotation is: (let ((.cse1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base|) |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.offset|))) (let ((.cse2 (+ .cse1 1)) (.cse3 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base|) |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.offset|))) (and (<= (+ |ULTIMATE.start_aws_raise_error_#res#1| 1) 0) (= |ULTIMATE.start_aws_mul_u64_checked_~b#1| 24) (let ((.cse0 (select (select |#memory_int| .cse1) 40))) (<= (div (+ (* .cse0 (- 1)) 8) (- 18446744073709551616)) (div .cse0 18446744073709551616))) (< .cse2 |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|) (= |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.offset| 0) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset| |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.offset|) (= |ULTIMATE.start_hash_table_state_is_valid_~map#1.base| .cse1) (= |ULTIMATE.start_aws_hash_table_is_valid_~map#1.offset| |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.offset|) (< .cse1 |#StackHeapBarrier|) (= .cse3 0) (= |ULTIMATE.start_save_byte_from_hash_table_~#size_in_bytes~0#1.base| |ULTIMATE.start_aws_add_u64_checked_~r#1.base|) (= .cse3 |ULTIMATE.start_hash_table_state_is_valid_~map#1.offset|) (= |ULTIMATE.start_aws_mul_u64_checked_~r#1.base| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|) (let ((.cse8 (+ |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base| 1)) (.cse7 (+ |ULTIMATE.start_save_byte_from_hash_table_~#size_in_bytes~0#1.base| 1))) (let ((.cse5 (< |ULTIMATE.start_save_byte_from_hash_table_~#size_in_bytes~0#1.base| |ULTIMATE.start_save_byte_from_hash_table_~storage#1.base|)) (.cse6 (< .cse7 |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base|)) (.cse4 (< .cse8 |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base|))) (or (and .cse4 .cse5 .cse6) (and .cse5 (< .cse7 |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|) .cse6) (and .cse4 (< .cse8 |ULTIMATE.start_save_byte_from_hash_table_~#size_in_bytes~0#1.base|) (< |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base| |ULTIMATE.start_save_byte_from_hash_table_~storage#1.base|)) (let ((.cse9 (+ 2 .cse1))) (and (< .cse9 |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|) (< .cse9 |ULTIMATE.start_save_byte_from_hash_table_~#size_in_bytes~0#1.base|) (< 2 |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|) (< .cse9 |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base|) (< 2 |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base|) (< .cse2 |ULTIMATE.start_save_byte_from_hash_table_~storage#1.base|) (< 1 |ULTIMATE.start_save_byte_from_hash_table_~storage#1.base|) (< 2 |ULTIMATE.start_save_byte_from_hash_table_~#size_in_bytes~0#1.base|))) (< |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base| |ULTIMATE.start_save_byte_from_hash_table_~storage#1.base|)))) (= (select |#valid| |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base|) 1) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base| |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base|) (= (select |#valid| .cse1) 1) (= |ULTIMATE.start_save_byte_from_hash_table_~state~0#1.base| .cse1) (exists ((|ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base| Int) (|ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base| Int)) (and (not (= |ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base| |ULTIMATE.start_save_byte_from_hash_table_~#size_in_bytes~0#1.base|)) (not (= |ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base| |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base|)) (not (= |ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base| |ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base|)) (= (select |#valid| |ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base|) 1) (not (= |ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|)) (not (= |ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base| |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base|)) (not (= |ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|)) (= (select |#valid| |ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base|) 1) (not (= |ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base| |ULTIMATE.start_save_byte_from_hash_table_~#size_in_bytes~0#1.base|)))) (= |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.offset| |ULTIMATE.start_aws_mul_u64_checked_~r#1.offset|) (= (select (select |#memory_int| |ULTIMATE.start_save_byte_from_hash_table_~state~0#1.base|) (+ 40 |ULTIMATE.start_save_byte_from_hash_table_~state~0#1.offset|)) |ULTIMATE.start_aws_mul_u64_checked_~a#1|) (not (= |ULTIMATE.start_save_byte_from_hash_table_~storage#1.base| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|)) (= |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.offset| 0) (< 1 |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|) (not (= |ULTIMATE.start_save_byte_from_hash_table_~#size_in_bytes~0#1.base| |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base|)) (= |ULTIMATE.start_hash_table_state_required_bytes_~required_bytes#1.base| |ULTIMATE.start_save_byte_from_hash_table_~#size_in_bytes~0#1.base|) (< .cse2 |ULTIMATE.start_save_byte_from_hash_table_~#size_in_bytes~0#1.base|) (not (= |ULTIMATE.start_bounded_malloc_#res#1.base| 0)) (= .cse3 |ULTIMATE.start_save_byte_from_hash_table_~state~0#1.offset|) (= |ULTIMATE.start_save_byte_from_hash_table_~#size_in_bytes~0#1.offset| 0) (not (= |ULTIMATE.start_save_byte_from_hash_table_~#size_in_bytes~0#1.base| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|)) (not (= |ULTIMATE.start_hash_table_state_is_valid_~map#1.base| 0)) (= (select |#valid| |ULTIMATE.start_save_byte_from_hash_table_~#size_in_bytes~0#1.base|) 1) (not (= |ULTIMATE.start_save_byte_from_hash_table_~storage#1.base| |ULTIMATE.start_save_byte_from_hash_table_~#size_in_bytes~0#1.base|)) (<= (mod |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1| 18446744073709551616) 8) (= (select |#valid| |ULTIMATE.start_save_byte_from_hash_table_~storage#1.base|) 1) (= |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base| |ULTIMATE.start_aws_hash_table_is_valid_~map#1.base|) (= |ULTIMATE.start_save_byte_from_hash_table_~#size_in_bytes~0#1.offset| |ULTIMATE.start_hash_table_state_required_bytes_~required_bytes#1.offset|) (< 0 |#StackHeapBarrier|) (not (= |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|)) (< 1 |ULTIMATE.start_save_byte_from_hash_table_~#size_in_bytes~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base|)))) [2021-11-22 20:11:06,069 INFO L854 garLoopResultBuilder]: At program point L9136-5(line 9136) the Hoare annotation is: false [2021-11-22 20:11:06,069 INFO L854 garLoopResultBuilder]: At program point L9136-2(line 9136) the Hoare annotation is: false [2021-11-22 20:11:06,069 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-11-22 20:11:06,069 INFO L854 garLoopResultBuilder]: At program point L7287-1(lines 7280 7288) the Hoare annotation is: false [2021-11-22 20:11:06,069 INFO L854 garLoopResultBuilder]: At program point L7287(lines 7280 7288) the Hoare annotation is: false [2021-11-22 20:11:06,069 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-22 20:11:06,069 INFO L858 garLoopResultBuilder]: For program point L9403(lines 9403 9409) no Hoare annotation was computed. [2021-11-22 20:11:06,069 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-22 20:11:06,069 INFO L854 garLoopResultBuilder]: At program point L7356-1(lines 7348 7357) the Hoare annotation is: false [2021-11-22 20:11:06,069 INFO L854 garLoopResultBuilder]: At program point L7356(lines 7348 7357) the Hoare annotation is: false [2021-11-22 20:11:06,070 INFO L858 garLoopResultBuilder]: For program point L222(lines 222 224) no Hoare annotation was computed. [2021-11-22 20:11:06,070 INFO L858 garLoopResultBuilder]: For program point L222-1(lines 222 224) no Hoare annotation was computed. [2021-11-22 20:11:06,070 INFO L858 garLoopResultBuilder]: For program point L222-2(lines 222 224) no Hoare annotation was computed. [2021-11-22 20:11:06,070 INFO L858 garLoopResultBuilder]: For program point L222-3(lines 222 224) no Hoare annotation was computed. [2021-11-22 20:11:06,070 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-22 20:11:06,070 INFO L858 garLoopResultBuilder]: For program point L222-4(lines 222 224) no Hoare annotation was computed. [2021-11-22 20:11:06,070 INFO L858 garLoopResultBuilder]: For program point L222-5(lines 222 224) no Hoare annotation was computed. [2021-11-22 20:11:06,070 INFO L858 garLoopResultBuilder]: For program point L222-6(lines 222 224) no Hoare annotation was computed. [2021-11-22 20:11:06,070 INFO L858 garLoopResultBuilder]: For program point L222-7(lines 222 224) no Hoare annotation was computed. [2021-11-22 20:11:06,070 INFO L858 garLoopResultBuilder]: For program point L222-8(lines 222 224) no Hoare annotation was computed. [2021-11-22 20:11:06,071 INFO L858 garLoopResultBuilder]: For program point L222-9(lines 222 224) no Hoare annotation was computed. [2021-11-22 20:11:06,071 INFO L858 garLoopResultBuilder]: For program point L222-10(lines 222 224) no Hoare annotation was computed. [2021-11-22 20:11:06,071 INFO L858 garLoopResultBuilder]: For program point L222-11(lines 222 224) no Hoare annotation was computed. [2021-11-22 20:11:06,071 INFO L858 garLoopResultBuilder]: For program point L222-12(lines 222 224) no Hoare annotation was computed. [2021-11-22 20:11:06,071 INFO L858 garLoopResultBuilder]: For program point L222-13(lines 222 224) no Hoare annotation was computed. [2021-11-22 20:11:06,071 INFO L858 garLoopResultBuilder]: For program point L222-14(lines 222 224) no Hoare annotation was computed. [2021-11-22 20:11:06,071 INFO L858 garLoopResultBuilder]: For program point L222-15(lines 222 224) no Hoare annotation was computed. [2021-11-22 20:11:06,071 INFO L858 garLoopResultBuilder]: For program point L222-16(lines 222 224) no Hoare annotation was computed. [2021-11-22 20:11:06,071 INFO L858 garLoopResultBuilder]: For program point L222-17(lines 222 224) no Hoare annotation was computed. [2021-11-22 20:11:06,071 INFO L858 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2021-11-22 20:11:06,071 INFO L858 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2021-11-22 20:11:06,072 INFO L858 garLoopResultBuilder]: For program point L223-3(line 223) no Hoare annotation was computed. [2021-11-22 20:11:06,072 INFO L858 garLoopResultBuilder]: For program point L223-4(line 223) no Hoare annotation was computed. [2021-11-22 20:11:06,072 INFO L858 garLoopResultBuilder]: For program point L223-6(line 223) no Hoare annotation was computed. [2021-11-22 20:11:06,072 INFO L858 garLoopResultBuilder]: For program point L223-7(line 223) no Hoare annotation was computed. [2021-11-22 20:11:06,072 INFO L858 garLoopResultBuilder]: For program point L223-9(line 223) no Hoare annotation was computed. [2021-11-22 20:11:06,072 INFO L858 garLoopResultBuilder]: For program point L223-10(line 223) no Hoare annotation was computed. [2021-11-22 20:11:06,072 INFO L858 garLoopResultBuilder]: For program point L223-12(line 223) no Hoare annotation was computed. [2021-11-22 20:11:06,072 INFO L858 garLoopResultBuilder]: For program point L223-13(line 223) no Hoare annotation was computed. [2021-11-22 20:11:06,072 INFO L858 garLoopResultBuilder]: For program point L10001-4(lines 10001 10005) no Hoare annotation was computed. [2021-11-22 20:11:06,072 INFO L858 garLoopResultBuilder]: For program point L223-15(line 223) no Hoare annotation was computed. [2021-11-22 20:11:06,072 INFO L858 garLoopResultBuilder]: For program point L10001-5(lines 10001 10005) no Hoare annotation was computed. [2021-11-22 20:11:06,073 INFO L858 garLoopResultBuilder]: For program point L223-16(line 223) no Hoare annotation was computed. [2021-11-22 20:11:06,073 INFO L858 garLoopResultBuilder]: For program point L10001-6(lines 10001 10005) no Hoare annotation was computed. [2021-11-22 20:11:06,073 INFO L858 garLoopResultBuilder]: For program point L10001-7(lines 10001 10005) no Hoare annotation was computed. [2021-11-22 20:11:06,073 INFO L858 garLoopResultBuilder]: For program point L10001(lines 10001 10005) no Hoare annotation was computed. [2021-11-22 20:11:06,073 INFO L858 garLoopResultBuilder]: For program point L223-18(line 223) no Hoare annotation was computed. [2021-11-22 20:11:06,073 INFO L858 garLoopResultBuilder]: For program point L10001-1(lines 10001 10005) no Hoare annotation was computed. [2021-11-22 20:11:06,073 INFO L858 garLoopResultBuilder]: For program point L223-19(line 223) no Hoare annotation was computed. [2021-11-22 20:11:06,073 INFO L858 garLoopResultBuilder]: For program point L10001-2(lines 10001 10005) no Hoare annotation was computed. [2021-11-22 20:11:06,073 INFO L858 garLoopResultBuilder]: For program point L10001-3(lines 10001 10005) no Hoare annotation was computed. [2021-11-22 20:11:06,073 INFO L858 garLoopResultBuilder]: For program point L223-21(line 223) no Hoare annotation was computed. [2021-11-22 20:11:06,073 INFO L858 garLoopResultBuilder]: For program point L223-22(line 223) no Hoare annotation was computed. [2021-11-22 20:11:06,074 INFO L858 garLoopResultBuilder]: For program point L223-24(line 223) no Hoare annotation was computed. [2021-11-22 20:11:06,074 INFO L858 garLoopResultBuilder]: For program point L223-25(line 223) no Hoare annotation was computed. [2021-11-22 20:11:06,074 INFO L858 garLoopResultBuilder]: For program point L10001-8(lines 10001 10005) no Hoare annotation was computed. [2021-11-22 20:11:06,074 INFO L858 garLoopResultBuilder]: For program point L223-27(line 223) no Hoare annotation was computed. [2021-11-22 20:11:06,074 INFO L858 garLoopResultBuilder]: For program point L10001-9(lines 10001 10005) no Hoare annotation was computed. [2021-11-22 20:11:06,074 INFO L858 garLoopResultBuilder]: For program point L223-28(line 223) no Hoare annotation was computed. [2021-11-22 20:11:06,074 INFO L858 garLoopResultBuilder]: For program point L223-30(line 223) no Hoare annotation was computed. [2021-11-22 20:11:06,074 INFO L858 garLoopResultBuilder]: For program point L223-31(line 223) no Hoare annotation was computed. [2021-11-22 20:11:06,074 INFO L858 garLoopResultBuilder]: For program point L223-33(line 223) no Hoare annotation was computed. [2021-11-22 20:11:06,074 INFO L858 garLoopResultBuilder]: For program point L223-34(line 223) no Hoare annotation was computed. [2021-11-22 20:11:06,074 INFO L858 garLoopResultBuilder]: For program point L223-36(line 223) no Hoare annotation was computed. [2021-11-22 20:11:06,075 INFO L858 garLoopResultBuilder]: For program point L223-37(line 223) no Hoare annotation was computed. [2021-11-22 20:11:06,075 INFO L858 garLoopResultBuilder]: For program point L223-39(line 223) no Hoare annotation was computed. [2021-11-22 20:11:06,075 INFO L858 garLoopResultBuilder]: For program point L223-40(line 223) no Hoare annotation was computed. [2021-11-22 20:11:06,075 INFO L858 garLoopResultBuilder]: For program point L223-42(line 223) no Hoare annotation was computed. [2021-11-22 20:11:06,075 INFO L858 garLoopResultBuilder]: For program point L223-43(line 223) no Hoare annotation was computed. [2021-11-22 20:11:06,075 INFO L858 garLoopResultBuilder]: For program point L223-45(line 223) no Hoare annotation was computed. [2021-11-22 20:11:06,075 INFO L858 garLoopResultBuilder]: For program point L223-46(line 223) no Hoare annotation was computed. [2021-11-22 20:11:06,075 INFO L858 garLoopResultBuilder]: For program point L223-48(line 223) no Hoare annotation was computed. [2021-11-22 20:11:06,075 INFO L858 garLoopResultBuilder]: For program point L223-49(line 223) no Hoare annotation was computed. [2021-11-22 20:11:06,075 INFO L858 garLoopResultBuilder]: For program point L223-51(line 223) no Hoare annotation was computed. [2021-11-22 20:11:06,075 INFO L858 garLoopResultBuilder]: For program point L223-52(line 223) no Hoare annotation was computed. [2021-11-22 20:11:06,076 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-11-22 20:11:06,076 INFO L858 garLoopResultBuilder]: For program point L10136(lines 10136 10139) no Hoare annotation was computed. [2021-11-22 20:11:06,076 INFO L858 garLoopResultBuilder]: For program point L10136-2(lines 10136 10139) no Hoare annotation was computed. [2021-11-22 20:11:06,076 INFO L854 garLoopResultBuilder]: At program point L6833(lines 6831 6834) the Hoare annotation is: false [2021-11-22 20:11:06,076 INFO L858 garLoopResultBuilder]: For program point L9410-1(lines 9391 9411) no Hoare annotation was computed. [2021-11-22 20:11:06,076 INFO L858 garLoopResultBuilder]: For program point L9410-2(line 9410) no Hoare annotation was computed. [2021-11-22 20:11:06,076 INFO L858 garLoopResultBuilder]: For program point L10137(line 10137) no Hoare annotation was computed. [2021-11-22 20:11:06,076 INFO L858 garLoopResultBuilder]: For program point L10137-2(line 10137) no Hoare annotation was computed. [2021-11-22 20:11:06,076 INFO L858 garLoopResultBuilder]: For program point L10138(line 10138) no Hoare annotation was computed. [2021-11-22 20:11:06,076 INFO L858 garLoopResultBuilder]: For program point L10138-2(line 10138) no Hoare annotation was computed. [2021-11-22 20:11:06,076 INFO L854 garLoopResultBuilder]: At program point L9082(lines 9082 9098) the Hoare annotation is: false [2021-11-22 20:11:06,077 INFO L858 garLoopResultBuilder]: For program point L2542(lines 2542 2543) no Hoare annotation was computed. [2021-11-22 20:11:06,077 INFO L858 garLoopResultBuilder]: For program point L2542-1(lines 2542 2543) no Hoare annotation was computed. [2021-11-22 20:11:06,077 INFO L854 garLoopResultBuilder]: At program point L9347-2(lines 9347 9381) the Hoare annotation is: false [2021-11-22 20:11:06,077 INFO L858 garLoopResultBuilder]: For program point L9347-3(lines 9347 9381) no Hoare annotation was computed. [2021-11-22 20:11:06,077 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-22 20:11:06,077 INFO L854 garLoopResultBuilder]: At program point L2545-1(lines 2541 2546) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base|) |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.offset|))) (and (<= (+ |ULTIMATE.start_aws_raise_error_#res#1| 1) 0) (not (= |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base| 0)) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset| |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.offset|) (= |ULTIMATE.start_aws_hash_table_is_valid_~map#1.offset| |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.offset|) (<= (+ |ULTIMATE.start_aws_add_u64_checked_#res#1| 1) 0) (= (select |#valid| |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base|) 1) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base| |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base|) (exists ((|ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base| Int) (|ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base| Int)) (and (not (= |ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base| |ULTIMATE.start_save_byte_from_hash_table_~#size_in_bytes~0#1.base|)) (not (= |ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base| |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base|)) (not (= |ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base| |ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base|)) (= (select |#valid| |ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base|) 1) (not (= |ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|)) (not (= |ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base| |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base|)) (not (= |ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|)) (= (select |#valid| |ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base|) 1) (not (= |ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base| |ULTIMATE.start_save_byte_from_hash_table_~#size_in_bytes~0#1.base|)))) (or (not (= |ULTIMATE.start_hash_table_state_is_valid_~map#1.offset| 0)) (not (= |ULTIMATE.start_hash_table_state_is_valid_~map#1.base| 0))) (< (+ .cse0 1) |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base|) (not (= |ULTIMATE.start_save_byte_from_hash_table_~storage#1.base| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|)) (= |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.offset| 0) (not (= |ULTIMATE.start_save_byte_from_hash_table_~#size_in_bytes~0#1.base| |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base|)) (not (= |ULTIMATE.start_bounded_malloc_#res#1.base| 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base|) (not (= .cse0 0)) (not (= |ULTIMATE.start_save_byte_from_hash_table_~#size_in_bytes~0#1.base| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|)) (= (select |#valid| |ULTIMATE.start_save_byte_from_hash_table_~#size_in_bytes~0#1.base|) 1) (not (= |ULTIMATE.start_save_byte_from_hash_table_~storage#1.base| |ULTIMATE.start_save_byte_from_hash_table_~#size_in_bytes~0#1.base|)) (= (select |#valid| |ULTIMATE.start_save_byte_from_hash_table_~storage#1.base|) 1) (= |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base| |ULTIMATE.start_aws_hash_table_is_valid_~map#1.base|) (not (= |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|)))) [2021-11-22 20:11:06,077 INFO L854 garLoopResultBuilder]: At program point L2545(lines 2541 2546) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset| |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.offset|)) (.cse1 (< |#StackHeapBarrier| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base|)) (.cse2 (not (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base| |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base|))) (.cse3 (= (select |#valid| |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base|) 1)) (.cse4 (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base| |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base|)) (.cse5 (not (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|))) (.cse6 (= |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.offset| 0)) (.cse7 (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base| |ULTIMATE.start_hash_table_state_required_bytes_~required_bytes#1.base|)) (.cse8 (= (select |#valid| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|) 1)) (.cse9 (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base|)) (.cse12 (= (select |#valid| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base|) 1)) (.cse13 (<= (mod |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1| 18446744073709551616) 8)) (.cse14 (< 0 |#StackHeapBarrier|)) (.cse15 (not (= |ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|))) (.cse16 (exists ((|v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0#1.base_19| Int)) (= (select |#valid| |v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0#1.base_19|) 0))) (.cse17 (= |ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries#1| 8))) (or (let ((.cse10 (select |#memory_int| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|))) (let ((.cse11 (select .cse10 0))) (and (= |ULTIMATE.start_aws_mul_u64_checked_~b#1| 24) (= |ULTIMATE.start_hash_table_state_required_bytes_~required_bytes#1.offset| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.offset|) (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.offset| |ULTIMATE.start_aws_add_u64_checked_~r#1.offset|) (= |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.offset| 0) .cse0 .cse1 .cse2 (= |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1| |ULTIMATE.start_aws_mul_u64_checked_~a#1|) (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base| |ULTIMATE.start_aws_add_u64_checked_~r#1.base|) (= |ULTIMATE.start_aws_mul_u64_checked_~r#1.base| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|) .cse3 .cse4 (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.offset| 0) (= |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.offset| |ULTIMATE.start_aws_mul_u64_checked_~r#1.offset|) .cse5 .cse6 .cse7 .cse8 .cse9 (= (* 24 |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1|) (select .cse10 |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.offset|)) (= (+ 29629528 (select (select |#memory_int| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base|) |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.offset|)) .cse11) (= |ULTIMATE.start_aws_add_u64_checked_~a#1| .cse11) .cse12 .cse13 (= (+ |ULTIMATE.start_aws_add_u64_checked_~b#1| 29629528) 0) .cse14 .cse15 .cse16 .cse17))) (and (<= (+ |ULTIMATE.start_aws_raise_error_#res#1| 1) 0) .cse0 .cse1 .cse2 (<= (+ |ULTIMATE.start_aws_add_u64_checked_#res#1| 1) 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))) [2021-11-22 20:11:06,080 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:11:06,081 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-22 20:11:06,093 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0#1.base_19,QUANTIFIED] [2021-11-22 20:11:06,094 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0#1.base_19,QUANTIFIED] [2021-11-22 20:11:06,111 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0#1.base_19,QUANTIFIED] [2021-11-22 20:11:06,112 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0#1.base_19,QUANTIFIED] [2021-11-22 20:11:06,114 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_62,QUANTIFIED] [2021-11-22 20:11:06,114 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_62,QUANTIFIED] [2021-11-22 20:11:06,115 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_62,QUANTIFIED] [2021-11-22 20:11:06,115 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_62,QUANTIFIED] [2021-11-22 20:11:06,118 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,119 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,119 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,119 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,120 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,120 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:11:06,120 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:11:06,120 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,121 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,121 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,121 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,125 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_63,QUANTIFIED] [2021-11-22 20:11:06,125 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_63,QUANTIFIED] [2021-11-22 20:11:06,126 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,126 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,126 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] [2021-11-22 20:11:06,126 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] [2021-11-22 20:11:06,126 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] [2021-11-22 20:11:06,127 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] [2021-11-22 20:11:06,127 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] [2021-11-22 20:11:06,127 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] [2021-11-22 20:11:06,127 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] [2021-11-22 20:11:06,127 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] [2021-11-22 20:11:06,128 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] [2021-11-22 20:11:06,128 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] [2021-11-22 20:11:06,128 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,128 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:11:06,128 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,130 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,130 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,130 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,131 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,131 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,131 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:11:06,131 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:11:06,132 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,132 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,132 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,132 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,132 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_63,QUANTIFIED] [2021-11-22 20:11:06,133 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_63,QUANTIFIED] [2021-11-22 20:11:06,133 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,133 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,133 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] [2021-11-22 20:11:06,133 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] [2021-11-22 20:11:06,134 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] [2021-11-22 20:11:06,134 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] [2021-11-22 20:11:06,134 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] [2021-11-22 20:11:06,134 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] [2021-11-22 20:11:06,134 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] [2021-11-22 20:11:06,135 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] [2021-11-22 20:11:06,135 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] [2021-11-22 20:11:06,135 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] [2021-11-22 20:11:06,135 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,135 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:11:06,136 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,137 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0#1.base_19,QUANTIFIED] [2021-11-22 20:11:06,138 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0#1.base_19,QUANTIFIED] [2021-11-22 20:11:06,138 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_62,QUANTIFIED] [2021-11-22 20:11:06,138 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_62,QUANTIFIED] [2021-11-22 20:11:06,139 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_62,QUANTIFIED] [2021-11-22 20:11:06,140 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_62,QUANTIFIED] [2021-11-22 20:11:06,141 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0#1.base_19,QUANTIFIED] [2021-11-22 20:11:06,141 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0#1.base_19,QUANTIFIED] [2021-11-22 20:11:06,142 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,143 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,143 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,143 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,143 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,143 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:11:06,144 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:11:06,144 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,144 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,144 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,145 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,145 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_63,QUANTIFIED] [2021-11-22 20:11:06,145 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_63,QUANTIFIED] [2021-11-22 20:11:06,145 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,145 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,146 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] [2021-11-22 20:11:06,146 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] [2021-11-22 20:11:06,146 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] [2021-11-22 20:11:06,146 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] [2021-11-22 20:11:06,146 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] [2021-11-22 20:11:06,147 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] [2021-11-22 20:11:06,147 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] [2021-11-22 20:11:06,147 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] [2021-11-22 20:11:06,147 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] [2021-11-22 20:11:06,147 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] [2021-11-22 20:11:06,148 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,148 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:11:06,148 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,149 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,151 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,151 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,151 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,152 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,152 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:11:06,152 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:11:06,152 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,153 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,153 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,153 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,153 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_63,QUANTIFIED] [2021-11-22 20:11:06,153 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_63,QUANTIFIED] [2021-11-22 20:11:06,154 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,154 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,154 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] [2021-11-22 20:11:06,154 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] [2021-11-22 20:11:06,154 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] [2021-11-22 20:11:06,155 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] [2021-11-22 20:11:06,155 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] [2021-11-22 20:11:06,155 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] [2021-11-22 20:11:06,155 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] [2021-11-22 20:11:06,155 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] [2021-11-22 20:11:06,155 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] [2021-11-22 20:11:06,156 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] [2021-11-22 20:11:06,156 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,156 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:11:06,156 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,158 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:11:06,159 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,159 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:11:06,159 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,160 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:11:06,160 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,160 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:11:06,160 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,161 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,161 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,161 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,162 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,162 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,162 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:11:06,162 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:11:06,163 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,163 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,163 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,163 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,163 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_63,QUANTIFIED] [2021-11-22 20:11:06,164 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_63,QUANTIFIED] [2021-11-22 20:11:06,164 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,164 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,164 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] [2021-11-22 20:11:06,164 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] [2021-11-22 20:11:06,165 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] [2021-11-22 20:11:06,165 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] [2021-11-22 20:11:06,165 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] [2021-11-22 20:11:06,165 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] [2021-11-22 20:11:06,165 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] [2021-11-22 20:11:06,166 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] [2021-11-22 20:11:06,166 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] [2021-11-22 20:11:06,166 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] [2021-11-22 20:11:06,166 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,166 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:11:06,167 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,168 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,168 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,168 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,169 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,169 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,169 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:11:06,169 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:11:06,170 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,170 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,170 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,170 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,170 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_63,QUANTIFIED] [2021-11-22 20:11:06,171 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_63,QUANTIFIED] [2021-11-22 20:11:06,171 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,171 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,171 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] [2021-11-22 20:11:06,171 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] [2021-11-22 20:11:06,172 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] [2021-11-22 20:11:06,172 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] [2021-11-22 20:11:06,172 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] [2021-11-22 20:11:06,172 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] [2021-11-22 20:11:06,172 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] [2021-11-22 20:11:06,174 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] [2021-11-22 20:11:06,174 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] [2021-11-22 20:11:06,174 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] [2021-11-22 20:11:06,174 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,174 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:11:06,175 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,176 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:11:06,176 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,176 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:11:06,177 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,177 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,178 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,178 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,178 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,178 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,179 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:11:06,179 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:11:06,179 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,179 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,179 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,180 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,180 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,180 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,180 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] [2021-11-22 20:11:06,180 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] [2021-11-22 20:11:06,181 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] [2021-11-22 20:11:06,181 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] [2021-11-22 20:11:06,181 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] [2021-11-22 20:11:06,181 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] [2021-11-22 20:11:06,181 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] [2021-11-22 20:11:06,182 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] [2021-11-22 20:11:06,182 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] [2021-11-22 20:11:06,182 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] [2021-11-22 20:11:06,182 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,182 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:11:06,184 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,184 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,184 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,185 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,185 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,185 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:11:06,185 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:11:06,186 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,186 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,186 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,186 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,186 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,187 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,187 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] [2021-11-22 20:11:06,187 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] [2021-11-22 20:11:06,187 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] [2021-11-22 20:11:06,187 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] [2021-11-22 20:11:06,188 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] [2021-11-22 20:11:06,188 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] [2021-11-22 20:11:06,188 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] [2021-11-22 20:11:06,188 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] [2021-11-22 20:11:06,188 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] [2021-11-22 20:11:06,188 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] [2021-11-22 20:11:06,189 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,189 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:11:06,191 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_62,QUANTIFIED] [2021-11-22 20:11:06,191 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_62,QUANTIFIED] [2021-11-22 20:11:06,192 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_62,QUANTIFIED] [2021-11-22 20:11:06,192 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_62,QUANTIFIED] [2021-11-22 20:11:06,198 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] [2021-11-22 20:11:06,198 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] [2021-11-22 20:11:06,198 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] [2021-11-22 20:11:06,198 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] [2021-11-22 20:11:06,199 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] [2021-11-22 20:11:06,199 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] [2021-11-22 20:11:06,199 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] [2021-11-22 20:11:06,199 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] [2021-11-22 20:11:06,200 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] [2021-11-22 20:11:06,201 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] [2021-11-22 20:11:06,201 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,201 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,202 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] [2021-11-22 20:11:06,202 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] [2021-11-22 20:11:06,203 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] [2021-11-22 20:11:06,203 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] [2021-11-22 20:11:06,203 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] [2021-11-22 20:11:06,203 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] [2021-11-22 20:11:06,203 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] [2021-11-22 20:11:06,203 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] [2021-11-22 20:11:06,204 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] [2021-11-22 20:11:06,204 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] [2021-11-22 20:11:06,204 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,204 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,206 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] [2021-11-22 20:11:06,206 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] [2021-11-22 20:11:06,206 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] [2021-11-22 20:11:06,206 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] [2021-11-22 20:11:06,206 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] [2021-11-22 20:11:06,206 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] [2021-11-22 20:11:06,207 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] [2021-11-22 20:11:06,207 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] [2021-11-22 20:11:06,208 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] [2021-11-22 20:11:06,208 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] [2021-11-22 20:11:06,208 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,208 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,209 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] [2021-11-22 20:11:06,210 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] [2021-11-22 20:11:06,210 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] [2021-11-22 20:11:06,210 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] [2021-11-22 20:11:06,210 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] [2021-11-22 20:11:06,210 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] [2021-11-22 20:11:06,210 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] [2021-11-22 20:11:06,211 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] [2021-11-22 20:11:06,211 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] [2021-11-22 20:11:06,211 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] [2021-11-22 20:11:06,211 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,211 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,213 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base_24,QUANTIFIED] [2021-11-22 20:11:06,213 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base_24,QUANTIFIED] [2021-11-22 20:11:06,213 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0#1.base_19,QUANTIFIED] [2021-11-22 20:11:06,215 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base_24,QUANTIFIED] [2021-11-22 20:11:06,215 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base_24,QUANTIFIED] [2021-11-22 20:11:06,215 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0#1.base_19,QUANTIFIED] [2021-11-22 20:11:06,216 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0#1.base_19,QUANTIFIED] [2021-11-22 20:11:06,216 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0#1.base_19,QUANTIFIED] [2021-11-22 20:11:06,217 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0#1.base_19,QUANTIFIED] [2021-11-22 20:11:06,217 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0#1.base_19,QUANTIFIED] [2021-11-22 20:11:06,218 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 08:11:06 BoogieIcfgContainer [2021-11-22 20:11:06,218 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-22 20:11:06,219 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-22 20:11:06,219 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-22 20:11:06,219 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-22 20:11:06,220 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 08:06:52" (3/4) ... [2021-11-22 20:11:06,223 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-11-22 20:11:06,262 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 378 nodes and edges [2021-11-22 20:11:06,265 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 110 nodes and edges [2021-11-22 20:11:06,267 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 34 nodes and edges [2021-11-22 20:11:06,269 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2021-11-22 20:11:06,271 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2021-11-22 20:11:06,273 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2021-11-22 20:11:06,276 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-11-22 20:11:06,278 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-11-22 20:11:06,306 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((b == 24 && required_bytes == required_bytes) && elemsize == 0) && map == map) && unknown-#StackHeapBarrier-unknown < required_bytes) && (\exists v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_62 : int :: \valid[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_62] == 0)) && !(required_bytes == map)) && num_entries == a) && r == elemsize) && \valid[map] == 1) && map == map) && required_bytes == 0) && elemsize == r) && !(required_bytes == elemsize)) && map == 0) && required_bytes == required_bytes) && \valid[elemsize] == 1) && unknown-#StackHeapBarrier-unknown + 1 <= map) && \valid[required_bytes] == 1) && num_entries % 18446744073709551616 <= 8) && 0 < unknown-#StackHeapBarrier-unknown) && !(map == elemsize)) && max_table_entries == 8 [2021-11-22 20:11:06,306 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((\result + 1 <= 0 && map == map) && unknown-#StackHeapBarrier-unknown < required_bytes) && (\exists v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_62 : int :: \valid[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_62] == 0)) && !(required_bytes == map)) && \valid[map] == 1) && map == map) && !(required_bytes == elemsize)) && map == 0) && \result + 1 <= 0) && required_bytes == required_bytes) && \valid[elemsize] == 1) && \valid[required_bytes] == 1) && num_entries % 18446744073709551616 <= 8) && 0 < unknown-#StackHeapBarrier-unknown) && !(map == elemsize)) && unknown-#StackHeapBarrier-unknown < map) && max_table_entries == 8) || (((((((((((((((((((((((b == 24 && required_bytes == required_bytes) && elemsize == 0) && map == map) && unknown-#StackHeapBarrier-unknown < required_bytes) && (\exists v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_62 : int :: \valid[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_62] == 0)) && !(required_bytes == map)) && num_entries == a) && r == elemsize) && \valid[map] == 1) && map == map) && required_bytes == 0) && elemsize == r) && !(required_bytes == elemsize)) && map == 0) && required_bytes == required_bytes) && \valid[elemsize] == 1) && 24 * num_entries == unknown-#memory_int-unknown[elemsize][elemsize]) && \valid[required_bytes] == 1) && num_entries % 18446744073709551616 <= 8) && 0 < unknown-#StackHeapBarrier-unknown) && !(map == elemsize)) && unknown-#StackHeapBarrier-unknown < map) && max_table_entries == 8) [2021-11-22 20:11:06,306 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((\result + 1 <= 0 && map == map) && unknown-#StackHeapBarrier-unknown < required_bytes) && (\exists v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_62 : int :: \valid[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_62] == 0)) && !(required_bytes == map)) && \valid[map] == 1) && map == map) && !(required_bytes == elemsize)) && map == 0) && \result + 1 <= 0) && required_bytes == required_bytes) && \valid[elemsize] == 1) && \valid[required_bytes] == 1) && num_entries % 18446744073709551616 <= 8) && \result + 1 <= 0) && 0 < unknown-#StackHeapBarrier-unknown) && !(map == elemsize)) && unknown-#StackHeapBarrier-unknown < map) && max_table_entries == 8) || (((((((((((((((((((((((b == 24 && required_bytes == required_bytes) && elemsize == 0) && map == map) && unknown-#StackHeapBarrier-unknown < required_bytes) && (\exists v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_62 : int :: \valid[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_62] == 0)) && !(required_bytes == map)) && num_entries == a) && r == elemsize) && \valid[map] == 1) && map == map) && required_bytes == 0) && elemsize == r) && !(required_bytes == elemsize)) && map == 0) && required_bytes == required_bytes) && \valid[elemsize] == 1) && 24 * num_entries == unknown-#memory_int-unknown[elemsize][elemsize]) && \valid[required_bytes] == 1) && num_entries % 18446744073709551616 <= 8) && 0 < unknown-#StackHeapBarrier-unknown) && !(map == elemsize)) && unknown-#StackHeapBarrier-unknown < map) && max_table_entries == 8) [2021-11-22 20:11:06,306 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((\result + 1 <= 0 && map == map) && unknown-#StackHeapBarrier-unknown < required_bytes) && (\exists v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_62 : int :: \valid[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_62] == 0)) && !(required_bytes == map)) && \valid[map] == 1) && map == map) && !(required_bytes == elemsize)) && map == 0) && required_bytes == required_bytes) && \valid[elemsize] == 1) && unknown-#StackHeapBarrier-unknown + 1 <= map) && \valid[required_bytes] == 1) && num_entries % 18446744073709551616 <= 8) && 0 < unknown-#StackHeapBarrier-unknown) && !(map == elemsize)) && max_table_entries == 8 [2021-11-22 20:11:06,306 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((!(map == 0) && map == map) && !(required_bytes == map)) && \valid[map] == 1) && map == map) && map == 0) && unknown-#StackHeapBarrier-unknown + 1 <= map) && \result + 1 <= 0) || ((((((((((((((map == map && unknown-#StackHeapBarrier-unknown < required_bytes) && !(required_bytes == map)) && \valid[map] == 1) && map == map) && required_bytes == 0) && map == 0) && (\exists v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base_24 : int :: !(v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base_24 == map) && 29629528 + unknown-#memory_int-unknown[required_bytes][required_bytes] == unknown-#memory_int-unknown[v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base_24][0])) && 24 * num_entries == 29629528 + unknown-#memory_int-unknown[required_bytes][required_bytes]) && \valid[required_bytes] == 1) && num_entries % 18446744073709551616 <= 8) && 0 < unknown-#StackHeapBarrier-unknown) && (\exists v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0#1.base_19 : int :: \valid[v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0#1.base_19] == 0)) && unknown-#StackHeapBarrier-unknown < map) && max_table_entries == 8) [2021-11-22 20:11:06,306 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((b == 24 && required_bytes == required_bytes) && required_bytes == r) && elemsize == 0) && map == map) && unknown-#StackHeapBarrier-unknown < required_bytes) && !(required_bytes == map)) && num_entries == a) && required_bytes == r) && r == elemsize) && \valid[map] == 1) && map == map) && required_bytes == 0) && elemsize == r) && !(required_bytes == elemsize)) && map == 0) && required_bytes == required_bytes) && \valid[elemsize] == 1) && unknown-#StackHeapBarrier-unknown + 1 <= map) && 24 * num_entries == unknown-#memory_int-unknown[elemsize][elemsize]) && a == unknown-#memory_int-unknown[elemsize][0]) && \valid[required_bytes] == 1) && num_entries % 18446744073709551616 <= 8) && b + 29629528 == 0) && 0 < unknown-#StackHeapBarrier-unknown) && !(map == elemsize)) && (\exists v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0#1.base_19 : int :: \valid[v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0#1.base_19] == 0)) && max_table_entries == 8 [2021-11-22 20:11:06,306 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((b == 24 && required_bytes == required_bytes) && required_bytes == r) && elemsize == 0) && map == map) && unknown-#StackHeapBarrier-unknown < required_bytes) && !(required_bytes == map)) && num_entries == a) && required_bytes == r) && r == elemsize) && \valid[map] == 1) && map == map) && required_bytes == 0) && elemsize == r) && !(required_bytes == elemsize)) && map == 0) && required_bytes == required_bytes) && \valid[elemsize] == 1) && unknown-#StackHeapBarrier-unknown + 1 <= map) && 24 * num_entries == unknown-#memory_int-unknown[elemsize][elemsize]) && 29629528 + unknown-#memory_int-unknown[required_bytes][required_bytes] == unknown-#memory_int-unknown[elemsize][0]) && a == unknown-#memory_int-unknown[elemsize][0]) && \valid[required_bytes] == 1) && num_entries % 18446744073709551616 <= 8) && b + 29629528 == 0) && 0 < unknown-#StackHeapBarrier-unknown) && !(map == elemsize)) && (\exists v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0#1.base_19 : int :: \valid[v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0#1.base_19] == 0)) && max_table_entries == 8) || (((((((((((((((((\result + 1 <= 0 && map == map) && unknown-#StackHeapBarrier-unknown < required_bytes) && !(required_bytes == map)) && \result + 1 <= 0) && \valid[map] == 1) && map == map) && !(required_bytes == elemsize)) && map == 0) && required_bytes == required_bytes) && \valid[elemsize] == 1) && unknown-#StackHeapBarrier-unknown + 1 <= map) && \valid[required_bytes] == 1) && num_entries % 18446744073709551616 <= 8) && 0 < unknown-#StackHeapBarrier-unknown) && !(map == elemsize)) && (\exists v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0#1.base_19 : int :: \valid[v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0#1.base_19] == 0)) && max_table_entries == 8) [2021-11-22 20:11:06,307 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((\result + 1 <= 0 && map == map) && unknown-#StackHeapBarrier-unknown < required_bytes) && !(required_bytes == map)) && \result + 1 <= 0) && \valid[map] == 1) && map == map) && !(required_bytes == elemsize)) && map == 0) && required_bytes == required_bytes) && \valid[elemsize] == 1) && unknown-#StackHeapBarrier-unknown + 1 <= map) && \valid[required_bytes] == 1) && \result + 1 <= 0) && num_entries % 18446744073709551616 <= 8) && 0 < unknown-#StackHeapBarrier-unknown) && !(map == elemsize)) && (\exists v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0#1.base_19 : int :: \valid[v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0#1.base_19] == 0)) && max_table_entries == 8) || ((((((((((((((((((((((((((((b == 24 && required_bytes == required_bytes) && required_bytes == r) && elemsize == 0) && map == map) && unknown-#StackHeapBarrier-unknown < required_bytes) && !(required_bytes == map)) && num_entries == a) && required_bytes == r) && r == elemsize) && \valid[map] == 1) && map == map) && required_bytes == 0) && elemsize == r) && !(required_bytes == elemsize)) && map == 0) && required_bytes == required_bytes) && \valid[elemsize] == 1) && unknown-#StackHeapBarrier-unknown + 1 <= map) && 24 * num_entries == unknown-#memory_int-unknown[elemsize][elemsize]) && 29629528 + unknown-#memory_int-unknown[required_bytes][required_bytes] == unknown-#memory_int-unknown[elemsize][0]) && a == unknown-#memory_int-unknown[elemsize][0]) && \valid[required_bytes] == 1) && num_entries % 18446744073709551616 <= 8) && b + 29629528 == 0) && 0 < unknown-#StackHeapBarrier-unknown) && !(map == elemsize)) && (\exists v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0#1.base_19 : int :: \valid[v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0#1.base_19] == 0)) && max_table_entries == 8) [2021-11-22 20:11:06,307 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((\result + 1 <= 0 && map == map) && unknown-#StackHeapBarrier-unknown < required_bytes) && !(required_bytes == map)) && \valid[map] == 1) && map == map) && !(required_bytes == elemsize)) && map == 0) && required_bytes == required_bytes) && \valid[elemsize] == 1) && unknown-#StackHeapBarrier-unknown + 1 <= map) && \valid[required_bytes] == 1) && num_entries % 18446744073709551616 <= 8) && 0 < unknown-#StackHeapBarrier-unknown) && !(map == elemsize)) && (\exists v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0#1.base_19 : int :: \valid[v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0#1.base_19] == 0)) && max_table_entries == 8 [2021-11-22 20:11:06,308 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((((((((((((\result + 1 <= 0 && b == 24) && (unknown-#memory_int-unknown[#memory_$Pointer$[map][map]][40] * -1 + 8) / -18446744073709551616 <= unknown-#memory_int-unknown[#memory_$Pointer$[map][map]][40] / 18446744073709551616) && #memory_$Pointer$[map][map] + 1 < elemsize) && elemsize == 0) && map == map) && map == #memory_$Pointer$[map][map]) && map == map) && #memory_$Pointer$[map][map] < unknown-#StackHeapBarrier-unknown) && #memory_$Pointer$[map][map] == 0) && #memory_$Pointer$[map][map] == map) && r == elemsize) && !(rval == map)) && ((((((elemsize + 1 < map && size_in_bytes < storage) && size_in_bytes + 1 < map) || ((size_in_bytes < storage && size_in_bytes + 1 < elemsize) && size_in_bytes + 1 < map)) || ((elemsize + 1 < map && elemsize + 1 < size_in_bytes) && elemsize < storage)) || (((((((2 + #memory_$Pointer$[map][map] < elemsize && 2 + #memory_$Pointer$[map][map] < size_in_bytes) && 2 < elemsize) && 2 + #memory_$Pointer$[map][map] < map) && 2 < map) && #memory_$Pointer$[map][map] + 1 < storage) && 1 < storage) && 2 < size_in_bytes)) || map < storage)) && \valid[map] == 1) && map == map) && (\exists v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_63 : int :: !(v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_63 == elemsize) && \valid[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_63] == 0)) && \valid[#memory_$Pointer$[map][map]] == 1) && state == #memory_$Pointer$[map][map]) && (\exists ULTIMATE.start_aws_hash_table_find_harness_~#\old_byte~0#1.base : int, ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base : int :: (((((((!(ULTIMATE.start_aws_hash_table_find_harness_~#\old_byte~0#1.base == size_in_bytes) && !(ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base == map)) && !(ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base == ULTIMATE.start_aws_hash_table_find_harness_~#\old_byte~0#1.base)) && \valid[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base] == 1) && !(ULTIMATE.start_aws_hash_table_find_harness_~#\old_byte~0#1.base == elemsize)) && !(ULTIMATE.start_aws_hash_table_find_harness_~#\old_byte~0#1.base == map)) && !(ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base == elemsize)) && \valid[ULTIMATE.start_aws_hash_table_find_harness_~#\old_byte~0#1.base] == 1) && !(ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base == size_in_bytes))) && elemsize == r) && unknown-#memory_int-unknown[state][40 + state] == a) && !(storage == elemsize)) && map == 0) && \result + 1 <= 0) && 1 < elemsize) && !(size_in_bytes == map)) && required_bytes == size_in_bytes) && #memory_$Pointer$[map][map] + 1 < size_in_bytes) && !(\result == 0)) && #memory_$Pointer$[map][map] == state) && size_in_bytes == 0) && !(#memory_$Pointer$[map][map] == 0)) && !(size_in_bytes == elemsize)) && \valid[size_in_bytes] == 1) && !(storage == size_in_bytes)) && num_entries % 18446744073709551616 <= 8) && \valid[storage] == 1) && map == map) && size_in_bytes == required_bytes) && 0 < unknown-#StackHeapBarrier-unknown) && !(map == elemsize)) && 1 < size_in_bytes) && unknown-#StackHeapBarrier-unknown < map [2021-11-22 20:11:06,308 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((((((((((((\result + 1 <= 0 && b == 24) && (unknown-#memory_int-unknown[#memory_$Pointer$[map][map]][40] * -1 + 8) / -18446744073709551616 <= unknown-#memory_int-unknown[#memory_$Pointer$[map][map]][40] / 18446744073709551616) && #memory_$Pointer$[map][map] + 1 < elemsize) && elemsize == 0) && map == map) && map == #memory_$Pointer$[map][map]) && map == map) && #memory_$Pointer$[map][map] < unknown-#StackHeapBarrier-unknown) && #memory_$Pointer$[map][map] == 0) && #memory_$Pointer$[map][map] == map) && r == elemsize) && !(rval == map)) && ((((((elemsize + 1 < map && size_in_bytes < storage) && size_in_bytes + 1 < map) || ((size_in_bytes < storage && size_in_bytes + 1 < elemsize) && size_in_bytes + 1 < map)) || ((elemsize + 1 < map && elemsize + 1 < size_in_bytes) && elemsize < storage)) || (((((((2 + #memory_$Pointer$[map][map] < elemsize && 2 + #memory_$Pointer$[map][map] < size_in_bytes) && 2 < elemsize) && 2 + #memory_$Pointer$[map][map] < map) && 2 < map) && #memory_$Pointer$[map][map] + 1 < storage) && 1 < storage) && 2 < size_in_bytes)) || map < storage)) && \valid[map] == 1) && map == map) && (\exists v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_63 : int :: !(v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_63 == elemsize) && \valid[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_63] == 0)) && \valid[#memory_$Pointer$[map][map]] == 1) && state == #memory_$Pointer$[map][map]) && (\exists ULTIMATE.start_aws_hash_table_find_harness_~#\old_byte~0#1.base : int, ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base : int :: (((((((!(ULTIMATE.start_aws_hash_table_find_harness_~#\old_byte~0#1.base == size_in_bytes) && !(ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base == map)) && !(ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base == ULTIMATE.start_aws_hash_table_find_harness_~#\old_byte~0#1.base)) && \valid[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base] == 1) && !(ULTIMATE.start_aws_hash_table_find_harness_~#\old_byte~0#1.base == elemsize)) && !(ULTIMATE.start_aws_hash_table_find_harness_~#\old_byte~0#1.base == map)) && !(ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base == elemsize)) && \valid[ULTIMATE.start_aws_hash_table_find_harness_~#\old_byte~0#1.base] == 1) && !(ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base == size_in_bytes))) && elemsize == r) && unknown-#memory_int-unknown[state][40 + state] == a) && !(storage == elemsize)) && map == 0) && \result + 1 <= 0) && 1 < elemsize) && !(size_in_bytes == map)) && required_bytes == size_in_bytes) && #memory_$Pointer$[map][map] + 1 < size_in_bytes) && !(\result == 0)) && #memory_$Pointer$[map][map] == state) && size_in_bytes == 0) && !(#memory_$Pointer$[map][map] == 0)) && !(size_in_bytes == elemsize)) && \valid[size_in_bytes] == 1) && !(storage == size_in_bytes)) && num_entries % 18446744073709551616 <= 8) && \valid[storage] == 1) && map == map) && \result + 1 <= 0) && size_in_bytes == required_bytes) && 0 < unknown-#StackHeapBarrier-unknown) && !(map == elemsize)) && 1 < size_in_bytes) && unknown-#StackHeapBarrier-unknown < map [2021-11-22 20:11:06,308 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((((((((((\result + 1 <= 0 && b == 24) && (unknown-#memory_int-unknown[#memory_$Pointer$[map][map]][40] * -1 + 8) / -18446744073709551616 <= unknown-#memory_int-unknown[#memory_$Pointer$[map][map]][40] / 18446744073709551616) && #memory_$Pointer$[map][map] + 1 < elemsize) && elemsize == 0) && map == map) && map == #memory_$Pointer$[map][map]) && map == map) && #memory_$Pointer$[map][map] < unknown-#StackHeapBarrier-unknown) && #memory_$Pointer$[map][map] == 0) && #memory_$Pointer$[map][map] == map) && r == elemsize) && !(rval == map)) && ((((((elemsize + 1 < map && size_in_bytes < storage) && size_in_bytes + 1 < map) || ((size_in_bytes < storage && size_in_bytes + 1 < elemsize) && size_in_bytes + 1 < map)) || ((elemsize + 1 < map && elemsize + 1 < size_in_bytes) && elemsize < storage)) || (((((((2 + #memory_$Pointer$[map][map] < elemsize && 2 + #memory_$Pointer$[map][map] < size_in_bytes) && 2 < elemsize) && 2 + #memory_$Pointer$[map][map] < map) && 2 < map) && #memory_$Pointer$[map][map] + 1 < storage) && 1 < storage) && 2 < size_in_bytes)) || map < storage)) && \valid[map] == 1) && map == map) && (\exists v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_63 : int :: !(v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_63 == elemsize) && \valid[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_63] == 0)) && \valid[#memory_$Pointer$[map][map]] == 1) && state == #memory_$Pointer$[map][map]) && (\exists ULTIMATE.start_aws_hash_table_find_harness_~#\old_byte~0#1.base : int, ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base : int :: (((((((!(ULTIMATE.start_aws_hash_table_find_harness_~#\old_byte~0#1.base == size_in_bytes) && !(ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base == map)) && !(ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base == ULTIMATE.start_aws_hash_table_find_harness_~#\old_byte~0#1.base)) && \valid[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base] == 1) && !(ULTIMATE.start_aws_hash_table_find_harness_~#\old_byte~0#1.base == elemsize)) && !(ULTIMATE.start_aws_hash_table_find_harness_~#\old_byte~0#1.base == map)) && !(ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base == elemsize)) && \valid[ULTIMATE.start_aws_hash_table_find_harness_~#\old_byte~0#1.base] == 1) && !(ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base == size_in_bytes))) && elemsize == r) && unknown-#memory_int-unknown[state][40 + state] == a) && !(storage == elemsize)) && map == 0) && 1 < elemsize) && !(size_in_bytes == map)) && required_bytes == size_in_bytes) && #memory_$Pointer$[map][map] + 1 < size_in_bytes) && !(\result == 0)) && unknown-#StackHeapBarrier-unknown + 1 <= map) && #memory_$Pointer$[map][map] == state) && size_in_bytes == 0) && !(#memory_$Pointer$[map][map] == 0)) && !(size_in_bytes == elemsize)) && \valid[size_in_bytes] == 1) && !(storage == size_in_bytes)) && num_entries % 18446744073709551616 <= 8) && \valid[storage] == 1) && map == map) && size_in_bytes == required_bytes) && 0 < unknown-#StackHeapBarrier-unknown) && !(map == elemsize)) && 1 < size_in_bytes [2021-11-22 20:11:06,308 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!(map == 0) && map == map) && map == map) && map == map) && (!(map == 0) || !(map == 0))) && !(\result == 0)) && map == map) && \result + 1 <= 0 [2021-11-22 20:11:06,308 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((\result + 1 <= 0 && !(map == 0)) && map == map) && map == map) && \result + 1 <= 0) && \valid[map] == 1) && map == map) && (\exists ULTIMATE.start_aws_hash_table_find_harness_~#\old_byte~0#1.base : int, ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base : int :: (((((((!(ULTIMATE.start_aws_hash_table_find_harness_~#\old_byte~0#1.base == size_in_bytes) && !(ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base == map)) && !(ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base == ULTIMATE.start_aws_hash_table_find_harness_~#\old_byte~0#1.base)) && \valid[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base] == 1) && !(ULTIMATE.start_aws_hash_table_find_harness_~#\old_byte~0#1.base == elemsize)) && !(ULTIMATE.start_aws_hash_table_find_harness_~#\old_byte~0#1.base == map)) && !(ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base == elemsize)) && \valid[ULTIMATE.start_aws_hash_table_find_harness_~#\old_byte~0#1.base] == 1) && !(ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base == size_in_bytes))) && (!(map == 0) || !(map == 0))) && #memory_$Pointer$[map][map] + 1 < map) && !(storage == elemsize)) && map == 0) && !(size_in_bytes == map)) && !(\result == 0)) && unknown-#StackHeapBarrier-unknown + 1 <= map) && !(#memory_$Pointer$[map][map] == 0)) && !(size_in_bytes == elemsize)) && \valid[size_in_bytes] == 1) && !(storage == size_in_bytes)) && \valid[storage] == 1) && map == map) && !(map == elemsize) [2021-11-22 20:11:06,308 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((\result + 1 <= 0 && !(map == 0)) && map == map) && map == map) && \result + 1 <= 0) && \valid[map] == 1) && map == map) && (\exists ULTIMATE.start_aws_hash_table_find_harness_~#\old_byte~0#1.base : int, ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base : int :: (((((((!(ULTIMATE.start_aws_hash_table_find_harness_~#\old_byte~0#1.base == size_in_bytes) && !(ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base == map)) && !(ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base == ULTIMATE.start_aws_hash_table_find_harness_~#\old_byte~0#1.base)) && \valid[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base] == 1) && !(ULTIMATE.start_aws_hash_table_find_harness_~#\old_byte~0#1.base == elemsize)) && !(ULTIMATE.start_aws_hash_table_find_harness_~#\old_byte~0#1.base == map)) && !(ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base == elemsize)) && \valid[ULTIMATE.start_aws_hash_table_find_harness_~#\old_byte~0#1.base] == 1) && !(ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base == size_in_bytes))) && (!(map == 0) || !(map == 0))) && #memory_$Pointer$[map][map] + 1 < map) && !(storage == elemsize)) && map == 0) && !(size_in_bytes == map)) && !(\result == 0)) && unknown-#StackHeapBarrier-unknown + 1 <= map) && !(#memory_$Pointer$[map][map] == 0)) && !(size_in_bytes == elemsize)) && \result + 1 <= 0) && \valid[size_in_bytes] == 1) && !(storage == size_in_bytes)) && \valid[storage] == 1) && map == map) && !(map == elemsize) [2021-11-22 20:11:06,308 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((((((((((\result + 1 <= 0 && b == 24) && (unknown-#memory_int-unknown[#memory_$Pointer$[map][map]][40] * -1 + 8) / -18446744073709551616 <= unknown-#memory_int-unknown[#memory_$Pointer$[map][map]][40] / 18446744073709551616) && #memory_$Pointer$[map][map] + 1 < elemsize) && elemsize == 0) && map == map) && map == #memory_$Pointer$[map][map]) && map == map) && #memory_$Pointer$[map][map] < unknown-#StackHeapBarrier-unknown) && #memory_$Pointer$[map][map] == 0) && size_in_bytes == r) && #memory_$Pointer$[map][map] == map) && r == elemsize) && ((((((elemsize + 1 < map && size_in_bytes < storage) && size_in_bytes + 1 < map) || ((size_in_bytes < storage && size_in_bytes + 1 < elemsize) && size_in_bytes + 1 < map)) || ((elemsize + 1 < map && elemsize + 1 < size_in_bytes) && elemsize < storage)) || (((((((2 + #memory_$Pointer$[map][map] < elemsize && 2 + #memory_$Pointer$[map][map] < size_in_bytes) && 2 < elemsize) && 2 + #memory_$Pointer$[map][map] < map) && 2 < map) && #memory_$Pointer$[map][map] + 1 < storage) && 1 < storage) && 2 < size_in_bytes)) || map < storage)) && \valid[map] == 1) && map == map) && \valid[#memory_$Pointer$[map][map]] == 1) && state == #memory_$Pointer$[map][map]) && (\exists ULTIMATE.start_aws_hash_table_find_harness_~#\old_byte~0#1.base : int, ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base : int :: (((((((!(ULTIMATE.start_aws_hash_table_find_harness_~#\old_byte~0#1.base == size_in_bytes) && !(ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base == map)) && !(ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base == ULTIMATE.start_aws_hash_table_find_harness_~#\old_byte~0#1.base)) && \valid[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base] == 1) && !(ULTIMATE.start_aws_hash_table_find_harness_~#\old_byte~0#1.base == elemsize)) && !(ULTIMATE.start_aws_hash_table_find_harness_~#\old_byte~0#1.base == map)) && !(ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base == elemsize)) && \valid[ULTIMATE.start_aws_hash_table_find_harness_~#\old_byte~0#1.base] == 1) && !(ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base == size_in_bytes))) && elemsize == r) && unknown-#memory_int-unknown[state][40 + state] == a) && !(storage == elemsize)) && map == 0) && 1 < elemsize) && !(size_in_bytes == map)) && required_bytes == size_in_bytes) && #memory_$Pointer$[map][map] + 1 < size_in_bytes) && !(\result == 0)) && #memory_$Pointer$[map][map] == state) && size_in_bytes == 0) && !(size_in_bytes == elemsize)) && !(map == 0)) && \valid[size_in_bytes] == 1) && !(storage == size_in_bytes)) && num_entries % 18446744073709551616 <= 8) && \valid[storage] == 1) && map == map) && size_in_bytes == required_bytes) && 0 < unknown-#StackHeapBarrier-unknown) && !(map == elemsize)) && 1 < size_in_bytes) && unknown-#StackHeapBarrier-unknown < map [2021-11-22 20:11:06,309 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((!(map == 0) && map == map) && map == map) && #memory_$Pointer$[map][map] == 0) && map == map) && (!(map == 0) || !(map == 0))) && !(\result == 0)) && #memory_$Pointer$[map][map] == 0) && map == map [2021-11-22 20:11:06,309 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((!(map == 0) && map == map) && map == map) && #memory_$Pointer$[map][map] == 0) && #memory_$Pointer$[map][map] == 0) && #memory_$Pointer$[map][map] == 0) && map == map) && (!(map == 0) || !(map == 0))) && !(\result == 0)) && #memory_$Pointer$[map][map] == 0) && map == map [2021-11-22 20:11:06,310 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((!(map == 0) && map == map) && \result == 0) && map == map) && !(\result == 0) [2021-11-22 20:11:06,310 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((!(map == 0) && map == map) && \result == 0) && map == map) && !(\result == 0) [2021-11-22 20:11:06,311 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((!(map == 0) && map == map) && \result == 0) && map == map) && !(\result == 0) [2021-11-22 20:11:06,850 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-11-22 20:11:06,850 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-22 20:11:06,851 INFO L158 Benchmark]: Toolchain (without parser) took 259106.69ms. Allocated memory was 94.4MB in the beginning and 679.5MB in the end (delta: 585.1MB). Free memory was 57.0MB in the beginning and 322.7MB in the end (delta: -265.7MB). Peak memory consumption was 460.7MB. Max. memory is 16.1GB. [2021-11-22 20:11:06,851 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 94.4MB. Free memory was 53.7MB in the beginning and 53.7MB in the end (delta: 70.0kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-22 20:11:06,851 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2391.78ms. Allocated memory was 94.4MB in the beginning and 172.0MB in the end (delta: 77.6MB). Free memory was 56.8MB in the beginning and 74.1MB in the end (delta: -17.4MB). Peak memory consumption was 64.6MB. Max. memory is 16.1GB. [2021-11-22 20:11:06,851 INFO L158 Benchmark]: Boogie Procedure Inliner took 177.71ms. Allocated memory is still 172.0MB. Free memory was 74.1MB in the beginning and 104.4MB in the end (delta: -30.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-22 20:11:06,851 INFO L158 Benchmark]: Boogie Preprocessor took 117.03ms. Allocated memory is still 172.0MB. Free memory was 104.4MB in the beginning and 92.9MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-11-22 20:11:06,851 INFO L158 Benchmark]: RCFGBuilder took 1727.15ms. Allocated memory was 172.0MB in the beginning and 216.0MB in the end (delta: 44.0MB). Free memory was 92.9MB in the beginning and 131.9MB in the end (delta: -39.0MB). Peak memory consumption was 43.3MB. Max. memory is 16.1GB. [2021-11-22 20:11:06,852 INFO L158 Benchmark]: TraceAbstraction took 254056.96ms. Allocated memory was 216.0MB in the beginning and 679.5MB in the end (delta: 463.5MB). Free memory was 130.9MB in the beginning and 314.1MB in the end (delta: -183.2MB). Peak memory consumption was 393.5MB. Max. memory is 16.1GB. [2021-11-22 20:11:06,852 INFO L158 Benchmark]: Witness Printer took 631.43ms. Allocated memory is still 679.5MB. Free memory was 314.1MB in the beginning and 322.7MB in the end (delta: -8.6MB). Peak memory consumption was 134.0MB. Max. memory is 16.1GB. [2021-11-22 20:11:06,852 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 94.4MB. Free memory was 53.7MB in the beginning and 53.7MB in the end (delta: 70.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2391.78ms. Allocated memory was 94.4MB in the beginning and 172.0MB in the end (delta: 77.6MB). Free memory was 56.8MB in the beginning and 74.1MB in the end (delta: -17.4MB). Peak memory consumption was 64.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 177.71ms. Allocated memory is still 172.0MB. Free memory was 74.1MB in the beginning and 104.4MB in the end (delta: -30.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 117.03ms. Allocated memory is still 172.0MB. Free memory was 104.4MB in the beginning and 92.9MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * RCFGBuilder took 1727.15ms. Allocated memory was 172.0MB in the beginning and 216.0MB in the end (delta: 44.0MB). Free memory was 92.9MB in the beginning and 131.9MB in the end (delta: -39.0MB). Peak memory consumption was 43.3MB. Max. memory is 16.1GB. * TraceAbstraction took 254056.96ms. Allocated memory was 216.0MB in the beginning and 679.5MB in the end (delta: 463.5MB). Free memory was 130.9MB in the beginning and 314.1MB in the end (delta: -183.2MB). Peak memory consumption was 393.5MB. Max. memory is 16.1GB. * Witness Printer took 631.43ms. Allocated memory is still 679.5MB. Free memory was 314.1MB in the beginning and 322.7MB in the end (delta: -8.6MB). Peak memory consumption was 134.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_62,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_62,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_62,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_62,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_63,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_63,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_63,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_63,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_62,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_62,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_62,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_62,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_63,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_63,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_63,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_63,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_63,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_63,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_63,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_63,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_62,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_62,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_62,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_62,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base_24,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base_24,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base_24,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base_24,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0#1.base_19,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 305 locations, 18 error locations. Started 1 CEGAR loops. OverallTime: 253.8s, OverallIterations: 24, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 10.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 5.8s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 12776 SdHoareTripleChecker+Valid, 4.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 12776 mSDsluCounter, 41829 SdHoareTripleChecker+Invalid, 3.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 1107 IncrementalHoareTripleChecker+Unchecked, 32886 mSDsCounter, 444 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4371 IncrementalHoareTripleChecker+Invalid, 5922 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 444 mSolverCounterUnsat, 8943 mSDtfsCounter, 4371 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 962 GetRequests, 674 SyntacticMatches, 1 SemanticMatches, 287 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1707 ImplicationChecksByTransitivity, 8.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=471occurred in iteration=15, InterpolantAutomatonStates: 252, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 24 MinimizatonAttempts, 2946 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 88 LocationsWithAnnotation, 88 PreInvPairs, 117 NumberOfFragments, 3247 HoareAnnotationTreeSize, 88 FomulaSimplifications, 187 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 88 FomulaSimplificationsInter, 10882 FormulaSimplificationTreeSizeReductionInter, 5.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.7s SsaConstructionTime, 196.4s SatisfiabilityAnalysisTime, 36.4s InterpolantComputationTime, 2242 NumberOfCodeBlocks, 2242 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 2218 ConstructedInterpolants, 163 QuantifiedInterpolants, 22646 SizeOfPredicates, 357 NumberOfNonLiveVariables, 20643 ConjunctsInSsa, 1632 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 18 specifications checked. All of them hold - InvariantResult [Line: 2613]: Loop Invariant [2021-11-22 20:11:06,893 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0#1.base_19,QUANTIFIED] [2021-11-22 20:11:06,894 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0#1.base_19,QUANTIFIED] [2021-11-22 20:11:06,894 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0#1.base_19,QUANTIFIED] [2021-11-22 20:11:06,894 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0#1.base_19,QUANTIFIED] Derived loop invariant: ((((((((((((((((((\result + 1 <= 0 && map == map) && unknown-#StackHeapBarrier-unknown < required_bytes) && !(required_bytes == map)) && \result + 1 <= 0) && \valid[map] == 1) && map == map) && !(required_bytes == elemsize)) && map == 0) && required_bytes == required_bytes) && \valid[elemsize] == 1) && unknown-#StackHeapBarrier-unknown + 1 <= map) && \valid[required_bytes] == 1) && \result + 1 <= 0) && num_entries % 18446744073709551616 <= 8) && 0 < unknown-#StackHeapBarrier-unknown) && !(map == elemsize)) && (\exists v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0#1.base_19 : int :: \valid[v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0#1.base_19] == 0)) && max_table_entries == 8) || ((((((((((((((((((((((((((((b == 24 && required_bytes == required_bytes) && required_bytes == r) && elemsize == 0) && map == map) && unknown-#StackHeapBarrier-unknown < required_bytes) && !(required_bytes == map)) && num_entries == a) && required_bytes == r) && r == elemsize) && \valid[map] == 1) && map == map) && required_bytes == 0) && elemsize == r) && !(required_bytes == elemsize)) && map == 0) && required_bytes == required_bytes) && \valid[elemsize] == 1) && unknown-#StackHeapBarrier-unknown + 1 <= map) && 24 * num_entries == unknown-#memory_int-unknown[elemsize][elemsize]) && 29629528 + unknown-#memory_int-unknown[required_bytes][required_bytes] == unknown-#memory_int-unknown[elemsize][0]) && a == unknown-#memory_int-unknown[elemsize][0]) && \valid[required_bytes] == 1) && num_entries % 18446744073709551616 <= 8) && b + 29629528 == 0) && 0 < unknown-#StackHeapBarrier-unknown) && !(map == elemsize)) && (\exists v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0#1.base_19 : int :: \valid[v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0#1.base_19] == 0)) && max_table_entries == 8) - InvariantResult [Line: 7331]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 9136]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2497]: Loop Invariant [2021-11-22 20:11:06,895 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_62,QUANTIFIED] [2021-11-22 20:11:06,895 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_62,QUANTIFIED] [2021-11-22 20:11:06,896 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_62,QUANTIFIED] [2021-11-22 20:11:06,896 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_62,QUANTIFIED] Derived loop invariant: (((((((((((((((((\result + 1 <= 0 && map == map) && unknown-#StackHeapBarrier-unknown < required_bytes) && (\exists v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_62 : int :: \valid[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_62] == 0)) && !(required_bytes == map)) && \valid[map] == 1) && map == map) && !(required_bytes == elemsize)) && map == 0) && \result + 1 <= 0) && required_bytes == required_bytes) && \valid[elemsize] == 1) && \valid[required_bytes] == 1) && num_entries % 18446744073709551616 <= 8) && 0 < unknown-#StackHeapBarrier-unknown) && !(map == elemsize)) && unknown-#StackHeapBarrier-unknown < map) && max_table_entries == 8) || (((((((((((((((((((((((b == 24 && required_bytes == required_bytes) && elemsize == 0) && map == map) && unknown-#StackHeapBarrier-unknown < required_bytes) && (\exists v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_62 : int :: \valid[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_62] == 0)) && !(required_bytes == map)) && num_entries == a) && r == elemsize) && \valid[map] == 1) && map == map) && required_bytes == 0) && elemsize == r) && !(required_bytes == elemsize)) && map == 0) && required_bytes == required_bytes) && \valid[elemsize] == 1) && 24 * num_entries == unknown-#memory_int-unknown[elemsize][elemsize]) && \valid[required_bytes] == 1) && num_entries % 18446744073709551616 <= 8) && 0 < unknown-#StackHeapBarrier-unknown) && !(map == elemsize)) && unknown-#StackHeapBarrier-unknown < map) && max_table_entries == 8) - InvariantResult [Line: 9330]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 7369]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 7280]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 238]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2626]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2626]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 9082]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 266]: Loop Invariant Derived loop invariant: (((((map == map && \valid[map] == 1) && map == map) && map == 0) && unknown-#StackHeapBarrier-unknown + 1 <= map) && 0 < unknown-#StackHeapBarrier-unknown) && max_table_entries == 8 - InvariantResult [Line: 6837]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1988]: Loop Invariant [2021-11-22 20:11:06,898 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,898 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,898 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,898 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,898 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,899 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:11:06,899 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:11:06,899 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,899 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,899 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,899 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,900 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_63,QUANTIFIED] [2021-11-22 20:11:06,900 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_63,QUANTIFIED] [2021-11-22 20:11:06,900 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,900 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,900 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] [2021-11-22 20:11:06,900 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] [2021-11-22 20:11:06,900 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] [2021-11-22 20:11:06,900 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] [2021-11-22 20:11:06,901 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] [2021-11-22 20:11:06,901 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] [2021-11-22 20:11:06,901 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] [2021-11-22 20:11:06,901 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] [2021-11-22 20:11:06,901 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] [2021-11-22 20:11:06,901 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] [2021-11-22 20:11:06,901 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,901 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:11:06,902 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,902 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,902 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,903 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,903 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,903 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,903 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:11:06,903 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:11:06,903 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,904 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,904 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,904 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,904 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_63,QUANTIFIED] [2021-11-22 20:11:06,904 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_63,QUANTIFIED] [2021-11-22 20:11:06,904 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,904 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,905 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] [2021-11-22 20:11:06,905 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] [2021-11-22 20:11:06,905 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] [2021-11-22 20:11:06,905 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] [2021-11-22 20:11:06,905 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] [2021-11-22 20:11:06,905 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] [2021-11-22 20:11:06,905 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] [2021-11-22 20:11:06,905 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] [2021-11-22 20:11:06,906 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] [2021-11-22 20:11:06,906 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] [2021-11-22 20:11:06,906 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,906 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:11:06,906 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((\result + 1 <= 0 && b == 24) && (unknown-#memory_int-unknown[#memory_$Pointer$[map][map]][40] * -1 + 8) / -18446744073709551616 <= unknown-#memory_int-unknown[#memory_$Pointer$[map][map]][40] / 18446744073709551616) && #memory_$Pointer$[map][map] + 1 < elemsize) && elemsize == 0) && map == map) && map == #memory_$Pointer$[map][map]) && map == map) && #memory_$Pointer$[map][map] < unknown-#StackHeapBarrier-unknown) && #memory_$Pointer$[map][map] == 0) && #memory_$Pointer$[map][map] == map) && r == elemsize) && !(rval == map)) && ((((((elemsize + 1 < map && size_in_bytes < storage) && size_in_bytes + 1 < map) || ((size_in_bytes < storage && size_in_bytes + 1 < elemsize) && size_in_bytes + 1 < map)) || ((elemsize + 1 < map && elemsize + 1 < size_in_bytes) && elemsize < storage)) || (((((((2 + #memory_$Pointer$[map][map] < elemsize && 2 + #memory_$Pointer$[map][map] < size_in_bytes) && 2 < elemsize) && 2 + #memory_$Pointer$[map][map] < map) && 2 < map) && #memory_$Pointer$[map][map] + 1 < storage) && 1 < storage) && 2 < size_in_bytes)) || map < storage)) && \valid[map] == 1) && map == map) && (\exists v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_63 : int :: !(v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_63 == elemsize) && \valid[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_63] == 0)) && \valid[#memory_$Pointer$[map][map]] == 1) && state == #memory_$Pointer$[map][map]) && (\exists ULTIMATE.start_aws_hash_table_find_harness_~#\old_byte~0#1.base : int, ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base : int :: (((((((!(ULTIMATE.start_aws_hash_table_find_harness_~#\old_byte~0#1.base == size_in_bytes) && !(ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base == map)) && !(ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base == ULTIMATE.start_aws_hash_table_find_harness_~#\old_byte~0#1.base)) && \valid[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base] == 1) && !(ULTIMATE.start_aws_hash_table_find_harness_~#\old_byte~0#1.base == elemsize)) && !(ULTIMATE.start_aws_hash_table_find_harness_~#\old_byte~0#1.base == map)) && !(ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base == elemsize)) && \valid[ULTIMATE.start_aws_hash_table_find_harness_~#\old_byte~0#1.base] == 1) && !(ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base == size_in_bytes))) && elemsize == r) && unknown-#memory_int-unknown[state][40 + state] == a) && !(storage == elemsize)) && map == 0) && 1 < elemsize) && !(size_in_bytes == map)) && required_bytes == size_in_bytes) && #memory_$Pointer$[map][map] + 1 < size_in_bytes) && !(\result == 0)) && unknown-#StackHeapBarrier-unknown + 1 <= map) && #memory_$Pointer$[map][map] == state) && size_in_bytes == 0) && !(#memory_$Pointer$[map][map] == 0)) && !(size_in_bytes == elemsize)) && \valid[size_in_bytes] == 1) && !(storage == size_in_bytes)) && num_entries % 18446744073709551616 <= 8) && \valid[storage] == 1) && map == map) && size_in_bytes == required_bytes) && 0 < unknown-#StackHeapBarrier-unknown) && !(map == elemsize)) && 1 < size_in_bytes - InvariantResult [Line: 1988]: Loop Invariant [2021-11-22 20:11:06,907 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0#1.base_19,QUANTIFIED] [2021-11-22 20:11:06,907 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0#1.base_19,QUANTIFIED] Derived loop invariant: (((((((((((((((\result + 1 <= 0 && map == map) && unknown-#StackHeapBarrier-unknown < required_bytes) && !(required_bytes == map)) && \valid[map] == 1) && map == map) && !(required_bytes == elemsize)) && map == 0) && required_bytes == required_bytes) && \valid[elemsize] == 1) && unknown-#StackHeapBarrier-unknown + 1 <= map) && \valid[required_bytes] == 1) && num_entries % 18446744073709551616 <= 8) && 0 < unknown-#StackHeapBarrier-unknown) && !(map == elemsize)) && (\exists v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0#1.base_19 : int :: \valid[v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0#1.base_19] == 0)) && max_table_entries == 8 - InvariantResult [Line: 239]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1988]: Loop Invariant [2021-11-22 20:11:06,908 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_62,QUANTIFIED] [2021-11-22 20:11:06,908 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_62,QUANTIFIED] Derived loop invariant: (((((((((((((((\result + 1 <= 0 && map == map) && unknown-#StackHeapBarrier-unknown < required_bytes) && (\exists v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_62 : int :: \valid[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_62] == 0)) && !(required_bytes == map)) && \valid[map] == 1) && map == map) && !(required_bytes == elemsize)) && map == 0) && required_bytes == required_bytes) && \valid[elemsize] == 1) && unknown-#StackHeapBarrier-unknown + 1 <= map) && \valid[required_bytes] == 1) && num_entries % 18446744073709551616 <= 8) && 0 < unknown-#StackHeapBarrier-unknown) && !(map == elemsize)) && max_table_entries == 8 - InvariantResult [Line: 238]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2626]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 9999]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 253]: Loop Invariant [2021-11-22 20:11:06,909 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_62,QUANTIFIED] [2021-11-22 20:11:06,909 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_62,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((b == 24 && required_bytes == required_bytes) && elemsize == 0) && map == map) && unknown-#StackHeapBarrier-unknown < required_bytes) && (\exists v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_62 : int :: \valid[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_62] == 0)) && !(required_bytes == map)) && num_entries == a) && r == elemsize) && \valid[map] == 1) && map == map) && required_bytes == 0) && elemsize == r) && !(required_bytes == elemsize)) && map == 0) && required_bytes == required_bytes) && \valid[elemsize] == 1) && unknown-#StackHeapBarrier-unknown + 1 <= map) && \valid[required_bytes] == 1) && num_entries % 18446744073709551616 <= 8) && 0 < unknown-#StackHeapBarrier-unknown) && !(map == elemsize)) && max_table_entries == 8 - InvariantResult [Line: 9999]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 9999]: Loop Invariant Derived loop invariant: (((!(map == 0) && map == map) && \result == 0) && map == map) && !(\result == 0) - InvariantResult [Line: 239]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 248]: Loop Invariant [2021-11-22 20:11:06,910 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0#1.base_19,QUANTIFIED] [2021-11-22 20:11:06,910 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0#1.base_19,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((((((b == 24 && required_bytes == required_bytes) && required_bytes == r) && elemsize == 0) && map == map) && unknown-#StackHeapBarrier-unknown < required_bytes) && !(required_bytes == map)) && num_entries == a) && required_bytes == r) && r == elemsize) && \valid[map] == 1) && map == map) && required_bytes == 0) && elemsize == r) && !(required_bytes == elemsize)) && map == 0) && required_bytes == required_bytes) && \valid[elemsize] == 1) && unknown-#StackHeapBarrier-unknown + 1 <= map) && 24 * num_entries == unknown-#memory_int-unknown[elemsize][elemsize]) && a == unknown-#memory_int-unknown[elemsize][0]) && \valid[required_bytes] == 1) && num_entries % 18446744073709551616 <= 8) && b + 29629528 == 0) && 0 < unknown-#StackHeapBarrier-unknown) && !(map == elemsize)) && (\exists v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0#1.base_19 : int :: \valid[v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0#1.base_19] == 0)) && max_table_entries == 8 - InvariantResult [Line: 9103]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 9999]: Loop Invariant Derived loop invariant: (((!(map == 0) && map == map) && \result == 0) && map == map) && !(\result == 0) - InvariantResult [Line: 248]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 238]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 262]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 239]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 7348]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2626]: Loop Invariant Derived loop invariant: (((((((cond == 1 && map == map) && \valid[map] == 1) && map == map) && map == 0) && unknown-#StackHeapBarrier-unknown + 1 <= map) && num_entries % 18446744073709551616 <= 8) && 0 < unknown-#StackHeapBarrier-unknown) && max_table_entries == 8 - InvariantResult [Line: 238]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 266]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2626]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2497]: Loop Invariant [2021-11-22 20:11:06,912 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,912 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,912 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,912 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,913 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,913 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:11:06,913 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:11:06,913 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,913 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,913 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,914 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,914 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_63,QUANTIFIED] [2021-11-22 20:11:06,914 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_63,QUANTIFIED] [2021-11-22 20:11:06,915 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,915 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,915 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] [2021-11-22 20:11:06,915 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] [2021-11-22 20:11:06,915 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] [2021-11-22 20:11:06,915 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] [2021-11-22 20:11:06,915 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] [2021-11-22 20:11:06,916 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] [2021-11-22 20:11:06,916 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] [2021-11-22 20:11:06,916 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] [2021-11-22 20:11:06,916 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] [2021-11-22 20:11:06,916 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] [2021-11-22 20:11:06,917 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,917 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:11:06,917 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,918 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,918 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,918 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,918 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,919 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,919 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:11:06,919 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:11:06,919 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,919 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,919 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,920 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,920 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_63,QUANTIFIED] [2021-11-22 20:11:06,920 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_63,QUANTIFIED] [2021-11-22 20:11:06,920 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,920 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,920 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] [2021-11-22 20:11:06,920 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] [2021-11-22 20:11:06,921 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] [2021-11-22 20:11:06,921 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] [2021-11-22 20:11:06,921 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] [2021-11-22 20:11:06,921 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] [2021-11-22 20:11:06,921 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] [2021-11-22 20:11:06,921 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] [2021-11-22 20:11:06,921 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] [2021-11-22 20:11:06,921 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] [2021-11-22 20:11:06,922 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,922 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:11:06,922 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((\result + 1 <= 0 && b == 24) && (unknown-#memory_int-unknown[#memory_$Pointer$[map][map]][40] * -1 + 8) / -18446744073709551616 <= unknown-#memory_int-unknown[#memory_$Pointer$[map][map]][40] / 18446744073709551616) && #memory_$Pointer$[map][map] + 1 < elemsize) && elemsize == 0) && map == map) && map == #memory_$Pointer$[map][map]) && map == map) && #memory_$Pointer$[map][map] < unknown-#StackHeapBarrier-unknown) && #memory_$Pointer$[map][map] == 0) && #memory_$Pointer$[map][map] == map) && r == elemsize) && !(rval == map)) && ((((((elemsize + 1 < map && size_in_bytes < storage) && size_in_bytes + 1 < map) || ((size_in_bytes < storage && size_in_bytes + 1 < elemsize) && size_in_bytes + 1 < map)) || ((elemsize + 1 < map && elemsize + 1 < size_in_bytes) && elemsize < storage)) || (((((((2 + #memory_$Pointer$[map][map] < elemsize && 2 + #memory_$Pointer$[map][map] < size_in_bytes) && 2 < elemsize) && 2 + #memory_$Pointer$[map][map] < map) && 2 < map) && #memory_$Pointer$[map][map] + 1 < storage) && 1 < storage) && 2 < size_in_bytes)) || map < storage)) && \valid[map] == 1) && map == map) && (\exists v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_63 : int :: !(v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_63 == elemsize) && \valid[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_63] == 0)) && \valid[#memory_$Pointer$[map][map]] == 1) && state == #memory_$Pointer$[map][map]) && (\exists ULTIMATE.start_aws_hash_table_find_harness_~#\old_byte~0#1.base : int, ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base : int :: (((((((!(ULTIMATE.start_aws_hash_table_find_harness_~#\old_byte~0#1.base == size_in_bytes) && !(ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base == map)) && !(ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base == ULTIMATE.start_aws_hash_table_find_harness_~#\old_byte~0#1.base)) && \valid[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base] == 1) && !(ULTIMATE.start_aws_hash_table_find_harness_~#\old_byte~0#1.base == elemsize)) && !(ULTIMATE.start_aws_hash_table_find_harness_~#\old_byte~0#1.base == map)) && !(ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base == elemsize)) && \valid[ULTIMATE.start_aws_hash_table_find_harness_~#\old_byte~0#1.base] == 1) && !(ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base == size_in_bytes))) && elemsize == r) && unknown-#memory_int-unknown[state][40 + state] == a) && !(storage == elemsize)) && map == 0) && \result + 1 <= 0) && 1 < elemsize) && !(size_in_bytes == map)) && required_bytes == size_in_bytes) && #memory_$Pointer$[map][map] + 1 < size_in_bytes) && !(\result == 0)) && #memory_$Pointer$[map][map] == state) && size_in_bytes == 0) && !(#memory_$Pointer$[map][map] == 0)) && !(size_in_bytes == elemsize)) && \valid[size_in_bytes] == 1) && !(storage == size_in_bytes)) && num_entries % 18446744073709551616 <= 8) && \valid[storage] == 1) && map == map) && size_in_bytes == required_bytes) && 0 < unknown-#StackHeapBarrier-unknown) && !(map == elemsize)) && 1 < size_in_bytes) && unknown-#StackHeapBarrier-unknown < map - InvariantResult [Line: 9988]: Loop Invariant [2021-11-22 20:11:06,923 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:11:06,923 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,923 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:11:06,923 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,924 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:11:06,924 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,924 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:11:06,924 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (((((((((!(map == 0) && map == map) && map == map) && #memory_$Pointer$[map][map] == 0) && #memory_$Pointer$[map][map] == 0) && #memory_$Pointer$[map][map] == 0) && map == map) && (!(map == 0) || !(map == 0))) && !(\result == 0)) && #memory_$Pointer$[map][map] == 0) && map == map - InvariantResult [Line: 238]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 9999]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 9988]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 253]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 239]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 9999]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 238]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 9303]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2586]: Loop Invariant [2021-11-22 20:11:06,927 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,927 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,927 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,927 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,927 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,928 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:11:06,928 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:11:06,928 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,928 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,928 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,928 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,929 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_63,QUANTIFIED] [2021-11-22 20:11:06,929 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_63,QUANTIFIED] [2021-11-22 20:11:06,929 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,929 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,929 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] [2021-11-22 20:11:06,930 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] [2021-11-22 20:11:06,930 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] [2021-11-22 20:11:06,930 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] [2021-11-22 20:11:06,930 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] [2021-11-22 20:11:06,930 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] [2021-11-22 20:11:06,930 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] [2021-11-22 20:11:06,930 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] [2021-11-22 20:11:06,930 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] [2021-11-22 20:11:06,931 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] [2021-11-22 20:11:06,931 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,931 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:11:06,931 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,932 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,932 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,932 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,932 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,932 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,933 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:11:06,933 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:11:06,933 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,933 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,933 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,933 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,933 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_63,QUANTIFIED] [2021-11-22 20:11:06,934 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_63,QUANTIFIED] [2021-11-22 20:11:06,934 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,934 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,934 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] [2021-11-22 20:11:06,934 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] [2021-11-22 20:11:06,934 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] [2021-11-22 20:11:06,934 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] [2021-11-22 20:11:06,935 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] [2021-11-22 20:11:06,935 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] [2021-11-22 20:11:06,935 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] [2021-11-22 20:11:06,935 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] [2021-11-22 20:11:06,935 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] [2021-11-22 20:11:06,935 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] [2021-11-22 20:11:06,935 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,935 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:11:06,936 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((\result + 1 <= 0 && b == 24) && (unknown-#memory_int-unknown[#memory_$Pointer$[map][map]][40] * -1 + 8) / -18446744073709551616 <= unknown-#memory_int-unknown[#memory_$Pointer$[map][map]][40] / 18446744073709551616) && #memory_$Pointer$[map][map] + 1 < elemsize) && elemsize == 0) && map == map) && map == #memory_$Pointer$[map][map]) && map == map) && #memory_$Pointer$[map][map] < unknown-#StackHeapBarrier-unknown) && #memory_$Pointer$[map][map] == 0) && #memory_$Pointer$[map][map] == map) && r == elemsize) && !(rval == map)) && ((((((elemsize + 1 < map && size_in_bytes < storage) && size_in_bytes + 1 < map) || ((size_in_bytes < storage && size_in_bytes + 1 < elemsize) && size_in_bytes + 1 < map)) || ((elemsize + 1 < map && elemsize + 1 < size_in_bytes) && elemsize < storage)) || (((((((2 + #memory_$Pointer$[map][map] < elemsize && 2 + #memory_$Pointer$[map][map] < size_in_bytes) && 2 < elemsize) && 2 + #memory_$Pointer$[map][map] < map) && 2 < map) && #memory_$Pointer$[map][map] + 1 < storage) && 1 < storage) && 2 < size_in_bytes)) || map < storage)) && \valid[map] == 1) && map == map) && (\exists v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_63 : int :: !(v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_63 == elemsize) && \valid[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_63] == 0)) && \valid[#memory_$Pointer$[map][map]] == 1) && state == #memory_$Pointer$[map][map]) && (\exists ULTIMATE.start_aws_hash_table_find_harness_~#\old_byte~0#1.base : int, ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base : int :: (((((((!(ULTIMATE.start_aws_hash_table_find_harness_~#\old_byte~0#1.base == size_in_bytes) && !(ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base == map)) && !(ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base == ULTIMATE.start_aws_hash_table_find_harness_~#\old_byte~0#1.base)) && \valid[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base] == 1) && !(ULTIMATE.start_aws_hash_table_find_harness_~#\old_byte~0#1.base == elemsize)) && !(ULTIMATE.start_aws_hash_table_find_harness_~#\old_byte~0#1.base == map)) && !(ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base == elemsize)) && \valid[ULTIMATE.start_aws_hash_table_find_harness_~#\old_byte~0#1.base] == 1) && !(ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base == size_in_bytes))) && elemsize == r) && unknown-#memory_int-unknown[state][40 + state] == a) && !(storage == elemsize)) && map == 0) && \result + 1 <= 0) && 1 < elemsize) && !(size_in_bytes == map)) && required_bytes == size_in_bytes) && #memory_$Pointer$[map][map] + 1 < size_in_bytes) && !(\result == 0)) && #memory_$Pointer$[map][map] == state) && size_in_bytes == 0) && !(#memory_$Pointer$[map][map] == 0)) && !(size_in_bytes == elemsize)) && \valid[size_in_bytes] == 1) && !(storage == size_in_bytes)) && num_entries % 18446744073709551616 <= 8) && \valid[storage] == 1) && map == map) && \result + 1 <= 0) && size_in_bytes == required_bytes) && 0 < unknown-#StackHeapBarrier-unknown) && !(map == elemsize)) && 1 < size_in_bytes) && unknown-#StackHeapBarrier-unknown < map - InvariantResult [Line: 9129]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 239]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 9988]: Loop Invariant [2021-11-22 20:11:06,937 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:11:06,937 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,937 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:11:06,938 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (((((((!(map == 0) && map == map) && map == map) && #memory_$Pointer$[map][map] == 0) && map == map) && (!(map == 0) || !(map == 0))) && !(\result == 0)) && #memory_$Pointer$[map][map] == 0) && map == map - InvariantResult [Line: 2626]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 9136]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1988]: Loop Invariant [2021-11-22 20:11:06,938 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,938 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,938 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,939 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,939 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,939 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:11:06,939 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:11:06,939 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,939 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,939 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,940 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,940 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,940 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,940 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] [2021-11-22 20:11:06,940 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] [2021-11-22 20:11:06,940 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] [2021-11-22 20:11:06,940 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] [2021-11-22 20:11:06,941 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] [2021-11-22 20:11:06,941 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] [2021-11-22 20:11:06,942 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] [2021-11-22 20:11:06,942 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] [2021-11-22 20:11:06,942 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] [2021-11-22 20:11:06,942 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] [2021-11-22 20:11:06,942 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,942 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:11:06,943 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,943 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,943 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,944 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,944 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,944 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:11:06,944 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 20:11:06,944 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,944 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,944 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,945 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,945 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,945 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,945 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] [2021-11-22 20:11:06,945 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] [2021-11-22 20:11:06,945 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] [2021-11-22 20:11:06,945 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] [2021-11-22 20:11:06,945 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] [2021-11-22 20:11:06,946 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] [2021-11-22 20:11:06,946 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] [2021-11-22 20:11:06,946 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] [2021-11-22 20:11:06,946 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] [2021-11-22 20:11:06,946 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] [2021-11-22 20:11:06,947 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,947 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((\result + 1 <= 0 && b == 24) && (unknown-#memory_int-unknown[#memory_$Pointer$[map][map]][40] * -1 + 8) / -18446744073709551616 <= unknown-#memory_int-unknown[#memory_$Pointer$[map][map]][40] / 18446744073709551616) && #memory_$Pointer$[map][map] + 1 < elemsize) && elemsize == 0) && map == map) && map == #memory_$Pointer$[map][map]) && map == map) && #memory_$Pointer$[map][map] < unknown-#StackHeapBarrier-unknown) && #memory_$Pointer$[map][map] == 0) && size_in_bytes == r) && #memory_$Pointer$[map][map] == map) && r == elemsize) && ((((((elemsize + 1 < map && size_in_bytes < storage) && size_in_bytes + 1 < map) || ((size_in_bytes < storage && size_in_bytes + 1 < elemsize) && size_in_bytes + 1 < map)) || ((elemsize + 1 < map && elemsize + 1 < size_in_bytes) && elemsize < storage)) || (((((((2 + #memory_$Pointer$[map][map] < elemsize && 2 + #memory_$Pointer$[map][map] < size_in_bytes) && 2 < elemsize) && 2 + #memory_$Pointer$[map][map] < map) && 2 < map) && #memory_$Pointer$[map][map] + 1 < storage) && 1 < storage) && 2 < size_in_bytes)) || map < storage)) && \valid[map] == 1) && map == map) && \valid[#memory_$Pointer$[map][map]] == 1) && state == #memory_$Pointer$[map][map]) && (\exists ULTIMATE.start_aws_hash_table_find_harness_~#\old_byte~0#1.base : int, ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base : int :: (((((((!(ULTIMATE.start_aws_hash_table_find_harness_~#\old_byte~0#1.base == size_in_bytes) && !(ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base == map)) && !(ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base == ULTIMATE.start_aws_hash_table_find_harness_~#\old_byte~0#1.base)) && \valid[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base] == 1) && !(ULTIMATE.start_aws_hash_table_find_harness_~#\old_byte~0#1.base == elemsize)) && !(ULTIMATE.start_aws_hash_table_find_harness_~#\old_byte~0#1.base == map)) && !(ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base == elemsize)) && \valid[ULTIMATE.start_aws_hash_table_find_harness_~#\old_byte~0#1.base] == 1) && !(ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base == size_in_bytes))) && elemsize == r) && unknown-#memory_int-unknown[state][40 + state] == a) && !(storage == elemsize)) && map == 0) && 1 < elemsize) && !(size_in_bytes == map)) && required_bytes == size_in_bytes) && #memory_$Pointer$[map][map] + 1 < size_in_bytes) && !(\result == 0)) && #memory_$Pointer$[map][map] == state) && size_in_bytes == 0) && !(size_in_bytes == elemsize)) && !(map == 0)) && \valid[size_in_bytes] == 1) && !(storage == size_in_bytes)) && num_entries % 18446744073709551616 <= 8) && \valid[storage] == 1) && map == map) && size_in_bytes == required_bytes) && 0 < unknown-#StackHeapBarrier-unknown) && !(map == elemsize)) && 1 < size_in_bytes) && unknown-#StackHeapBarrier-unknown < map - InvariantResult [Line: 9999]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2626]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 10143]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2626]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 9999]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 9347]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 7280]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 238]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2586]: Loop Invariant [2021-11-22 20:11:06,948 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_62,QUANTIFIED] [2021-11-22 20:11:06,948 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_62,QUANTIFIED] [2021-11-22 20:11:06,949 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_62,QUANTIFIED] [2021-11-22 20:11:06,949 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_62,QUANTIFIED] Derived loop invariant: ((((((((((((((((((\result + 1 <= 0 && map == map) && unknown-#StackHeapBarrier-unknown < required_bytes) && (\exists v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_62 : int :: \valid[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_62] == 0)) && !(required_bytes == map)) && \valid[map] == 1) && map == map) && !(required_bytes == elemsize)) && map == 0) && \result + 1 <= 0) && required_bytes == required_bytes) && \valid[elemsize] == 1) && \valid[required_bytes] == 1) && num_entries % 18446744073709551616 <= 8) && \result + 1 <= 0) && 0 < unknown-#StackHeapBarrier-unknown) && !(map == elemsize)) && unknown-#StackHeapBarrier-unknown < map) && max_table_entries == 8) || (((((((((((((((((((((((b == 24 && required_bytes == required_bytes) && elemsize == 0) && map == map) && unknown-#StackHeapBarrier-unknown < required_bytes) && (\exists v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_62 : int :: \valid[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_62] == 0)) && !(required_bytes == map)) && num_entries == a) && r == elemsize) && \valid[map] == 1) && map == map) && required_bytes == 0) && elemsize == r) && !(required_bytes == elemsize)) && map == 0) && required_bytes == required_bytes) && \valid[elemsize] == 1) && 24 * num_entries == unknown-#memory_int-unknown[elemsize][elemsize]) && \valid[required_bytes] == 1) && num_entries % 18446744073709551616 <= 8) && 0 < unknown-#StackHeapBarrier-unknown) && !(map == elemsize)) && unknown-#StackHeapBarrier-unknown < map) && max_table_entries == 8) - InvariantResult [Line: 9391]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 6943]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2613]: Loop Invariant [2021-11-22 20:11:06,950 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] [2021-11-22 20:11:06,950 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] [2021-11-22 20:11:06,950 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] [2021-11-22 20:11:06,950 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] [2021-11-22 20:11:06,950 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] [2021-11-22 20:11:06,950 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] [2021-11-22 20:11:06,950 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] [2021-11-22 20:11:06,951 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] [2021-11-22 20:11:06,951 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] [2021-11-22 20:11:06,951 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] [2021-11-22 20:11:06,951 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,951 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,951 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] [2021-11-22 20:11:06,951 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] [2021-11-22 20:11:06,952 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] [2021-11-22 20:11:06,952 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] [2021-11-22 20:11:06,952 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] [2021-11-22 20:11:06,952 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] [2021-11-22 20:11:06,952 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] [2021-11-22 20:11:06,952 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] [2021-11-22 20:11:06,952 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] [2021-11-22 20:11:06,952 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] [2021-11-22 20:11:06,953 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,953 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (((((((((((((((((((((\result + 1 <= 0 && !(map == 0)) && map == map) && map == map) && \result + 1 <= 0) && \valid[map] == 1) && map == map) && (\exists ULTIMATE.start_aws_hash_table_find_harness_~#\old_byte~0#1.base : int, ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base : int :: (((((((!(ULTIMATE.start_aws_hash_table_find_harness_~#\old_byte~0#1.base == size_in_bytes) && !(ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base == map)) && !(ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base == ULTIMATE.start_aws_hash_table_find_harness_~#\old_byte~0#1.base)) && \valid[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base] == 1) && !(ULTIMATE.start_aws_hash_table_find_harness_~#\old_byte~0#1.base == elemsize)) && !(ULTIMATE.start_aws_hash_table_find_harness_~#\old_byte~0#1.base == map)) && !(ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base == elemsize)) && \valid[ULTIMATE.start_aws_hash_table_find_harness_~#\old_byte~0#1.base] == 1) && !(ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base == size_in_bytes))) && (!(map == 0) || !(map == 0))) && #memory_$Pointer$[map][map] + 1 < map) && !(storage == elemsize)) && map == 0) && !(size_in_bytes == map)) && !(\result == 0)) && unknown-#StackHeapBarrier-unknown + 1 <= map) && !(#memory_$Pointer$[map][map] == 0)) && !(size_in_bytes == elemsize)) && \result + 1 <= 0) && \valid[size_in_bytes] == 1) && !(storage == size_in_bytes)) && \valid[storage] == 1) && map == map) && !(map == elemsize) - InvariantResult [Line: 9129]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2626]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 262]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 6831]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 263]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 9988]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 239]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 10101]: Loop Invariant Derived loop invariant: ((((((!(map == 0) && map == map) && map == map) && map == map) && (!(map == 0) || !(map == 0))) && !(\result == 0)) && map == map) && \result + 1 <= 0 - InvariantResult [Line: 2626]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2626]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 7331]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2541]: Loop Invariant [2021-11-22 20:11:06,954 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] [2021-11-22 20:11:06,955 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] [2021-11-22 20:11:06,955 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] [2021-11-22 20:11:06,955 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] [2021-11-22 20:11:06,955 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] [2021-11-22 20:11:06,955 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] [2021-11-22 20:11:06,955 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] [2021-11-22 20:11:06,955 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] [2021-11-22 20:11:06,955 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] [2021-11-22 20:11:06,955 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] [2021-11-22 20:11:06,956 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,956 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,956 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] [2021-11-22 20:11:06,956 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] [2021-11-22 20:11:06,956 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] [2021-11-22 20:11:06,956 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] [2021-11-22 20:11:06,957 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] [2021-11-22 20:11:06,957 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] [2021-11-22 20:11:06,957 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] [2021-11-22 20:11:06,957 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] [2021-11-22 20:11:06,957 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_hash_table_find_harness_~#old_byte~0#1.base,QUANTIFIED] [2021-11-22 20:11:06,957 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base,QUANTIFIED] [2021-11-22 20:11:06,957 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 20:11:06,957 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((((((((((((((((((\result + 1 <= 0 && !(map == 0)) && map == map) && map == map) && \result + 1 <= 0) && \valid[map] == 1) && map == map) && (\exists ULTIMATE.start_aws_hash_table_find_harness_~#\old_byte~0#1.base : int, ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base : int :: (((((((!(ULTIMATE.start_aws_hash_table_find_harness_~#\old_byte~0#1.base == size_in_bytes) && !(ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base == map)) && !(ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base == ULTIMATE.start_aws_hash_table_find_harness_~#\old_byte~0#1.base)) && \valid[ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base] == 1) && !(ULTIMATE.start_aws_hash_table_find_harness_~#\old_byte~0#1.base == elemsize)) && !(ULTIMATE.start_aws_hash_table_find_harness_~#\old_byte~0#1.base == map)) && !(ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base == elemsize)) && \valid[ULTIMATE.start_aws_hash_table_find_harness_~#\old_byte~0#1.base] == 1) && !(ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base == size_in_bytes))) && (!(map == 0) || !(map == 0))) && #memory_$Pointer$[map][map] + 1 < map) && !(storage == elemsize)) && map == 0) && !(size_in_bytes == map)) && !(\result == 0)) && unknown-#StackHeapBarrier-unknown + 1 <= map) && !(#memory_$Pointer$[map][map] == 0)) && !(size_in_bytes == elemsize)) && \valid[size_in_bytes] == 1) && !(storage == size_in_bytes)) && \valid[storage] == 1) && map == map) && !(map == elemsize) - InvariantResult [Line: 10101]: Loop Invariant [2021-11-22 20:11:06,958 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base_24,QUANTIFIED] [2021-11-22 20:11:06,958 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base_24,QUANTIFIED] [2021-11-22 20:11:06,958 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0#1.base_19,QUANTIFIED] [2021-11-22 20:11:06,958 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base_24,QUANTIFIED] [2021-11-22 20:11:06,958 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base_24,QUANTIFIED] [2021-11-22 20:11:06,959 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0#1.base_19,QUANTIFIED] Derived loop invariant: (((((((!(map == 0) && map == map) && !(required_bytes == map)) && \valid[map] == 1) && map == map) && map == 0) && unknown-#StackHeapBarrier-unknown + 1 <= map) && \result + 1 <= 0) || ((((((((((((((map == map && unknown-#StackHeapBarrier-unknown < required_bytes) && !(required_bytes == map)) && \valid[map] == 1) && map == map) && required_bytes == 0) && map == 0) && (\exists v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base_24 : int :: !(v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base_24 == map) && 29629528 + unknown-#memory_int-unknown[required_bytes][required_bytes] == unknown-#memory_int-unknown[v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base_24][0])) && 24 * num_entries == 29629528 + unknown-#memory_int-unknown[required_bytes][required_bytes]) && \valid[required_bytes] == 1) && num_entries % 18446744073709551616 <= 8) && 0 < unknown-#StackHeapBarrier-unknown) && (\exists v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0#1.base_19 : int :: \valid[v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0#1.base_19] == 0)) && unknown-#StackHeapBarrier-unknown < map) && max_table_entries == 8) - InvariantResult [Line: 9999]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 9103]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2541]: Loop Invariant [2021-11-22 20:11:06,959 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0#1.base_19,QUANTIFIED] [2021-11-22 20:11:06,959 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0#1.base_19,QUANTIFIED] [2021-11-22 20:11:06,960 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0#1.base_19,QUANTIFIED] [2021-11-22 20:11:06,960 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0#1.base_19,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((((((((b == 24 && required_bytes == required_bytes) && required_bytes == r) && elemsize == 0) && map == map) && unknown-#StackHeapBarrier-unknown < required_bytes) && !(required_bytes == map)) && num_entries == a) && required_bytes == r) && r == elemsize) && \valid[map] == 1) && map == map) && required_bytes == 0) && elemsize == r) && !(required_bytes == elemsize)) && map == 0) && required_bytes == required_bytes) && \valid[elemsize] == 1) && unknown-#StackHeapBarrier-unknown + 1 <= map) && 24 * num_entries == unknown-#memory_int-unknown[elemsize][elemsize]) && 29629528 + unknown-#memory_int-unknown[required_bytes][required_bytes] == unknown-#memory_int-unknown[elemsize][0]) && a == unknown-#memory_int-unknown[elemsize][0]) && \valid[required_bytes] == 1) && num_entries % 18446744073709551616 <= 8) && b + 29629528 == 0) && 0 < unknown-#StackHeapBarrier-unknown) && !(map == elemsize)) && (\exists v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0#1.base_19 : int :: \valid[v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0#1.base_19] == 0)) && max_table_entries == 8) || (((((((((((((((((\result + 1 <= 0 && map == map) && unknown-#StackHeapBarrier-unknown < required_bytes) && !(required_bytes == map)) && \result + 1 <= 0) && \valid[map] == 1) && map == map) && !(required_bytes == elemsize)) && map == 0) && required_bytes == required_bytes) && \valid[elemsize] == 1) && unknown-#StackHeapBarrier-unknown + 1 <= map) && \valid[required_bytes] == 1) && num_entries % 18446744073709551616 <= 8) && 0 < unknown-#StackHeapBarrier-unknown) && !(map == elemsize)) && (\exists v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0#1.base_19 : int :: \valid[v_ULTIMATE.start___CPROVER_overflow_plus_~#c~0#1.base_19] == 0)) && max_table_entries == 8) - InvariantResult [Line: 7331]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 7348]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 9999]: Loop Invariant Derived loop invariant: (((!(map == 0) && map == map) && \result == 0) && map == map) && !(\result == 0) - InvariantResult [Line: 9988]: Loop Invariant Derived loop invariant: 0 RESULT: Ultimate proved your program to be correct! [2021-11-22 20:11:07,043 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE