./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/aws-c-common/aws_hash_table_eq_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9ad7fb26 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dded36d2-a5e3-4d93-9042-30748813ed17/bin/uautomizer-tBqnrhUYjU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dded36d2-a5e3-4d93-9042-30748813ed17/bin/uautomizer-tBqnrhUYjU/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dded36d2-a5e3-4d93-9042-30748813ed17/bin/uautomizer-tBqnrhUYjU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dded36d2-a5e3-4d93-9042-30748813ed17/bin/uautomizer-tBqnrhUYjU/config/AutomizerReach.xml -i ../../sv-benchmarks/c/aws-c-common/aws_hash_table_eq_harness.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dded36d2-a5e3-4d93-9042-30748813ed17/bin/uautomizer-tBqnrhUYjU/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dded36d2-a5e3-4d93-9042-30748813ed17/bin/uautomizer-tBqnrhUYjU --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 66d360c8c29bda7e5219dac4b14837aec8d465009822b05f671b68702d836670 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-9ad7fb2 [2021-11-02 23:15:24,774 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-02 23:15:24,776 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-02 23:15:24,811 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-02 23:15:24,812 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-02 23:15:24,813 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-02 23:15:24,815 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-02 23:15:24,817 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-02 23:15:24,819 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-02 23:15:24,820 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-02 23:15:24,821 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-02 23:15:24,823 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-02 23:15:24,823 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-02 23:15:24,825 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-02 23:15:24,826 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-02 23:15:24,828 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-02 23:15:24,829 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-02 23:15:24,830 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-02 23:15:24,833 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-02 23:15:24,844 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-02 23:15:24,847 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-02 23:15:24,851 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-02 23:15:24,853 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-02 23:15:24,854 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-02 23:15:24,866 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-02 23:15:24,867 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-02 23:15:24,867 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-02 23:15:24,868 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-02 23:15:24,869 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-02 23:15:24,870 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-02 23:15:24,870 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-02 23:15:24,871 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-02 23:15:24,872 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-02 23:15:24,873 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-02 23:15:24,874 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-02 23:15:24,875 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-02 23:15:24,875 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-02 23:15:24,876 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-02 23:15:24,876 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-02 23:15:24,877 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-02 23:15:24,878 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-02 23:15:24,882 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dded36d2-a5e3-4d93-9042-30748813ed17/bin/uautomizer-tBqnrhUYjU/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-02 23:15:24,926 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-02 23:15:24,928 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-02 23:15:24,929 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-02 23:15:24,929 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-02 23:15:24,930 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-02 23:15:24,931 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-02 23:15:24,931 INFO L138 SettingsManager]: * Use SBE=true [2021-11-02 23:15:24,931 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-02 23:15:24,932 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-02 23:15:24,932 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-02 23:15:24,933 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-02 23:15:24,933 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-02 23:15:24,933 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-02 23:15:24,934 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-02 23:15:24,934 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-02 23:15:24,934 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-02 23:15:24,934 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-02 23:15:24,934 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-02 23:15:24,935 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-02 23:15:24,935 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-02 23:15:24,935 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-02 23:15:24,935 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-02 23:15:24,936 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-02 23:15:24,936 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-02 23:15:24,936 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-02 23:15:24,936 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-02 23:15:24,937 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-02 23:15:24,937 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-02 23:15:24,937 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-02 23:15:24,938 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dded36d2-a5e3-4d93-9042-30748813ed17/bin/uautomizer-tBqnrhUYjU/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dded36d2-a5e3-4d93-9042-30748813ed17/bin/uautomizer-tBqnrhUYjU 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 -> 66d360c8c29bda7e5219dac4b14837aec8d465009822b05f671b68702d836670 [2021-11-02 23:15:25,190 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-02 23:15:25,228 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-02 23:15:25,231 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-02 23:15:25,232 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-02 23:15:25,233 INFO L275 PluginConnector]: CDTParser initialized [2021-11-02 23:15:25,234 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dded36d2-a5e3-4d93-9042-30748813ed17/bin/uautomizer-tBqnrhUYjU/../../sv-benchmarks/c/aws-c-common/aws_hash_table_eq_harness.i [2021-11-02 23:15:25,312 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dded36d2-a5e3-4d93-9042-30748813ed17/bin/uautomizer-tBqnrhUYjU/data/62e453e99/e720c2029b3a4e40ae5edba057a5c353/FLAG532376efd [2021-11-02 23:15:26,081 INFO L306 CDTParser]: Found 1 translation units. [2021-11-02 23:15:26,082 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dded36d2-a5e3-4d93-9042-30748813ed17/sv-benchmarks/c/aws-c-common/aws_hash_table_eq_harness.i [2021-11-02 23:15:26,147 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dded36d2-a5e3-4d93-9042-30748813ed17/bin/uautomizer-tBqnrhUYjU/data/62e453e99/e720c2029b3a4e40ae5edba057a5c353/FLAG532376efd [2021-11-02 23:15:26,308 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dded36d2-a5e3-4d93-9042-30748813ed17/bin/uautomizer-tBqnrhUYjU/data/62e453e99/e720c2029b3a4e40ae5edba057a5c353 [2021-11-02 23:15:26,314 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-02 23:15:26,315 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-02 23:15:26,316 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-02 23:15:26,316 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-02 23:15:26,323 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-02 23:15:26,324 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 11:15:26" (1/1) ... [2021-11-02 23:15:26,325 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@647aa6b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:15:26, skipping insertion in model container [2021-11-02 23:15:26,326 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 11:15:26" (1/1) ... [2021-11-02 23:15:26,336 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-02 23:15:26,465 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-02 23:15:26,802 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dded36d2-a5e3-4d93-9042-30748813ed17/sv-benchmarks/c/aws-c-common/aws_hash_table_eq_harness.i[4491,4504] [2021-11-02 23:15:26,810 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dded36d2-a5e3-4d93-9042-30748813ed17/sv-benchmarks/c/aws-c-common/aws_hash_table_eq_harness.i[4551,4564] [2021-11-02 23:15:26,838 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-02 23:15:26,845 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-02 23:15:27,881 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 23:15:27,882 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 23:15:27,882 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 23:15:27,883 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 23:15:27,884 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 23:15:27,905 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 23:15:27,906 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 23:15:27,908 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 23:15:27,908 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 23:15:27,910 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 23:15:27,919 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 23:15:27,920 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 23:15:27,921 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 23:15:28,407 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-02 23:15:28,409 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-02 23:15:28,413 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-02 23:15:28,451 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-02 23:15:28,453 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-02 23:15:28,454 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-02 23:15:28,455 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-02 23:15:28,455 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-02 23:15:28,456 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-02 23:15:28,457 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-02 23:15:28,696 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-02 23:15:29,019 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 23:15:29,020 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 23:15:29,043 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 23:15:29,045 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 23:15:29,051 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 23:15:29,051 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 23:15:29,066 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 23:15:29,067 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 23:15:29,068 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 23:15:29,068 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 23:15:29,069 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 23:15:29,069 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 23:15:29,070 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 23:15:29,105 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-02 23:15:29,134 INFO L203 MainTranslator]: Completed pre-run [2021-11-02 23:15:29,148 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dded36d2-a5e3-4d93-9042-30748813ed17/sv-benchmarks/c/aws-c-common/aws_hash_table_eq_harness.i[4491,4504] [2021-11-02 23:15:29,148 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dded36d2-a5e3-4d93-9042-30748813ed17/sv-benchmarks/c/aws-c-common/aws_hash_table_eq_harness.i[4551,4564] [2021-11-02 23:15:29,150 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-02 23:15:29,151 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-02 23:15:29,200 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 23:15:29,201 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 23:15:29,202 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 23:15:29,203 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 23:15:29,204 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 23:15:29,219 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 23:15:29,220 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 23:15:29,221 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 23:15:29,222 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 23:15:29,223 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 23:15:29,224 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 23:15:29,224 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 23:15:29,224 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 23:15:29,266 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-02 23:15:29,267 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-02 23:15:29,268 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-02 23:15:29,269 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-02 23:15:29,270 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-02 23:15:29,271 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-02 23:15:29,271 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-02 23:15:29,272 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-02 23:15:29,272 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-02 23:15:29,273 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-02 23:15:29,309 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-02 23:15:29,508 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 23:15:29,508 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 23:15:29,517 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 23:15:29,519 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 23:15:29,522 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 23:15:29,522 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 23:15:29,537 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 23:15:29,538 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 23:15:29,539 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 23:15:29,539 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 23:15:29,539 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 23:15:29,540 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 23:15:29,540 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 23:15:29,559 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-02 23:15:29,888 INFO L208 MainTranslator]: Completed translation [2021-11-02 23:15:29,889 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:15:29 WrapperNode [2021-11-02 23:15:29,889 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-02 23:15:29,890 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-02 23:15:29,891 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-02 23:15:29,891 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-02 23:15:29,898 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:15:29" (1/1) ... [2021-11-02 23:15:30,063 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:15:29" (1/1) ... [2021-11-02 23:15:30,242 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-02 23:15:30,244 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-02 23:15:30,244 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-02 23:15:30,245 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-02 23:15:30,253 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:15:29" (1/1) ... [2021-11-02 23:15:30,254 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:15:29" (1/1) ... [2021-11-02 23:15:30,282 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:15:29" (1/1) ... [2021-11-02 23:15:30,283 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:15:29" (1/1) ... [2021-11-02 23:15:30,386 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:15:29" (1/1) ... [2021-11-02 23:15:30,409 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:15:29" (1/1) ... [2021-11-02 23:15:30,424 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:15:29" (1/1) ... [2021-11-02 23:15:30,451 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-02 23:15:30,452 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-02 23:15:30,452 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-02 23:15:30,452 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-02 23:15:30,454 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:15:29" (1/1) ... [2021-11-02 23:15:30,461 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-02 23:15:30,472 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dded36d2-a5e3-4d93-9042-30748813ed17/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 23:15:30,492 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dded36d2-a5e3-4d93-9042-30748813ed17/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-02 23:15:30,527 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dded36d2-a5e3-4d93-9042-30748813ed17/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-02 23:15:30,547 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2021-11-02 23:15:30,547 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-02 23:15:30,548 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-02 23:15:30,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-02 23:15:30,548 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-02 23:15:30,548 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-02 23:15:30,548 INFO L130 BoogieDeclarations]: Found specification of procedure __builtin_uaddl_overflow [2021-11-02 23:15:30,549 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-02 23:15:30,549 INFO L130 BoogieDeclarations]: Found specification of procedure __builtin_umull_overflow [2021-11-02 23:15:30,549 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-02 23:15:30,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-02 23:15:30,550 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-02 23:15:30,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-02 23:15:30,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-02 23:15:43,244 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##423: assume !true; [2021-11-02 23:15:43,245 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##287: assume !true; [2021-11-02 23:15:43,245 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##234: assume !true; [2021-11-02 23:15:43,245 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##313: assume !true; [2021-11-02 23:15:43,245 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##190: assume !true; [2021-11-02 23:15:43,245 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##150: assume !true; [2021-11-02 23:15:43,246 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##396: assume !true; [2021-11-02 23:15:43,246 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##342: assume !true; [2021-11-02 23:15:43,259 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-02 23:15:43,260 INFO L299 CfgBuilder]: Removed 474 assume(true) statements. [2021-11-02 23:15:43,263 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 11:15:43 BoogieIcfgContainer [2021-11-02 23:15:43,263 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-02 23:15:43,265 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-02 23:15:43,265 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-02 23:15:43,268 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-02 23:15:43,269 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 11:15:26" (1/3) ... [2021-11-02 23:15:43,269 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1edfa271 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 11:15:43, skipping insertion in model container [2021-11-02 23:15:43,270 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:15:29" (2/3) ... [2021-11-02 23:15:43,270 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1edfa271 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 11:15:43, skipping insertion in model container [2021-11-02 23:15:43,270 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 11:15:43" (3/3) ... [2021-11-02 23:15:43,272 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_hash_table_eq_harness.i [2021-11-02 23:15:43,277 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-02 23:15:43,277 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 25 error locations. [2021-11-02 23:15:43,328 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-02 23:15:43,334 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-02 23:15:43,334 INFO L340 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2021-11-02 23:15:43,360 INFO L276 IsEmpty]: Start isEmpty. Operand has 513 states, 487 states have (on average 1.4209445585215605) internal successors, (692), 512 states have internal predecessors, (692), 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-02 23:15:43,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2021-11-02 23:15:43,382 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 23:15:43,383 INFO L513 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, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 23:15:43,385 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 22 more)] === [2021-11-02 23:15:43,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 23:15:43,391 INFO L85 PathProgramCache]: Analyzing trace with hash 472998027, now seen corresponding path program 1 times [2021-11-02 23:15:43,400 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 23:15:43,401 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55750675] [2021-11-02 23:15:43,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 23:15:43,402 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 23:15:43,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 23:15:44,188 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-02 23:15:44,189 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 23:15:44,189 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55750675] [2021-11-02 23:15:44,190 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55750675] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 23:15:44,190 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 23:15:44,190 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-02 23:15:44,192 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620910331] [2021-11-02 23:15:44,197 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-02 23:15:44,197 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 23:15:44,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-02 23:15:44,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-02 23:15:44,220 INFO L87 Difference]: Start difference. First operand has 513 states, 487 states have (on average 1.4209445585215605) internal successors, (692), 512 states have internal predecessors, (692), 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 58.5) internal successors, (117), 2 states have internal predecessors, (117), 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-02 23:15:44,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 23:15:44,297 INFO L93 Difference]: Finished difference Result 1021 states and 1378 transitions. [2021-11-02 23:15:44,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-02 23:15:44,298 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 58.5) internal successors, (117), 2 states have internal predecessors, (117), 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 117 [2021-11-02 23:15:44,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 23:15:44,324 INFO L225 Difference]: With dead ends: 1021 [2021-11-02 23:15:44,325 INFO L226 Difference]: Without dead ends: 506 [2021-11-02 23:15:44,333 INFO L786 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-02 23:15:44,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2021-11-02 23:15:44,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 506. [2021-11-02 23:15:44,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 506 states, 481 states have (on average 1.2806652806652807) internal successors, (616), 505 states have internal predecessors, (616), 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-02 23:15:44,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 616 transitions. [2021-11-02 23:15:44,420 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 616 transitions. Word has length 117 [2021-11-02 23:15:44,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 23:15:44,420 INFO L470 AbstractCegarLoop]: Abstraction has 506 states and 616 transitions. [2021-11-02 23:15:44,421 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 58.5) internal successors, (117), 2 states have internal predecessors, (117), 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-02 23:15:44,421 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 616 transitions. [2021-11-02 23:15:44,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2021-11-02 23:15:44,427 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 23:15:44,427 INFO L513 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, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 23:15:44,428 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-02 23:15:44,428 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 22 more)] === [2021-11-02 23:15:44,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 23:15:44,431 INFO L85 PathProgramCache]: Analyzing trace with hash 550783055, now seen corresponding path program 1 times [2021-11-02 23:15:44,431 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 23:15:44,431 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122642853] [2021-11-02 23:15:44,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 23:15:44,435 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 23:15:44,581 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-02 23:15:44,582 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [968353831] [2021-11-02 23:15:44,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 23:15:44,582 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-02 23:15:44,583 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dded36d2-a5e3-4d93-9042-30748813ed17/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 23:15:44,588 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dded36d2-a5e3-4d93-9042-30748813ed17/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-02 23:15:44,607 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dded36d2-a5e3-4d93-9042-30748813ed17/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-02 23:15:45,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 23:15:45,757 INFO L263 TraceCheckSpWp]: Trace formula consists of 3015 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-02 23:15:45,769 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 23:15:46,487 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-02 23:15:46,487 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 23:15:46,487 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122642853] [2021-11-02 23:15:46,488 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-02 23:15:46,488 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [968353831] [2021-11-02 23:15:46,488 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [968353831] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 23:15:46,488 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 23:15:46,488 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-02 23:15:46,489 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257843427] [2021-11-02 23:15:46,490 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-02 23:15:46,491 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 23:15:46,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-02 23:15:46,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-02 23:15:46,492 INFO L87 Difference]: Start difference. First operand 506 states and 616 transitions. Second operand has 5 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 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-02 23:15:46,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 23:15:46,898 INFO L93 Difference]: Finished difference Result 1472 states and 1794 transitions. [2021-11-02 23:15:46,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-02 23:15:46,898 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 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 117 [2021-11-02 23:15:46,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 23:15:46,904 INFO L225 Difference]: With dead ends: 1472 [2021-11-02 23:15:46,904 INFO L226 Difference]: Without dead ends: 988 [2021-11-02 23:15:46,905 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-02 23:15:46,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 988 states. [2021-11-02 23:15:46,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 988 to 518. [2021-11-02 23:15:46,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 518 states, 493 states have (on average 1.2738336713995944) internal successors, (628), 517 states have internal predecessors, (628), 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-02 23:15:46,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 628 transitions. [2021-11-02 23:15:46,923 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 628 transitions. Word has length 117 [2021-11-02 23:15:46,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 23:15:46,923 INFO L470 AbstractCegarLoop]: Abstraction has 518 states and 628 transitions. [2021-11-02 23:15:46,924 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 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-02 23:15:46,924 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 628 transitions. [2021-11-02 23:15:46,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2021-11-02 23:15:46,926 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 23:15:46,927 INFO L513 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 23:15:46,970 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dded36d2-a5e3-4d93-9042-30748813ed17/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-02 23:15:47,150 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dded36d2-a5e3-4d93-9042-30748813ed17/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-02 23:15:47,150 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 22 more)] === [2021-11-02 23:15:47,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 23:15:47,151 INFO L85 PathProgramCache]: Analyzing trace with hash -550582129, now seen corresponding path program 1 times [2021-11-02 23:15:47,151 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 23:15:47,151 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138099013] [2021-11-02 23:15:47,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 23:15:47,151 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 23:15:47,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 23:15:47,693 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-02 23:15:47,694 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 23:15:47,694 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138099013] [2021-11-02 23:15:47,694 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138099013] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 23:15:47,694 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 23:15:47,694 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-02 23:15:47,695 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831673010] [2021-11-02 23:15:47,695 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-02 23:15:47,695 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 23:15:47,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-02 23:15:47,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-11-02 23:15:47,696 INFO L87 Difference]: Start difference. First operand 518 states and 628 transitions. Second operand has 8 states, 8 states have (on average 15.625) internal successors, (125), 8 states have internal predecessors, (125), 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-02 23:15:53,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 23:15:53,845 INFO L93 Difference]: Finished difference Result 1044 states and 1266 transitions. [2021-11-02 23:15:53,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-02 23:15:53,847 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 15.625) internal successors, (125), 8 states have internal predecessors, (125), 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 125 [2021-11-02 23:15:53,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 23:15:53,851 INFO L225 Difference]: With dead ends: 1044 [2021-11-02 23:15:53,852 INFO L226 Difference]: Without dead ends: 564 [2021-11-02 23:15:53,853 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2021-11-02 23:15:53,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2021-11-02 23:15:53,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 520. [2021-11-02 23:15:53,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 520 states, 495 states have (on average 1.2727272727272727) internal successors, (630), 519 states have internal predecessors, (630), 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-02 23:15:53,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 630 transitions. [2021-11-02 23:15:53,884 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 630 transitions. Word has length 125 [2021-11-02 23:15:53,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 23:15:53,885 INFO L470 AbstractCegarLoop]: Abstraction has 520 states and 630 transitions. [2021-11-02 23:15:53,885 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.625) internal successors, (125), 8 states have internal predecessors, (125), 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-02 23:15:53,885 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 630 transitions. [2021-11-02 23:15:53,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2021-11-02 23:15:53,888 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 23:15:53,888 INFO L513 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 23:15:53,890 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-02 23:15:53,891 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 22 more)] === [2021-11-02 23:15:53,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 23:15:53,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1710991121, now seen corresponding path program 1 times [2021-11-02 23:15:53,892 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 23:15:53,892 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164000720] [2021-11-02 23:15:53,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 23:15:53,892 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 23:15:54,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 23:15:54,305 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-02 23:15:54,306 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 23:15:54,306 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164000720] [2021-11-02 23:15:54,306 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164000720] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 23:15:54,306 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 23:15:54,306 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-02 23:15:54,307 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196184267] [2021-11-02 23:15:54,307 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 23:15:54,307 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 23:15:54,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 23:15:54,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-02 23:15:54,308 INFO L87 Difference]: Start difference. First operand 520 states and 630 transitions. Second operand has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 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-02 23:15:54,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 23:15:54,682 INFO L93 Difference]: Finished difference Result 1003 states and 1217 transitions. [2021-11-02 23:15:54,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-02 23:15:54,683 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 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 125 [2021-11-02 23:15:54,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 23:15:54,686 INFO L225 Difference]: With dead ends: 1003 [2021-11-02 23:15:54,686 INFO L226 Difference]: Without dead ends: 518 [2021-11-02 23:15:54,688 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-02 23:15:54,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2021-11-02 23:15:54,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 518. [2021-11-02 23:15:54,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 518 states, 493 states have (on average 1.2636916835699796) internal successors, (623), 517 states have internal predecessors, (623), 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-02 23:15:54,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 623 transitions. [2021-11-02 23:15:54,709 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 623 transitions. Word has length 125 [2021-11-02 23:15:54,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 23:15:54,709 INFO L470 AbstractCegarLoop]: Abstraction has 518 states and 623 transitions. [2021-11-02 23:15:54,709 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 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-02 23:15:54,710 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 623 transitions. [2021-11-02 23:15:54,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2021-11-02 23:15:54,711 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 23:15:54,711 INFO L513 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 23:15:54,711 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-02 23:15:54,712 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 22 more)] === [2021-11-02 23:15:54,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 23:15:54,712 INFO L85 PathProgramCache]: Analyzing trace with hash -595987094, now seen corresponding path program 1 times [2021-11-02 23:15:54,712 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 23:15:54,713 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147229319] [2021-11-02 23:15:54,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 23:15:54,713 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 23:15:54,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 23:15:55,126 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-02 23:15:55,126 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 23:15:55,126 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147229319] [2021-11-02 23:15:55,126 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147229319] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 23:15:55,126 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 23:15:55,127 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-02 23:15:55,127 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672976614] [2021-11-02 23:15:55,127 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-02 23:15:55,128 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 23:15:55,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-02 23:15:55,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-02 23:15:55,128 INFO L87 Difference]: Start difference. First operand 518 states and 623 transitions. Second operand has 5 states, 5 states have (on average 25.4) internal successors, (127), 5 states have internal predecessors, (127), 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-02 23:16:01,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 23:16:01,292 INFO L93 Difference]: Finished difference Result 1291 states and 1546 transitions. [2021-11-02 23:16:01,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-02 23:16:01,293 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.4) internal successors, (127), 5 states have internal predecessors, (127), 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 127 [2021-11-02 23:16:01,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 23:16:01,297 INFO L225 Difference]: With dead ends: 1291 [2021-11-02 23:16:01,297 INFO L226 Difference]: Without dead ends: 810 [2021-11-02 23:16:01,299 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-02 23:16:01,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 810 states. [2021-11-02 23:16:01,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 810 to 518. [2021-11-02 23:16:01,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 518 states, 493 states have (on average 1.2271805273833671) internal successors, (605), 517 states have internal predecessors, (605), 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-02 23:16:01,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 605 transitions. [2021-11-02 23:16:01,334 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 605 transitions. Word has length 127 [2021-11-02 23:16:01,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 23:16:01,335 INFO L470 AbstractCegarLoop]: Abstraction has 518 states and 605 transitions. [2021-11-02 23:16:01,335 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.4) internal successors, (127), 5 states have internal predecessors, (127), 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-02 23:16:01,336 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 605 transitions. [2021-11-02 23:16:01,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-11-02 23:16:01,337 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 23:16:01,338 INFO L513 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 23:16:01,338 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-02 23:16:01,338 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 22 more)] === [2021-11-02 23:16:01,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 23:16:01,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1912536357, now seen corresponding path program 1 times [2021-11-02 23:16:01,339 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 23:16:01,340 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935038024] [2021-11-02 23:16:01,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 23:16:01,340 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 23:16:01,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 23:16:01,912 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-02 23:16:01,912 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 23:16:01,912 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935038024] [2021-11-02 23:16:01,912 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935038024] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 23:16:01,913 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 23:16:01,913 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-02 23:16:01,913 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143143187] [2021-11-02 23:16:01,914 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-02 23:16:01,914 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 23:16:01,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-02 23:16:01,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-11-02 23:16:01,915 INFO L87 Difference]: Start difference. First operand 518 states and 605 transitions. Second operand has 8 states, 8 states have (on average 16.0) internal successors, (128), 8 states have internal predecessors, (128), 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-02 23:16:08,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 23:16:08,121 INFO L93 Difference]: Finished difference Result 1242 states and 1454 transitions. [2021-11-02 23:16:08,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-02 23:16:08,122 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 16.0) internal successors, (128), 8 states have internal predecessors, (128), 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 128 [2021-11-02 23:16:08,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 23:16:08,128 INFO L225 Difference]: With dead ends: 1242 [2021-11-02 23:16:08,128 INFO L226 Difference]: Without dead ends: 828 [2021-11-02 23:16:08,130 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2021-11-02 23:16:08,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 828 states. [2021-11-02 23:16:08,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 828 to 641. [2021-11-02 23:16:08,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 641 states, 616 states have (on average 1.2256493506493507) internal successors, (755), 640 states have internal predecessors, (755), 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-02 23:16:08,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 755 transitions. [2021-11-02 23:16:08,172 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 755 transitions. Word has length 128 [2021-11-02 23:16:08,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 23:16:08,173 INFO L470 AbstractCegarLoop]: Abstraction has 641 states and 755 transitions. [2021-11-02 23:16:08,173 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 16.0) internal successors, (128), 8 states have internal predecessors, (128), 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-02 23:16:08,173 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 755 transitions. [2021-11-02 23:16:08,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-11-02 23:16:08,175 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 23:16:08,176 INFO L513 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 23:16:08,176 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-02 23:16:08,176 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 22 more)] === [2021-11-02 23:16:08,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 23:16:08,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1570667547, now seen corresponding path program 1 times [2021-11-02 23:16:08,177 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 23:16:08,177 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884209542] [2021-11-02 23:16:08,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 23:16:08,178 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 23:16:08,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 23:16:08,615 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-02 23:16:08,615 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 23:16:08,615 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884209542] [2021-11-02 23:16:08,616 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884209542] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 23:16:08,616 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 23:16:08,616 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-02 23:16:08,616 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352757597] [2021-11-02 23:16:08,617 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 23:16:08,617 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 23:16:08,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 23:16:08,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-02 23:16:08,618 INFO L87 Difference]: Start difference. First operand 641 states and 755 transitions. Second operand has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 states have internal predecessors, (128), 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-02 23:16:09,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 23:16:09,007 INFO L93 Difference]: Finished difference Result 1177 states and 1389 transitions. [2021-11-02 23:16:09,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-02 23:16:09,008 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 states have internal predecessors, (128), 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 128 [2021-11-02 23:16:09,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 23:16:09,012 INFO L225 Difference]: With dead ends: 1177 [2021-11-02 23:16:09,013 INFO L226 Difference]: Without dead ends: 637 [2021-11-02 23:16:09,014 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-02 23:16:09,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2021-11-02 23:16:09,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 637. [2021-11-02 23:16:09,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 637 states, 612 states have (on average 1.2156862745098038) internal successors, (744), 636 states have internal predecessors, (744), 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-02 23:16:09,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 744 transitions. [2021-11-02 23:16:09,058 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 744 transitions. Word has length 128 [2021-11-02 23:16:09,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 23:16:09,059 INFO L470 AbstractCegarLoop]: Abstraction has 637 states and 744 transitions. [2021-11-02 23:16:09,059 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 states have internal predecessors, (128), 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-02 23:16:09,059 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 744 transitions. [2021-11-02 23:16:09,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2021-11-02 23:16:09,061 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 23:16:09,062 INFO L513 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, 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-02 23:16:09,062 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-02 23:16:09,062 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 22 more)] === [2021-11-02 23:16:09,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 23:16:09,063 INFO L85 PathProgramCache]: Analyzing trace with hash -1723642064, now seen corresponding path program 1 times [2021-11-02 23:16:09,063 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 23:16:09,063 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136392786] [2021-11-02 23:16:09,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 23:16:09,063 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 23:16:09,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 23:16:10,053 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-02 23:16:10,054 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 23:16:10,054 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136392786] [2021-11-02 23:16:10,054 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136392786] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 23:16:10,054 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 23:16:10,054 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-02 23:16:10,054 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693375529] [2021-11-02 23:16:10,055 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-02 23:16:10,055 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 23:16:10,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-02 23:16:10,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-11-02 23:16:10,056 INFO L87 Difference]: Start difference. First operand 637 states and 744 transitions. Second operand has 10 states, 10 states have (on average 13.4) internal successors, (134), 10 states have internal predecessors, (134), 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-02 23:16:29,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 23:16:29,547 INFO L93 Difference]: Finished difference Result 2270 states and 2652 transitions. [2021-11-02 23:16:29,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-11-02 23:16:29,548 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 13.4) internal successors, (134), 10 states have internal predecessors, (134), 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 134 [2021-11-02 23:16:29,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 23:16:29,561 INFO L225 Difference]: With dead ends: 2270 [2021-11-02 23:16:29,561 INFO L226 Difference]: Without dead ends: 1852 [2021-11-02 23:16:29,564 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=315, Invalid=875, Unknown=0, NotChecked=0, Total=1190 [2021-11-02 23:16:29,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1852 states. [2021-11-02 23:16:29,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1852 to 785. [2021-11-02 23:16:29,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 785 states, 760 states have (on average 1.2328947368421053) internal successors, (937), 784 states have internal predecessors, (937), 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-02 23:16:29,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 937 transitions. [2021-11-02 23:16:29,628 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 937 transitions. Word has length 134 [2021-11-02 23:16:29,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 23:16:29,628 INFO L470 AbstractCegarLoop]: Abstraction has 785 states and 937 transitions. [2021-11-02 23:16:29,629 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.4) internal successors, (134), 10 states have internal predecessors, (134), 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-02 23:16:29,629 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 937 transitions. [2021-11-02 23:16:29,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2021-11-02 23:16:29,631 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 23:16:29,631 INFO L513 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, 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-02 23:16:29,631 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-02 23:16:29,632 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 22 more)] === [2021-11-02 23:16:29,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 23:16:29,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1504787346, now seen corresponding path program 1 times [2021-11-02 23:16:29,632 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 23:16:29,633 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602757648] [2021-11-02 23:16:29,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 23:16:29,633 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 23:16:29,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 23:16:30,170 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-02 23:16:30,171 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 23:16:30,171 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602757648] [2021-11-02 23:16:30,171 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602757648] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 23:16:30,171 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 23:16:30,171 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-02 23:16:30,171 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146209154] [2021-11-02 23:16:30,172 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-02 23:16:30,172 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 23:16:30,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-02 23:16:30,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-02 23:16:30,173 INFO L87 Difference]: Start difference. First operand 785 states and 937 transitions. Second operand has 7 states, 7 states have (on average 19.142857142857142) internal successors, (134), 7 states have internal predecessors, (134), 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-02 23:16:30,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 23:16:30,727 INFO L93 Difference]: Finished difference Result 1328 states and 1594 transitions. [2021-11-02 23:16:30,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-02 23:16:30,728 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.142857142857142) internal successors, (134), 7 states have internal predecessors, (134), 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 134 [2021-11-02 23:16:30,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 23:16:30,733 INFO L225 Difference]: With dead ends: 1328 [2021-11-02 23:16:30,733 INFO L226 Difference]: Without dead ends: 756 [2021-11-02 23:16:30,734 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-11-02 23:16:30,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2021-11-02 23:16:30,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 756. [2021-11-02 23:16:30,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 756 states, 731 states have (on average 1.2106703146374829) internal successors, (885), 755 states have internal predecessors, (885), 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-02 23:16:30,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 756 states to 756 states and 885 transitions. [2021-11-02 23:16:30,783 INFO L78 Accepts]: Start accepts. Automaton has 756 states and 885 transitions. Word has length 134 [2021-11-02 23:16:30,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 23:16:30,784 INFO L470 AbstractCegarLoop]: Abstraction has 756 states and 885 transitions. [2021-11-02 23:16:30,784 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.142857142857142) internal successors, (134), 7 states have internal predecessors, (134), 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-02 23:16:30,784 INFO L276 IsEmpty]: Start isEmpty. Operand 756 states and 885 transitions. [2021-11-02 23:16:30,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2021-11-02 23:16:30,786 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 23:16:30,786 INFO L513 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, 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-02 23:16:30,787 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-02 23:16:30,787 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 22 more)] === [2021-11-02 23:16:30,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 23:16:30,787 INFO L85 PathProgramCache]: Analyzing trace with hash 217886608, now seen corresponding path program 1 times [2021-11-02 23:16:30,788 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 23:16:30,788 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490939373] [2021-11-02 23:16:30,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 23:16:30,788 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 23:16:32,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 23:16:33,177 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-02 23:16:33,177 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 23:16:33,177 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490939373] [2021-11-02 23:16:33,178 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490939373] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 23:16:33,178 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 23:16:33,178 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-02 23:16:33,178 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542755668] [2021-11-02 23:16:33,179 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-02 23:16:33,179 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 23:16:33,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-02 23:16:33,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-11-02 23:16:33,181 INFO L87 Difference]: Start difference. First operand 756 states and 885 transitions. Second operand has 13 states, 13 states have (on average 10.307692307692308) internal successors, (134), 13 states have internal predecessors, (134), 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-02 23:16:48,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 23:16:48,059 INFO L93 Difference]: Finished difference Result 1556 states and 1816 transitions. [2021-11-02 23:16:48,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-02 23:16:48,060 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 10.307692307692308) internal successors, (134), 13 states have internal predecessors, (134), 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 134 [2021-11-02 23:16:48,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 23:16:48,066 INFO L225 Difference]: With dead ends: 1556 [2021-11-02 23:16:48,066 INFO L226 Difference]: Without dead ends: 1039 [2021-11-02 23:16:48,068 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=123, Invalid=477, Unknown=0, NotChecked=0, Total=600 [2021-11-02 23:16:48,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1039 states. [2021-11-02 23:16:48,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1039 to 759. [2021-11-02 23:16:48,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 759 states, 734 states have (on average 1.2098092643051772) internal successors, (888), 758 states have internal predecessors, (888), 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-02 23:16:48,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 888 transitions. [2021-11-02 23:16:48,125 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 888 transitions. Word has length 134 [2021-11-02 23:16:48,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 23:16:48,125 INFO L470 AbstractCegarLoop]: Abstraction has 759 states and 888 transitions. [2021-11-02 23:16:48,125 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 10.307692307692308) internal successors, (134), 13 states have internal predecessors, (134), 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-02 23:16:48,126 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 888 transitions. [2021-11-02 23:16:48,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2021-11-02 23:16:48,127 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 23:16:48,128 INFO L513 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, 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-02 23:16:48,128 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-02 23:16:48,128 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 22 more)] === [2021-11-02 23:16:48,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 23:16:48,129 INFO L85 PathProgramCache]: Analyzing trace with hash 1780835856, now seen corresponding path program 1 times [2021-11-02 23:16:48,129 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 23:16:48,129 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532352197] [2021-11-02 23:16:48,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 23:16:48,130 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 23:16:48,258 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-02 23:16:48,258 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1285964577] [2021-11-02 23:16:48,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 23:16:48,258 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-02 23:16:48,259 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dded36d2-a5e3-4d93-9042-30748813ed17/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 23:16:48,264 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dded36d2-a5e3-4d93-9042-30748813ed17/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-02 23:16:48,282 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dded36d2-a5e3-4d93-9042-30748813ed17/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-02 23:16:49,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 23:16:49,304 INFO L263 TraceCheckSpWp]: Trace formula consists of 3206 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-02 23:16:49,314 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 23:16:49,763 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-02 23:16:49,763 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 23:16:49,764 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532352197] [2021-11-02 23:16:49,764 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-02 23:16:49,764 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1285964577] [2021-11-02 23:16:49,764 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1285964577] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 23:16:49,764 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 23:16:49,764 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-02 23:16:49,765 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994279469] [2021-11-02 23:16:49,765 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-02 23:16:49,765 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 23:16:49,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-02 23:16:49,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-02 23:16:49,766 INFO L87 Difference]: Start difference. First operand 759 states and 888 transitions. Second operand has 5 states, 5 states have (on average 26.8) internal successors, (134), 5 states have internal predecessors, (134), 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-02 23:16:50,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 23:16:50,145 INFO L93 Difference]: Finished difference Result 2211 states and 2586 transitions. [2021-11-02 23:16:50,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-02 23:16:50,146 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.8) internal successors, (134), 5 states have internal predecessors, (134), 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 134 [2021-11-02 23:16:50,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 23:16:50,154 INFO L225 Difference]: With dead ends: 2211 [2021-11-02 23:16:50,154 INFO L226 Difference]: Without dead ends: 1477 [2021-11-02 23:16:50,156 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 131 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-02 23:16:50,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1477 states. [2021-11-02 23:16:50,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1477 to 771. [2021-11-02 23:16:50,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 771 states, 746 states have (on average 1.2064343163538873) internal successors, (900), 770 states have internal predecessors, (900), 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-02 23:16:50,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 900 transitions. [2021-11-02 23:16:50,221 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 900 transitions. Word has length 134 [2021-11-02 23:16:50,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 23:16:50,222 INFO L470 AbstractCegarLoop]: Abstraction has 771 states and 900 transitions. [2021-11-02 23:16:50,222 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.8) internal successors, (134), 5 states have internal predecessors, (134), 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-02 23:16:50,222 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 900 transitions. [2021-11-02 23:16:50,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2021-11-02 23:16:50,224 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 23:16:50,224 INFO L513 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, 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-02 23:16:50,268 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dded36d2-a5e3-4d93-9042-30748813ed17/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-02 23:16:50,451 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dded36d2-a5e3-4d93-9042-30748813ed17/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-02 23:16:50,451 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 22 more)] === [2021-11-02 23:16:50,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 23:16:50,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1299755598, now seen corresponding path program 1 times [2021-11-02 23:16:50,452 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 23:16:50,452 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588175574] [2021-11-02 23:16:50,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 23:16:50,452 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 23:16:50,581 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-02 23:16:50,581 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1270058513] [2021-11-02 23:16:50,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 23:16:50,581 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-02 23:16:50,582 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dded36d2-a5e3-4d93-9042-30748813ed17/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 23:16:50,582 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dded36d2-a5e3-4d93-9042-30748813ed17/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-02 23:16:50,606 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dded36d2-a5e3-4d93-9042-30748813ed17/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-02 23:16:51,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 23:16:51,649 INFO L263 TraceCheckSpWp]: Trace formula consists of 3207 conjuncts, 17 conjunts are in the unsatisfiable core [2021-11-02 23:16:51,656 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 23:16:52,080 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-02 23:16:52,080 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 23:16:52,080 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588175574] [2021-11-02 23:16:52,081 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-02 23:16:52,081 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1270058513] [2021-11-02 23:16:52,081 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1270058513] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 23:16:52,081 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 23:16:52,081 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-02 23:16:52,081 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385893331] [2021-11-02 23:16:52,082 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-02 23:16:52,082 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 23:16:52,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-02 23:16:52,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-02 23:16:52,083 INFO L87 Difference]: Start difference. First operand 771 states and 900 transitions. Second operand has 5 states, 5 states have (on average 26.8) internal successors, (134), 5 states have internal predecessors, (134), 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-02 23:16:52,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 23:16:52,926 INFO L93 Difference]: Finished difference Result 1461 states and 1704 transitions. [2021-11-02 23:16:52,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-02 23:16:52,927 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.8) internal successors, (134), 5 states have internal predecessors, (134), 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 134 [2021-11-02 23:16:52,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 23:16:52,931 INFO L225 Difference]: With dead ends: 1461 [2021-11-02 23:16:52,931 INFO L226 Difference]: Without dead ends: 855 [2021-11-02 23:16:52,933 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-02 23:16:52,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2021-11-02 23:16:52,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 677. [2021-11-02 23:16:52,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 677 states, 652 states have (on average 1.2070552147239264) internal successors, (787), 676 states have internal predecessors, (787), 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-02 23:16:52,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 787 transitions. [2021-11-02 23:16:52,991 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 787 transitions. Word has length 134 [2021-11-02 23:16:52,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 23:16:52,992 INFO L470 AbstractCegarLoop]: Abstraction has 677 states and 787 transitions. [2021-11-02 23:16:52,992 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.8) internal successors, (134), 5 states have internal predecessors, (134), 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-02 23:16:52,992 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 787 transitions. [2021-11-02 23:16:52,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2021-11-02 23:16:52,994 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 23:16:52,994 INFO L513 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 23:16:53,041 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dded36d2-a5e3-4d93-9042-30748813ed17/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-02 23:16:53,211 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dded36d2-a5e3-4d93-9042-30748813ed17/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-02 23:16:53,211 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 22 more)] === [2021-11-02 23:16:53,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 23:16:53,212 INFO L85 PathProgramCache]: Analyzing trace with hash -2015297100, now seen corresponding path program 1 times [2021-11-02 23:16:53,212 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 23:16:53,212 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281972823] [2021-11-02 23:16:53,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 23:16:53,212 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 23:16:53,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 23:16:54,132 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-02 23:16:54,132 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 23:16:54,132 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281972823] [2021-11-02 23:16:54,132 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281972823] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 23:16:54,132 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 23:16:54,133 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-02 23:16:54,133 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215705539] [2021-11-02 23:16:54,133 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-02 23:16:54,134 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 23:16:54,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-02 23:16:54,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-11-02 23:16:54,134 INFO L87 Difference]: Start difference. First operand 677 states and 787 transitions. Second operand has 9 states, 9 states have (on average 15.88888888888889) internal successors, (143), 9 states have internal predecessors, (143), 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-02 23:17:03,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 23:17:03,698 INFO L93 Difference]: Finished difference Result 1194 states and 1364 transitions. [2021-11-02 23:17:03,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-02 23:17:03,699 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 15.88888888888889) internal successors, (143), 9 states have internal predecessors, (143), 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 143 [2021-11-02 23:17:03,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 23:17:03,707 INFO L225 Difference]: With dead ends: 1194 [2021-11-02 23:17:03,707 INFO L226 Difference]: Without dead ends: 1129 [2021-11-02 23:17:03,708 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=104, Invalid=238, Unknown=0, NotChecked=0, Total=342 [2021-11-02 23:17:03,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1129 states. [2021-11-02 23:17:03,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1129 to 681. [2021-11-02 23:17:03,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 681 states, 656 states have (on average 1.2057926829268293) internal successors, (791), 680 states have internal predecessors, (791), 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-02 23:17:03,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 681 states and 791 transitions. [2021-11-02 23:17:03,766 INFO L78 Accepts]: Start accepts. Automaton has 681 states and 791 transitions. Word has length 143 [2021-11-02 23:17:03,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 23:17:03,767 INFO L470 AbstractCegarLoop]: Abstraction has 681 states and 791 transitions. [2021-11-02 23:17:03,767 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.88888888888889) internal successors, (143), 9 states have internal predecessors, (143), 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-02 23:17:03,767 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 791 transitions. [2021-11-02 23:17:03,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2021-11-02 23:17:03,769 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 23:17:03,769 INFO L513 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 23:17:03,770 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-02 23:17:03,770 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 22 more)] === [2021-11-02 23:17:03,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 23:17:03,771 INFO L85 PathProgramCache]: Analyzing trace with hash -1335238730, now seen corresponding path program 1 times [2021-11-02 23:17:03,771 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 23:17:03,771 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009888840] [2021-11-02 23:17:03,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 23:17:03,771 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 23:17:03,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 23:17:04,343 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-02 23:17:04,343 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 23:17:04,344 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009888840] [2021-11-02 23:17:04,344 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009888840] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 23:17:04,344 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 23:17:04,344 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-02 23:17:04,344 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168933479] [2021-11-02 23:17:04,345 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-02 23:17:04,345 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 23:17:04,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-02 23:17:04,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-02 23:17:04,346 INFO L87 Difference]: Start difference. First operand 681 states and 791 transitions. Second operand has 7 states, 7 states have (on average 20.428571428571427) internal successors, (143), 7 states have internal predecessors, (143), 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-02 23:17:04,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 23:17:04,884 INFO L93 Difference]: Finished difference Result 861 states and 994 transitions. [2021-11-02 23:17:04,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-02 23:17:04,886 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.428571428571427) internal successors, (143), 7 states have internal predecessors, (143), 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 143 [2021-11-02 23:17:04,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 23:17:04,890 INFO L225 Difference]: With dead ends: 861 [2021-11-02 23:17:04,891 INFO L226 Difference]: Without dead ends: 671 [2021-11-02 23:17:04,892 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-11-02 23:17:04,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2021-11-02 23:17:04,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 671. [2021-11-02 23:17:04,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 671 states, 646 states have (on average 1.1888544891640866) internal successors, (768), 670 states have internal predecessors, (768), 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-02 23:17:04,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 768 transitions. [2021-11-02 23:17:04,961 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 768 transitions. Word has length 143 [2021-11-02 23:17:04,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 23:17:04,962 INFO L470 AbstractCegarLoop]: Abstraction has 671 states and 768 transitions. [2021-11-02 23:17:04,962 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.428571428571427) internal successors, (143), 7 states have internal predecessors, (143), 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-02 23:17:04,962 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 768 transitions. [2021-11-02 23:17:04,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2021-11-02 23:17:04,964 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 23:17:04,964 INFO L513 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 23:17:04,964 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-02 23:17:04,965 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 22 more)] === [2021-11-02 23:17:04,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 23:17:04,965 INFO L85 PathProgramCache]: Analyzing trace with hash 1420026888, now seen corresponding path program 1 times [2021-11-02 23:17:04,966 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 23:17:04,966 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049807644] [2021-11-02 23:17:04,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 23:17:04,966 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 23:17:08,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 23:17:09,152 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-02 23:17:09,153 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 23:17:09,153 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049807644] [2021-11-02 23:17:09,153 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049807644] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 23:17:09,153 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 23:17:09,153 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-02 23:17:09,153 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336897391] [2021-11-02 23:17:09,154 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 23:17:09,154 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 23:17:09,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 23:17:09,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 23:17:09,155 INFO L87 Difference]: Start difference. First operand 671 states and 768 transitions. Second operand has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 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-02 23:17:09,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 23:17:09,591 INFO L93 Difference]: Finished difference Result 1320 states and 1510 transitions. [2021-11-02 23:17:09,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-02 23:17:09,593 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 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 146 [2021-11-02 23:17:09,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 23:17:09,597 INFO L225 Difference]: With dead ends: 1320 [2021-11-02 23:17:09,597 INFO L226 Difference]: Without dead ends: 671 [2021-11-02 23:17:09,601 INFO L786 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-02 23:17:09,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2021-11-02 23:17:09,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 647. [2021-11-02 23:17:09,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 647 states, 622 states have (on average 1.1832797427652733) internal successors, (736), 646 states have internal predecessors, (736), 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-02 23:17:09,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 736 transitions. [2021-11-02 23:17:09,661 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 736 transitions. Word has length 146 [2021-11-02 23:17:09,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 23:17:09,662 INFO L470 AbstractCegarLoop]: Abstraction has 647 states and 736 transitions. [2021-11-02 23:17:09,662 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 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-02 23:17:09,662 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 736 transitions. [2021-11-02 23:17:09,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2021-11-02 23:17:09,664 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 23:17:09,664 INFO L513 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 23:17:09,664 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-02 23:17:09,664 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 22 more)] === [2021-11-02 23:17:09,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 23:17:09,665 INFO L85 PathProgramCache]: Analyzing trace with hash 161407208, now seen corresponding path program 1 times [2021-11-02 23:17:09,665 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 23:17:09,665 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962853967] [2021-11-02 23:17:09,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 23:17:09,666 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 23:17:09,750 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-02 23:17:09,750 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1201817778] [2021-11-02 23:17:09,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 23:17:09,751 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-02 23:17:09,751 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dded36d2-a5e3-4d93-9042-30748813ed17/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 23:17:09,752 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dded36d2-a5e3-4d93-9042-30748813ed17/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-02 23:17:09,768 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dded36d2-a5e3-4d93-9042-30748813ed17/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-02 23:23:00,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 23:23:00,763 INFO L263 TraceCheckSpWp]: Trace formula consists of 3629 conjuncts, 170 conjunts are in the unsatisfiable core [2021-11-02 23:23:00,775 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 23:23:02,001 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 13 treesize of output 9 [2021-11-02 23:23:02,785 INFO L354 Elim1Store]: treesize reduction 15, result has 42.3 percent of original size [2021-11-02 23:23:02,786 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 27 treesize of output 26 [2021-11-02 23:23:04,188 INFO L354 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2021-11-02 23:23:04,188 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 71 treesize of output 50 [2021-11-02 23:23:04,199 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 56 treesize of output 52 [2021-11-02 23:23:04,249 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-02 23:23:04,664 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 59 treesize of output 51 [2021-11-02 23:23:04,673 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 48 treesize of output 32 [2021-11-02 23:23:04,830 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 44 treesize of output 28 [2021-11-02 23:23:05,586 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-02 23:23:05,587 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 23:23:05,587 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962853967] [2021-11-02 23:23:05,587 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-02 23:23:05,587 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1201817778] [2021-11-02 23:23:05,588 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1201817778] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 23:23:05,588 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 23:23:05,588 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-11-02 23:23:05,588 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312205862] [2021-11-02 23:23:05,589 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-11-02 23:23:05,589 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 23:23:05,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-11-02 23:23:05,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=336, Unknown=0, NotChecked=0, Total=380 [2021-11-02 23:23:05,591 INFO L87 Difference]: Start difference. First operand 647 states and 736 transitions. Second operand has 20 states, 20 states have (on average 7.9) internal successors, (158), 20 states have internal predecessors, (158), 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-02 23:23:43,942 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.offset| 0) (= |c_ULTIMATE.start_bounded_malloc_#res.offset| 0) (= c_ULTIMATE.start_ensure_allocated_hash_table_~map.base |c_ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.base|) (= |c_ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.offset| 0) (< (+ |c_ULTIMATE.start_bounded_malloc_#res.base| 1) |c_ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.base|) (exists ((|ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base| Int)) (let ((.cse0 (select (select |c_#memory_int| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base|) 0))) (and (= (* 24 c_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0) (+ 29629528 .cse0)) (<= (mod .cse0 18446744073709551616) 36028797018963967)))) (<= c_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 8) (= |c_ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.offset| c_ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (exists ((|ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base| Int)) (let ((.cse1 (select (select |c_#memory_int| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base|) 0))) (and (= (* 24 c_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0) (+ 29629528 .cse1)) (let ((.cse2 (mod .cse1 18446744073709551616))) (or (and (= c_ULTIMATE.start_assume_abort_if_not_~cond 1) (<= .cse2 36028797018963967)) (and (= c_ULTIMATE.start_assume_abort_if_not_~cond 0) (< 36028797018963967 .cse2))))))) (= (+ (select (select |c_#memory_int| |c_ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base|) |c_ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.offset|) 29629528) (* 24 c_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0)) (<= c_ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 8) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.base|)) is different from false [2021-11-02 23:23:59,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 23:23:59,713 INFO L93 Difference]: Finished difference Result 2120 states and 2439 transitions. [2021-11-02 23:23:59,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-11-02 23:23:59,714 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 7.9) internal successors, (158), 20 states have internal predecessors, (158), 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 158 [2021-11-02 23:23:59,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 23:23:59,723 INFO L225 Difference]: With dead ends: 2120 [2021-11-02 23:23:59,723 INFO L226 Difference]: Without dead ends: 1545 [2021-11-02 23:23:59,726 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 508 ImplicationChecksByTransitivity, 17.7s TimeCoverageRelationStatistics Valid=327, Invalid=2224, Unknown=3, NotChecked=98, Total=2652 [2021-11-02 23:23:59,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1545 states. [2021-11-02 23:23:59,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1545 to 652. [2021-11-02 23:23:59,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 652 states, 627 states have (on average 1.1770334928229664) internal successors, (738), 651 states have internal predecessors, (738), 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-02 23:23:59,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 738 transitions. [2021-11-02 23:23:59,808 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 738 transitions. Word has length 158 [2021-11-02 23:23:59,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 23:23:59,808 INFO L470 AbstractCegarLoop]: Abstraction has 652 states and 738 transitions. [2021-11-02 23:23:59,809 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 7.9) internal successors, (158), 20 states have internal predecessors, (158), 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-02 23:23:59,809 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 738 transitions. [2021-11-02 23:23:59,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2021-11-02 23:23:59,811 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 23:23:59,811 INFO L513 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 23:24:00,027 WARN L435 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dded36d2-a5e3-4d93-9042-30748813ed17/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forcibly destroying the process [2021-11-02 23:24:00,096 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dded36d2-a5e3-4d93-9042-30748813ed17/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 137 [2021-11-02 23:24:00,096 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dded36d2-a5e3-4d93-9042-30748813ed17/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-11-02 23:24:00,097 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 22 more)] === [2021-11-02 23:24:00,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 23:24:00,097 INFO L85 PathProgramCache]: Analyzing trace with hash -819316508, now seen corresponding path program 1 times [2021-11-02 23:24:00,097 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 23:24:00,097 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855639896] [2021-11-02 23:24:00,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 23:24:00,098 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 23:24:00,220 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-02 23:24:00,220 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [763009066] [2021-11-02 23:24:00,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 23:24:00,221 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-02 23:24:00,221 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dded36d2-a5e3-4d93-9042-30748813ed17/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 23:24:00,223 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dded36d2-a5e3-4d93-9042-30748813ed17/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-02 23:24:00,247 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dded36d2-a5e3-4d93-9042-30748813ed17/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-02 23:24:01,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 23:24:01,369 INFO L263 TraceCheckSpWp]: Trace formula consists of 3638 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-02 23:24:01,376 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 23:24:01,995 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-02 23:24:01,995 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 23:24:01,995 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855639896] [2021-11-02 23:24:01,995 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-02 23:24:01,995 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [763009066] [2021-11-02 23:24:01,995 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [763009066] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 23:24:01,996 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 23:24:01,996 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-02 23:24:01,996 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065926060] [2021-11-02 23:24:01,997 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-02 23:24:01,997 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 23:24:01,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-02 23:24:01,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-02 23:24:01,997 INFO L87 Difference]: Start difference. First operand 652 states and 738 transitions. Second operand has 6 states, 6 states have (on average 26.666666666666668) internal successors, (160), 6 states have internal predecessors, (160), 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-02 23:24:02,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 23:24:02,456 INFO L93 Difference]: Finished difference Result 1351 states and 1526 transitions. [2021-11-02 23:24:02,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-02 23:24:02,457 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.666666666666668) internal successors, (160), 6 states have internal predecessors, (160), 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 160 [2021-11-02 23:24:02,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 23:24:02,460 INFO L225 Difference]: With dead ends: 1351 [2021-11-02 23:24:02,460 INFO L226 Difference]: Without dead ends: 691 [2021-11-02 23:24:02,462 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-11-02 23:24:02,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2021-11-02 23:24:02,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 639. [2021-11-02 23:24:02,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 639 states, 614 states have (on average 1.1726384364820848) internal successors, (720), 638 states have internal predecessors, (720), 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-02 23:24:02,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 720 transitions. [2021-11-02 23:24:02,520 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 720 transitions. Word has length 160 [2021-11-02 23:24:02,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 23:24:02,521 INFO L470 AbstractCegarLoop]: Abstraction has 639 states and 720 transitions. [2021-11-02 23:24:02,521 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.666666666666668) internal successors, (160), 6 states have internal predecessors, (160), 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-02 23:24:02,521 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 720 transitions. [2021-11-02 23:24:02,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2021-11-02 23:24:02,523 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 23:24:02,523 INFO L513 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 23:24:02,570 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dded36d2-a5e3-4d93-9042-30748813ed17/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-11-02 23:24:02,751 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dded36d2-a5e3-4d93-9042-30748813ed17/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-11-02 23:24:02,751 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 22 more)] === [2021-11-02 23:24:02,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 23:24:02,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1769082860, now seen corresponding path program 1 times [2021-11-02 23:24:02,752 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 23:24:02,752 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082532963] [2021-11-02 23:24:02,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 23:24:02,752 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 23:24:02,839 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-02 23:24:02,840 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1046520521] [2021-11-02 23:24:02,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 23:24:02,840 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-02 23:24:02,840 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dded36d2-a5e3-4d93-9042-30748813ed17/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 23:24:02,841 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dded36d2-a5e3-4d93-9042-30748813ed17/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-02 23:24:02,865 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dded36d2-a5e3-4d93-9042-30748813ed17/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-02 23:24:04,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 23:24:04,210 INFO L263 TraceCheckSpWp]: Trace formula consists of 3638 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-02 23:24:04,217 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 23:24:04,909 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-02 23:24:04,909 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 23:24:04,910 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082532963] [2021-11-02 23:24:04,910 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-02 23:24:04,910 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1046520521] [2021-11-02 23:24:04,910 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1046520521] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 23:24:04,910 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 23:24:04,910 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-02 23:24:04,911 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619764333] [2021-11-02 23:24:04,911 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-02 23:24:04,912 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 23:24:04,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-02 23:24:04,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-02 23:24:04,913 INFO L87 Difference]: Start difference. First operand 639 states and 720 transitions. Second operand has 6 states, 6 states have (on average 26.666666666666668) internal successors, (160), 6 states have internal predecessors, (160), 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-02 23:24:05,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 23:24:05,127 INFO L93 Difference]: Finished difference Result 701 states and 784 transitions. [2021-11-02 23:24:05,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-02 23:24:05,129 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.666666666666668) internal successors, (160), 6 states have internal predecessors, (160), 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 160 [2021-11-02 23:24:05,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 23:24:05,130 INFO L225 Difference]: With dead ends: 701 [2021-11-02 23:24:05,130 INFO L226 Difference]: Without dead ends: 0 [2021-11-02 23:24:05,131 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-11-02 23:24:05,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-11-02 23:24:05,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-11-02 23:24:05,132 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-02 23:24:05,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-11-02 23:24:05,132 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 160 [2021-11-02 23:24:05,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 23:24:05,133 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-11-02 23:24:05,133 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.666666666666668) internal successors, (160), 6 states have internal predecessors, (160), 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-02 23:24:05,133 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-11-02 23:24:05,134 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-11-02 23:24:05,136 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-11-02 23:24:05,137 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION [2021-11-02 23:24:05,137 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION [2021-11-02 23:24:05,137 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION [2021-11-02 23:24:05,138 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION [2021-11-02 23:24:05,138 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION [2021-11-02 23:24:05,138 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION [2021-11-02 23:24:05,138 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION [2021-11-02 23:24:05,139 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION [2021-11-02 23:24:05,139 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION [2021-11-02 23:24:05,139 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION [2021-11-02 23:24:05,140 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION [2021-11-02 23:24:05,140 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION [2021-11-02 23:24:05,140 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION [2021-11-02 23:24:05,140 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION [2021-11-02 23:24:05,140 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION [2021-11-02 23:24:05,141 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION [2021-11-02 23:24:05,141 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION [2021-11-02 23:24:05,141 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION [2021-11-02 23:24:05,141 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION [2021-11-02 23:24:05,142 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION [2021-11-02 23:24:05,142 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION [2021-11-02 23:24:05,142 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION [2021-11-02 23:24:05,142 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION [2021-11-02 23:24:05,143 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION [2021-11-02 23:24:05,189 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dded36d2-a5e3-4d93-9042-30748813ed17/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-11-02 23:24:05,371 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dded36d2-a5e3-4d93-9042-30748813ed17/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-11-02 23:24:05,373 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-11-02 23:24:05,380 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,381 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,386 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,387 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,387 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,388 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,388 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,389 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,389 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,390 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,390 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,391 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,394 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,395 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,395 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,396 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,397 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,397 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,398 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,398 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,399 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,407 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,408 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,408 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,409 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,423 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,429 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,429 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,431 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,431 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,438 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,439 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,440 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,440 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,440 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,445 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,450 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,451 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,460 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,461 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,462 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,478 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,478 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,479 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,479 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,483 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,483 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,484 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,485 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,486 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,486 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,486 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,487 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,496 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,497 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,497 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,498 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,498 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,507 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,508 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,508 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,509 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,530 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,532 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,533 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,533 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,534 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,534 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,535 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,542 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,542 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,561 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,562 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,566 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,572 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,578 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,578 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,580 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,581 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,587 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,587 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,588 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,588 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,589 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,589 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,592 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,593 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,609 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,610 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,613 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,614 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,619 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,619 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,636 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,637 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,637 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,637 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,638 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,643 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,644 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,645 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,652 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,653 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,672 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,672 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,673 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,674 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,675 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,675 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,676 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,680 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,683 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,684 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,685 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,685 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,692 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,694 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,694 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,695 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,704 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,705 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,705 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,712 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,720 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,720 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,745 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,760 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,815 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,817 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,817 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,818 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,818 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,819 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,825 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,825 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,826 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,826 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,827 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,827 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,827 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,831 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,831 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,834 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,834 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,840 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,841 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,843 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,851 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,852 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,856 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,857 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,857 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,858 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,860 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,861 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,861 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,867 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,868 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:05,868 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 23:24:13,098 WARN L207 SmtUtils]: Spent 5.99 s on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2021-11-02 23:24:25,444 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-02 23:24:25,444 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-02 23:24:25,445 INFO L860 garLoopResultBuilder]: At program point L10144(line 10144) the Hoare annotation is: true [2021-11-02 23:24:25,445 INFO L857 garLoopResultBuilder]: For program point L9748(lines 9748 9752) no Hoare annotation was computed. [2021-11-02 23:24:25,445 INFO L857 garLoopResultBuilder]: For program point L9748-1(lines 9748 9752) no Hoare annotation was computed. [2021-11-02 23:24:25,445 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-02 23:24:25,445 INFO L857 garLoopResultBuilder]: For program point L9749-1(line 9749) no Hoare annotation was computed. [2021-11-02 23:24:25,446 INFO L857 garLoopResultBuilder]: For program point L9749-3(line 9749) no Hoare annotation was computed. [2021-11-02 23:24:25,446 INFO L853 garLoopResultBuilder]: At program point L9749-5(lines 9749 9751) the Hoare annotation is: false [2021-11-02 23:24:25,446 INFO L857 garLoopResultBuilder]: For program point L9354(lines 9354 9357) no Hoare annotation was computed. [2021-11-02 23:24:25,446 INFO L853 garLoopResultBuilder]: At program point L238(line 238) the Hoare annotation is: false [2021-11-02 23:24:25,446 INFO L853 garLoopResultBuilder]: At program point L238-1(line 238) the Hoare annotation is: false [2021-11-02 23:24:25,446 INFO L853 garLoopResultBuilder]: At program point L238-2(line 238) the Hoare annotation is: false [2021-11-02 23:24:25,447 INFO L853 garLoopResultBuilder]: At program point L238-3(line 238) the Hoare annotation is: false [2021-11-02 23:24:25,447 INFO L853 garLoopResultBuilder]: At program point L7373(lines 7369 7374) the Hoare annotation is: false [2021-11-02 23:24:25,447 INFO L853 garLoopResultBuilder]: At program point L238-4(line 238) the Hoare annotation is: false [2021-11-02 23:24:25,447 INFO L853 garLoopResultBuilder]: At program point L238-5(line 238) the Hoare annotation is: false [2021-11-02 23:24:25,447 INFO L853 garLoopResultBuilder]: At program point L238-6(line 238) the Hoare annotation is: false [2021-11-02 23:24:25,447 INFO L853 garLoopResultBuilder]: At program point L2617-1(lines 2613 2621) the Hoare annotation is: (and (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (or (not (= ULTIMATE.start_hash_table_state_is_valid_~map.offset 0)) (not (= ULTIMATE.start_hash_table_state_is_valid_~map.base 0))) (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.offset| 0) (not (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.base| 0)) (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base) (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset)) [2021-11-02 23:24:25,448 INFO L853 garLoopResultBuilder]: At program point L2617(lines 2613 2621) the Hoare annotation is: (and (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.offset| 0) (not (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.base| 0)) (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base) (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset)) [2021-11-02 23:24:25,448 INFO L853 garLoopResultBuilder]: At program point L2617-3(lines 2613 2621) the Hoare annotation is: (and (= ULTIMATE.start_aws_hash_table_is_valid_~map.offset |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.offset|) (= (select |#valid| |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.base|) 1) (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (= ULTIMATE.start_ensure_allocated_hash_table_~map.base |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.base|) (or (not (= ULTIMATE.start_hash_table_state_is_valid_~map.offset 0)) (not (= ULTIMATE.start_hash_table_state_is_valid_~map.base 0))) (<= (+ |ULTIMATE.start_aws_add_u64_checked_#res| 1) 0) (<= (+ |ULTIMATE.start_aws_add_size_checked_#res| 1) 0) (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.offset| 0) (not (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.base| 0)) (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.offset| 0) (= ULTIMATE.start_aws_hash_table_is_valid_~map.base |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.base|) (<= (+ |ULTIMATE.start_aws_raise_error_#res| 1) 0) (not (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.base| 0)) (<= ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 8) (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (<= ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 8) (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.base|)) [2021-11-02 23:24:25,448 INFO L853 garLoopResultBuilder]: At program point L2617-2(lines 2613 2621) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.offset| 0)) (.cse1 (= ULTIMATE.start_ensure_allocated_hash_table_~map.base |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.base|)) (.cse2 (or (not (= ULTIMATE.start_hash_table_state_is_valid_~map.offset 0)) (not (= ULTIMATE.start_hash_table_state_is_valid_~map.base 0)))) (.cse3 (= (select (store |#valid| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base| 0) |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.base|) 1)) (.cse4 (= ULTIMATE.start_aws_mul_u64_checked_~b 24)) (.cse5 (= |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.offset| ULTIMATE.start_aws_mul_u64_checked_~r.offset)) (.cse6 (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.offset| 0)) (.cse7 (not (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.base| 0))) (.cse8 (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.offset| 0)) (.cse9 (not (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base| |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.base|))) (.cse10 (not (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.base| 0))) (.cse11 (<= ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 8)) (.cse12 (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset)) (.cse13 (= ULTIMATE.start_hash_table_state_required_bytes_~required_bytes.offset |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.offset|)) (.cse14 (= ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 ULTIMATE.start_aws_mul_u64_checked_~a)) (.cse15 (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base| ULTIMATE.start_hash_table_state_required_bytes_~required_bytes.base)) (.cse16 (<= ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 8)) (.cse17 (= ULTIMATE.start_aws_mul_u64_checked_~r.base |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base|)) (.cse18 (= |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.offset| 0)) (.cse19 (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.base|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= (+ (select (select |#memory_int| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base|) |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.offset|) 29629528) (* 24 ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0)) .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse3 (<= (+ |ULTIMATE.start_aws_add_u64_checked_#res| 1) 0) .cse4 .cse5 (<= (+ |ULTIMATE.start_aws_add_size_checked_#res| 1) 0) .cse6 .cse7 .cse8 (<= (+ |ULTIMATE.start_aws_raise_error_#res| 1) 0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19))) [2021-11-02 23:24:25,449 INFO L853 garLoopResultBuilder]: At program point L239(line 239) the Hoare annotation is: false [2021-11-02 23:24:25,449 INFO L853 garLoopResultBuilder]: At program point L239-1(line 239) the Hoare annotation is: false [2021-11-02 23:24:25,449 INFO L853 garLoopResultBuilder]: At program point L239-2(line 239) the Hoare annotation is: false [2021-11-02 23:24:25,449 INFO L853 garLoopResultBuilder]: At program point L239-3(line 239) the Hoare annotation is: false [2021-11-02 23:24:25,450 INFO L853 garLoopResultBuilder]: At program point L239-4(line 239) the Hoare annotation is: false [2021-11-02 23:24:25,450 INFO L853 garLoopResultBuilder]: At program point L239-5(line 239) the Hoare annotation is: false [2021-11-02 23:24:25,450 INFO L857 garLoopResultBuilder]: For program point L9094(lines 9094 9096) no Hoare annotation was computed. [2021-11-02 23:24:25,450 INFO L857 garLoopResultBuilder]: For program point L9359-2(lines 9359 9362) no Hoare annotation was computed. [2021-11-02 23:24:25,450 INFO L857 garLoopResultBuilder]: For program point L9359(line 9359) no Hoare annotation was computed. [2021-11-02 23:24:25,451 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-02 23:24:25,451 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-02 23:24:25,451 INFO L857 garLoopResultBuilder]: For program point L9097-1(lines 9082 9098) no Hoare annotation was computed. [2021-11-02 23:24:25,451 INFO L853 garLoopResultBuilder]: At program point L9759-3(lines 9759 9783) the Hoare annotation is: false [2021-11-02 23:24:25,452 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-02 23:24:25,452 INFO L853 garLoopResultBuilder]: At program point L9759-4(lines 9759 9783) the Hoare annotation is: false [2021-11-02 23:24:25,452 INFO L857 garLoopResultBuilder]: For program point L9759-1(lines 9759 9783) no Hoare annotation was computed. [2021-11-02 23:24:25,452 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-02 23:24:25,452 INFO L857 garLoopResultBuilder]: For program point L9761(lines 9761 9763) no Hoare annotation was computed. [2021-11-02 23:24:25,453 INFO L853 garLoopResultBuilder]: At program point L250(lines 248 251) the Hoare annotation is: (and (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.offset| 0) (not (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.base| 0)) (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base) (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset)) [2021-11-02 23:24:25,453 INFO L853 garLoopResultBuilder]: At program point L250-1(lines 248 251) the Hoare annotation is: (and (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (or (not (= ULTIMATE.start_hash_table_state_is_valid_~map.offset 0)) (not (= ULTIMATE.start_hash_table_state_is_valid_~map.base 0))) (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.offset| 0) (not (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.base| 0)) (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base) (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset)) [2021-11-02 23:24:25,453 INFO L857 garLoopResultBuilder]: For program point L7385-3(lines 7385 7387) no Hoare annotation was computed. [2021-11-02 23:24:25,453 INFO L857 garLoopResultBuilder]: For program point L7385-2(lines 7385 7387) no Hoare annotation was computed. [2021-11-02 23:24:25,454 INFO L853 garLoopResultBuilder]: At program point L250-2(lines 248 251) the Hoare annotation is: (and (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.offset| 0) (= ULTIMATE.start_ensure_allocated_hash_table_~map.base |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.base|) (or (not (= ULTIMATE.start_hash_table_state_is_valid_~map.offset 0)) (not (= ULTIMATE.start_hash_table_state_is_valid_~map.base 0))) (= (select (store |#valid| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base| 0) |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.base|) 1) (= (* 24 ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0) (select (select |#memory_int| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base|) |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.offset|)) (= ULTIMATE.start_aws_mul_u64_checked_~b 24) (= |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.offset| ULTIMATE.start_aws_mul_u64_checked_~r.offset) (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.offset| 0) (not (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.base| 0)) (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.offset| 0) (not (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base| |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.base|)) (not (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.base| 0)) (= ULTIMATE.start_aws_add_u64_checked_~r.offset |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.offset|) (exists ((|ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base| Int)) (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base|) 0))) (and (= .cse0 (* 24 ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0)) (= .cse0 ULTIMATE.start_aws_add_u64_checked_~a)))) (<= ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 8) (= (+ 29629528 ULTIMATE.start_aws_add_u64_checked_~b) 0) (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (= ULTIMATE.start_hash_table_state_required_bytes_~required_bytes.offset |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.offset|) (= ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 ULTIMATE.start_aws_mul_u64_checked_~a) (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base| ULTIMATE.start_hash_table_state_required_bytes_~required_bytes.base) (<= ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 8) (= ULTIMATE.start_aws_mul_u64_checked_~r.base |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base|) (= ULTIMATE.start_aws_add_u64_checked_~r.base |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base|) (= |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.offset| 0) (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.base|)) [2021-11-02 23:24:25,454 INFO L857 garLoopResultBuilder]: For program point L7385-1(lines 7385 7387) no Hoare annotation was computed. [2021-11-02 23:24:25,454 INFO L853 garLoopResultBuilder]: At program point L250-3(lines 248 251) the Hoare annotation is: false [2021-11-02 23:24:25,454 INFO L857 garLoopResultBuilder]: For program point L7385(lines 7385 7387) no Hoare annotation was computed. [2021-11-02 23:24:25,455 INFO L857 garLoopResultBuilder]: For program point L7385-7(lines 7385 7387) no Hoare annotation was computed. [2021-11-02 23:24:25,455 INFO L857 garLoopResultBuilder]: For program point L7385-6(lines 7385 7387) no Hoare annotation was computed. [2021-11-02 23:24:25,455 INFO L857 garLoopResultBuilder]: For program point L7385-5(lines 7385 7387) no Hoare annotation was computed. [2021-11-02 23:24:25,455 INFO L857 garLoopResultBuilder]: For program point L7385-4(lines 7385 7387) no Hoare annotation was computed. [2021-11-02 23:24:25,455 INFO L853 garLoopResultBuilder]: At program point L2630(lines 2626 2631) the Hoare annotation is: (and (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.offset| 0) (not (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.base| 0)) (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base) (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset)) [2021-11-02 23:24:25,456 INFO L853 garLoopResultBuilder]: At program point L2630-2(lines 2626 2631) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.base|) 1) (= ULTIMATE.start_ensure_allocated_hash_table_~map.base |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.base|) (or (not (= ULTIMATE.start_hash_table_state_is_valid_~map.offset 0)) (not (= ULTIMATE.start_hash_table_state_is_valid_~map.base 0))) (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.offset| 0) (not (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.base| 0)) (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.offset| 0) (not (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.base| 0)) (or (= ULTIMATE.start_assume_abort_if_not_~cond 1) (= ULTIMATE.start_assume_abort_if_not_~cond 0)) (<= ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 8) (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (<= ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 8) (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.base|)) [2021-11-02 23:24:25,456 INFO L853 garLoopResultBuilder]: At program point L2630-1(lines 2626 2631) the Hoare annotation is: (and |ULTIMATE.start_aws_hash_table_is_valid_#t~short1478| (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.base|) |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.offset|) 0)) (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (or (not (= ULTIMATE.start_hash_table_state_is_valid_~map.offset 0)) (not (= ULTIMATE.start_hash_table_state_is_valid_~map.base 0))) (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.offset| 0) (not (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.base| 0)) (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base) (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_hash_table_is_valid_~map.base) ULTIMATE.start_aws_hash_table_is_valid_~map.offset) 0)) (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset)) [2021-11-02 23:24:25,456 INFO L857 garLoopResultBuilder]: For program point L2498(lines 2498 2499) no Hoare annotation was computed. [2021-11-02 23:24:25,456 INFO L853 garLoopResultBuilder]: At program point L2630-4(lines 2626 2631) the Hoare annotation is: false [2021-11-02 23:24:25,457 INFO L853 garLoopResultBuilder]: At program point L2630-3(lines 2626 2631) the Hoare annotation is: (let ((.cse1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.base|) |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.offset|))) (let ((.cse0 (select (select |#memory_int| ULTIMATE.start_hash_table_state_is_valid_~map.base) 40)) (.cse2 (select (select |#memory_int| .cse1) 40))) (and |ULTIMATE.start_aws_hash_table_is_valid_#t~short1475| |ULTIMATE.start_aws_hash_table_is_valid_#t~short1478| (= (select |#valid| |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.base|) 1) (= ULTIMATE.start_aws_hash_table_is_valid_~map.offset 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.base|) (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (= ULTIMATE.start_ensure_allocated_hash_table_~map.base |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.base|) (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.offset| 0) (not (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.base| 0)) (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.offset| 0) (= ULTIMATE.start_aws_hash_table_is_valid_~map.base |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.base|) (= ULTIMATE.start_hash_table_state_is_valid_~map.offset 0) (not (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.base| 0)) (< (+ (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_hash_table_is_valid_~map.base) 0) 1) ULTIMATE.start_aws_hash_table_is_valid_~map.base) (<= (mod (+ 18446744073679922088 (* .cse0 24)) 18446744073709551616) 36028797018963967) (= ULTIMATE.start_hash_table_state_is_valid_~size_at_least_two~0 0) (not (= .cse1 0)) (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_aws_hash_table_is_valid_~map.base) 0)) (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (<= .cse0 8) (<= .cse2 8) (not (= ULTIMATE.start_hash_table_state_is_valid_~map.base 0)) (<= (mod (+ 18446744073679922088 (* .cse2 24)) 18446744073709551616) 36028797018963967)))) [2021-11-02 23:24:25,457 INFO L857 garLoopResultBuilder]: For program point L2498-2(lines 2498 2499) no Hoare annotation was computed. [2021-11-02 23:24:25,457 INFO L853 garLoopResultBuilder]: At program point L2630-6(lines 2626 2631) the Hoare annotation is: false [2021-11-02 23:24:25,458 INFO L857 garLoopResultBuilder]: For program point L2498-1(lines 2498 2499) no Hoare annotation was computed. [2021-11-02 23:24:25,458 INFO L853 garLoopResultBuilder]: At program point L2630-5(lines 2626 2631) the Hoare annotation is: false [2021-11-02 23:24:25,458 INFO L853 garLoopResultBuilder]: At program point L2630-8(lines 2626 2631) the Hoare annotation is: false [2021-11-02 23:24:25,458 INFO L857 garLoopResultBuilder]: For program point L2498-3(lines 2498 2499) no Hoare annotation was computed. [2021-11-02 23:24:25,458 INFO L853 garLoopResultBuilder]: At program point L2630-7(lines 2626 2631) the Hoare annotation is: false [2021-11-02 23:24:25,459 INFO L853 garLoopResultBuilder]: At program point L2630-10(lines 2626 2631) the Hoare annotation is: false [2021-11-02 23:24:25,459 INFO L853 garLoopResultBuilder]: At program point L2630-9(lines 2626 2631) the Hoare annotation is: false [2021-11-02 23:24:25,459 INFO L853 garLoopResultBuilder]: At program point L2630-12(lines 2626 2631) the Hoare annotation is: false [2021-11-02 23:24:25,459 INFO L853 garLoopResultBuilder]: At program point L2630-11(lines 2626 2631) the Hoare annotation is: false [2021-11-02 23:24:25,459 INFO L853 garLoopResultBuilder]: At program point L2630-14(lines 2626 2631) the Hoare annotation is: false [2021-11-02 23:24:25,460 INFO L853 garLoopResultBuilder]: At program point L2630-13(lines 2626 2631) the Hoare annotation is: false [2021-11-02 23:24:25,460 INFO L853 garLoopResultBuilder]: At program point L2630-16(lines 2626 2631) the Hoare annotation is: false [2021-11-02 23:24:25,460 INFO L853 garLoopResultBuilder]: At program point L2630-15(lines 2626 2631) the Hoare annotation is: false [2021-11-02 23:24:25,460 INFO L853 garLoopResultBuilder]: At program point L2630-18(lines 2626 2631) the Hoare annotation is: false [2021-11-02 23:24:25,460 INFO L853 garLoopResultBuilder]: At program point L2630-17(lines 2626 2631) the Hoare annotation is: false [2021-11-02 23:24:25,461 INFO L853 garLoopResultBuilder]: At program point L2630-20(lines 2626 2631) the Hoare annotation is: false [2021-11-02 23:24:25,461 INFO L853 garLoopResultBuilder]: At program point L2630-19(lines 2626 2631) the Hoare annotation is: false [2021-11-02 23:24:25,461 INFO L853 garLoopResultBuilder]: At program point L2630-22(lines 2626 2631) the Hoare annotation is: false [2021-11-02 23:24:25,461 INFO L853 garLoopResultBuilder]: At program point L2630-21(lines 2626 2631) the Hoare annotation is: false [2021-11-02 23:24:25,461 INFO L853 garLoopResultBuilder]: At program point L2630-24(lines 2626 2631) the Hoare annotation is: false [2021-11-02 23:24:25,462 INFO L853 garLoopResultBuilder]: At program point L2630-23(lines 2626 2631) the Hoare annotation is: false [2021-11-02 23:24:25,462 INFO L857 garLoopResultBuilder]: For program point L9370(lines 9370 9378) no Hoare annotation was computed. [2021-11-02 23:24:25,462 INFO L857 garLoopResultBuilder]: For program point L9107(lines 9107 9111) no Hoare annotation was computed. [2021-11-02 23:24:25,462 INFO L857 garLoopResultBuilder]: For program point L9107-1(lines 9107 9111) no Hoare annotation was computed. [2021-11-02 23:24:25,462 INFO L857 garLoopResultBuilder]: For program point L9107-2(lines 9107 9111) no Hoare annotation was computed. [2021-11-02 23:24:25,463 INFO L853 garLoopResultBuilder]: At program point L2501-1(lines 2497 2502) the Hoare annotation is: (let ((.cse0 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse1 (or (not (= ULTIMATE.start_hash_table_state_is_valid_~map.offset 0)) (not (= ULTIMATE.start_hash_table_state_is_valid_~map.base 0)))) (.cse2 (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.offset| 0)) (.cse3 (not (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.base| 0))) (.cse4 (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base)) (.cse5 (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= |ULTIMATE.start_aws_mul_u64_checked_#res| 0)) (and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.base|) |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.offset|) 0)) .cse0 .cse1 .cse2 .cse3 .cse4 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_hash_table_is_valid_~map.base) ULTIMATE.start_aws_hash_table_is_valid_~map.offset) 0)) .cse5))) [2021-11-02 23:24:25,463 INFO L853 garLoopResultBuilder]: At program point L2501(lines 2497 2502) the Hoare annotation is: (and (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.offset| 0) (not (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.base| 0)) (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base) (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset)) [2021-11-02 23:24:25,463 INFO L853 garLoopResultBuilder]: At program point L2501-3(lines 2497 2502) the Hoare annotation is: false [2021-11-02 23:24:25,464 INFO L853 garLoopResultBuilder]: At program point L2501-2(lines 2497 2502) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.offset| 0)) (.cse1 (= ULTIMATE.start_ensure_allocated_hash_table_~map.base |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.base|)) (.cse2 (or (not (= ULTIMATE.start_hash_table_state_is_valid_~map.offset 0)) (not (= ULTIMATE.start_hash_table_state_is_valid_~map.base 0)))) (.cse3 (= (select (store |#valid| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base| 0) |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.base|) 1)) (.cse4 (= ULTIMATE.start_aws_mul_u64_checked_~b 24)) (.cse5 (= |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.offset| ULTIMATE.start_aws_mul_u64_checked_~r.offset)) (.cse6 (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.offset| 0)) (.cse7 (not (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.base| 0))) (.cse8 (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.offset| 0)) (.cse9 (not (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base| |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.base|))) (.cse10 (not (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.base| 0))) (.cse11 (<= ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 8)) (.cse12 (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset)) (.cse13 (= ULTIMATE.start_hash_table_state_required_bytes_~required_bytes.offset |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.offset|)) (.cse14 (= ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 ULTIMATE.start_aws_mul_u64_checked_~a)) (.cse15 (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base| ULTIMATE.start_hash_table_state_required_bytes_~required_bytes.base)) (.cse16 (<= ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 8)) (.cse17 (= ULTIMATE.start_aws_mul_u64_checked_~r.base |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base|)) (.cse18 (= |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.offset| 0)) (.cse19 (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.base|))) (or (and (<= (+ |ULTIMATE.start_aws_mul_u64_checked_#res| 1) 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= (+ |ULTIMATE.start_aws_raise_error_#res| 1) 0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse3 (= (* 24 ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0) (select (select |#memory_int| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base|) |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.offset|)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19))) [2021-11-02 23:24:25,464 INFO L853 garLoopResultBuilder]: At program point L255(lines 253 256) the Hoare annotation is: (and (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.offset| 0) (not (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.base| 0)) (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base) (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset)) [2021-11-02 23:24:25,464 INFO L853 garLoopResultBuilder]: At program point L255-1(lines 253 256) the Hoare annotation is: (and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.base|) |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.offset|) 0)) (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (or (not (= ULTIMATE.start_hash_table_state_is_valid_~map.offset 0)) (not (= ULTIMATE.start_hash_table_state_is_valid_~map.base 0))) (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.offset| 0) (not (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.base| 0)) (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base) (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_hash_table_is_valid_~map.base) ULTIMATE.start_aws_hash_table_is_valid_~map.offset) 0)) (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset)) [2021-11-02 23:24:25,465 INFO L853 garLoopResultBuilder]: At program point L255-2(lines 253 256) the Hoare annotation is: (and (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.offset| 0) (= ULTIMATE.start_ensure_allocated_hash_table_~map.base |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.base|) (or (not (= ULTIMATE.start_hash_table_state_is_valid_~map.offset 0)) (not (= ULTIMATE.start_hash_table_state_is_valid_~map.base 0))) (= (select (store |#valid| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base| 0) |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.base|) 1) (= ULTIMATE.start_aws_mul_u64_checked_~b 24) (= |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.offset| ULTIMATE.start_aws_mul_u64_checked_~r.offset) (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.offset| 0) (not (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.base| 0)) (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.offset| 0) (not (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base| |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.base|)) (not (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.base| 0)) (<= ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 8) (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (= ULTIMATE.start_hash_table_state_required_bytes_~required_bytes.offset |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.offset|) (= ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 ULTIMATE.start_aws_mul_u64_checked_~a) (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base| ULTIMATE.start_hash_table_state_required_bytes_~required_bytes.base) (<= ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 8) (= ULTIMATE.start_aws_mul_u64_checked_~r.base |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base|) (= |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.offset| 0) (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.base|)) [2021-11-02 23:24:25,465 INFO L853 garLoopResultBuilder]: At program point L255-3(lines 253 256) the Hoare annotation is: false [2021-11-02 23:24:25,465 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-11-02 23:24:25,465 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-02 23:24:25,466 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-02 23:24:25,466 INFO L857 garLoopResultBuilder]: For program point L9771(lines 9771 9776) no Hoare annotation was computed. [2021-11-02 23:24:25,466 INFO L857 garLoopResultBuilder]: For program point L9771-1(lines 9771 9776) no Hoare annotation was computed. [2021-11-02 23:24:25,466 INFO L857 garLoopResultBuilder]: For program point L7195-1(lines 7195 7201) no Hoare annotation was computed. [2021-11-02 23:24:25,466 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-02 23:24:25,467 INFO L857 garLoopResultBuilder]: For program point L7195(lines 7195 7201) no Hoare annotation was computed. [2021-11-02 23:24:25,467 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-02 23:24:25,467 INFO L857 garLoopResultBuilder]: For program point L7196-2(lines 7196 7200) no Hoare annotation was computed. [2021-11-02 23:24:25,467 INFO L857 garLoopResultBuilder]: For program point L7196(lines 7196 7200) no Hoare annotation was computed. [2021-11-02 23:24:25,467 INFO L857 garLoopResultBuilder]: For program point L9773-1(line 9773) no Hoare annotation was computed. [2021-11-02 23:24:25,468 INFO L857 garLoopResultBuilder]: For program point L9773-3(line 9773) no Hoare annotation was computed. [2021-11-02 23:24:25,468 INFO L853 garLoopResultBuilder]: At program point L9773-5(lines 9773 9775) the Hoare annotation is: false [2021-11-02 23:24:25,468 INFO L857 garLoopResultBuilder]: For program point L9311(lines 9311 9317) no Hoare annotation was computed. [2021-11-02 23:24:25,468 INFO L857 garLoopResultBuilder]: For program point L10104-3(lines 10104 10106) no Hoare annotation was computed. [2021-11-02 23:24:25,469 INFO L857 garLoopResultBuilder]: For program point L9113(lines 9113 9121) no Hoare annotation was computed. [2021-11-02 23:24:25,469 INFO L857 garLoopResultBuilder]: For program point L10104(lines 10104 10106) no Hoare annotation was computed. [2021-11-02 23:24:25,469 INFO L857 garLoopResultBuilder]: For program point L9113-1(lines 9113 9121) no Hoare annotation was computed. [2021-11-02 23:24:25,469 INFO L857 garLoopResultBuilder]: For program point L10104-1(lines 10104 10106) no Hoare annotation was computed. [2021-11-02 23:24:25,469 INFO L857 garLoopResultBuilder]: For program point L9113-2(lines 9113 9121) no Hoare annotation was computed. [2021-11-02 23:24:25,469 INFO L857 garLoopResultBuilder]: For program point L10104-2(lines 10104 10106) no Hoare annotation was computed. [2021-11-02 23:24:25,469 INFO L857 garLoopResultBuilder]: For program point L9312(lines 9312 9314) no Hoare annotation was computed. [2021-11-02 23:24:25,469 INFO L857 garLoopResultBuilder]: For program point L9312-2(lines 9312 9314) no Hoare annotation was computed. [2021-11-02 23:24:25,469 INFO L853 garLoopResultBuilder]: At program point L262(line 262) the Hoare annotation is: false [2021-11-02 23:24:25,470 INFO L853 garLoopResultBuilder]: At program point L262-1(line 262) the Hoare annotation is: false [2021-11-02 23:24:25,470 INFO L853 garLoopResultBuilder]: At program point L262-2(line 262) the Hoare annotation is: false [2021-11-02 23:24:25,470 INFO L853 garLoopResultBuilder]: At program point L263(line 263) the Hoare annotation is: (and (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (or (not (= ULTIMATE.start_hash_table_state_is_valid_~map.offset 0)) (not (= ULTIMATE.start_hash_table_state_is_valid_~map.base 0))) (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.offset| 0) (not (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.base| 0)) (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base) (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset)) [2021-11-02 23:24:25,470 INFO L853 garLoopResultBuilder]: At program point L263-1(line 263) the Hoare annotation is: false [2021-11-02 23:24:25,470 INFO L857 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-11-02 23:24:25,470 INFO L853 garLoopResultBuilder]: At program point L-1-1(line -1) the Hoare annotation is: false [2021-11-02 23:24:25,470 INFO L857 garLoopResultBuilder]: For program point L-1-2(line -1) no Hoare annotation was computed. [2021-11-02 23:24:25,470 INFO L857 garLoopResultBuilder]: For program point L-1-4(line -1) no Hoare annotation was computed. [2021-11-02 23:24:25,470 INFO L853 garLoopResultBuilder]: At program point L-1-5(line -1) the Hoare annotation is: false [2021-11-02 23:24:25,470 INFO L857 garLoopResultBuilder]: For program point L-1-6(line -1) no Hoare annotation was computed. [2021-11-02 23:24:25,471 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-02 23:24:25,471 INFO L857 garLoopResultBuilder]: For program point L-1-8(line -1) no Hoare annotation was computed. [2021-11-02 23:24:25,471 INFO L853 garLoopResultBuilder]: At program point L-1-9(line -1) the Hoare annotation is: false [2021-11-02 23:24:25,471 INFO L857 garLoopResultBuilder]: For program point L-1-10(line -1) no Hoare annotation was computed. [2021-11-02 23:24:25,471 INFO L857 garLoopResultBuilder]: For program point L-1-12(line -1) no Hoare annotation was computed. [2021-11-02 23:24:25,471 INFO L853 garLoopResultBuilder]: At program point L-1-13(line -1) the Hoare annotation is: false [2021-11-02 23:24:25,471 INFO L857 garLoopResultBuilder]: For program point L7267-1(lines 7267 7272) no Hoare annotation was computed. [2021-11-02 23:24:25,471 INFO L857 garLoopResultBuilder]: For program point L7267(lines 7267 7272) no Hoare annotation was computed. [2021-11-02 23:24:25,471 INFO L857 garLoopResultBuilder]: For program point L10108(lines 10108 10110) no Hoare annotation was computed. [2021-11-02 23:24:25,471 INFO L857 garLoopResultBuilder]: For program point L10108-1(lines 10108 10110) no Hoare annotation was computed. [2021-11-02 23:24:25,471 INFO L857 garLoopResultBuilder]: For program point L10108-2(lines 10108 10110) no Hoare annotation was computed. [2021-11-02 23:24:25,472 INFO L857 garLoopResultBuilder]: For program point L9778(lines 9778 9782) no Hoare annotation was computed. [2021-11-02 23:24:25,472 INFO L857 garLoopResultBuilder]: For program point L10108-3(lines 10108 10110) no Hoare annotation was computed. [2021-11-02 23:24:25,472 INFO L857 garLoopResultBuilder]: For program point L9779-1(line 9779) no Hoare annotation was computed. [2021-11-02 23:24:25,472 INFO L857 garLoopResultBuilder]: For program point L9779-3(line 9779) no Hoare annotation was computed. [2021-11-02 23:24:25,472 INFO L853 garLoopResultBuilder]: At program point L266(line 266) the Hoare annotation is: (and (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.offset| 0) (not (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.base| 0)) (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base) (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset)) [2021-11-02 23:24:25,472 INFO L853 garLoopResultBuilder]: At program point L9779-5(lines 9779 9781) the Hoare annotation is: false [2021-11-02 23:24:25,472 INFO L853 garLoopResultBuilder]: At program point L266-1(line 266) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.base|) 1) (= ULTIMATE.start_ensure_allocated_hash_table_~map.base |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.base|) (or (not (= ULTIMATE.start_hash_table_state_is_valid_~map.offset 0)) (not (= ULTIMATE.start_hash_table_state_is_valid_~map.base 0))) (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.offset| 0) (not (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.base| 0)) (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.offset| 0) (not (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.base| 0)) (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (<= ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 8) (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.base|)) [2021-11-02 23:24:25,472 INFO L853 garLoopResultBuilder]: At program point L10044(lines 9999 10046) the Hoare annotation is: (and |ULTIMATE.start_aws_hash_table_is_valid_#t~short1478| (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.base|) |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.offset|) 0)) (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (or (not (= ULTIMATE.start_hash_table_state_is_valid_~map.offset 0)) (not (= ULTIMATE.start_hash_table_state_is_valid_~map.base 0))) (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.offset| 0) (not (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.base| 0)) (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base) (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_hash_table_is_valid_~map.base) ULTIMATE.start_aws_hash_table_is_valid_~map.offset) 0)) (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset)) [2021-11-02 23:24:25,473 INFO L853 garLoopResultBuilder]: At program point L10044-1(lines 9999 10046) the Hoare annotation is: (let ((.cse1 (select (select |#memory_int| ULTIMATE.start_hash_table_state_is_valid_~map.base) 40)) (.cse0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_hash_table_is_valid_~map.base) 0)) (.cse2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.base|) |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.offset|))) (and |ULTIMATE.start_aws_hash_table_is_valid_#t~short1475| |ULTIMATE.start_aws_hash_table_is_valid_#t~short1478| (= (select |#valid| |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.base|) 1) (= ULTIMATE.start_aws_hash_table_is_valid_~map.offset 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.base|) (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (= ULTIMATE.start_ensure_allocated_hash_table_~map.base |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.base|) (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.offset| 0) (not (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.base| 0)) (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.offset| 0) (= ULTIMATE.start_aws_hash_table_is_valid_~map.base |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.base|) (= ULTIMATE.start_hash_table_state_is_valid_~map.offset 0) (not (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.base| 0)) (= |ULTIMATE.start_hash_table_state_is_valid_#res| 0) (< (+ .cse0 1) ULTIMATE.start_aws_hash_table_is_valid_~map.base) (<= (mod (+ 18446744073679922088 (* .cse1 24)) 18446744073709551616) 36028797018963967) (= ULTIMATE.start_hash_table_state_is_valid_~size_at_least_two~0 0) (not (= .cse2 0)) (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_aws_hash_table_is_valid_~map.base) 0)) (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (<= .cse1 8) (<= (mod (+ 18446744073679922088 (* (select (select |#memory_int| .cse0) 40) 24)) 18446744073709551616) 36028797018963967) (<= (select (select |#memory_int| .cse2) 40) 8) (not (= ULTIMATE.start_hash_table_state_is_valid_~map.base 0)))) [2021-11-02 23:24:25,473 INFO L853 garLoopResultBuilder]: At program point L10044-2(lines 9999 10046) the Hoare annotation is: false [2021-11-02 23:24:25,473 INFO L853 garLoopResultBuilder]: At program point L10044-7(lines 9999 10046) the Hoare annotation is: false [2021-11-02 23:24:25,473 INFO L853 garLoopResultBuilder]: At program point L10044-8(lines 9999 10046) the Hoare annotation is: false [2021-11-02 23:24:25,473 INFO L853 garLoopResultBuilder]: At program point L10044-9(lines 9999 10046) the Hoare annotation is: (and (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (= ULTIMATE.start_ensure_allocated_hash_table_~map.base |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.base|) (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.offset| 0) (not (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.base| 0)) (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.offset| 0) (not (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.base| 0)) (= |ULTIMATE.start_hash_table_state_is_valid_#res| 0) (not (= ULTIMATE.start_aws_hash_table_eq_~b.base 0)) (or (= ULTIMATE.start_assume_abort_if_not_~cond 1) (= ULTIMATE.start_assume_abort_if_not_~cond 0)) (<= ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 8) (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (not (= ULTIMATE.start_aws_hash_table_eq_~a.base 0)) (<= ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 8) (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.base|)) [2021-11-02 23:24:25,473 INFO L853 garLoopResultBuilder]: At program point L10044-10(lines 9999 10046) the Hoare annotation is: (and (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (= ULTIMATE.start_ensure_allocated_hash_table_~map.base |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.base|) (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.offset| 0) (not (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.base| 0)) (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.offset| 0) (not (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.base| 0)) (= |ULTIMATE.start_hash_table_state_is_valid_#res| 0) (not (= ULTIMATE.start_aws_hash_table_eq_~b.base 0)) (<= ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 8) (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (not (= ULTIMATE.start_aws_hash_table_eq_~a.base 0)) (<= ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 8) (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.base|)) [2021-11-02 23:24:25,473 INFO L853 garLoopResultBuilder]: At program point L10044-3(lines 9999 10046) the Hoare annotation is: false [2021-11-02 23:24:25,473 INFO L853 garLoopResultBuilder]: At program point L10044-4(lines 9999 10046) the Hoare annotation is: false [2021-11-02 23:24:25,473 INFO L853 garLoopResultBuilder]: At program point L10044-5(lines 9999 10046) the Hoare annotation is: false [2021-11-02 23:24:25,474 INFO L853 garLoopResultBuilder]: At program point L10044-6(lines 9999 10046) the Hoare annotation is: false [2021-11-02 23:24:25,474 INFO L853 garLoopResultBuilder]: At program point L10044-15(lines 9999 10046) the Hoare annotation is: false [2021-11-02 23:24:25,474 INFO L853 garLoopResultBuilder]: At program point L10044-16(lines 9999 10046) the Hoare annotation is: false [2021-11-02 23:24:25,474 INFO L853 garLoopResultBuilder]: At program point L10044-17(lines 9999 10046) the Hoare annotation is: false [2021-11-02 23:24:25,474 INFO L853 garLoopResultBuilder]: At program point L10044-18(lines 9999 10046) the Hoare annotation is: false [2021-11-02 23:24:25,474 INFO L853 garLoopResultBuilder]: At program point L10044-11(lines 9999 10046) the Hoare annotation is: false [2021-11-02 23:24:25,474 INFO L853 garLoopResultBuilder]: At program point L10044-12(lines 9999 10046) the Hoare annotation is: (and (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (= ULTIMATE.start_ensure_allocated_hash_table_~map.base |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.base|) (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.offset| 0) (not (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.base| 0)) (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.offset| 0) (not (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.base| 0)) (= |ULTIMATE.start_hash_table_state_is_valid_#res| 0) (not (= ULTIMATE.start_aws_hash_table_eq_~b.base 0)) (<= ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 8) (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (not (= ULTIMATE.start_aws_hash_table_eq_~a.base 0)) (<= ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 8) (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.base|)) [2021-11-02 23:24:25,474 INFO L853 garLoopResultBuilder]: At program point L10044-13(lines 9999 10046) the Hoare annotation is: false [2021-11-02 23:24:25,474 INFO L853 garLoopResultBuilder]: At program point L10044-14(lines 9999 10046) the Hoare annotation is: false [2021-11-02 23:24:25,474 INFO L853 garLoopResultBuilder]: At program point L10044-19(lines 9999 10046) the Hoare annotation is: false [2021-11-02 23:24:25,475 INFO L857 garLoopResultBuilder]: For program point L9384(lines 9384 9386) no Hoare annotation was computed. [2021-11-02 23:24:25,475 INFO L853 garLoopResultBuilder]: At program point L10044-20(lines 9999 10046) the Hoare annotation is: false [2021-11-02 23:24:25,475 INFO L853 garLoopResultBuilder]: At program point L10044-21(lines 9999 10046) the Hoare annotation is: false [2021-11-02 23:24:25,475 INFO L857 garLoopResultBuilder]: For program point L9384-2(lines 9384 9386) no Hoare annotation was computed. [2021-11-02 23:24:25,475 INFO L853 garLoopResultBuilder]: At program point L10044-22(lines 9999 10046) the Hoare annotation is: false [2021-11-02 23:24:25,475 INFO L857 garLoopResultBuilder]: For program point L9319-2(lines 9319 9325) no Hoare annotation was computed. [2021-11-02 23:24:25,475 INFO L857 garLoopResultBuilder]: For program point L9319(line 9319) no Hoare annotation was computed. [2021-11-02 23:24:25,475 INFO L853 garLoopResultBuilder]: At program point L10112-3(lines 10101 10113) the Hoare annotation is: (and (= ULTIMATE.start_aws_hash_table_is_valid_~map.offset |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.offset|) (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (= ULTIMATE.start_ensure_allocated_hash_table_~map.base |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.base|) (or (not (= ULTIMATE.start_hash_table_state_is_valid_~map.offset 0)) (not (= ULTIMATE.start_hash_table_state_is_valid_~map.base 0))) (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.offset| 0) (not (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.base| 0)) (<= (+ |ULTIMATE.start_hash_table_state_required_bytes_#res| 1) 0) (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.offset| 0) (= ULTIMATE.start_aws_hash_table_is_valid_~map.base |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.base|) (not (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.base| 0)) (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset)) [2021-11-02 23:24:25,475 INFO L853 garLoopResultBuilder]: At program point L10112(lines 10101 10113) the Hoare annotation is: (and (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.offset| 0) (not (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.base| 0)) (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base) (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset)) [2021-11-02 23:24:25,476 INFO L853 garLoopResultBuilder]: At program point L10112-1(lines 10101 10113) the Hoare annotation is: (and (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (or (not (= ULTIMATE.start_hash_table_state_is_valid_~map.offset 0)) (not (= ULTIMATE.start_hash_table_state_is_valid_~map.base 0))) (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.offset| 0) (not (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.base| 0)) (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base) (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset)) [2021-11-02 23:24:25,476 INFO L853 garLoopResultBuilder]: At program point L10112-2(lines 10101 10113) the Hoare annotation is: (let ((.cse0 (= (select |#valid| |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.base|) 1)) (.cse1 (= ULTIMATE.start_ensure_allocated_hash_table_~map.base |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.base|)) (.cse2 (or (not (= ULTIMATE.start_hash_table_state_is_valid_~map.offset 0)) (not (= ULTIMATE.start_hash_table_state_is_valid_~map.base 0)))) (.cse3 (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.offset| 0)) (.cse4 (not (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.base| 0))) (.cse5 (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.offset| 0)) (.cse6 (not (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base| |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.base|))) (.cse7 (not (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.base| 0))) (.cse8 (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset))) (or (and (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.offset| 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 8) .cse8 (= (+ (select (select |#memory_int| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base|) |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.offset|) 29629528) (* 24 ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0)) (<= ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 8) (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.base|)) (and .cse0 (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.base|) .cse1 .cse2 .cse3 .cse4 (<= (+ |ULTIMATE.start_hash_table_state_required_bytes_#res| 1) 0) .cse5 .cse6 .cse7 .cse8))) [2021-11-02 23:24:25,476 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-02 23:24:25,476 INFO L857 garLoopResultBuilder]: For program point L6809-1(lines 6809 6819) no Hoare annotation was computed. [2021-11-02 23:24:25,476 INFO L857 garLoopResultBuilder]: For program point L6809(lines 6809 6819) no Hoare annotation was computed. [2021-11-02 23:24:25,476 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-02 23:24:25,477 INFO L857 garLoopResultBuilder]: For program point L9320(lines 9320 9322) no Hoare annotation was computed. [2021-11-02 23:24:25,477 INFO L857 garLoopResultBuilder]: For program point L9320-2(lines 9320 9322) no Hoare annotation was computed. [2021-11-02 23:24:25,477 INFO L853 garLoopResultBuilder]: At program point L9123(lines 9103 9124) the Hoare annotation is: false [2021-11-02 23:24:25,477 INFO L853 garLoopResultBuilder]: At program point L9123-1(lines 9103 9124) the Hoare annotation is: false [2021-11-02 23:24:25,477 INFO L857 garLoopResultBuilder]: For program point L10114(lines 10114 10143) no Hoare annotation was computed. [2021-11-02 23:24:25,478 INFO L853 garLoopResultBuilder]: At program point L9123-2(lines 9103 9124) the Hoare annotation is: false [2021-11-02 23:24:25,478 INFO L857 garLoopResultBuilder]: For program point L9784-4(lines 9741 9787) no Hoare annotation was computed. [2021-11-02 23:24:25,478 INFO L857 garLoopResultBuilder]: For program point L9784(line 9784) no Hoare annotation was computed. [2021-11-02 23:24:25,478 INFO L857 garLoopResultBuilder]: For program point L9784-2(line 9784) no Hoare annotation was computed. [2021-11-02 23:24:25,478 INFO L853 garLoopResultBuilder]: At program point L9388(lines 9330 9389) the Hoare annotation is: false [2021-11-02 23:24:25,479 INFO L857 garLoopResultBuilder]: For program point L7274(lines 7274 7278) no Hoare annotation was computed. [2021-11-02 23:24:25,479 INFO L857 garLoopResultBuilder]: For program point L7274-1(lines 7274 7278) no Hoare annotation was computed. [2021-11-02 23:24:25,479 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-02 23:24:25,479 INFO L857 garLoopResultBuilder]: For program point L7341-3(lines 7341 7343) no Hoare annotation was computed. [2021-11-02 23:24:25,479 INFO L857 garLoopResultBuilder]: For program point L7341-2(lines 7341 7343) no Hoare annotation was computed. [2021-11-02 23:24:25,480 INFO L857 garLoopResultBuilder]: For program point L7341(lines 7341 7343) no Hoare annotation was computed. [2021-11-02 23:24:25,480 INFO L857 garLoopResultBuilder]: For program point L7341-6(lines 7341 7343) no Hoare annotation was computed. [2021-11-02 23:24:25,480 INFO L857 garLoopResultBuilder]: For program point L7341-5(lines 7341 7343) no Hoare annotation was computed. [2021-11-02 23:24:25,480 INFO L857 garLoopResultBuilder]: For program point L7341-8(lines 7341 7343) no Hoare annotation was computed. [2021-11-02 23:24:25,480 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-02 23:24:25,481 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-02 23:24:25,481 INFO L853 garLoopResultBuilder]: At program point L9391(lines 9391 9411) the Hoare annotation is: false [2021-11-02 23:24:25,481 INFO L853 garLoopResultBuilder]: At program point L6947-1(lines 6943 6948) the Hoare annotation is: (and (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.offset| 0) (= |ULTIMATE.start_bounded_malloc_#res.offset| 0) (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (= ULTIMATE.start_ensure_allocated_hash_table_~map.base |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.base|) (or (not (= ULTIMATE.start_hash_table_state_is_valid_~map.offset 0)) (not (= ULTIMATE.start_hash_table_state_is_valid_~map.base 0))) (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.offset| 0) (not (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.base| 0)) (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.offset| 0) (not (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.base| 0)) (= (select (store |#valid| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base| 0) |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.base|) 1) (< (+ |ULTIMATE.start_bounded_malloc_#res.base| 1) |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.base|) (exists ((|ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base| Int)) (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base|) 0))) (and (= (* 24 ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0) (+ 29629528 .cse0)) (<= (mod .cse0 18446744073709551616) 36028797018963967)))) (<= ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 8) (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (exists ((|ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base| Int)) (let ((.cse1 (select (select |#memory_int| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base|) 0))) (and (= (* 24 ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0) (+ 29629528 .cse1)) (let ((.cse2 (mod .cse1 18446744073709551616))) (or (and (= ULTIMATE.start_assume_abort_if_not_~cond 1) (<= .cse2 36028797018963967)) (and (= ULTIMATE.start_assume_abort_if_not_~cond 0) (< 36028797018963967 .cse2))))))) (= (+ (select (select |#memory_int| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base|) |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.offset|) 29629528) (* 24 ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0)) (<= ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 8) (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.base|)) [2021-11-02 23:24:25,482 INFO L853 garLoopResultBuilder]: At program point L6947(lines 6943 6948) the Hoare annotation is: (and (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.offset| 0) (not (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.base| 0)) (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base) (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset)) [2021-11-02 23:24:25,482 INFO L853 garLoopResultBuilder]: At program point L7344-2(lines 7331 7345) the Hoare annotation is: false [2021-11-02 23:24:25,482 INFO L853 garLoopResultBuilder]: At program point L7344-1(lines 7331 7345) the Hoare annotation is: false [2021-11-02 23:24:25,482 INFO L853 garLoopResultBuilder]: At program point L7344(lines 7331 7345) the Hoare annotation is: false [2021-11-02 23:24:25,482 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-02 23:24:25,483 INFO L857 garLoopResultBuilder]: For program point L210(lines 210 212) no Hoare annotation was computed. [2021-11-02 23:24:25,483 INFO L857 garLoopResultBuilder]: For program point L210-1(lines 210 212) no Hoare annotation was computed. [2021-11-02 23:24:25,483 INFO L857 garLoopResultBuilder]: For program point L210-2(lines 210 212) no Hoare annotation was computed. [2021-11-02 23:24:25,483 INFO L857 garLoopResultBuilder]: For program point L210-3(lines 210 212) no Hoare annotation was computed. [2021-11-02 23:24:25,483 INFO L857 garLoopResultBuilder]: For program point L210-4(lines 210 212) no Hoare annotation was computed. [2021-11-02 23:24:25,484 INFO L857 garLoopResultBuilder]: For program point L210-5(lines 210 212) no Hoare annotation was computed. [2021-11-02 23:24:25,484 INFO L857 garLoopResultBuilder]: For program point L210-6(lines 210 212) no Hoare annotation was computed. [2021-11-02 23:24:25,484 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-02 23:24:25,484 INFO L857 garLoopResultBuilder]: For program point L210-7(lines 210 212) no Hoare annotation was computed. [2021-11-02 23:24:25,484 INFO L853 garLoopResultBuilder]: At program point L9327(lines 9303 9328) the Hoare annotation is: false [2021-11-02 23:24:25,485 INFO L857 garLoopResultBuilder]: For program point L210-8(lines 210 212) no Hoare annotation was computed. [2021-11-02 23:24:25,485 INFO L857 garLoopResultBuilder]: For program point L210-9(lines 210 212) no Hoare annotation was computed. [2021-11-02 23:24:25,485 INFO L857 garLoopResultBuilder]: For program point L210-10(lines 210 212) no Hoare annotation was computed. [2021-11-02 23:24:25,485 INFO L857 garLoopResultBuilder]: For program point L210-11(lines 210 212) no Hoare annotation was computed. [2021-11-02 23:24:25,485 INFO L857 garLoopResultBuilder]: For program point L210-12(lines 210 212) no Hoare annotation was computed. [2021-11-02 23:24:25,486 INFO L857 garLoopResultBuilder]: For program point L210-13(lines 210 212) no Hoare annotation was computed. [2021-11-02 23:24:25,486 INFO L853 garLoopResultBuilder]: At program point L9129(lines 9129 9137) the Hoare annotation is: false [2021-11-02 23:24:25,486 INFO L857 garLoopResultBuilder]: For program point L210-14(lines 210 212) no Hoare annotation was computed. [2021-11-02 23:24:25,486 INFO L853 garLoopResultBuilder]: At program point L9129-1(lines 9129 9137) the Hoare annotation is: false [2021-11-02 23:24:25,486 INFO L857 garLoopResultBuilder]: For program point L210-15(lines 210 212) no Hoare annotation was computed. [2021-11-02 23:24:25,487 INFO L857 garLoopResultBuilder]: For program point L210-16(lines 210 212) no Hoare annotation was computed. [2021-11-02 23:24:25,487 INFO L857 garLoopResultBuilder]: For program point L210-17(lines 210 212) no Hoare annotation was computed. [2021-11-02 23:24:25,487 INFO L857 garLoopResultBuilder]: For program point L210-18(lines 210 212) no Hoare annotation was computed. [2021-11-02 23:24:25,487 INFO L857 garLoopResultBuilder]: For program point L210-19(lines 210 212) no Hoare annotation was computed. [2021-11-02 23:24:25,487 INFO L857 garLoopResultBuilder]: For program point L210-20(lines 210 212) no Hoare annotation was computed. [2021-11-02 23:24:25,488 INFO L857 garLoopResultBuilder]: For program point L210-21(lines 210 212) no Hoare annotation was computed. [2021-11-02 23:24:25,488 INFO L857 garLoopResultBuilder]: For program point L210-22(lines 210 212) no Hoare annotation was computed. [2021-11-02 23:24:25,488 INFO L857 garLoopResultBuilder]: For program point L210-23(lines 210 212) no Hoare annotation was computed. [2021-11-02 23:24:25,488 INFO L857 garLoopResultBuilder]: For program point L210-24(lines 210 212) no Hoare annotation was computed. [2021-11-02 23:24:25,488 INFO L857 garLoopResultBuilder]: For program point L210-25(lines 210 212) no Hoare annotation was computed. [2021-11-02 23:24:25,488 INFO L857 garLoopResultBuilder]: For program point L210-26(lines 210 212) no Hoare annotation was computed. [2021-11-02 23:24:25,489 INFO L857 garLoopResultBuilder]: For program point L210-27(lines 210 212) no Hoare annotation was computed. [2021-11-02 23:24:25,489 INFO L857 garLoopResultBuilder]: For program point L210-28(lines 210 212) no Hoare annotation was computed. [2021-11-02 23:24:25,489 INFO L857 garLoopResultBuilder]: For program point L210-29(lines 210 212) no Hoare annotation was computed. [2021-11-02 23:24:25,489 INFO L857 garLoopResultBuilder]: For program point L210-30(lines 210 212) no Hoare annotation was computed. [2021-11-02 23:24:25,489 INFO L857 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2021-11-02 23:24:25,490 INFO L857 garLoopResultBuilder]: For program point L210-31(lines 210 212) no Hoare annotation was computed. [2021-11-02 23:24:25,490 INFO L857 garLoopResultBuilder]: For program point L210-32(lines 210 212) no Hoare annotation was computed. [2021-11-02 23:24:25,490 INFO L857 garLoopResultBuilder]: For program point L211-2(line 211) no Hoare annotation was computed. [2021-11-02 23:24:25,490 INFO L857 garLoopResultBuilder]: For program point L211-4(line 211) no Hoare annotation was computed. [2021-11-02 23:24:25,490 INFO L857 garLoopResultBuilder]: For program point L211-6(line 211) no Hoare annotation was computed. [2021-11-02 23:24:25,491 INFO L857 garLoopResultBuilder]: For program point L211-8(line 211) no Hoare annotation was computed. [2021-11-02 23:24:25,491 INFO L857 garLoopResultBuilder]: For program point L211-10(line 211) no Hoare annotation was computed. [2021-11-02 23:24:25,491 INFO L857 garLoopResultBuilder]: For program point L211-12(line 211) no Hoare annotation was computed. [2021-11-02 23:24:25,491 INFO L857 garLoopResultBuilder]: For program point L211-14(line 211) no Hoare annotation was computed. [2021-11-02 23:24:25,491 INFO L857 garLoopResultBuilder]: For program point L211-16(line 211) no Hoare annotation was computed. [2021-11-02 23:24:25,492 INFO L857 garLoopResultBuilder]: For program point L211-18(line 211) no Hoare annotation was computed. [2021-11-02 23:24:25,492 INFO L853 garLoopResultBuilder]: At program point L2590(lines 2586 2594) the Hoare annotation is: (and (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.offset| 0) (not (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.base| 0)) (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base) (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset)) [2021-11-02 23:24:25,492 INFO L857 garLoopResultBuilder]: For program point L211-20(line 211) no Hoare annotation was computed. [2021-11-02 23:24:25,492 INFO L853 garLoopResultBuilder]: At program point L2590-2(lines 2586 2594) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.offset| 0)) (.cse1 (= ULTIMATE.start_ensure_allocated_hash_table_~map.base |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.base|)) (.cse2 (or (not (= ULTIMATE.start_hash_table_state_is_valid_~map.offset 0)) (not (= ULTIMATE.start_hash_table_state_is_valid_~map.base 0)))) (.cse3 (= (select (store |#valid| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base| 0) |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.base|) 1)) (.cse4 (= ULTIMATE.start_aws_mul_u64_checked_~b 24)) (.cse5 (= |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.offset| ULTIMATE.start_aws_mul_u64_checked_~r.offset)) (.cse6 (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.offset| 0)) (.cse7 (not (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.base| 0))) (.cse8 (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.offset| 0)) (.cse9 (not (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base| |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.base|))) (.cse10 (not (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.base| 0))) (.cse11 (<= ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 8)) (.cse12 (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset)) (.cse13 (= ULTIMATE.start_hash_table_state_required_bytes_~required_bytes.offset |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.offset|)) (.cse14 (= ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 ULTIMATE.start_aws_mul_u64_checked_~a)) (.cse15 (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base| ULTIMATE.start_hash_table_state_required_bytes_~required_bytes.base)) (.cse16 (<= ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 8)) (.cse17 (= ULTIMATE.start_aws_mul_u64_checked_~r.base |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base|)) (.cse18 (= |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.offset| 0)) (.cse19 (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.base|))) (or (and (<= (+ |ULTIMATE.start_aws_mul_u64_checked_#res| 1) 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= (+ |ULTIMATE.start_aws_raise_error_#res| 1) 0) .cse9 .cse10 (<= (+ |ULTIMATE.start_aws_mul_size_checked_#res| 1) 0) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse3 (= (* 24 ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0) (select (select |#memory_int| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base|) |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.offset|)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19))) [2021-11-02 23:24:25,493 INFO L857 garLoopResultBuilder]: For program point L211-22(line 211) no Hoare annotation was computed. [2021-11-02 23:24:25,493 INFO L853 garLoopResultBuilder]: At program point L2590-1(lines 2586 2594) the Hoare annotation is: (let ((.cse0 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse1 (or (not (= ULTIMATE.start_hash_table_state_is_valid_~map.offset 0)) (not (= ULTIMATE.start_hash_table_state_is_valid_~map.base 0)))) (.cse2 (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.offset| 0)) (.cse3 (not (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.base| 0))) (.cse4 (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base)) (.cse5 (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset))) (or (and .cse0 .cse1 .cse2 .cse3 (= |ULTIMATE.start_aws_mul_size_checked_#res| 0) .cse4 .cse5 (= |ULTIMATE.start_aws_mul_u64_checked_#res| 0)) (and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.base|) |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.offset|) 0)) .cse0 .cse1 .cse2 .cse3 .cse4 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_hash_table_is_valid_~map.base) ULTIMATE.start_aws_hash_table_is_valid_~map.offset) 0)) .cse5))) [2021-11-02 23:24:25,493 INFO L857 garLoopResultBuilder]: For program point L211-24(line 211) no Hoare annotation was computed. [2021-11-02 23:24:25,493 INFO L853 garLoopResultBuilder]: At program point L2590-3(lines 2586 2594) the Hoare annotation is: false [2021-11-02 23:24:25,493 INFO L857 garLoopResultBuilder]: For program point L211-26(line 211) no Hoare annotation was computed. [2021-11-02 23:24:25,494 INFO L857 garLoopResultBuilder]: For program point L211-28(line 211) no Hoare annotation was computed. [2021-11-02 23:24:25,494 INFO L857 garLoopResultBuilder]: For program point L211-30(line 211) no Hoare annotation was computed. [2021-11-02 23:24:25,494 INFO L857 garLoopResultBuilder]: For program point L211-32(line 211) no Hoare annotation was computed. [2021-11-02 23:24:25,494 INFO L857 garLoopResultBuilder]: For program point L211-34(line 211) no Hoare annotation was computed. [2021-11-02 23:24:25,494 INFO L857 garLoopResultBuilder]: For program point L211-36(line 211) no Hoare annotation was computed. [2021-11-02 23:24:25,495 INFO L857 garLoopResultBuilder]: For program point L211-38(line 211) no Hoare annotation was computed. [2021-11-02 23:24:25,495 INFO L857 garLoopResultBuilder]: For program point L211-40(line 211) no Hoare annotation was computed. [2021-11-02 23:24:25,495 INFO L857 garLoopResultBuilder]: For program point L211-42(line 211) no Hoare annotation was computed. [2021-11-02 23:24:25,495 INFO L857 garLoopResultBuilder]: For program point L9990-2(line 9990) no Hoare annotation was computed. [2021-11-02 23:24:25,495 INFO L857 garLoopResultBuilder]: For program point L9990-3(line 9990) no Hoare annotation was computed. [2021-11-02 23:24:25,496 INFO L857 garLoopResultBuilder]: For program point L211-44(line 211) no Hoare annotation was computed. [2021-11-02 23:24:25,496 INFO L857 garLoopResultBuilder]: For program point L211-46(line 211) no Hoare annotation was computed. [2021-11-02 23:24:25,496 INFO L857 garLoopResultBuilder]: For program point L211-48(line 211) no Hoare annotation was computed. [2021-11-02 23:24:25,496 INFO L857 garLoopResultBuilder]: For program point L9990(line 9990) no Hoare annotation was computed. [2021-11-02 23:24:25,496 INFO L857 garLoopResultBuilder]: For program point L9990-9(line 9990) no Hoare annotation was computed. [2021-11-02 23:24:25,497 INFO L857 garLoopResultBuilder]: For program point L211-50(line 211) no Hoare annotation was computed. [2021-11-02 23:24:25,497 INFO L857 garLoopResultBuilder]: For program point L9990-10(line 9990) no Hoare annotation was computed. [2021-11-02 23:24:25,497 INFO L857 garLoopResultBuilder]: For program point L211-52(line 211) no Hoare annotation was computed. [2021-11-02 23:24:25,497 INFO L857 garLoopResultBuilder]: For program point L9990-12(line 9990) no Hoare annotation was computed. [2021-11-02 23:24:25,497 INFO L857 garLoopResultBuilder]: For program point L9990-5(line 9990) no Hoare annotation was computed. [2021-11-02 23:24:25,497 INFO L857 garLoopResultBuilder]: For program point L211-54(line 211) no Hoare annotation was computed. [2021-11-02 23:24:25,498 INFO L853 garLoopResultBuilder]: At program point L9990-6(lines 9988 9991) the Hoare annotation is: (and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.base|) |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.offset|) 0)) (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (or (not (= ULTIMATE.start_hash_table_state_is_valid_~map.offset 0)) (not (= ULTIMATE.start_hash_table_state_is_valid_~map.base 0))) (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.offset| 0) (not (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.base| 0)) (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base) (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_hash_table_is_valid_~map.base) ULTIMATE.start_aws_hash_table_is_valid_~map.offset) 0)) (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset)) [2021-11-02 23:24:25,498 INFO L857 garLoopResultBuilder]: For program point L9990-7(line 9990) no Hoare annotation was computed. [2021-11-02 23:24:25,498 INFO L857 garLoopResultBuilder]: For program point L211-56(line 211) no Hoare annotation was computed. [2021-11-02 23:24:25,498 INFO L857 garLoopResultBuilder]: For program point L9990-17(line 9990) no Hoare annotation was computed. [2021-11-02 23:24:25,499 INFO L857 garLoopResultBuilder]: For program point L211-58(line 211) no Hoare annotation was computed. [2021-11-02 23:24:25,499 INFO L857 garLoopResultBuilder]: For program point L9990-19(line 9990) no Hoare annotation was computed. [2021-11-02 23:24:25,499 INFO L857 garLoopResultBuilder]: For program point L211-60(line 211) no Hoare annotation was computed. [2021-11-02 23:24:25,499 INFO L853 garLoopResultBuilder]: At program point L9990-20(lines 9988 9991) the Hoare annotation is: (and (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (= ULTIMATE.start_ensure_allocated_hash_table_~map.base |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.base|) (or (not (= ULTIMATE.start_hash_table_state_is_valid_~map.offset 0)) (not (= ULTIMATE.start_hash_table_state_is_valid_~map.base 0))) (not (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.base| 0)) (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.offset| 0) (= |ULTIMATE.start_aws_hash_table_is_valid_#res| 0) (not (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.base| 0)) (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset)) [2021-11-02 23:24:25,500 INFO L853 garLoopResultBuilder]: At program point L9990-13(lines 9988 9991) the Hoare annotation is: (let ((.cse1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.base|) |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.offset|))) (let ((.cse0 (select (select |#memory_int| ULTIMATE.start_hash_table_state_is_valid_~map.base) 40)) (.cse2 (select (select |#memory_int| .cse1) 40))) (and (= (select |#valid| |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.base|) 1) (= ULTIMATE.start_aws_hash_table_is_valid_~map.offset 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.base|) (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (= ULTIMATE.start_ensure_allocated_hash_table_~map.base |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.base|) (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.offset| 0) (not (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.base| 0)) (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.offset| 0) (= ULTIMATE.start_aws_hash_table_is_valid_~map.base |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.base|) (= |ULTIMATE.start_aws_hash_table_is_valid_#res| 0) (= ULTIMATE.start_hash_table_state_is_valid_~map.offset 0) (not (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.base| 0)) (= |ULTIMATE.start_hash_table_state_is_valid_#res| 0) (< (+ (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_hash_table_is_valid_~map.base) 0) 1) ULTIMATE.start_aws_hash_table_is_valid_~map.base) (<= (mod (+ 18446744073679922088 (* .cse0 24)) 18446744073709551616) 36028797018963967) (= ULTIMATE.start_hash_table_state_is_valid_~size_at_least_two~0 0) (not (= .cse1 0)) (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_aws_hash_table_is_valid_~map.base) 0)) (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (<= .cse0 8) (<= .cse2 8) (not (= ULTIMATE.start_hash_table_state_is_valid_~map.base 0)) (<= (mod (+ 18446744073679922088 (* .cse2 24)) 18446744073709551616) 36028797018963967)))) [2021-11-02 23:24:25,500 INFO L857 garLoopResultBuilder]: For program point L211-62(line 211) no Hoare annotation was computed. [2021-11-02 23:24:25,500 INFO L857 garLoopResultBuilder]: For program point L9990-14(line 9990) no Hoare annotation was computed. [2021-11-02 23:24:25,500 INFO L857 garLoopResultBuilder]: For program point L211-64(line 211) no Hoare annotation was computed. [2021-11-02 23:24:25,500 INFO L857 garLoopResultBuilder]: For program point L9990-16(line 9990) no Hoare annotation was computed. [2021-11-02 23:24:25,501 INFO L857 garLoopResultBuilder]: For program point L9990-26(line 9990) no Hoare annotation was computed. [2021-11-02 23:24:25,501 INFO L853 garLoopResultBuilder]: At program point L9990-27(lines 9988 9991) the Hoare annotation is: (and (= ULTIMATE.start_aws_hash_table_is_valid_~map.offset |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.offset|) (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (= ULTIMATE.start_ensure_allocated_hash_table_~map.base |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.base|) (or (not (= ULTIMATE.start_hash_table_state_is_valid_~map.offset 0)) (not (= ULTIMATE.start_hash_table_state_is_valid_~map.base 0))) (not (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.base| 0)) (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.offset| 0) (= ULTIMATE.start_aws_hash_table_is_valid_~map.base |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.base|) (= |ULTIMATE.start_aws_hash_table_is_valid_#res| 0) (not (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.base| 0)) (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset)) [2021-11-02 23:24:25,501 INFO L857 garLoopResultBuilder]: For program point L9990-28(line 9990) no Hoare annotation was computed. [2021-11-02 23:24:25,501 INFO L857 garLoopResultBuilder]: For program point L9990-21(line 9990) no Hoare annotation was computed. [2021-11-02 23:24:25,502 INFO L857 garLoopResultBuilder]: For program point L9990-23(line 9990) no Hoare annotation was computed. [2021-11-02 23:24:25,502 INFO L857 garLoopResultBuilder]: For program point L9990-24(line 9990) no Hoare annotation was computed. [2021-11-02 23:24:25,502 INFO L857 garLoopResultBuilder]: For program point L9990-33(line 9990) no Hoare annotation was computed. [2021-11-02 23:24:25,502 INFO L853 garLoopResultBuilder]: At program point L9990-34(lines 9988 9991) the Hoare annotation is: (and (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (= ULTIMATE.start_ensure_allocated_hash_table_~map.base |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.base|) (or (not (= ULTIMATE.start_hash_table_state_is_valid_~map.offset 0)) (not (= ULTIMATE.start_hash_table_state_is_valid_~map.base 0))) (not (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.base| 0)) (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.offset| 0) (or (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.base|) |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.offset|) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.base|) |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.offset|) 0))) (= |ULTIMATE.start_aws_hash_table_is_valid_#res| 0) (not (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.base| 0)) (not (= ULTIMATE.start_aws_hash_table_eq_~b.base 0)) (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (or (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_hash_table_eq_~b.base) ULTIMATE.start_aws_hash_table_eq_~b.offset) 0)) (not (= (select (select |#memory_$Pointer$.offset| ULTIMATE.start_aws_hash_table_eq_~b.base) ULTIMATE.start_aws_hash_table_eq_~b.offset) 0)))) [2021-11-02 23:24:25,502 INFO L857 garLoopResultBuilder]: For program point L9990-35(line 9990) no Hoare annotation was computed. [2021-11-02 23:24:25,503 INFO L857 garLoopResultBuilder]: For program point L9990-30(line 9990) no Hoare annotation was computed. [2021-11-02 23:24:25,503 INFO L857 garLoopResultBuilder]: For program point L9990-31(line 9990) no Hoare annotation was computed. [2021-11-02 23:24:25,503 INFO L853 garLoopResultBuilder]: At program point L9990-41(lines 9988 9991) the Hoare annotation is: false [2021-11-02 23:24:25,503 INFO L857 garLoopResultBuilder]: For program point L9990-42(line 9990) no Hoare annotation was computed. [2021-11-02 23:24:25,503 INFO L857 garLoopResultBuilder]: For program point L9990-44(line 9990) no Hoare annotation was computed. [2021-11-02 23:24:25,504 INFO L857 garLoopResultBuilder]: For program point L9990-37(line 9990) no Hoare annotation was computed. [2021-11-02 23:24:25,504 INFO L857 garLoopResultBuilder]: For program point L9990-38(line 9990) no Hoare annotation was computed. [2021-11-02 23:24:25,504 INFO L857 garLoopResultBuilder]: For program point L9990-40(line 9990) no Hoare annotation was computed. [2021-11-02 23:24:25,504 INFO L857 garLoopResultBuilder]: For program point L9990-49(line 9990) no Hoare annotation was computed. [2021-11-02 23:24:25,504 INFO L857 garLoopResultBuilder]: For program point L9990-51(line 9990) no Hoare annotation was computed. [2021-11-02 23:24:25,505 INFO L857 garLoopResultBuilder]: For program point L9990-52(line 9990) no Hoare annotation was computed. [2021-11-02 23:24:25,505 INFO L857 garLoopResultBuilder]: For program point L9990-45(line 9990) no Hoare annotation was computed. [2021-11-02 23:24:25,505 INFO L857 garLoopResultBuilder]: For program point L9990-47(line 9990) no Hoare annotation was computed. [2021-11-02 23:24:25,505 INFO L853 garLoopResultBuilder]: At program point L9990-48(lines 9988 9991) the Hoare annotation is: false [2021-11-02 23:24:25,505 INFO L857 garLoopResultBuilder]: For program point L9990-58(line 9990) no Hoare annotation was computed. [2021-11-02 23:24:25,506 INFO L857 garLoopResultBuilder]: For program point L9990-59(line 9990) no Hoare annotation was computed. [2021-11-02 23:24:25,506 INFO L857 garLoopResultBuilder]: For program point L9067(lines 9086 9091) no Hoare annotation was computed. [2021-11-02 23:24:25,506 INFO L853 garLoopResultBuilder]: At program point L1998(lines 1988 1999) the Hoare annotation is: (and (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.offset| 0) (not (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.base| 0)) (<= (+ |ULTIMATE.start_aws_raise_error_#res| 1) 0) (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base) (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset)) [2021-11-02 23:24:25,506 INFO L853 garLoopResultBuilder]: At program point L1998-1(lines 1988 1999) the Hoare annotation is: (and (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.offset| 0) (not (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.base| 0)) (<= (+ |ULTIMATE.start_aws_raise_error_#res| 1) 0) (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base) (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset)) [2021-11-02 23:24:25,507 INFO L853 garLoopResultBuilder]: At program point L1998-2(lines 1988 1999) the Hoare annotation is: (and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.base|) |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.offset|) 0)) (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (or (not (= ULTIMATE.start_hash_table_state_is_valid_~map.offset 0)) (not (= ULTIMATE.start_hash_table_state_is_valid_~map.base 0))) (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.offset| 0) (not (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.base| 0)) (<= (+ |ULTIMATE.start_aws_raise_error_#res| 1) 0) (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base) (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_hash_table_is_valid_~map.base) ULTIMATE.start_aws_hash_table_is_valid_~map.offset) 0)) (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset)) [2021-11-02 23:24:25,507 INFO L857 garLoopResultBuilder]: For program point L9990-54(line 9990) no Hoare annotation was computed. [2021-11-02 23:24:25,507 INFO L853 garLoopResultBuilder]: At program point L1998-3(lines 1988 1999) the Hoare annotation is: (and (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (or (not (= ULTIMATE.start_hash_table_state_is_valid_~map.offset 0)) (not (= ULTIMATE.start_hash_table_state_is_valid_~map.base 0))) (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.offset| 0) (not (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.base| 0)) (<= (+ |ULTIMATE.start_aws_raise_error_#res| 1) 0) (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base) (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset)) [2021-11-02 23:24:25,507 INFO L853 garLoopResultBuilder]: At program point L9990-55(lines 9988 9991) the Hoare annotation is: false [2021-11-02 23:24:25,508 INFO L853 garLoopResultBuilder]: At program point L1998-4(lines 1988 1999) the Hoare annotation is: (and (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.offset| 0) (= ULTIMATE.start_ensure_allocated_hash_table_~map.base |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.base|) (or (not (= ULTIMATE.start_hash_table_state_is_valid_~map.offset 0)) (not (= ULTIMATE.start_hash_table_state_is_valid_~map.base 0))) (= (select (store |#valid| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base| 0) |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.base|) 1) (= ULTIMATE.start_aws_mul_u64_checked_~b 24) (= |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.offset| ULTIMATE.start_aws_mul_u64_checked_~r.offset) (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.offset| 0) (not (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.base| 0)) (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.offset| 0) (<= (+ |ULTIMATE.start_aws_raise_error_#res| 1) 0) (not (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base| |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.base|)) (not (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.base| 0)) (<= ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 8) (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (= ULTIMATE.start_hash_table_state_required_bytes_~required_bytes.offset |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.offset|) (= ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 ULTIMATE.start_aws_mul_u64_checked_~a) (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base| ULTIMATE.start_hash_table_state_required_bytes_~required_bytes.base) (<= ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 8) (= ULTIMATE.start_aws_mul_u64_checked_~r.base |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base|) (= |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.offset| 0) (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.base|)) [2021-11-02 23:24:25,508 INFO L857 garLoopResultBuilder]: For program point L9990-56(line 9990) no Hoare annotation was computed. [2021-11-02 23:24:25,508 INFO L853 garLoopResultBuilder]: At program point L1998-5(lines 1988 1999) the Hoare annotation is: (and (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.offset| 0) (= ULTIMATE.start_ensure_allocated_hash_table_~map.base |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.base|) (or (not (= ULTIMATE.start_hash_table_state_is_valid_~map.offset 0)) (not (= ULTIMATE.start_hash_table_state_is_valid_~map.base 0))) (= (select (store |#valid| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base| 0) |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.base|) 1) (= ULTIMATE.start_aws_mul_u64_checked_~b 24) (= |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.offset| ULTIMATE.start_aws_mul_u64_checked_~r.offset) (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.offset| 0) (not (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.base| 0)) (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.offset| 0) (<= (+ |ULTIMATE.start_aws_raise_error_#res| 1) 0) (not (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base| |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.base|)) (not (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.base| 0)) (<= ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 8) (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (= ULTIMATE.start_hash_table_state_required_bytes_~required_bytes.offset |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.offset|) (= ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 ULTIMATE.start_aws_mul_u64_checked_~a) (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base| ULTIMATE.start_hash_table_state_required_bytes_~required_bytes.base) (<= ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 8) (= ULTIMATE.start_aws_mul_u64_checked_~r.base |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base|) (= |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.offset| 0) (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.base|)) [2021-11-02 23:24:25,508 INFO L857 garLoopResultBuilder]: For program point L9990-65(line 9990) no Hoare annotation was computed. [2021-11-02 23:24:25,509 INFO L853 garLoopResultBuilder]: At program point L1998-6(lines 1988 1999) the Hoare annotation is: false [2021-11-02 23:24:25,509 INFO L857 garLoopResultBuilder]: For program point L9990-66(line 9990) no Hoare annotation was computed. [2021-11-02 23:24:25,509 INFO L853 garLoopResultBuilder]: At program point L1998-7(lines 1988 1999) the Hoare annotation is: (and (= ULTIMATE.start_aws_hash_table_is_valid_~map.offset |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.offset|) (= (select |#valid| |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.base|) 1) (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (= ULTIMATE.start_ensure_allocated_hash_table_~map.base |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.base|) (or (not (= ULTIMATE.start_hash_table_state_is_valid_~map.offset 0)) (not (= ULTIMATE.start_hash_table_state_is_valid_~map.base 0))) (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.offset| 0) (not (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.base| 0)) (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.offset| 0) (= ULTIMATE.start_aws_hash_table_is_valid_~map.base |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.base|) (<= (+ |ULTIMATE.start_aws_raise_error_#res| 1) 0) (not (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.base| 0)) (<= ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 8) (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (<= ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 8) (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.base|)) [2021-11-02 23:24:25,509 INFO L857 garLoopResultBuilder]: For program point L9990-68(line 9990) no Hoare annotation was computed. [2021-11-02 23:24:25,509 INFO L857 garLoopResultBuilder]: For program point L9990-61(line 9990) no Hoare annotation was computed. [2021-11-02 23:24:25,510 INFO L853 garLoopResultBuilder]: At program point L9990-62(lines 9988 9991) the Hoare annotation is: (and (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (= ULTIMATE.start_ensure_allocated_hash_table_~map.base |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.base|) (not (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.base| 0)) (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.offset| 0) (= |ULTIMATE.start_aws_hash_table_is_valid_#res| 0) (not (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.base| 0)) (not (= ULTIMATE.start_aws_hash_table_eq_~b.base 0)) (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset)) [2021-11-02 23:24:25,510 INFO L857 garLoopResultBuilder]: For program point L9990-63(line 9990) no Hoare annotation was computed. [2021-11-02 23:24:25,510 INFO L857 garLoopResultBuilder]: For program point L9990-73(line 9990) no Hoare annotation was computed. [2021-11-02 23:24:25,510 INFO L857 garLoopResultBuilder]: For program point L9990-75(line 9990) no Hoare annotation was computed. [2021-11-02 23:24:25,510 INFO L853 garLoopResultBuilder]: At program point L9990-76(lines 9988 9991) the Hoare annotation is: false [2021-11-02 23:24:25,511 INFO L853 garLoopResultBuilder]: At program point L9990-69(lines 9988 9991) the Hoare annotation is: false [2021-11-02 23:24:25,511 INFO L857 garLoopResultBuilder]: For program point L9990-70(line 9990) no Hoare annotation was computed. [2021-11-02 23:24:25,511 INFO L857 garLoopResultBuilder]: For program point L9990-72(line 9990) no Hoare annotation was computed. [2021-11-02 23:24:25,511 INFO L857 garLoopResultBuilder]: For program point L9990-82(line 9990) no Hoare annotation was computed. [2021-11-02 23:24:25,511 INFO L853 garLoopResultBuilder]: At program point L9990-83(lines 9988 9991) the Hoare annotation is: false [2021-11-02 23:24:25,512 INFO L857 garLoopResultBuilder]: For program point L9990-84(line 9990) no Hoare annotation was computed. [2021-11-02 23:24:25,512 INFO L857 garLoopResultBuilder]: For program point L9990-77(line 9990) no Hoare annotation was computed. [2021-11-02 23:24:25,512 INFO L857 garLoopResultBuilder]: For program point L9990-79(line 9990) no Hoare annotation was computed. [2021-11-02 23:24:25,512 INFO L857 garLoopResultBuilder]: For program point L9990-80(line 9990) no Hoare annotation was computed. [2021-11-02 23:24:25,512 INFO L857 garLoopResultBuilder]: For program point L9990-89(line 9990) no Hoare annotation was computed. [2021-11-02 23:24:25,513 INFO L853 garLoopResultBuilder]: At program point L9990-90(lines 9988 9991) the Hoare annotation is: false [2021-11-02 23:24:25,513 INFO L857 garLoopResultBuilder]: For program point L9990-91(line 9990) no Hoare annotation was computed. [2021-11-02 23:24:25,513 INFO L857 garLoopResultBuilder]: For program point L9990-86(line 9990) no Hoare annotation was computed. [2021-11-02 23:24:25,513 INFO L857 garLoopResultBuilder]: For program point L9990-87(line 9990) no Hoare annotation was computed. [2021-11-02 23:24:25,513 INFO L853 garLoopResultBuilder]: At program point L9990-97(lines 9988 9991) the Hoare annotation is: false [2021-11-02 23:24:25,514 INFO L857 garLoopResultBuilder]: For program point L9990-98(line 9990) no Hoare annotation was computed. [2021-11-02 23:24:25,514 INFO L857 garLoopResultBuilder]: For program point L9990-100(line 9990) no Hoare annotation was computed. [2021-11-02 23:24:25,514 INFO L857 garLoopResultBuilder]: For program point L9990-93(line 9990) no Hoare annotation was computed. [2021-11-02 23:24:25,514 INFO L857 garLoopResultBuilder]: For program point L9990-94(line 9990) no Hoare annotation was computed. [2021-11-02 23:24:25,514 INFO L857 garLoopResultBuilder]: For program point L9990-96(line 9990) no Hoare annotation was computed. [2021-11-02 23:24:25,514 INFO L857 garLoopResultBuilder]: For program point L9990-105(line 9990) no Hoare annotation was computed. [2021-11-02 23:24:25,515 INFO L857 garLoopResultBuilder]: For program point L9990-107(line 9990) no Hoare annotation was computed. [2021-11-02 23:24:25,515 INFO L857 garLoopResultBuilder]: For program point L9990-108(line 9990) no Hoare annotation was computed. [2021-11-02 23:24:25,515 INFO L857 garLoopResultBuilder]: For program point L9990-101(line 9990) no Hoare annotation was computed. [2021-11-02 23:24:25,515 INFO L857 garLoopResultBuilder]: For program point L9990-103(line 9990) no Hoare annotation was computed. [2021-11-02 23:24:25,515 INFO L853 garLoopResultBuilder]: At program point L9990-104(lines 9988 9991) the Hoare annotation is: false [2021-11-02 23:24:25,516 INFO L857 garLoopResultBuilder]: For program point L9990-114(line 9990) no Hoare annotation was computed. [2021-11-02 23:24:25,516 INFO L857 garLoopResultBuilder]: For program point L9990-115(line 9990) no Hoare annotation was computed. [2021-11-02 23:24:25,516 INFO L857 garLoopResultBuilder]: For program point L9990-110(line 9990) no Hoare annotation was computed. [2021-11-02 23:24:25,516 INFO L853 garLoopResultBuilder]: At program point L9990-111(lines 9988 9991) the Hoare annotation is: false [2021-11-02 23:24:25,516 INFO L857 garLoopResultBuilder]: For program point L9990-112(line 9990) no Hoare annotation was computed. [2021-11-02 23:24:25,516 INFO L857 garLoopResultBuilder]: For program point L9990-121(line 9990) no Hoare annotation was computed. [2021-11-02 23:24:25,517 INFO L857 garLoopResultBuilder]: For program point L9990-122(line 9990) no Hoare annotation was computed. [2021-11-02 23:24:25,517 INFO L857 garLoopResultBuilder]: For program point L9990-124(line 9990) no Hoare annotation was computed. [2021-11-02 23:24:25,517 INFO L857 garLoopResultBuilder]: For program point L9990-117(line 9990) no Hoare annotation was computed. [2021-11-02 23:24:25,517 INFO L853 garLoopResultBuilder]: At program point L9990-118(lines 9988 9991) the Hoare annotation is: false [2021-11-02 23:24:25,517 INFO L857 garLoopResultBuilder]: For program point L9990-119(line 9990) no Hoare annotation was computed. [2021-11-02 23:24:25,518 INFO L853 garLoopResultBuilder]: At program point L9990-125(lines 9988 9991) the Hoare annotation is: false [2021-11-02 23:24:25,518 INFO L853 garLoopResultBuilder]: At program point L9136-5(line 9136) the Hoare annotation is: false [2021-11-02 23:24:25,518 INFO L853 garLoopResultBuilder]: At program point L9136-2(line 9136) the Hoare annotation is: false [2021-11-02 23:24:25,518 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-11-02 23:24:25,518 INFO L853 garLoopResultBuilder]: At program point L7287-1(lines 7280 7288) the Hoare annotation is: false [2021-11-02 23:24:25,519 INFO L853 garLoopResultBuilder]: At program point L7287(lines 7280 7288) the Hoare annotation is: false [2021-11-02 23:24:25,519 INFO L853 garLoopResultBuilder]: At program point L7287-2(lines 7280 7288) the Hoare annotation is: false [2021-11-02 23:24:25,519 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-02 23:24:25,519 INFO L857 garLoopResultBuilder]: For program point L9403(lines 9403 9409) no Hoare annotation was computed. [2021-11-02 23:24:25,519 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-02 23:24:25,520 INFO L853 garLoopResultBuilder]: At program point L7356-2(lines 7348 7357) the Hoare annotation is: false [2021-11-02 23:24:25,520 INFO L853 garLoopResultBuilder]: At program point L7356-1(lines 7348 7357) the Hoare annotation is: false [2021-11-02 23:24:25,520 INFO L853 garLoopResultBuilder]: At program point L7356(lines 7348 7357) the Hoare annotation is: false [2021-11-02 23:24:25,520 INFO L857 garLoopResultBuilder]: For program point L222(lines 222 224) no Hoare annotation was computed. [2021-11-02 23:24:25,520 INFO L857 garLoopResultBuilder]: For program point L222-1(lines 222 224) no Hoare annotation was computed. [2021-11-02 23:24:25,521 INFO L857 garLoopResultBuilder]: For program point L222-2(lines 222 224) no Hoare annotation was computed. [2021-11-02 23:24:25,521 INFO L857 garLoopResultBuilder]: For program point L222-3(lines 222 224) no Hoare annotation was computed. [2021-11-02 23:24:25,521 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-02 23:24:25,521 INFO L857 garLoopResultBuilder]: For program point L222-4(lines 222 224) no Hoare annotation was computed. [2021-11-02 23:24:25,521 INFO L857 garLoopResultBuilder]: For program point L222-5(lines 222 224) no Hoare annotation was computed. [2021-11-02 23:24:25,522 INFO L857 garLoopResultBuilder]: For program point L222-6(lines 222 224) no Hoare annotation was computed. [2021-11-02 23:24:25,522 INFO L857 garLoopResultBuilder]: For program point L222-7(lines 222 224) no Hoare annotation was computed. [2021-11-02 23:24:25,522 INFO L857 garLoopResultBuilder]: For program point L222-8(lines 222 224) no Hoare annotation was computed. [2021-11-02 23:24:25,522 INFO L857 garLoopResultBuilder]: For program point L222-9(lines 222 224) no Hoare annotation was computed. [2021-11-02 23:24:25,522 INFO L857 garLoopResultBuilder]: For program point L222-10(lines 222 224) no Hoare annotation was computed. [2021-11-02 23:24:25,523 INFO L857 garLoopResultBuilder]: For program point L222-11(lines 222 224) no Hoare annotation was computed. [2021-11-02 23:24:25,523 INFO L857 garLoopResultBuilder]: For program point L222-12(lines 222 224) no Hoare annotation was computed. [2021-11-02 23:24:25,523 INFO L857 garLoopResultBuilder]: For program point L222-13(lines 222 224) no Hoare annotation was computed. [2021-11-02 23:24:25,523 INFO L857 garLoopResultBuilder]: For program point L222-14(lines 222 224) no Hoare annotation was computed. [2021-11-02 23:24:25,523 INFO L857 garLoopResultBuilder]: For program point L222-15(lines 222 224) no Hoare annotation was computed. [2021-11-02 23:24:25,523 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-02 23:24:25,524 INFO L857 garLoopResultBuilder]: For program point L222-16(lines 222 224) no Hoare annotation was computed. [2021-11-02 23:24:25,524 INFO L857 garLoopResultBuilder]: For program point L222-17(lines 222 224) no Hoare annotation was computed. [2021-11-02 23:24:25,524 INFO L857 garLoopResultBuilder]: For program point L222-18(lines 222 224) no Hoare annotation was computed. [2021-11-02 23:24:25,524 INFO L857 garLoopResultBuilder]: For program point L222-19(lines 222 224) no Hoare annotation was computed. [2021-11-02 23:24:25,524 INFO L857 garLoopResultBuilder]: For program point L222-20(lines 222 224) no Hoare annotation was computed. [2021-11-02 23:24:25,525 INFO L857 garLoopResultBuilder]: For program point L222-21(lines 222 224) no Hoare annotation was computed. [2021-11-02 23:24:25,525 INFO L857 garLoopResultBuilder]: For program point L222-22(lines 222 224) no Hoare annotation was computed. [2021-11-02 23:24:25,525 INFO L857 garLoopResultBuilder]: For program point L222-23(lines 222 224) no Hoare annotation was computed. [2021-11-02 23:24:25,525 INFO L857 garLoopResultBuilder]: For program point L222-24(lines 222 224) no Hoare annotation was computed. [2021-11-02 23:24:25,525 INFO L857 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2021-11-02 23:24:25,525 INFO L857 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2021-11-02 23:24:25,526 INFO L857 garLoopResultBuilder]: For program point L223-3(line 223) no Hoare annotation was computed. [2021-11-02 23:24:25,526 INFO L857 garLoopResultBuilder]: For program point L223-4(line 223) no Hoare annotation was computed. [2021-11-02 23:24:25,526 INFO L857 garLoopResultBuilder]: For program point L223-6(line 223) no Hoare annotation was computed. [2021-11-02 23:24:25,526 INFO L857 garLoopResultBuilder]: For program point L223-7(line 223) no Hoare annotation was computed. [2021-11-02 23:24:25,526 INFO L857 garLoopResultBuilder]: For program point L223-9(line 223) no Hoare annotation was computed. [2021-11-02 23:24:25,526 INFO L857 garLoopResultBuilder]: For program point L223-10(line 223) no Hoare annotation was computed. [2021-11-02 23:24:25,527 INFO L857 garLoopResultBuilder]: For program point L223-12(line 223) no Hoare annotation was computed. [2021-11-02 23:24:25,527 INFO L857 garLoopResultBuilder]: For program point L223-13(line 223) no Hoare annotation was computed. [2021-11-02 23:24:25,527 INFO L857 garLoopResultBuilder]: For program point L10001-4(lines 10001 10005) no Hoare annotation was computed. [2021-11-02 23:24:25,527 INFO L857 garLoopResultBuilder]: For program point L10001-5(lines 10001 10005) no Hoare annotation was computed. [2021-11-02 23:24:25,527 INFO L857 garLoopResultBuilder]: For program point L223-15(line 223) no Hoare annotation was computed. [2021-11-02 23:24:25,527 INFO L857 garLoopResultBuilder]: For program point L10001-6(lines 10001 10005) no Hoare annotation was computed. [2021-11-02 23:24:25,528 INFO L857 garLoopResultBuilder]: For program point L223-16(line 223) no Hoare annotation was computed. [2021-11-02 23:24:25,528 INFO L857 garLoopResultBuilder]: For program point L10001-7(lines 10001 10005) no Hoare annotation was computed. [2021-11-02 23:24:25,528 INFO L857 garLoopResultBuilder]: For program point L10001(lines 10001 10005) no Hoare annotation was computed. [2021-11-02 23:24:25,528 INFO L857 garLoopResultBuilder]: For program point L223-18(line 223) no Hoare annotation was computed. [2021-11-02 23:24:25,528 INFO L857 garLoopResultBuilder]: For program point L10001-1(lines 10001 10005) no Hoare annotation was computed. [2021-11-02 23:24:25,529 INFO L857 garLoopResultBuilder]: For program point L223-19(line 223) no Hoare annotation was computed. [2021-11-02 23:24:25,529 INFO L857 garLoopResultBuilder]: For program point L10001-2(lines 10001 10005) no Hoare annotation was computed. [2021-11-02 23:24:25,529 INFO L857 garLoopResultBuilder]: For program point L10001-3(lines 10001 10005) no Hoare annotation was computed. [2021-11-02 23:24:25,529 INFO L857 garLoopResultBuilder]: For program point L223-21(line 223) no Hoare annotation was computed. [2021-11-02 23:24:25,529 INFO L857 garLoopResultBuilder]: For program point L223-22(line 223) no Hoare annotation was computed. [2021-11-02 23:24:25,529 INFO L857 garLoopResultBuilder]: For program point L10001-12(lines 10001 10005) no Hoare annotation was computed. [2021-11-02 23:24:25,530 INFO L857 garLoopResultBuilder]: For program point L10001-13(lines 10001 10005) no Hoare annotation was computed. [2021-11-02 23:24:25,530 INFO L857 garLoopResultBuilder]: For program point L223-24(line 223) no Hoare annotation was computed. [2021-11-02 23:24:25,530 INFO L857 garLoopResultBuilder]: For program point L10001-14(lines 10001 10005) no Hoare annotation was computed. [2021-11-02 23:24:25,530 INFO L857 garLoopResultBuilder]: For program point L223-25(line 223) no Hoare annotation was computed. [2021-11-02 23:24:25,530 INFO L857 garLoopResultBuilder]: For program point L10001-15(lines 10001 10005) no Hoare annotation was computed. [2021-11-02 23:24:25,530 INFO L857 garLoopResultBuilder]: For program point L10001-8(lines 10001 10005) no Hoare annotation was computed. [2021-11-02 23:24:25,531 INFO L853 garLoopResultBuilder]: At program point L9737(lines 9737 9787) the Hoare annotation is: false [2021-11-02 23:24:25,531 INFO L857 garLoopResultBuilder]: For program point L10001-9(lines 10001 10005) no Hoare annotation was computed. [2021-11-02 23:24:25,531 INFO L857 garLoopResultBuilder]: For program point L223-27(line 223) no Hoare annotation was computed. [2021-11-02 23:24:25,531 INFO L857 garLoopResultBuilder]: For program point L10001-10(lines 10001 10005) no Hoare annotation was computed. [2021-11-02 23:24:25,531 INFO L857 garLoopResultBuilder]: For program point L223-28(line 223) no Hoare annotation was computed. [2021-11-02 23:24:25,532 INFO L857 garLoopResultBuilder]: For program point L10001-11(lines 10001 10005) no Hoare annotation was computed. [2021-11-02 23:24:25,532 INFO L857 garLoopResultBuilder]: For program point L223-30(line 223) no Hoare annotation was computed. [2021-11-02 23:24:25,532 INFO L857 garLoopResultBuilder]: For program point L10001-20(lines 10001 10005) no Hoare annotation was computed. [2021-11-02 23:24:25,532 INFO L857 garLoopResultBuilder]: For program point L223-31(line 223) no Hoare annotation was computed. [2021-11-02 23:24:25,532 INFO L857 garLoopResultBuilder]: For program point L10001-21(lines 10001 10005) no Hoare annotation was computed. [2021-11-02 23:24:25,532 INFO L857 garLoopResultBuilder]: For program point L10001-22(lines 10001 10005) no Hoare annotation was computed. [2021-11-02 23:24:25,533 INFO L857 garLoopResultBuilder]: For program point L223-33(line 223) no Hoare annotation was computed. [2021-11-02 23:24:25,533 INFO L857 garLoopResultBuilder]: For program point L223-34(line 223) no Hoare annotation was computed. [2021-11-02 23:24:25,533 INFO L857 garLoopResultBuilder]: For program point L10001-16(lines 10001 10005) no Hoare annotation was computed. [2021-11-02 23:24:25,533 INFO L857 garLoopResultBuilder]: For program point L10001-17(lines 10001 10005) no Hoare annotation was computed. [2021-11-02 23:24:25,533 INFO L857 garLoopResultBuilder]: For program point L223-36(line 223) no Hoare annotation was computed. [2021-11-02 23:24:25,534 INFO L857 garLoopResultBuilder]: For program point L10001-18(lines 10001 10005) no Hoare annotation was computed. [2021-11-02 23:24:25,534 INFO L857 garLoopResultBuilder]: For program point L223-37(line 223) no Hoare annotation was computed. [2021-11-02 23:24:25,534 INFO L857 garLoopResultBuilder]: For program point L10001-19(lines 10001 10005) no Hoare annotation was computed. [2021-11-02 23:24:25,534 INFO L857 garLoopResultBuilder]: For program point L223-39(line 223) no Hoare annotation was computed. [2021-11-02 23:24:25,534 INFO L857 garLoopResultBuilder]: For program point L223-40(line 223) no Hoare annotation was computed. [2021-11-02 23:24:25,534 INFO L857 garLoopResultBuilder]: For program point L223-42(line 223) no Hoare annotation was computed. [2021-11-02 23:24:25,535 INFO L857 garLoopResultBuilder]: For program point L223-43(line 223) no Hoare annotation was computed. [2021-11-02 23:24:25,535 INFO L857 garLoopResultBuilder]: For program point L223-45(line 223) no Hoare annotation was computed. [2021-11-02 23:24:25,535 INFO L857 garLoopResultBuilder]: For program point L223-46(line 223) no Hoare annotation was computed. [2021-11-02 23:24:25,535 INFO L857 garLoopResultBuilder]: For program point L223-48(line 223) no Hoare annotation was computed. [2021-11-02 23:24:25,535 INFO L857 garLoopResultBuilder]: For program point L223-49(line 223) no Hoare annotation was computed. [2021-11-02 23:24:25,535 INFO L857 garLoopResultBuilder]: For program point L223-51(line 223) no Hoare annotation was computed. [2021-11-02 23:24:25,536 INFO L857 garLoopResultBuilder]: For program point L223-52(line 223) no Hoare annotation was computed. [2021-11-02 23:24:25,536 INFO L857 garLoopResultBuilder]: For program point L223-54(line 223) no Hoare annotation was computed. [2021-11-02 23:24:25,536 INFO L857 garLoopResultBuilder]: For program point L223-55(line 223) no Hoare annotation was computed. [2021-11-02 23:24:25,536 INFO L857 garLoopResultBuilder]: For program point L223-57(line 223) no Hoare annotation was computed. [2021-11-02 23:24:25,536 INFO L857 garLoopResultBuilder]: For program point L223-58(line 223) no Hoare annotation was computed. [2021-11-02 23:24:25,536 INFO L857 garLoopResultBuilder]: For program point L223-60(line 223) no Hoare annotation was computed. [2021-11-02 23:24:25,537 INFO L857 garLoopResultBuilder]: For program point L223-61(line 223) no Hoare annotation was computed. [2021-11-02 23:24:25,537 INFO L857 garLoopResultBuilder]: For program point L223-63(line 223) no Hoare annotation was computed. [2021-11-02 23:24:25,537 INFO L857 garLoopResultBuilder]: For program point L223-64(line 223) no Hoare annotation was computed. [2021-11-02 23:24:25,537 INFO L857 garLoopResultBuilder]: For program point L223-66(line 223) no Hoare annotation was computed. [2021-11-02 23:24:25,537 INFO L857 garLoopResultBuilder]: For program point L223-67(line 223) no Hoare annotation was computed. [2021-11-02 23:24:25,538 INFO L857 garLoopResultBuilder]: For program point L223-69(line 223) no Hoare annotation was computed. [2021-11-02 23:24:25,538 INFO L857 garLoopResultBuilder]: For program point L223-70(line 223) no Hoare annotation was computed. [2021-11-02 23:24:25,538 INFO L857 garLoopResultBuilder]: For program point L223-72(line 223) no Hoare annotation was computed. [2021-11-02 23:24:25,538 INFO L857 garLoopResultBuilder]: For program point L223-73(line 223) no Hoare annotation was computed. [2021-11-02 23:24:25,538 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-11-02 23:24:25,538 INFO L853 garLoopResultBuilder]: At program point L9146(lines 9144 9147) the Hoare annotation is: false [2021-11-02 23:24:25,539 INFO L857 garLoopResultBuilder]: For program point L9410-1(lines 9391 9411) no Hoare annotation was computed. [2021-11-02 23:24:25,539 INFO L857 garLoopResultBuilder]: For program point L9410-2(line 9410) no Hoare annotation was computed. [2021-11-02 23:24:25,539 INFO L853 garLoopResultBuilder]: At program point L9146-1(lines 9144 9147) the Hoare annotation is: false [2021-11-02 23:24:25,539 INFO L853 garLoopResultBuilder]: At program point L9082(lines 9082 9098) the Hoare annotation is: false [2021-11-02 23:24:25,539 INFO L857 garLoopResultBuilder]: For program point L2542(lines 2542 2543) no Hoare annotation was computed. [2021-11-02 23:24:25,540 INFO L857 garLoopResultBuilder]: For program point L2542-2(lines 2542 2543) no Hoare annotation was computed. [2021-11-02 23:24:25,540 INFO L857 garLoopResultBuilder]: For program point L2542-1(lines 2542 2543) no Hoare annotation was computed. [2021-11-02 23:24:25,540 INFO L857 garLoopResultBuilder]: For program point L2542-3(lines 2542 2543) no Hoare annotation was computed. [2021-11-02 23:24:25,540 INFO L853 garLoopResultBuilder]: At program point L9347-2(lines 9347 9381) the Hoare annotation is: false [2021-11-02 23:24:25,540 INFO L857 garLoopResultBuilder]: For program point L9347-3(lines 9347 9381) no Hoare annotation was computed. [2021-11-02 23:24:25,541 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-02 23:24:25,541 INFO L853 garLoopResultBuilder]: At program point L2545-1(lines 2541 2546) the Hoare annotation is: (and (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (or (not (= ULTIMATE.start_hash_table_state_is_valid_~map.offset 0)) (not (= ULTIMATE.start_hash_table_state_is_valid_~map.base 0))) (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.offset| 0) (not (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.base| 0)) (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base) (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset)) [2021-11-02 23:24:25,541 INFO L853 garLoopResultBuilder]: At program point L2545(lines 2541 2546) the Hoare annotation is: (and (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.offset| 0) (not (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.base| 0)) (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base) (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset)) [2021-11-02 23:24:25,541 INFO L853 garLoopResultBuilder]: At program point L2545-3(lines 2541 2546) the Hoare annotation is: (and (= ULTIMATE.start_aws_hash_table_is_valid_~map.offset |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.offset|) (= (select |#valid| |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.base|) 1) (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (= ULTIMATE.start_ensure_allocated_hash_table_~map.base |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.base|) (or (not (= ULTIMATE.start_hash_table_state_is_valid_~map.offset 0)) (not (= ULTIMATE.start_hash_table_state_is_valid_~map.base 0))) (<= (+ |ULTIMATE.start_aws_add_u64_checked_#res| 1) 0) (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.offset| 0) (not (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.base| 0)) (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.offset| 0) (= ULTIMATE.start_aws_hash_table_is_valid_~map.base |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.base|) (<= (+ |ULTIMATE.start_aws_raise_error_#res| 1) 0) (not (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.base| 0)) (<= ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 8) (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (<= ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 8) (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.base|)) [2021-11-02 23:24:25,542 INFO L853 garLoopResultBuilder]: At program point L2545-2(lines 2541 2546) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.offset| 0)) (.cse1 (= ULTIMATE.start_ensure_allocated_hash_table_~map.base |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.base|)) (.cse2 (or (not (= ULTIMATE.start_hash_table_state_is_valid_~map.offset 0)) (not (= ULTIMATE.start_hash_table_state_is_valid_~map.base 0)))) (.cse3 (= (select (store |#valid| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base| 0) |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.base|) 1)) (.cse4 (= ULTIMATE.start_aws_mul_u64_checked_~b 24)) (.cse5 (= |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.offset| ULTIMATE.start_aws_mul_u64_checked_~r.offset)) (.cse6 (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.offset| 0)) (.cse7 (not (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_a~0.base| 0))) (.cse8 (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.offset| 0)) (.cse9 (not (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base| |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.base|))) (.cse10 (not (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.base| 0))) (.cse11 (<= ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 8)) (.cse12 (= |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset)) (.cse13 (= ULTIMATE.start_hash_table_state_required_bytes_~required_bytes.offset |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.offset|)) (.cse14 (= ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 ULTIMATE.start_aws_mul_u64_checked_~a)) (.cse15 (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base| ULTIMATE.start_hash_table_state_required_bytes_~required_bytes.base)) (.cse16 (<= ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 8)) (.cse17 (= ULTIMATE.start_aws_mul_u64_checked_~r.base |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base|)) (.cse18 (= |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.offset| 0)) (.cse19 (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_eq_harness_~#map_b~0.base|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= (+ (select (select |#memory_int| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base|) |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.offset|) 29629528) (* 24 ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0)) .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse3 (<= (+ |ULTIMATE.start_aws_add_u64_checked_#res| 1) 0) .cse4 .cse5 .cse6 .cse7 .cse8 (<= (+ |ULTIMATE.start_aws_raise_error_#res| 1) 0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19))) [2021-11-02 23:24:25,542 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-02 23:24:25,546 INFO L731 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 23:24:25,548 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-02 23:24:25,571 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 23:24:25,572 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 23:24:25,574 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 23:24:25,574 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 23:24:25,578 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 23:24:25,579 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 23:24:25,581 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 23:24:25,581 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 23:24:25,595 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base,QUANTIFIED] [2021-11-02 23:24:25,595 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base,QUANTIFIED] [2021-11-02 23:24:25,596 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base,QUANTIFIED] [2021-11-02 23:24:25,596 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base,QUANTIFIED] [2021-11-02 23:24:25,596 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base,QUANTIFIED] [2021-11-02 23:24:25,600 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base,QUANTIFIED] [2021-11-02 23:24:25,601 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base,QUANTIFIED] [2021-11-02 23:24:25,601 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base,QUANTIFIED] [2021-11-02 23:24:25,601 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base,QUANTIFIED] [2021-11-02 23:24:25,602 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base,QUANTIFIED] [2021-11-02 23:24:25,613 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 23:24:25,613 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 23:24:25,614 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 23:24:25,615 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 23:24:25,617 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 23:24:25,617 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 23:24:25,617 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 23:24:25,618 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 23:24:25,618 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 23:24:25,620 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 23:24:25,620 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 23:24:25,620 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 23:24:25,621 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 23:24:25,621 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 23:24:25,622 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 23:24:25,623 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 23:24:25,623 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 23:24:25,624 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 23:24:25,625 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 23:24:25,625 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 23:24:25,627 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 23:24:25,627 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 23:24:25,628 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 23:24:25,629 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 23:24:25,629 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 23:24:25,630 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 23:24:25,630 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 23:24:25,631 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 23:24:25,632 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 23:24:25,632 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 23:24:25,632 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 23:24:25,633 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 23:24:25,642 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 23:24:25,642 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 23:24:25,643 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 23:24:25,643 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 23:24:25,649 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 23:24:25,649 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 23:24:25,650 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 23:24:25,650 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 23:24:25,650 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 23:24:25,651 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 23:24:25,651 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 23:24:25,652 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 23:24:25,652 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 23:24:25,652 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 23:24:25,654 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 23:24:25,654 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 23:24:25,655 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 23:24:25,655 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 23:24:25,661 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base,QUANTIFIED] [2021-11-02 23:24:25,662 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base,QUANTIFIED] [2021-11-02 23:24:25,663 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base,QUANTIFIED] [2021-11-02 23:24:25,663 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base,QUANTIFIED] [2021-11-02 23:24:25,674 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 23:24:25,674 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 23:24:25,674 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 23:24:25,675 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 23:24:25,675 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 23:24:25,675 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 23:24:25,676 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 23:24:25,676 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 23:24:25,677 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 11:24:25 BoogieIcfgContainer [2021-11-02 23:24:25,677 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-02 23:24:25,678 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-02 23:24:25,678 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-02 23:24:25,678 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-02 23:24:25,679 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 11:15:43" (3/4) ... [2021-11-02 23:24:25,682 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-11-02 23:24:25,749 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 406 nodes and edges [2021-11-02 23:24:25,757 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 131 nodes and edges [2021-11-02 23:24:25,765 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 35 nodes and edges [2021-11-02 23:24:25,773 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2021-11-02 23:24:25,780 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2021-11-02 23:24:25,788 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2021-11-02 23:24:25,796 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-11-02 23:24:25,800 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-11-02 23:24:25,835 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((map_a == 0 && !(map_a == 0)) && \result + 1 <= 0) && map_a == map) && map_a == map [2021-11-02 23:24:25,836 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((!(\result == 0) && map_a == 0) && !(map_a == 0)) && map_a == map) && map_a == map [2021-11-02 23:24:25,837 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((map_a == 0 && !(map_a == 0)) && \result + 1 <= 0) && map_a == map) && map_a == map [2021-11-02 23:24:25,837 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((aux-map && map->p_impl && hash_table_state_is_valid(map->p_impl)-aux && !(#memory_$Pointer$[map_a][map_a] == 0)) && !(\result == 0)) && (!(map == 0) || !(map == 0))) && map_a == 0) && !(map_a == 0)) && map_a == map) && !(#memory_$Pointer$[map][map] == 0)) && map_a == map [2021-11-02 23:24:25,837 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!(#memory_$Pointer$[map_a][map_a] == 0) && !(\result == 0)) && (!(map == 0) || !(map == 0))) && map_a == 0) && !(map_a == 0)) && map_a == map) && !(#memory_$Pointer$[map][map] == 0)) && map_a == map [2021-11-02 23:24:25,838 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((aux-map && map->p_impl && hash_table_state_is_valid(map->p_impl)-aux && !(#memory_$Pointer$[map_a][map_a] == 0)) && !(\result == 0)) && (!(map == 0) || !(map == 0))) && map_a == 0) && !(map_a == 0)) && map_a == map) && !(#memory_$Pointer$[map][map] == 0)) && map_a == map [2021-11-02 23:24:25,839 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!(#memory_$Pointer$[map_a][map_a] == 0) && !(\result == 0)) && (!(map == 0) || !(map == 0))) && map_a == 0) && !(map_a == 0)) && map_a == map) && !(#memory_$Pointer$[map][map] == 0)) && map_a == map [2021-11-02 23:24:25,839 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!(\result == 0) && (!(map == 0) || !(map == 0))) && map_a == 0) && !(map_a == 0)) && map_a == map) && map_a == map) && \result == 0) || (((((((!(#memory_$Pointer$[map_a][map_a] == 0) && !(\result == 0)) && (!(map == 0) || !(map == 0))) && map_a == 0) && !(map_a == 0)) && map_a == map) && !(#memory_$Pointer$[map][map] == 0)) && map_a == map) [2021-11-02 23:24:25,840 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((!(\result == 0) && (!(map == 0) || !(map == 0))) && map_a == 0) && !(map_a == 0)) && \result == 0) && map_a == map) && map_a == map) && \result == 0) || (((((((!(#memory_$Pointer$[map_a][map_a] == 0) && !(\result == 0)) && (!(map == 0) || !(map == 0))) && map_a == 0) && !(map_a == 0)) && map_a == map) && !(#memory_$Pointer$[map][map] == 0)) && map_a == map) [2021-11-02 23:24:25,840 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((!(#memory_$Pointer$[map_a][map_a] == 0) && !(\result == 0)) && (!(map == 0) || !(map == 0))) && map_a == 0) && !(map_a == 0)) && \result + 1 <= 0) && map_a == map) && !(#memory_$Pointer$[map][map] == 0)) && map_a == map [2021-11-02 23:24:25,840 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((!(\result == 0) && (!(map == 0) || !(map == 0))) && map_a == 0) && !(map_a == 0)) && map_a == map) && map_a == map [2021-11-02 23:24:25,841 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((!(\result == 0) && (!(map == 0) || !(map == 0))) && map_a == 0) && !(map_a == 0)) && map_a == map) && map_a == map [2021-11-02 23:24:25,841 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((!(\result == 0) && (!(map == 0) || !(map == 0))) && map_a == 0) && !(map_a == 0)) && map_a == map) && map_a == map [2021-11-02 23:24:25,841 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((!(\result == 0) && (!(map == 0) || !(map == 0))) && map_a == 0) && !(map_a == 0)) && map_a == map) && map_a == map [2021-11-02 23:24:25,842 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((!(\result == 0) && (!(map == 0) || !(map == 0))) && map_a == 0) && !(map_a == 0)) && map_a == map) && map_a == map [2021-11-02 23:24:25,842 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(\result == 0) && (!(map == 0) || !(map == 0))) && map_a == 0) && !(map_a == 0)) && \result + 1 <= 0) && map_a == map) && map_a == map [2021-11-02 23:24:25,843 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((\result + 1 <= 0 && required_bytes == 0) && map == map_b) && (!(map == 0) || !(map == 0))) && \valid[elemsize := 0][map_b] == 1) && b == 24) && elemsize == r) && map_a == 0) && !(map_a == 0)) && map_b == 0) && \result + 1 <= 0) && !(required_bytes == map_b)) && !(map_b == 0)) && num_entries <= 8) && map_b == map) && required_bytes == required_bytes) && num_entries == a) && required_bytes == required_bytes) && max_table_entries <= 8) && r == elemsize) && elemsize == 0) && unknown-#StackHeapBarrier-unknown < map_b) || ((((((((((((((((((((required_bytes == 0 && map == map_b) && (!(map == 0) || !(map == 0))) && \valid[elemsize := 0][map_b] == 1) && 24 * num_entries == unknown-#memory_int-unknown[elemsize][elemsize]) && b == 24) && elemsize == r) && map_a == 0) && !(map_a == 0)) && map_b == 0) && !(required_bytes == map_b)) && !(map_b == 0)) && num_entries <= 8) && map_b == map) && required_bytes == required_bytes) && num_entries == a) && required_bytes == required_bytes) && max_table_entries <= 8) && r == elemsize) && elemsize == 0) && unknown-#StackHeapBarrier-unknown < map_b) [2021-11-02 23:24:25,843 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((\result + 1 <= 0 && required_bytes == 0) && map == map_b) && (!(map == 0) || !(map == 0))) && \valid[elemsize := 0][map_b] == 1) && b == 24) && elemsize == r) && map_a == 0) && !(map_a == 0)) && map_b == 0) && \result + 1 <= 0) && !(required_bytes == map_b)) && !(map_b == 0)) && \result + 1 <= 0) && num_entries <= 8) && map_b == map) && required_bytes == required_bytes) && num_entries == a) && required_bytes == required_bytes) && max_table_entries <= 8) && r == elemsize) && elemsize == 0) && unknown-#StackHeapBarrier-unknown < map_b) || ((((((((((((((((((((required_bytes == 0 && map == map_b) && (!(map == 0) || !(map == 0))) && \valid[elemsize := 0][map_b] == 1) && 24 * num_entries == unknown-#memory_int-unknown[elemsize][elemsize]) && b == 24) && elemsize == r) && map_a == 0) && !(map_a == 0)) && map_b == 0) && !(required_bytes == map_b)) && !(map_b == 0)) && num_entries <= 8) && map_b == map) && required_bytes == required_bytes) && num_entries == a) && required_bytes == required_bytes) && max_table_entries <= 8) && r == elemsize) && elemsize == 0) && unknown-#StackHeapBarrier-unknown < map_b) [2021-11-02 23:24:25,844 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((required_bytes == 0 && map == map_b) && (!(map == 0) || !(map == 0))) && \valid[elemsize := 0][map_b] == 1) && b == 24) && elemsize == r) && map_a == 0) && !(map_a == 0)) && map_b == 0) && \result + 1 <= 0) && !(required_bytes == map_b)) && !(map_b == 0)) && num_entries <= 8) && map_b == map) && required_bytes == required_bytes) && num_entries == a) && required_bytes == required_bytes) && max_table_entries <= 8) && r == elemsize) && elemsize == 0) && unknown-#StackHeapBarrier-unknown < map_b [2021-11-02 23:24:25,844 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((required_bytes == 0 && \valid[map_b] == 1) && map == map_b) && (!(map == 0) || !(map == 0))) && map_a == 0) && !(map_a == 0)) && map_b == 0) && !(required_bytes == map_b)) && !(map_b == 0)) && num_entries <= 8) && map_b == map) && unknown-#memory_int-unknown[required_bytes][required_bytes] + 29629528 == 24 * num_entries) && max_table_entries <= 8) && unknown-#StackHeapBarrier-unknown < map_b) || ((((((((((\valid[map_b] == 1 && unknown-#StackHeapBarrier-unknown + 1 <= map_b) && map == map_b) && (!(map == 0) || !(map == 0))) && map_a == 0) && !(map_a == 0)) && \result + 1 <= 0) && map_b == 0) && !(required_bytes == map_b)) && !(map_b == 0)) && map_b == map) [2021-11-02 23:24:25,844 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((required_bytes == 0 && map == map_b) && (!(map == 0) || !(map == 0))) && \valid[elemsize := 0][map_b] == 1) && 24 * num_entries == unknown-#memory_int-unknown[elemsize][elemsize]) && b == 24) && elemsize == r) && map_a == 0) && !(map_a == 0)) && map_b == 0) && !(required_bytes == map_b)) && !(map_b == 0)) && r == required_bytes) && (\exists ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base : int :: unknown-#memory_int-unknown[ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base][0] == 24 * num_entries && unknown-#memory_int-unknown[ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base][0] == a)) && num_entries <= 8) && 29629528 + b == 0) && map_b == map) && required_bytes == required_bytes) && num_entries == a) && required_bytes == required_bytes) && max_table_entries <= 8) && r == elemsize) && r == required_bytes) && elemsize == 0) && unknown-#StackHeapBarrier-unknown < map_b [2021-11-02 23:24:25,845 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((required_bytes == 0 && \result == 0) && !(\result == 0)) && map == map_b) && (!(map == 0) || !(map == 0))) && map_a == 0) && !(map_a == 0)) && map_b == 0) && !(map_b == 0)) && \valid[required_bytes := 0][map_b] == 1) && \result + 1 < map_b) && (\exists ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base : int :: 24 * num_entries == 29629528 + unknown-#memory_int-unknown[ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base][0] && unknown-#memory_int-unknown[ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base][0] % 18446744073709551616 <= 36028797018963967)) && num_entries <= 8) && map_b == map) && (\exists ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base : int :: 24 * num_entries == 29629528 + unknown-#memory_int-unknown[ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base][0] && ((cond == 1 && unknown-#memory_int-unknown[ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base][0] % 18446744073709551616 <= 36028797018963967) || (cond == 0 && 36028797018963967 < unknown-#memory_int-unknown[ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base][0] % 18446744073709551616)))) && unknown-#memory_int-unknown[required_bytes][required_bytes] + 29629528 == 24 * num_entries) && max_table_entries <= 8) && unknown-#StackHeapBarrier-unknown < map_b [2021-11-02 23:24:25,845 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((required_bytes == 0 && map == map_b) && (!(map == 0) || !(map == 0))) && \valid[elemsize := 0][map_b] == 1) && b == 24) && elemsize == r) && map_a == 0) && !(map_a == 0)) && map_b == 0) && !(required_bytes == map_b)) && !(map_b == 0)) && num_entries <= 8) && map_b == map) && required_bytes == required_bytes) && unknown-#memory_int-unknown[required_bytes][required_bytes] + 29629528 == 24 * num_entries) && num_entries == a) && required_bytes == required_bytes) && max_table_entries <= 8) && r == elemsize) && elemsize == 0) && unknown-#StackHeapBarrier-unknown < map_b) || (((((((((((((((((((((required_bytes == 0 && map == map_b) && (!(map == 0) || !(map == 0))) && \valid[elemsize := 0][map_b] == 1) && \result + 1 <= 0) && b == 24) && elemsize == r) && map_a == 0) && !(map_a == 0)) && map_b == 0) && \result + 1 <= 0) && !(required_bytes == map_b)) && !(map_b == 0)) && num_entries <= 8) && map_b == map) && required_bytes == required_bytes) && num_entries == a) && required_bytes == required_bytes) && max_table_entries <= 8) && r == elemsize) && elemsize == 0) && unknown-#StackHeapBarrier-unknown < map_b) [2021-11-02 23:24:25,845 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((required_bytes == 0 && map == map_b) && (!(map == 0) || !(map == 0))) && \valid[elemsize := 0][map_b] == 1) && b == 24) && elemsize == r) && map_a == 0) && !(map_a == 0)) && map_b == 0) && !(required_bytes == map_b)) && !(map_b == 0)) && num_entries <= 8) && map_b == map) && required_bytes == required_bytes) && unknown-#memory_int-unknown[required_bytes][required_bytes] + 29629528 == 24 * num_entries) && num_entries == a) && required_bytes == required_bytes) && max_table_entries <= 8) && r == elemsize) && elemsize == 0) && unknown-#StackHeapBarrier-unknown < map_b) || ((((((((((((((((((((((required_bytes == 0 && map == map_b) && (!(map == 0) || !(map == 0))) && \valid[elemsize := 0][map_b] == 1) && \result + 1 <= 0) && b == 24) && elemsize == r) && \result + 1 <= 0) && map_a == 0) && !(map_a == 0)) && map_b == 0) && \result + 1 <= 0) && !(required_bytes == map_b)) && !(map_b == 0)) && num_entries <= 8) && map_b == map) && required_bytes == required_bytes) && num_entries == a) && required_bytes == required_bytes) && max_table_entries <= 8) && r == elemsize) && elemsize == 0) && unknown-#StackHeapBarrier-unknown < map_b) [2021-11-02 23:24:25,845 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((required_bytes == 0 && map == map_b) && (!(map == 0) || !(map == 0))) && \valid[elemsize := 0][map_b] == 1) && b == 24) && elemsize == r) && map_a == 0) && !(map_a == 0)) && map_b == 0) && \result + 1 <= 0) && !(required_bytes == map_b)) && !(map_b == 0)) && num_entries <= 8) && map_b == map) && required_bytes == required_bytes) && num_entries == a) && required_bytes == required_bytes) && max_table_entries <= 8) && r == elemsize) && elemsize == 0) && unknown-#StackHeapBarrier-unknown < map_b [2021-11-02 23:24:25,846 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((aux-map && map->p_impl-aux && aux-map && map->p_impl && hash_table_state_is_valid(map->p_impl)-aux) && \valid[map_b] == 1) && map == 0) && unknown-#StackHeapBarrier-unknown + 1 <= map_b) && !(\result == 0)) && map == map_b) && map_a == 0) && !(map_a == 0)) && map_b == 0) && map == map_b) && map == 0) && !(map_b == 0)) && \result == 0) && #memory_$Pointer$[map][0] + 1 < map) && (18446744073679922088 + unknown-#memory_int-unknown[map][40] * 24) % 18446744073709551616 <= 36028797018963967) && size_at_least_two == 0) && !(#memory_$Pointer$[map_b][map_b] == 0)) && 0 == #memory_$Pointer$[map][0]) && map_b == map) && unknown-#memory_int-unknown[map][40] <= 8) && (18446744073679922088 + unknown-#memory_int-unknown[#memory_$Pointer$[map][0]][40] * 24) % 18446744073709551616 <= 36028797018963967) && unknown-#memory_int-unknown[#memory_$Pointer$[map_b][map_b]][40] <= 8) && !(map == 0) [2021-11-02 23:24:25,846 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((\valid[map_b] == 1 && map == 0) && unknown-#StackHeapBarrier-unknown + 1 <= map_b) && !(\result == 0)) && map == map_b) && map_a == 0) && !(map_a == 0)) && map_b == 0) && map == map_b) && \result == 0) && map == 0) && !(map_b == 0)) && \result == 0) && #memory_$Pointer$[map][0] + 1 < map) && (18446744073679922088 + unknown-#memory_int-unknown[map][40] * 24) % 18446744073709551616 <= 36028797018963967) && size_at_least_two == 0) && !(#memory_$Pointer$[map_b][map_b] == 0)) && 0 == #memory_$Pointer$[map][0]) && map_b == map) && unknown-#memory_int-unknown[map][40] <= 8) && unknown-#memory_int-unknown[#memory_$Pointer$[map_b][map_b]][40] <= 8) && !(map == 0)) && (18446744073679922088 + unknown-#memory_int-unknown[#memory_$Pointer$[map_b][map_b]][40] * 24) % 18446744073709551616 <= 36028797018963967 [2021-11-02 23:24:25,847 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((aux-map && map->p_impl-aux && aux-map && map->p_impl && hash_table_state_is_valid(map->p_impl)-aux) && \valid[map_b] == 1) && map == 0) && unknown-#StackHeapBarrier-unknown + 1 <= map_b) && !(\result == 0)) && map == map_b) && map_a == 0) && !(map_a == 0)) && map_b == 0) && map == map_b) && map == 0) && !(map_b == 0)) && #memory_$Pointer$[map][0] + 1 < map) && (18446744073679922088 + unknown-#memory_int-unknown[map][40] * 24) % 18446744073709551616 <= 36028797018963967) && size_at_least_two == 0) && !(#memory_$Pointer$[map_b][map_b] == 0)) && 0 == #memory_$Pointer$[map][0]) && map_b == map) && unknown-#memory_int-unknown[map][40] <= 8) && unknown-#memory_int-unknown[#memory_$Pointer$[map_b][map_b]][40] <= 8) && !(map == 0)) && (18446744073679922088 + unknown-#memory_int-unknown[#memory_$Pointer$[map_b][map_b]][40] * 24) % 18446744073709551616 <= 36028797018963967 [2021-11-02 23:24:25,848 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((map == map_b && !(\result == 0)) && map == map_b) && (!(map == 0) || !(map == 0))) && map_a == 0) && !(map_a == 0)) && \result + 1 <= 0) && map_b == 0) && map == map_b) && !(map_b == 0)) && map_b == map [2021-11-02 23:24:25,848 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((map == map_b && \valid[map_b] == 1) && !(\result == 0)) && map == map_b) && (!(map == 0) || !(map == 0))) && \result + 1 <= 0) && map_a == 0) && !(map_a == 0)) && map_b == 0) && map == map_b) && \result + 1 <= 0) && !(map_b == 0)) && num_entries <= 8) && map_b == map) && max_table_entries <= 8) && unknown-#StackHeapBarrier-unknown < map_b [2021-11-02 23:24:25,849 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((map == map_b && \valid[map_b] == 1) && !(\result == 0)) && map == map_b) && (!(map == 0) || !(map == 0))) && \result + 1 <= 0) && \result + 1 <= 0) && map_a == 0) && !(map_a == 0)) && map_b == 0) && map == map_b) && \result + 1 <= 0) && !(map_b == 0)) && num_entries <= 8) && map_b == map) && max_table_entries <= 8) && unknown-#StackHeapBarrier-unknown < map_b [2021-11-02 23:24:25,849 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((map == map_b && \valid[map_b] == 1) && !(\result == 0)) && map == map_b) && (!(map == 0) || !(map == 0))) && map_a == 0) && !(map_a == 0)) && map_b == 0) && map == map_b) && \result + 1 <= 0) && !(map_b == 0)) && num_entries <= 8) && map_b == map) && max_table_entries <= 8) && unknown-#StackHeapBarrier-unknown < map_b [2021-11-02 23:24:25,849 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!(\result == 0) && map == map_b) && (!(map == 0) || !(map == 0))) && !(map_a == 0)) && map_b == 0) && \result == 0) && !(map_b == 0)) && map_b == map [2021-11-02 23:24:25,850 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((map == map_b && !(\result == 0)) && map == map_b) && (!(map == 0) || !(map == 0))) && !(map_a == 0)) && map_b == 0) && map == map_b) && \result == 0) && !(map_b == 0)) && map_b == map [2021-11-02 23:24:25,851 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((!(\result == 0) && map == map_b) && (!(map == 0) || !(map == 0))) && !(map_a == 0)) && map_b == 0) && (!(#memory_$Pointer$[map_b][map_b] == 0) || !(#memory_$Pointer$[map_b][map_b] == 0))) && \result == 0) && !(map_b == 0)) && !(b == 0)) && map_b == map) && (!(#memory_$Pointer$[b][b] == 0) || !(#memory_$Pointer$[b][b] == 0)) [2021-11-02 23:24:25,854 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!(\result == 0) && map == map_b) && !(map_a == 0)) && map_b == 0) && \result == 0) && !(map_b == 0)) && !(b == 0)) && map_b == map [2021-11-02 23:24:25,855 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((!(\result == 0) && map == map_b) && map_a == 0) && !(map_a == 0)) && map_b == 0) && !(map_b == 0)) && \result == 0) && !(b == 0)) && (cond == 1 || cond == 0)) && num_entries <= 8) && map_b == map) && !(a == 0)) && max_table_entries <= 8) && unknown-#StackHeapBarrier-unknown < map_b [2021-11-02 23:24:25,858 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((!(\result == 0) && map == map_b) && map_a == 0) && !(map_a == 0)) && map_b == 0) && !(map_b == 0)) && \result == 0) && !(b == 0)) && num_entries <= 8) && map_b == map) && !(a == 0)) && max_table_entries <= 8) && unknown-#StackHeapBarrier-unknown < map_b [2021-11-02 23:24:25,860 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((!(\result == 0) && map == map_b) && map_a == 0) && !(map_a == 0)) && map_b == 0) && !(map_b == 0)) && \result == 0) && !(b == 0)) && num_entries <= 8) && map_b == map) && !(a == 0)) && max_table_entries <= 8) && unknown-#StackHeapBarrier-unknown < map_b [2021-11-02 23:24:26,922 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dded36d2-a5e3-4d93-9042-30748813ed17/bin/uautomizer-tBqnrhUYjU/witness.graphml [2021-11-02 23:24:26,922 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-02 23:24:26,924 INFO L168 Benchmark]: Toolchain (without parser) took 540607.32 ms. Allocated memory was 113.2 MB in the beginning and 547.4 MB in the end (delta: 434.1 MB). Free memory was 87.0 MB in the beginning and 209.3 MB in the end (delta: -122.3 MB). Peak memory consumption was 406.1 MB. Max. memory is 16.1 GB. [2021-11-02 23:24:26,924 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 113.2 MB. Free memory is still 90.5 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-11-02 23:24:26,925 INFO L168 Benchmark]: CACSL2BoogieTranslator took 3573.37 ms. Allocated memory was 113.2 MB in the beginning and 176.2 MB in the end (delta: 62.9 MB). Free memory was 86.9 MB in the beginning and 78.2 MB in the end (delta: 8.7 MB). Peak memory consumption was 99.9 MB. Max. memory is 16.1 GB. [2021-11-02 23:24:26,925 INFO L168 Benchmark]: Boogie Procedure Inliner took 352.14 ms. Allocated memory is still 176.2 MB. Free memory was 78.2 MB in the beginning and 106.2 MB in the end (delta: -27.9 MB). Peak memory consumption was 17.2 MB. Max. memory is 16.1 GB. [2021-11-02 23:24:26,926 INFO L168 Benchmark]: Boogie Preprocessor took 207.44 ms. Allocated memory is still 176.2 MB. Free memory was 106.2 MB in the beginning and 87.3 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. [2021-11-02 23:24:26,927 INFO L168 Benchmark]: RCFGBuilder took 12811.05 ms. Allocated memory was 176.2 MB in the beginning and 375.4 MB in the end (delta: 199.2 MB). Free memory was 87.3 MB in the beginning and 288.5 MB in the end (delta: -201.2 MB). Peak memory consumption was 209.9 MB. Max. memory is 16.1 GB. [2021-11-02 23:24:26,927 INFO L168 Benchmark]: TraceAbstraction took 522412.26 ms. Allocated memory was 375.4 MB in the beginning and 547.4 MB in the end (delta: 172.0 MB). Free memory was 288.5 MB in the beginning and 377.0 MB in the end (delta: -88.5 MB). Peak memory consumption was 321.5 MB. Max. memory is 16.1 GB. [2021-11-02 23:24:26,928 INFO L168 Benchmark]: Witness Printer took 1244.44 ms. Allocated memory is still 547.4 MB. Free memory was 377.0 MB in the beginning and 209.3 MB in the end (delta: 167.7 MB). Peak memory consumption was 261.0 MB. Max. memory is 16.1 GB. [2021-11-02 23:24:26,937 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.23 ms. Allocated memory is still 113.2 MB. Free memory is still 90.5 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 3573.37 ms. Allocated memory was 113.2 MB in the beginning and 176.2 MB in the end (delta: 62.9 MB). Free memory was 86.9 MB in the beginning and 78.2 MB in the end (delta: 8.7 MB). Peak memory consumption was 99.9 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 352.14 ms. Allocated memory is still 176.2 MB. Free memory was 78.2 MB in the beginning and 106.2 MB in the end (delta: -27.9 MB). Peak memory consumption was 17.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 207.44 ms. Allocated memory is still 176.2 MB. Free memory was 106.2 MB in the beginning and 87.3 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. * RCFGBuilder took 12811.05 ms. Allocated memory was 176.2 MB in the beginning and 375.4 MB in the end (delta: 199.2 MB). Free memory was 87.3 MB in the beginning and 288.5 MB in the end (delta: -201.2 MB). Peak memory consumption was 209.9 MB. Max. memory is 16.1 GB. * TraceAbstraction took 522412.26 ms. Allocated memory was 375.4 MB in the beginning and 547.4 MB in the end (delta: 172.0 MB). Free memory was 288.5 MB in the beginning and 377.0 MB in the end (delta: -88.5 MB). Peak memory consumption was 321.5 MB. Max. memory is 16.1 GB. * Witness Printer took 1244.44 ms. Allocated memory is still 547.4 MB. Free memory was 377.0 MB in the beginning and 209.3 MB in the end (delta: 167.7 MB). Peak memory consumption was 261.0 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - 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$.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_ensure_allocated_hash_table_~#required_bytes~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.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 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$.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$.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$.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$.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$.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$.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$.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$.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_hash_table_state_required_bytes_~#elemsize~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base,QUANTIFIED] - 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$.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$.offset * 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 - 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, 513 locations, 25 error locations. Started 1 CEGAR loops. OverallTime: 522.2s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 121.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 20.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 11580 SDtfs, 18298 SDslu, 41499 SDs, 0 SdLazy, 10338 SolverSat, 924 SolverUnsat, 30 SolverUnknown, 0 SolverNotchecked, 90.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1064 GetRequests, 857 SyntacticMatches, 0 SemanticMatches, 207 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 910 ImplicationChecksByTransitivity, 25.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=785occurred in iteration=8, InterpolantAutomatonStates: 184, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 18 MinimizatonAttempts, 4641 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 159 LocationsWithAnnotation, 159 PreInvPairs, 230 NumberOfFragments, 3147 HoareAnnotationTreeSize, 159 FomulaSimplifications, 23244 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 159 FomulaSimplificationsInter, 6159 FormulaSimplificationTreeSizeReductionInter, 19.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 1.2s SsaConstructionTime, 361.2s SatisfiabilityAnalysisTime, 13.1s InterpolantComputationTime, 2447 NumberOfCodeBlocks, 2447 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 2429 ConstructedInterpolants, 5 QuantifiedInterpolants, 6445 SizeOfPredicates, 110 NumberOfNonLiveVariables, 20333 ConjunctsInSsa, 211 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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 25 specifications checked. All of them hold - InvariantResult [Line: 2613]: Loop Invariant Derived loop invariant: ((map_a == 0 && !(map_a == 0)) && map_a == map) && map_a == map - InvariantResult [Line: 7331]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 9136]: Loop Invariant Derived loop invariant: 0 - 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: 9988]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: -1]: 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: 9082]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 266]: Loop Invariant Derived loop invariant: ((map_a == 0 && !(map_a == 0)) && map_a == map) && map_a == map - InvariantResult [Line: 1988]: Loop Invariant [2021-11-02 23:24:26,962 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 23:24:26,963 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 23:24:26,963 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 23:24:26,963 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (((((((!(#memory_$Pointer$[map_a][map_a] == 0) && !(\result == 0)) && (!(map == 0) || !(map == 0))) && map_a == 0) && !(map_a == 0)) && \result + 1 <= 0) && map_a == map) && !(#memory_$Pointer$[map][map] == 0)) && map_a == map - InvariantResult [Line: 2626]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1988]: Loop Invariant Derived loop invariant: (((map_a == 0 && !(map_a == 0)) && \result + 1 <= 0) && map_a == map) && map_a == map - InvariantResult [Line: 239]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 238]: 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 Derived loop invariant: ((map_a == 0 && !(map_a == 0)) && map_a == map) && map_a == map - InvariantResult [Line: 9999]: Loop Invariant [2021-11-02 23:24:26,964 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 23:24:26,965 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 23:24:26,965 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 23:24:26,965 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (((((((aux-map && map->p_impl && hash_table_state_is_valid(map->p_impl)-aux && !(#memory_$Pointer$[map_a][map_a] == 0)) && !(\result == 0)) && (!(map == 0) || !(map == 0))) && map_a == 0) && !(map_a == 0)) && map_a == map) && !(#memory_$Pointer$[map][map] == 0)) && map_a == map - InvariantResult [Line: 239]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 7348]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2613]: Loop Invariant Derived loop invariant: ((((((((((((((((((((required_bytes == 0 && map == map_b) && (!(map == 0) || !(map == 0))) && \valid[elemsize := 0][map_b] == 1) && b == 24) && elemsize == r) && map_a == 0) && !(map_a == 0)) && map_b == 0) && !(required_bytes == map_b)) && !(map_b == 0)) && num_entries <= 8) && map_b == map) && required_bytes == required_bytes) && unknown-#memory_int-unknown[required_bytes][required_bytes] + 29629528 == 24 * num_entries) && num_entries == a) && required_bytes == required_bytes) && max_table_entries <= 8) && r == elemsize) && elemsize == 0) && unknown-#StackHeapBarrier-unknown < map_b) || ((((((((((((((((((((((required_bytes == 0 && map == map_b) && (!(map == 0) || !(map == 0))) && \valid[elemsize := 0][map_b] == 1) && \result + 1 <= 0) && b == 24) && elemsize == r) && \result + 1 <= 0) && map_a == 0) && !(map_a == 0)) && map_b == 0) && \result + 1 <= 0) && !(required_bytes == map_b)) && !(map_b == 0)) && num_entries <= 8) && map_b == map) && required_bytes == required_bytes) && num_entries == a) && required_bytes == required_bytes) && max_table_entries <= 8) && r == elemsize) && elemsize == 0) && unknown-#StackHeapBarrier-unknown < map_b) - InvariantResult [Line: 9999]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 6943]: Loop Invariant [2021-11-02 23:24:26,968 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base,QUANTIFIED] [2021-11-02 23:24:26,968 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base,QUANTIFIED] [2021-11-02 23:24:26,968 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base,QUANTIFIED] [2021-11-02 23:24:26,969 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base,QUANTIFIED] [2021-11-02 23:24:26,969 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base,QUANTIFIED] [2021-11-02 23:24:26,972 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base,QUANTIFIED] [2021-11-02 23:24:26,972 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base,QUANTIFIED] [2021-11-02 23:24:26,973 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base,QUANTIFIED] [2021-11-02 23:24:26,973 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base,QUANTIFIED] [2021-11-02 23:24:26,973 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base,QUANTIFIED] Derived loop invariant: ((((((((((((((((required_bytes == 0 && \result == 0) && !(\result == 0)) && map == map_b) && (!(map == 0) || !(map == 0))) && map_a == 0) && !(map_a == 0)) && map_b == 0) && !(map_b == 0)) && \valid[required_bytes := 0][map_b] == 1) && \result + 1 < map_b) && (\exists ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base : int :: 24 * num_entries == 29629528 + unknown-#memory_int-unknown[ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base][0] && unknown-#memory_int-unknown[ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base][0] % 18446744073709551616 <= 36028797018963967)) && num_entries <= 8) && map_b == map) && (\exists ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base : int :: 24 * num_entries == 29629528 + unknown-#memory_int-unknown[ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base][0] && ((cond == 1 && unknown-#memory_int-unknown[ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base][0] % 18446744073709551616 <= 36028797018963967) || (cond == 0 && 36028797018963967 < unknown-#memory_int-unknown[ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base][0] % 18446744073709551616)))) && unknown-#memory_int-unknown[required_bytes][required_bytes] + 29629528 == 24 * num_entries) && max_table_entries <= 8) && unknown-#StackHeapBarrier-unknown < map_b - InvariantResult [Line: 238]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 9103]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 262]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1988]: Loop Invariant Derived loop invariant: (((((((((((((((((((required_bytes == 0 && map == map_b) && (!(map == 0) || !(map == 0))) && \valid[elemsize := 0][map_b] == 1) && b == 24) && elemsize == r) && map_a == 0) && !(map_a == 0)) && map_b == 0) && \result + 1 <= 0) && !(required_bytes == map_b)) && !(map_b == 0)) && num_entries <= 8) && map_b == map) && required_bytes == required_bytes) && num_entries == a) && required_bytes == required_bytes) && max_table_entries <= 8) && r == elemsize) && elemsize == 0) && unknown-#StackHeapBarrier-unknown < map_b - InvariantResult [Line: 239]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 7348]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2586]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2626]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 266]: Loop Invariant Derived loop invariant: ((((((((\valid[map_b] == 1 && map == map_b) && (!(map == 0) || !(map == 0))) && map_a == 0) && !(map_a == 0)) && map_b == 0) && !(map_b == 0)) && map_b == map) && max_table_entries <= 8) && unknown-#StackHeapBarrier-unknown < map_b - InvariantResult [Line: 1988]: Loop Invariant Derived loop invariant: (((((((((((((map == map_b && \valid[map_b] == 1) && !(\result == 0)) && map == map_b) && (!(map == 0) || !(map == 0))) && map_a == 0) && !(map_a == 0)) && map_b == 0) && map == map_b) && \result + 1 <= 0) && !(map_b == 0)) && num_entries <= 8) && map_b == map) && max_table_entries <= 8) && unknown-#StackHeapBarrier-unknown < map_b - InvariantResult [Line: 2626]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2497]: Loop Invariant [2021-11-02 23:24:26,983 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 23:24:26,983 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 23:24:26,983 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 23:24:26,984 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((((!(\result == 0) && (!(map == 0) || !(map == 0))) && map_a == 0) && !(map_a == 0)) && map_a == map) && map_a == map) && \result == 0) || (((((((!(#memory_$Pointer$[map_a][map_a] == 0) && !(\result == 0)) && (!(map == 0) || !(map == 0))) && map_a == 0) && !(map_a == 0)) && map_a == map) && !(#memory_$Pointer$[map][map] == 0)) && map_a == map) - InvariantResult [Line: 9144]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 238]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 9999]: Loop Invariant [2021-11-02 23:24:26,985 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 23:24:26,985 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 23:24:26,987 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 23:24:26,988 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 23:24:26,988 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 23:24:26,989 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 23:24:26,989 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 23:24:26,989 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 23:24:26,989 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 23:24:26,990 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((((((((((((((((((((aux-map && map->p_impl-aux && aux-map && map->p_impl && hash_table_state_is_valid(map->p_impl)-aux) && \valid[map_b] == 1) && map == 0) && unknown-#StackHeapBarrier-unknown + 1 <= map_b) && !(\result == 0)) && map == map_b) && map_a == 0) && !(map_a == 0)) && map_b == 0) && map == map_b) && map == 0) && !(map_b == 0)) && \result == 0) && #memory_$Pointer$[map][0] + 1 < map) && (18446744073679922088 + unknown-#memory_int-unknown[map][40] * 24) % 18446744073709551616 <= 36028797018963967) && size_at_least_two == 0) && !(#memory_$Pointer$[map_b][map_b] == 0)) && 0 == #memory_$Pointer$[map][0]) && map_b == map) && unknown-#memory_int-unknown[map][40] <= 8) && (18446744073679922088 + unknown-#memory_int-unknown[#memory_$Pointer$[map][0]][40] * 24) % 18446744073709551616 <= 36028797018963967) && unknown-#memory_int-unknown[#memory_$Pointer$[map_b][map_b]][40] <= 8) && !(map == 0) - InvariantResult [Line: 2497]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 9749]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 253]: Loop Invariant [2021-11-02 23:24:26,992 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 23:24:26,992 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 23:24:26,992 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 23:24:26,992 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((((!(#memory_$Pointer$[map_a][map_a] == 0) && !(\result == 0)) && (!(map == 0) || !(map == 0))) && map_a == 0) && !(map_a == 0)) && map_a == map) && !(#memory_$Pointer$[map][map] == 0)) && map_a == map - InvariantResult [Line: 2626]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 9988]: 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: 2626]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 238]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 9999]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 9303]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2586]: Loop Invariant [2021-11-02 23:24:26,995 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 23:24:26,996 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 23:24:26,996 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 23:24:26,997 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (((((((!(\result == 0) && (!(map == 0) || !(map == 0))) && map_a == 0) && !(map_a == 0)) && \result == 0) && map_a == map) && map_a == map) && \result == 0) || (((((((!(#memory_$Pointer$[map_a][map_a] == 0) && !(\result == 0)) && (!(map == 0) || !(map == 0))) && map_a == 0) && !(map_a == 0)) && map_a == map) && !(#memory_$Pointer$[map][map] == 0)) && map_a == map) - InvariantResult [Line: 9999]: 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: 239]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 9988]: Loop Invariant [2021-11-02 23:24:26,998 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 23:24:26,998 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 23:24:26,998 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 23:24:27,002 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 23:24:27,003 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 23:24:27,003 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 23:24:27,004 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 23:24:27,004 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 23:24:27,004 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 23:24:27,004 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (((((((((((((((((((((\valid[map_b] == 1 && map == 0) && unknown-#StackHeapBarrier-unknown + 1 <= map_b) && !(\result == 0)) && map == map_b) && map_a == 0) && !(map_a == 0)) && map_b == 0) && map == map_b) && \result == 0) && map == 0) && !(map_b == 0)) && \result == 0) && #memory_$Pointer$[map][0] + 1 < map) && (18446744073679922088 + unknown-#memory_int-unknown[map][40] * 24) % 18446744073709551616 <= 36028797018963967) && size_at_least_two == 0) && !(#memory_$Pointer$[map_b][map_b] == 0)) && 0 == #memory_$Pointer$[map][0]) && map_b == map) && unknown-#memory_int-unknown[map][40] <= 8) && unknown-#memory_int-unknown[#memory_$Pointer$[map_b][map_b]][40] <= 8) && !(map == 0)) && (18446744073679922088 + unknown-#memory_int-unknown[#memory_$Pointer$[map_b][map_b]][40] * 24) % 18446744073709551616 <= 36028797018963967 - InvariantResult [Line: 2626]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 9999]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1988]: Loop Invariant Derived loop invariant: (((((!(\result == 0) && (!(map == 0) || !(map == 0))) && map_a == 0) && !(map_a == 0)) && \result + 1 <= 0) && map_a == map) && map_a == map - InvariantResult [Line: 9999]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 9999]: Loop Invariant Derived loop invariant: (((((((((((!(\result == 0) && map == map_b) && map_a == 0) && !(map_a == 0)) && map_b == 0) && !(map_b == 0)) && \result == 0) && !(b == 0)) && num_entries <= 8) && map_b == map) && !(a == 0)) && max_table_entries <= 8) && unknown-#StackHeapBarrier-unknown < map_b - InvariantResult [Line: 2626]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 9737]: 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: 9988]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2613]: Loop Invariant Derived loop invariant: (((((((((((((((map == map_b && \valid[map_b] == 1) && !(\result == 0)) && map == map_b) && (!(map == 0) || !(map == 0))) && \result + 1 <= 0) && \result + 1 <= 0) && map_a == 0) && !(map_a == 0)) && map_b == 0) && map == map_b) && \result + 1 <= 0) && !(map_b == 0)) && num_entries <= 8) && map_b == map) && max_table_entries <= 8) && unknown-#StackHeapBarrier-unknown < map_b - InvariantResult [Line: 9129]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2586]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((\result + 1 <= 0 && required_bytes == 0) && map == map_b) && (!(map == 0) || !(map == 0))) && \valid[elemsize := 0][map_b] == 1) && b == 24) && elemsize == r) && map_a == 0) && !(map_a == 0)) && map_b == 0) && \result + 1 <= 0) && !(required_bytes == map_b)) && !(map_b == 0)) && \result + 1 <= 0) && num_entries <= 8) && map_b == map) && required_bytes == required_bytes) && num_entries == a) && required_bytes == required_bytes) && max_table_entries <= 8) && r == elemsize) && elemsize == 0) && unknown-#StackHeapBarrier-unknown < map_b) || ((((((((((((((((((((required_bytes == 0 && map == map_b) && (!(map == 0) || !(map == 0))) && \valid[elemsize := 0][map_b] == 1) && 24 * num_entries == unknown-#memory_int-unknown[elemsize][elemsize]) && b == 24) && elemsize == r) && map_a == 0) && !(map_a == 0)) && map_b == 0) && !(required_bytes == map_b)) && !(map_b == 0)) && num_entries <= 8) && map_b == map) && required_bytes == required_bytes) && num_entries == a) && required_bytes == required_bytes) && max_table_entries <= 8) && r == elemsize) && elemsize == 0) && unknown-#StackHeapBarrier-unknown < map_b) - InvariantResult [Line: 262]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 9988]: Loop Invariant [2021-11-02 23:24:27,010 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 23:24:27,010 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 23:24:27,011 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 23:24:27,011 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((((!(#memory_$Pointer$[map_a][map_a] == 0) && !(\result == 0)) && (!(map == 0) || !(map == 0))) && map_a == 0) && !(map_a == 0)) && map_a == map) && !(#memory_$Pointer$[map][map] == 0)) && map_a == map - InvariantResult [Line: 1988]: Loop Invariant Derived loop invariant: (((((((((((((((((((required_bytes == 0 && map == map_b) && (!(map == 0) || !(map == 0))) && \valid[elemsize := 0][map_b] == 1) && b == 24) && elemsize == r) && map_a == 0) && !(map_a == 0)) && map_b == 0) && \result + 1 <= 0) && !(required_bytes == map_b)) && !(map_b == 0)) && num_entries <= 8) && map_b == map) && required_bytes == required_bytes) && num_entries == a) && required_bytes == required_bytes) && max_table_entries <= 8) && r == elemsize) && elemsize == 0) && unknown-#StackHeapBarrier-unknown < map_b - InvariantResult [Line: 10101]: Loop Invariant Derived loop invariant: ((((!(\result == 0) && (!(map == 0) || !(map == 0))) && map_a == 0) && !(map_a == 0)) && map_a == map) && map_a == map - InvariantResult [Line: 9759]: 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 Derived loop invariant: ((((!(\result == 0) && (!(map == 0) || !(map == 0))) && map_a == 0) && !(map_a == 0)) && map_a == map) && map_a == map - InvariantResult [Line: 2626]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 9999]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2626]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 9988]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 7280]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2541]: Loop Invariant Derived loop invariant: ((map_a == 0 && !(map_a == 0)) && map_a == map) && map_a == map - InvariantResult [Line: 9988]: Loop Invariant Derived loop invariant: ((((((!(\result == 0) && map == map_b) && !(map_a == 0)) && map_b == 0) && \result == 0) && !(map_b == 0)) && !(b == 0)) && map_b == map - InvariantResult [Line: 7348]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 9999]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2497]: Loop Invariant Derived loop invariant: ((map_a == 0 && !(map_a == 0)) && map_a == map) && map_a == map - InvariantResult [Line: 262]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 10101]: Loop Invariant Derived loop invariant: (((((((((map == map_b && !(\result == 0)) && map == map_b) && (!(map == 0) || !(map == 0))) && map_a == 0) && !(map_a == 0)) && \result + 1 <= 0) && map_b == 0) && map == map_b) && !(map_b == 0)) && map_b == map - InvariantResult [Line: 1988]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2626]: Loop Invariant [2021-11-02 23:24:27,021 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 23:24:27,021 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 23:24:27,021 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 23:24:27,021 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 23:24:27,022 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 23:24:27,022 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 23:24:27,022 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 23:24:27,023 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 23:24:27,023 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 23:24:27,023 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (((((((((((((((((((((aux-map && map->p_impl-aux && aux-map && map->p_impl && hash_table_state_is_valid(map->p_impl)-aux) && \valid[map_b] == 1) && map == 0) && unknown-#StackHeapBarrier-unknown + 1 <= map_b) && !(\result == 0)) && map == map_b) && map_a == 0) && !(map_a == 0)) && map_b == 0) && map == map_b) && map == 0) && !(map_b == 0)) && #memory_$Pointer$[map][0] + 1 < map) && (18446744073679922088 + unknown-#memory_int-unknown[map][40] * 24) % 18446744073709551616 <= 36028797018963967) && size_at_least_two == 0) && !(#memory_$Pointer$[map_b][map_b] == 0)) && 0 == #memory_$Pointer$[map][0]) && map_b == map) && unknown-#memory_int-unknown[map][40] <= 8) && unknown-#memory_int-unknown[#memory_$Pointer$[map_b][map_b]][40] <= 8) && !(map == 0)) && (18446744073679922088 + unknown-#memory_int-unknown[#memory_$Pointer$[map_b][map_b]][40] * 24) % 18446744073709551616 <= 36028797018963967 - InvariantResult [Line: 2626]: 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: 9779]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 9988]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1988]: Loop Invariant Derived loop invariant: (((map_a == 0 && !(map_a == 0)) && \result + 1 <= 0) && map_a == map) && map_a == map - InvariantResult [Line: 2626]: Loop Invariant [2021-11-02 23:24:27,034 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 23:24:27,035 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 23:24:27,035 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 23:24:27,035 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (((((((aux-map && map->p_impl && hash_table_state_is_valid(map->p_impl)-aux && !(#memory_$Pointer$[map_a][map_a] == 0)) && !(\result == 0)) && (!(map == 0) || !(map == 0))) && map_a == 0) && !(map_a == 0)) && map_a == map) && !(#memory_$Pointer$[map][map] == 0)) && map_a == map - InvariantResult [Line: 9144]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 9988]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2497]: Loop Invariant Derived loop invariant: (((((((((((((((((((((\result + 1 <= 0 && required_bytes == 0) && map == map_b) && (!(map == 0) || !(map == 0))) && \valid[elemsize := 0][map_b] == 1) && b == 24) && elemsize == r) && map_a == 0) && !(map_a == 0)) && map_b == 0) && \result + 1 <= 0) && !(required_bytes == map_b)) && !(map_b == 0)) && num_entries <= 8) && map_b == map) && required_bytes == required_bytes) && num_entries == a) && required_bytes == required_bytes) && max_table_entries <= 8) && r == elemsize) && elemsize == 0) && unknown-#StackHeapBarrier-unknown < map_b) || ((((((((((((((((((((required_bytes == 0 && map == map_b) && (!(map == 0) || !(map == 0))) && \valid[elemsize := 0][map_b] == 1) && 24 * num_entries == unknown-#memory_int-unknown[elemsize][elemsize]) && b == 24) && elemsize == r) && map_a == 0) && !(map_a == 0)) && map_b == 0) && !(required_bytes == map_b)) && !(map_b == 0)) && num_entries <= 8) && map_b == map) && required_bytes == required_bytes) && num_entries == a) && required_bytes == required_bytes) && max_table_entries <= 8) && r == elemsize) && elemsize == 0) && unknown-#StackHeapBarrier-unknown < map_b) - InvariantResult [Line: 9999]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 9773]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 248]: Loop Invariant Derived loop invariant: ((map_a == 0 && !(map_a == 0)) && map_a == map) && map_a == map - InvariantResult [Line: 9103]: 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: 9988]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 248]: Loop Invariant Derived loop invariant: ((((!(\result == 0) && (!(map == 0) || !(map == 0))) && map_a == 0) && !(map_a == 0)) && map_a == map) && map_a == map - InvariantResult [Line: 2626]: Loop Invariant Derived loop invariant: ((map_a == 0 && !(map_a == 0)) && map_a == map) && map_a == 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: ((((((!(\result == 0) && map == map_b) && (!(map == 0) || !(map == 0))) && !(map_a == 0)) && map_b == 0) && \result == 0) && !(map_b == 0)) && map_b == map - InvariantResult [Line: 10144]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 253]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 9988]: Loop Invariant Derived loop invariant: ((((((((map == map_b && !(\result == 0)) && map == map_b) && (!(map == 0) || !(map == 0))) && !(map_a == 0)) && map_b == 0) && map == map_b) && \result == 0) && !(map_b == 0)) && map_b == map - InvariantResult [Line: 9999]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 9988]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2541]: Loop Invariant Derived loop invariant: ((((((((((((((map == map_b && \valid[map_b] == 1) && !(\result == 0)) && map == map_b) && (!(map == 0) || !(map == 0))) && \result + 1 <= 0) && map_a == 0) && !(map_a == 0)) && map_b == 0) && map == map_b) && \result + 1 <= 0) && !(map_b == 0)) && num_entries <= 8) && map_b == map) && max_table_entries <= 8) && unknown-#StackHeapBarrier-unknown < map_b - InvariantResult [Line: 248]: Loop Invariant [2021-11-02 23:24:27,045 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base,QUANTIFIED] [2021-11-02 23:24:27,045 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base,QUANTIFIED] [2021-11-02 23:24:27,046 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base,QUANTIFIED] [2021-11-02 23:24:27,046 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((required_bytes == 0 && map == map_b) && (!(map == 0) || !(map == 0))) && \valid[elemsize := 0][map_b] == 1) && 24 * num_entries == unknown-#memory_int-unknown[elemsize][elemsize]) && b == 24) && elemsize == r) && map_a == 0) && !(map_a == 0)) && map_b == 0) && !(required_bytes == map_b)) && !(map_b == 0)) && r == required_bytes) && (\exists ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base : int :: unknown-#memory_int-unknown[ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base][0] == 24 * num_entries && unknown-#memory_int-unknown[ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base][0] == a)) && num_entries <= 8) && 29629528 + b == 0) && map_b == map) && required_bytes == required_bytes) && num_entries == a) && required_bytes == required_bytes) && max_table_entries <= 8) && r == elemsize) && r == required_bytes) && elemsize == 0) && unknown-#StackHeapBarrier-unknown < map_b - InvariantResult [Line: 9999]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 9999]: Loop Invariant Derived loop invariant: ((((((((((((!(\result == 0) && map == map_b) && map_a == 0) && !(map_a == 0)) && map_b == 0) && !(map_b == 0)) && \result == 0) && !(b == 0)) && (cond == 1 || cond == 0)) && num_entries <= 8) && map_b == map) && !(a == 0)) && max_table_entries <= 8) && unknown-#StackHeapBarrier-unknown < map_b - InvariantResult [Line: 2541]: Loop Invariant Derived loop invariant: ((((((((((((((((((((required_bytes == 0 && map == map_b) && (!(map == 0) || !(map == 0))) && \valid[elemsize := 0][map_b] == 1) && b == 24) && elemsize == r) && map_a == 0) && !(map_a == 0)) && map_b == 0) && !(required_bytes == map_b)) && !(map_b == 0)) && num_entries <= 8) && map_b == map) && required_bytes == required_bytes) && unknown-#memory_int-unknown[required_bytes][required_bytes] + 29629528 == 24 * num_entries) && num_entries == a) && required_bytes == required_bytes) && max_table_entries <= 8) && r == elemsize) && elemsize == 0) && unknown-#StackHeapBarrier-unknown < map_b) || (((((((((((((((((((((required_bytes == 0 && map == map_b) && (!(map == 0) || !(map == 0))) && \valid[elemsize := 0][map_b] == 1) && \result + 1 <= 0) && b == 24) && elemsize == r) && map_a == 0) && !(map_a == 0)) && map_b == 0) && \result + 1 <= 0) && !(required_bytes == map_b)) && !(map_b == 0)) && num_entries <= 8) && map_b == map) && required_bytes == required_bytes) && num_entries == a) && required_bytes == required_bytes) && max_table_entries <= 8) && r == elemsize) && elemsize == 0) && unknown-#StackHeapBarrier-unknown < map_b) - InvariantResult [Line: 9999]: Loop Invariant Derived loop invariant: (((((((((((!(\result == 0) && map == map_b) && map_a == 0) && !(map_a == 0)) && map_b == 0) && !(map_b == 0)) && \result == 0) && !(b == 0)) && num_entries <= 8) && map_b == map) && !(a == 0)) && max_table_entries <= 8) && unknown-#StackHeapBarrier-unknown < map_b - InvariantResult [Line: 2626]: 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: 9129]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2626]: Loop Invariant Derived loop invariant: ((((((((((\valid[map_b] == 1 && map == map_b) && (!(map == 0) || !(map == 0))) && map_a == 0) && !(map_a == 0)) && map_b == 0) && !(map_b == 0)) && (cond == 1 || cond == 0)) && num_entries <= 8) && map_b == map) && max_table_entries <= 8) && unknown-#StackHeapBarrier-unknown < map_b - InvariantResult [Line: 9136]: 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: 9999]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2626]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 9347]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 248]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2586]: Loop Invariant Derived loop invariant: ((map_a == 0 && !(map_a == 0)) && map_a == map) && map_a == map - InvariantResult [Line: 9391]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 6943]: Loop Invariant Derived loop invariant: (((!(\result == 0) && map_a == 0) && !(map_a == 0)) && map_a == map) && map_a == map - InvariantResult [Line: 2613]: Loop Invariant Derived loop invariant: ((((!(\result == 0) && (!(map == 0) || !(map == 0))) && map_a == 0) && !(map_a == 0)) && map_a == map) && map_a == map - InvariantResult [Line: 9999]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2626]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 9988]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 253]: Loop Invariant Derived loop invariant: ((((((((((((((((((required_bytes == 0 && map == map_b) && (!(map == 0) || !(map == 0))) && \valid[elemsize := 0][map_b] == 1) && b == 24) && elemsize == r) && map_a == 0) && !(map_a == 0)) && map_b == 0) && !(required_bytes == map_b)) && !(map_b == 0)) && num_entries <= 8) && map_b == map) && required_bytes == required_bytes) && num_entries == a) && required_bytes == required_bytes) && max_table_entries <= 8) && r == elemsize) && elemsize == 0) && unknown-#StackHeapBarrier-unknown < map_b - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 263]: Loop Invariant Derived loop invariant: ((((!(\result == 0) && (!(map == 0) || !(map == 0))) && map_a == 0) && !(map_a == 0)) && map_a == map) && map_a == map - InvariantResult [Line: 239]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 9988]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2626]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 10101]: Loop Invariant Derived loop invariant: ((map_a == 0 && !(map_a == 0)) && map_a == map) && map_a == map - InvariantResult [Line: 9759]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 263]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 10101]: Loop Invariant Derived loop invariant: (((((((((((((required_bytes == 0 && \valid[map_b] == 1) && map == map_b) && (!(map == 0) || !(map == 0))) && map_a == 0) && !(map_a == 0)) && map_b == 0) && !(required_bytes == map_b)) && !(map_b == 0)) && num_entries <= 8) && map_b == map) && unknown-#memory_int-unknown[required_bytes][required_bytes] + 29629528 == 24 * num_entries) && max_table_entries <= 8) && unknown-#StackHeapBarrier-unknown < map_b) || ((((((((((\valid[map_b] == 1 && unknown-#StackHeapBarrier-unknown + 1 <= map_b) && map == map_b) && (!(map == 0) || !(map == 0))) && map_a == 0) && !(map_a == 0)) && \result + 1 <= 0) && map_b == 0) && !(required_bytes == map_b)) && !(map_b == 0)) && map_b == map) - InvariantResult [Line: 9103]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 7331]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 9988]: Loop Invariant [2021-11-02 23:24:27,059 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 23:24:27,059 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 23:24:27,059 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 23:24:27,060 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 23:24:27,060 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 23:24:27,060 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 23:24:27,060 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 23:24:27,061 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((((!(\result == 0) && map == map_b) && (!(map == 0) || !(map == 0))) && !(map_a == 0)) && map_b == 0) && (!(#memory_$Pointer$[map_b][map_b] == 0) || !(#memory_$Pointer$[map_b][map_b] == 0))) && \result == 0) && !(map_b == 0)) && !(b == 0)) && map_b == map) && (!(#memory_$Pointer$[b][b] == 0) || !(#memory_$Pointer$[b][b] == 0)) RESULT: Ultimate proved your program to be correct! [2021-11-02 23:24:27,279 WARN L435 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dded36d2-a5e3-4d93-9042-30748813ed17/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2021-11-02 23:24:27,320 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dded36d2-a5e3-4d93-9042-30748813ed17/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE