./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_hash_table_get_entry_count_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9c1b5966 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/aws-c-common/aws_hash_table_get_entry_count_harness.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 846a565d6a742f245ca362c4e2fb63bb4d14b5e5473527f5da84e078cffb2df4 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-9c1b596 [2021-10-30 23:05:27,792 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-30 23:05:27,794 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-30 23:05:27,847 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-30 23:05:27,847 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-30 23:05:27,849 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-30 23:05:27,849 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-30 23:05:27,850 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-30 23:05:27,853 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-30 23:05:27,864 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-30 23:05:27,864 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-30 23:05:27,866 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-30 23:05:27,866 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-30 23:05:27,868 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-30 23:05:27,869 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-30 23:05:27,873 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-30 23:05:27,874 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-30 23:05:27,875 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-30 23:05:27,878 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-30 23:05:27,883 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-30 23:05:27,884 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-30 23:05:27,885 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-30 23:05:27,886 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-30 23:05:27,886 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-30 23:05:27,891 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-30 23:05:27,891 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-30 23:05:27,891 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-30 23:05:27,893 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-30 23:05:27,893 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-30 23:05:27,893 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-30 23:05:27,894 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-30 23:05:27,894 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-30 23:05:27,895 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-30 23:05:27,896 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-30 23:05:27,897 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-30 23:05:27,897 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-30 23:05:27,898 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-30 23:05:27,898 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-30 23:05:27,898 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-30 23:05:27,899 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-30 23:05:27,899 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-30 23:05:27,900 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-10-30 23:05:27,925 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-30 23:05:27,925 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-30 23:05:27,926 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-30 23:05:27,926 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-30 23:05:27,927 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-30 23:05:27,927 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-30 23:05:27,927 INFO L138 SettingsManager]: * Use SBE=true [2021-10-30 23:05:27,927 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-30 23:05:27,927 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-30 23:05:27,928 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-30 23:05:27,928 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-30 23:05:27,928 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-30 23:05:27,928 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-30 23:05:27,929 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-30 23:05:27,929 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-30 23:05:27,929 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-30 23:05:27,929 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-30 23:05:27,929 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-30 23:05:27,929 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-30 23:05:27,929 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-30 23:05:27,929 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-30 23:05:27,930 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-30 23:05:27,930 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-30 23:05:27,930 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-30 23:05:27,930 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-30 23:05:27,930 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-10-30 23:05:27,930 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-10-30 23:05:27,930 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-30 23:05:27,931 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-30 23:05:27,931 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 846a565d6a742f245ca362c4e2fb63bb4d14b5e5473527f5da84e078cffb2df4 [2021-10-30 23:05:28,135 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-30 23:05:28,156 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-30 23:05:28,158 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-30 23:05:28,159 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-30 23:05:28,160 INFO L275 PluginConnector]: CDTParser initialized [2021-10-30 23:05:28,160 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_hash_table_get_entry_count_harness.i [2021-10-30 23:05:28,212 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a962d764/d47bc031b9a14892bea608134b2c1b5c/FLAG511dc1432 [2021-10-30 23:05:28,852 INFO L306 CDTParser]: Found 1 translation units. [2021-10-30 23:05:28,853 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_get_entry_count_harness.i [2021-10-30 23:05:28,890 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a962d764/d47bc031b9a14892bea608134b2c1b5c/FLAG511dc1432 [2021-10-30 23:05:29,240 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a962d764/d47bc031b9a14892bea608134b2c1b5c [2021-10-30 23:05:29,242 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-30 23:05:29,244 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-30 23:05:29,246 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-30 23:05:29,246 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-30 23:05:29,249 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-30 23:05:29,249 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.10 11:05:29" (1/1) ... [2021-10-30 23:05:29,250 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@382d4906 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.10 11:05:29, skipping insertion in model container [2021-10-30 23:05:29,250 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.10 11:05:29" (1/1) ... [2021-10-30 23:05:29,254 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-30 23:05:29,350 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-30 23:05:29,580 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_get_entry_count_harness.i[4504,4517] [2021-10-30 23:05:29,586 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_get_entry_count_harness.i[4564,4577] [2021-10-30 23:05:29,602 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-10-30 23:05:29,606 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-10-30 23:05:30,110 WARN L1529 CHandler]: Possible shadowing of function index [2021-10-30 23:05:30,110 WARN L1529 CHandler]: Possible shadowing of function index [2021-10-30 23:05:30,111 WARN L1529 CHandler]: Possible shadowing of function index [2021-10-30 23:05:30,111 WARN L1529 CHandler]: Possible shadowing of function index [2021-10-30 23:05:30,112 WARN L1529 CHandler]: Possible shadowing of function index [2021-10-30 23:05:30,133 WARN L1529 CHandler]: Possible shadowing of function index [2021-10-30 23:05:30,134 WARN L1529 CHandler]: Possible shadowing of function index [2021-10-30 23:05:30,135 WARN L1529 CHandler]: Possible shadowing of function index [2021-10-30 23:05:30,135 WARN L1529 CHandler]: Possible shadowing of function index [2021-10-30 23:05:30,136 WARN L1529 CHandler]: Possible shadowing of function index [2021-10-30 23:05:30,137 WARN L1529 CHandler]: Possible shadowing of function index [2021-10-30 23:05:30,137 WARN L1529 CHandler]: Possible shadowing of function index [2021-10-30 23:05:30,137 WARN L1529 CHandler]: Possible shadowing of function index [2021-10-30 23:05:30,340 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-10-30 23:05:30,341 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-10-30 23:05:30,341 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-10-30 23:05:30,343 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-10-30 23:05:30,344 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-10-30 23:05:30,345 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-10-30 23:05:30,345 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-10-30 23:05:30,346 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-10-30 23:05:30,346 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-10-30 23:05:30,364 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-10-30 23:05:30,493 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-10-30 23:05:30,721 WARN L1529 CHandler]: Possible shadowing of function index [2021-10-30 23:05:30,722 WARN L1529 CHandler]: Possible shadowing of function index [2021-10-30 23:05:30,741 WARN L1529 CHandler]: Possible shadowing of function index [2021-10-30 23:05:30,743 WARN L1529 CHandler]: Possible shadowing of function index [2021-10-30 23:05:30,747 WARN L1529 CHandler]: Possible shadowing of function index [2021-10-30 23:05:30,747 WARN L1529 CHandler]: Possible shadowing of function index [2021-10-30 23:05:30,760 WARN L1529 CHandler]: Possible shadowing of function index [2021-10-30 23:05:30,761 WARN L1529 CHandler]: Possible shadowing of function index [2021-10-30 23:05:30,763 WARN L1529 CHandler]: Possible shadowing of function index [2021-10-30 23:05:30,764 WARN L1529 CHandler]: Possible shadowing of function index [2021-10-30 23:05:30,764 WARN L1529 CHandler]: Possible shadowing of function index [2021-10-30 23:05:30,765 WARN L1529 CHandler]: Possible shadowing of function index [2021-10-30 23:05:30,765 WARN L1529 CHandler]: Possible shadowing of function index [2021-10-30 23:05:30,803 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-30 23:05:30,833 INFO L203 MainTranslator]: Completed pre-run [2021-10-30 23:05:30,859 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_get_entry_count_harness.i[4504,4517] [2021-10-30 23:05:30,860 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_get_entry_count_harness.i[4564,4577] [2021-10-30 23:05:30,861 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-10-30 23:05:30,861 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-10-30 23:05:30,886 WARN L1529 CHandler]: Possible shadowing of function index [2021-10-30 23:05:30,887 WARN L1529 CHandler]: Possible shadowing of function index [2021-10-30 23:05:30,887 WARN L1529 CHandler]: Possible shadowing of function index [2021-10-30 23:05:30,887 WARN L1529 CHandler]: Possible shadowing of function index [2021-10-30 23:05:30,888 WARN L1529 CHandler]: Possible shadowing of function index [2021-10-30 23:05:30,893 WARN L1529 CHandler]: Possible shadowing of function index [2021-10-30 23:05:30,894 WARN L1529 CHandler]: Possible shadowing of function index [2021-10-30 23:05:30,894 WARN L1529 CHandler]: Possible shadowing of function index [2021-10-30 23:05:30,894 WARN L1529 CHandler]: Possible shadowing of function index [2021-10-30 23:05:30,895 WARN L1529 CHandler]: Possible shadowing of function index [2021-10-30 23:05:30,896 WARN L1529 CHandler]: Possible shadowing of function index [2021-10-30 23:05:30,896 WARN L1529 CHandler]: Possible shadowing of function index [2021-10-30 23:05:30,896 WARN L1529 CHandler]: Possible shadowing of function index [2021-10-30 23:05:30,914 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-10-30 23:05:30,914 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-10-30 23:05:30,915 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-10-30 23:05:30,915 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-10-30 23:05:30,916 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-10-30 23:05:30,916 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-10-30 23:05:30,916 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-10-30 23:05:30,917 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-10-30 23:05:30,917 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-10-30 23:05:30,917 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-10-30 23:05:30,940 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-10-30 23:05:31,014 WARN L1529 CHandler]: Possible shadowing of function index [2021-10-30 23:05:31,015 WARN L1529 CHandler]: Possible shadowing of function index [2021-10-30 23:05:31,019 WARN L1529 CHandler]: Possible shadowing of function index [2021-10-30 23:05:31,020 WARN L1529 CHandler]: Possible shadowing of function index [2021-10-30 23:05:31,021 WARN L1529 CHandler]: Possible shadowing of function index [2021-10-30 23:05:31,021 WARN L1529 CHandler]: Possible shadowing of function index [2021-10-30 23:05:31,029 WARN L1529 CHandler]: Possible shadowing of function index [2021-10-30 23:05:31,030 WARN L1529 CHandler]: Possible shadowing of function index [2021-10-30 23:05:31,030 WARN L1529 CHandler]: Possible shadowing of function index [2021-10-30 23:05:31,030 WARN L1529 CHandler]: Possible shadowing of function index [2021-10-30 23:05:31,031 WARN L1529 CHandler]: Possible shadowing of function index [2021-10-30 23:05:31,031 WARN L1529 CHandler]: Possible shadowing of function index [2021-10-30 23:05:31,031 WARN L1529 CHandler]: Possible shadowing of function index [2021-10-30 23:05:31,041 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-30 23:05:31,221 INFO L208 MainTranslator]: Completed translation [2021-10-30 23:05:31,222 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.10 11:05:31 WrapperNode [2021-10-30 23:05:31,222 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-30 23:05:31,223 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-30 23:05:31,223 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-30 23:05:31,223 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-30 23:05:31,228 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.10 11:05:31" (1/1) ... [2021-10-30 23:05:31,323 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.10 11:05:31" (1/1) ... [2021-10-30 23:05:31,393 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-30 23:05:31,393 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-30 23:05:31,394 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-30 23:05:31,394 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-30 23:05:31,400 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.10 11:05:31" (1/1) ... [2021-10-30 23:05:31,401 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.10 11:05:31" (1/1) ... [2021-10-30 23:05:31,412 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.10 11:05:31" (1/1) ... [2021-10-30 23:05:31,413 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.10 11:05:31" (1/1) ... [2021-10-30 23:05:31,458 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.10 11:05:31" (1/1) ... [2021-10-30 23:05:31,464 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.10 11:05:31" (1/1) ... [2021-10-30 23:05:31,477 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.10 11:05:31" (1/1) ... [2021-10-30 23:05:31,489 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-30 23:05:31,492 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-30 23:05:31,492 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-30 23:05:31,492 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-30 23:05:31,493 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.10 11:05:31" (1/1) ... [2021-10-30 23:05:31,498 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-30 23:05:31,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-10-30 23:05:31,515 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-30 23:05:31,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-30 23:05:31,552 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2021-10-30 23:05:31,553 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-10-30 23:05:31,553 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-10-30 23:05:31,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-10-30 23:05:31,554 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-30 23:05:31,554 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-30 23:05:31,554 INFO L130 BoogieDeclarations]: Found specification of procedure __builtin_uaddl_overflow [2021-10-30 23:05:31,554 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-30 23:05:31,554 INFO L130 BoogieDeclarations]: Found specification of procedure __builtin_umull_overflow [2021-10-30 23:05:31,554 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-10-30 23:05:31,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-10-30 23:05:31,554 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-30 23:05:31,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-10-30 23:05:31,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-30 23:05:38,339 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-30 23:05:38,339 INFO L299 CfgBuilder]: Removed 100 assume(true) statements. [2021-10-30 23:05:38,342 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.10 11:05:38 BoogieIcfgContainer [2021-10-30 23:05:38,342 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-30 23:05:38,344 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-30 23:05:38,344 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-30 23:05:38,346 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-30 23:05:38,347 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.10 11:05:29" (1/3) ... [2021-10-30 23:05:38,347 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d62b52c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.10 11:05:38, skipping insertion in model container [2021-10-30 23:05:38,348 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.10 11:05:31" (2/3) ... [2021-10-30 23:05:38,348 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d62b52c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.10 11:05:38, skipping insertion in model container [2021-10-30 23:05:38,348 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.10 11:05:38" (3/3) ... [2021-10-30 23:05:38,349 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_hash_table_get_entry_count_harness.i [2021-10-30 23:05:38,353 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-30 23:05:38,353 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2021-10-30 23:05:38,382 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-30 23:05:38,386 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-10-30 23:05:38,387 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2021-10-30 23:05:38,401 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 84 states have (on average 1.3333333333333333) internal successors, (112), 87 states have internal predecessors, (112), 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-10-30 23:05:38,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-10-30 23:05:38,405 INFO L505 BasicCegarLoop]: Found error trace [2021-10-30 23:05:38,406 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] [2021-10-30 23:05:38,406 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-30 23:05:38,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-30 23:05:38,412 INFO L85 PathProgramCache]: Analyzing trace with hash -2070018022, now seen corresponding path program 1 times [2021-10-30 23:05:38,418 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-30 23:05:38,419 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487267729] [2021-10-30 23:05:38,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-30 23:05:38,422 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-30 23:05:38,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-30 23:05:38,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-30 23:05:38,898 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-30 23:05:38,898 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487267729] [2021-10-30 23:05:38,898 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487267729] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-30 23:05:38,898 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-30 23:05:38,899 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-30 23:05:38,901 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912758990] [2021-10-30 23:05:38,909 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-10-30 23:05:38,909 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-30 23:05:38,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-10-30 23:05:38,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-10-30 23:05:38,922 INFO L87 Difference]: Start difference. First operand has 88 states, 84 states have (on average 1.3333333333333333) internal successors, (112), 87 states have internal predecessors, (112), 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 20.5) internal successors, (41), 2 states have internal predecessors, (41), 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-10-30 23:05:38,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-30 23:05:38,944 INFO L93 Difference]: Finished difference Result 172 states and 219 transitions. [2021-10-30 23:05:38,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-10-30 23:05:38,945 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 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 41 [2021-10-30 23:05:38,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-30 23:05:38,950 INFO L225 Difference]: With dead ends: 172 [2021-10-30 23:05:38,950 INFO L226 Difference]: Without dead ends: 82 [2021-10-30 23:05:38,952 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-10-30 23:05:38,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2021-10-30 23:05:38,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2021-10-30 23:05:38,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 79 states have (on average 1.2151898734177216) internal successors, (96), 81 states have internal predecessors, (96), 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-10-30 23:05:38,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 96 transitions. [2021-10-30 23:05:38,983 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 96 transitions. Word has length 41 [2021-10-30 23:05:38,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-30 23:05:38,983 INFO L470 AbstractCegarLoop]: Abstraction has 82 states and 96 transitions. [2021-10-30 23:05:38,983 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 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-10-30 23:05:38,984 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 96 transitions. [2021-10-30 23:05:38,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-10-30 23:05:38,985 INFO L505 BasicCegarLoop]: Found error trace [2021-10-30 23:05:38,985 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] [2021-10-30 23:05:38,986 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-30 23:05:38,986 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-30 23:05:38,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-30 23:05:38,988 INFO L85 PathProgramCache]: Analyzing trace with hash 584946138, now seen corresponding path program 1 times [2021-10-30 23:05:38,989 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-30 23:05:38,989 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546714424] [2021-10-30 23:05:38,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-30 23:05:38,992 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-30 23:05:39,097 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-10-30 23:05:39,097 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [659774840] [2021-10-30 23:05:39,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-30 23:05:39,098 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-30 23:05:39,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-10-30 23:05:39,099 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-30 23:05:39,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-10-30 23:05:39,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-30 23:05:39,822 INFO L263 TraceCheckSpWp]: Trace formula consists of 2475 conjuncts, 7 conjunts are in the unsatisfiable core [2021-10-30 23:05:39,828 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-30 23:05:40,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-30 23:05:40,044 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-30 23:05:40,044 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546714424] [2021-10-30 23:05:40,044 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-10-30 23:05:40,044 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [659774840] [2021-10-30 23:05:40,044 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [659774840] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-30 23:05:40,044 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-30 23:05:40,044 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-30 23:05:40,045 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577055392] [2021-10-30 23:05:40,045 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-30 23:05:40,045 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-30 23:05:40,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-30 23:05:40,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-30 23:05:40,046 INFO L87 Difference]: Start difference. First operand 82 states and 96 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 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-10-30 23:05:40,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-30 23:05:40,241 INFO L93 Difference]: Finished difference Result 208 states and 244 transitions. [2021-10-30 23:05:40,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-30 23:05:40,242 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 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 41 [2021-10-30 23:05:40,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-30 23:05:40,243 INFO L225 Difference]: With dead ends: 208 [2021-10-30 23:05:40,243 INFO L226 Difference]: Without dead ends: 148 [2021-10-30 23:05:40,244 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 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-10-30 23:05:40,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2021-10-30 23:05:40,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 88. [2021-10-30 23:05:40,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 85 states have (on average 1.2) internal successors, (102), 87 states have internal predecessors, (102), 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-10-30 23:05:40,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 102 transitions. [2021-10-30 23:05:40,249 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 102 transitions. Word has length 41 [2021-10-30 23:05:40,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-30 23:05:40,250 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 102 transitions. [2021-10-30 23:05:40,250 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 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-10-30 23:05:40,250 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 102 transitions. [2021-10-30 23:05:40,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-10-30 23:05:40,251 INFO L505 BasicCegarLoop]: Found error trace [2021-10-30 23:05:40,251 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] [2021-10-30 23:05:40,274 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-10-30 23:05:40,455 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-30 23:05:40,455 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-30 23:05:40,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-30 23:05:40,456 INFO L85 PathProgramCache]: Analyzing trace with hash 976385498, now seen corresponding path program 1 times [2021-10-30 23:05:40,456 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-30 23:05:40,456 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223220772] [2021-10-30 23:05:40,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-30 23:05:40,457 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-30 23:05:40,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-30 23:05:40,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-30 23:05:40,836 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-30 23:05:40,836 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223220772] [2021-10-30 23:05:40,836 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223220772] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-30 23:05:40,836 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-30 23:05:40,836 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-30 23:05:40,836 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543455772] [2021-10-30 23:05:40,836 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-30 23:05:40,836 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-30 23:05:40,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-30 23:05:40,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-10-30 23:05:40,837 INFO L87 Difference]: Start difference. First operand 88 states and 102 transitions. Second operand has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 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-10-30 23:05:45,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-30 23:05:45,681 INFO L93 Difference]: Finished difference Result 184 states and 214 transitions. [2021-10-30 23:05:45,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-30 23:05:45,682 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 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 45 [2021-10-30 23:05:45,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-30 23:05:45,683 INFO L225 Difference]: With dead ends: 184 [2021-10-30 23:05:45,683 INFO L226 Difference]: Without dead ends: 134 [2021-10-30 23:05:45,683 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2021-10-30 23:05:45,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2021-10-30 23:05:45,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 109. [2021-10-30 23:05:45,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 106 states have (on average 1.2075471698113207) internal successors, (128), 108 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-10-30 23:05:45,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 128 transitions. [2021-10-30 23:05:45,690 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 128 transitions. Word has length 45 [2021-10-30 23:05:45,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-30 23:05:45,690 INFO L470 AbstractCegarLoop]: Abstraction has 109 states and 128 transitions. [2021-10-30 23:05:45,690 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 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-10-30 23:05:45,690 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 128 transitions. [2021-10-30 23:05:45,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-10-30 23:05:45,691 INFO L505 BasicCegarLoop]: Found error trace [2021-10-30 23:05:45,691 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] [2021-10-30 23:05:45,692 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-30 23:05:45,692 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-30 23:05:45,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-30 23:05:45,692 INFO L85 PathProgramCache]: Analyzing trace with hash -829052836, now seen corresponding path program 1 times [2021-10-30 23:05:45,692 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-30 23:05:45,692 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026885606] [2021-10-30 23:05:45,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-30 23:05:45,693 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-30 23:05:45,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-30 23:05:45,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-30 23:05:45,890 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-30 23:05:45,890 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026885606] [2021-10-30 23:05:45,890 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026885606] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-30 23:05:45,890 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-30 23:05:45,891 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-30 23:05:45,891 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497537198] [2021-10-30 23:05:45,891 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-30 23:05:45,891 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-30 23:05:45,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-30 23:05:45,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-30 23:05:45,892 INFO L87 Difference]: Start difference. First operand 109 states and 128 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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-10-30 23:05:45,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-30 23:05:45,966 INFO L93 Difference]: Finished difference Result 181 states and 213 transitions. [2021-10-30 23:05:45,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-30 23:05:45,967 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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 45 [2021-10-30 23:05:45,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-30 23:05:45,967 INFO L225 Difference]: With dead ends: 181 [2021-10-30 23:05:45,967 INFO L226 Difference]: Without dead ends: 107 [2021-10-30 23:05:45,968 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-10-30 23:05:45,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2021-10-30 23:05:45,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2021-10-30 23:05:45,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 104 states have (on average 1.1730769230769231) internal successors, (122), 106 states have internal predecessors, (122), 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-10-30 23:05:45,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 122 transitions. [2021-10-30 23:05:45,973 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 122 transitions. Word has length 45 [2021-10-30 23:05:45,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-30 23:05:45,973 INFO L470 AbstractCegarLoop]: Abstraction has 107 states and 122 transitions. [2021-10-30 23:05:45,973 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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-10-30 23:05:45,973 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 122 transitions. [2021-10-30 23:05:45,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-10-30 23:05:45,974 INFO L505 BasicCegarLoop]: Found error trace [2021-10-30 23:05:45,974 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] [2021-10-30 23:05:45,974 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-30 23:05:45,975 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-30 23:05:45,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-30 23:05:45,976 INFO L85 PathProgramCache]: Analyzing trace with hash 99946677, now seen corresponding path program 1 times [2021-10-30 23:05:45,976 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-30 23:05:45,976 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770120804] [2021-10-30 23:05:45,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-30 23:05:45,976 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-30 23:05:46,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-30 23:05:46,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-30 23:05:46,227 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-30 23:05:46,228 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770120804] [2021-10-30 23:05:46,228 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770120804] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-30 23:05:46,228 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-30 23:05:46,228 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-30 23:05:46,228 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978113863] [2021-10-30 23:05:46,228 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-30 23:05:46,228 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-30 23:05:46,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-30 23:05:46,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-30 23:05:46,229 INFO L87 Difference]: Start difference. First operand 107 states and 122 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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-10-30 23:05:50,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-30 23:05:50,902 INFO L93 Difference]: Finished difference Result 178 states and 203 transitions. [2021-10-30 23:05:50,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-30 23:05:50,902 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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 47 [2021-10-30 23:05:50,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-30 23:05:50,903 INFO L225 Difference]: With dead ends: 178 [2021-10-30 23:05:50,903 INFO L226 Difference]: Without dead ends: 108 [2021-10-30 23:05:50,904 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-10-30 23:05:50,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2021-10-30 23:05:50,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2021-10-30 23:05:50,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 104 states have (on average 1.1538461538461537) internal successors, (120), 106 states have internal predecessors, (120), 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-10-30 23:05:50,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 120 transitions. [2021-10-30 23:05:50,910 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 120 transitions. Word has length 47 [2021-10-30 23:05:50,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-30 23:05:50,910 INFO L470 AbstractCegarLoop]: Abstraction has 107 states and 120 transitions. [2021-10-30 23:05:50,911 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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-10-30 23:05:50,911 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 120 transitions. [2021-10-30 23:05:50,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-10-30 23:05:50,911 INFO L505 BasicCegarLoop]: Found error trace [2021-10-30 23:05:50,912 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] [2021-10-30 23:05:50,912 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-30 23:05:50,912 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-30 23:05:50,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-30 23:05:50,912 INFO L85 PathProgramCache]: Analyzing trace with hash -416077786, now seen corresponding path program 1 times [2021-10-30 23:05:50,912 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-30 23:05:50,913 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427908778] [2021-10-30 23:05:50,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-30 23:05:50,913 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-30 23:05:51,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-30 23:05:51,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-30 23:05:51,539 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-30 23:05:51,539 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427908778] [2021-10-30 23:05:51,539 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427908778] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-30 23:05:51,539 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-30 23:05:51,539 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-30 23:05:51,540 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005423591] [2021-10-30 23:05:51,540 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-30 23:05:51,540 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-30 23:05:51,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-30 23:05:51,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-30 23:05:51,540 INFO L87 Difference]: Start difference. First operand 107 states and 120 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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-10-30 23:05:51,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-30 23:05:51,669 INFO L93 Difference]: Finished difference Result 193 states and 215 transitions. [2021-10-30 23:05:51,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-30 23:05:51,669 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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 48 [2021-10-30 23:05:51,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-30 23:05:51,670 INFO L225 Difference]: With dead ends: 193 [2021-10-30 23:05:51,670 INFO L226 Difference]: Without dead ends: 107 [2021-10-30 23:05:51,670 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-10-30 23:05:51,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2021-10-30 23:05:51,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 104. [2021-10-30 23:05:51,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 101 states have (on average 1.108910891089109) internal successors, (112), 103 states have internal predecessors, (112), 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-10-30 23:05:51,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 112 transitions. [2021-10-30 23:05:51,682 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 112 transitions. Word has length 48 [2021-10-30 23:05:51,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-30 23:05:51,682 INFO L470 AbstractCegarLoop]: Abstraction has 104 states and 112 transitions. [2021-10-30 23:05:51,682 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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-10-30 23:05:51,682 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 112 transitions. [2021-10-30 23:05:51,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-10-30 23:05:51,685 INFO L505 BasicCegarLoop]: Found error trace [2021-10-30 23:05:51,685 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] [2021-10-30 23:05:51,685 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-30 23:05:51,685 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-30 23:05:51,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-30 23:05:51,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1407256250, now seen corresponding path program 1 times [2021-10-30 23:05:51,686 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-30 23:05:51,686 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459991078] [2021-10-30 23:05:51,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-30 23:05:51,686 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-30 23:05:51,749 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-10-30 23:05:51,749 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1848953413] [2021-10-30 23:05:51,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-30 23:05:51,750 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-30 23:05:51,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-10-30 23:05:51,751 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-30 23:05:51,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-10-30 23:05:52,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-30 23:05:52,416 INFO L263 TraceCheckSpWp]: Trace formula consists of 2667 conjuncts, 89 conjunts are in the unsatisfiable core [2021-10-30 23:05:52,430 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-30 23:05:53,784 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-10-30 23:05:53,801 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 29 [2021-10-30 23:05:53,812 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 26 treesize of output 22 [2021-10-30 23:05:54,116 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 15 treesize of output 7 [2021-10-30 23:05:54,207 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 13 treesize of output 5 [2021-10-30 23:05:54,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-30 23:05:54,741 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-30 23:05:54,741 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459991078] [2021-10-30 23:05:54,741 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-10-30 23:05:54,741 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1848953413] [2021-10-30 23:05:54,741 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1848953413] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-30 23:05:54,741 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-30 23:05:54,741 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-10-30 23:05:54,741 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807011199] [2021-10-30 23:05:54,742 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-10-30 23:05:54,742 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-30 23:05:54,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-10-30 23:05:54,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2021-10-30 23:05:54,743 INFO L87 Difference]: Start difference. First operand 104 states and 112 transitions. Second operand has 16 states, 16 states have (on average 3.375) internal successors, (54), 16 states have internal predecessors, (54), 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-10-30 23:06:18,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-30 23:06:18,725 INFO L93 Difference]: Finished difference Result 104 states and 112 transitions. [2021-10-30 23:06:18,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-10-30 23:06:18,726 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.375) internal successors, (54), 16 states have internal predecessors, (54), 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 54 [2021-10-30 23:06:18,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-30 23:06:18,726 INFO L225 Difference]: With dead ends: 104 [2021-10-30 23:06:18,726 INFO L226 Difference]: Without dead ends: 0 [2021-10-30 23:06:18,727 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=260, Invalid=670, Unknown=0, NotChecked=0, Total=930 [2021-10-30 23:06:18,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-10-30 23:06:18,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-10-30 23:06:18,727 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-10-30 23:06:18,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-10-30 23:06:18,727 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 54 [2021-10-30 23:06:18,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-30 23:06:18,728 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-30 23:06:18,728 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.375) internal successors, (54), 16 states have internal predecessors, (54), 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-10-30 23:06:18,728 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-10-30 23:06:18,728 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-10-30 23:06:18,730 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-30 23:06:18,730 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION [2021-10-30 23:06:18,730 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION [2021-10-30 23:06:18,751 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-10-30 23:06:18,930 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2021-10-30 23:06:18,933 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-10-30 23:06:18,936 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:06:18,937 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:06:18,938 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:06:18,951 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:06:18,951 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:06:18,952 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:06:18,952 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:06:18,953 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:06:18,953 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:06:18,954 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:06:18,954 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:06:18,955 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:06:18,955 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:06:18,959 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:06:18,959 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:06:18,960 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:06:18,967 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:06:18,968 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:06:18,969 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:06:18,969 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:06:18,970 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:06:18,970 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:06:18,971 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:06:18,972 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:06:18,975 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:06:18,976 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:06:18,977 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:06:18,977 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:06:18,979 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:06:18,979 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:06:20,349 INFO L853 garLoopResultBuilder]: At program point L10044(lines 9999 10046) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_hash_table_get_entry_count_harness_~#table~0.base|) |ULTIMATE.start_aws_hash_table_get_entry_count_harness_~#table~0.offset|))) (and |ULTIMATE.start_aws_hash_table_is_valid_#t~short1478| (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_get_entry_count_harness_~#table~0.base|) (= ULTIMATE.start_assume_abort_if_not_~cond 1) (= |ULTIMATE.start_bounded_malloc_#res.offset| 0) (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (< (+ .cse0 1) |ULTIMATE.start_aws_hash_table_get_entry_count_harness_~#table~0.base|) (= |ULTIMATE.start_aws_hash_table_get_entry_count_harness_~#table~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (= .cse0 ULTIMATE.start_hash_table_state_is_valid_~map.base) (= ULTIMATE.start_hash_table_state_is_valid_~map.offset 0) (= |ULTIMATE.start_hash_table_state_is_valid_#res| 0) (= |ULTIMATE.start_aws_hash_table_get_entry_count_harness_~#table~0.offset| 0) (= ULTIMATE.start_hash_table_state_is_valid_~size_at_least_two~0 0) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 1) 0) (not (= |ULTIMATE.start_aws_hash_table_get_entry_count_harness_~#table~0.base| 0)) (< (+ |ULTIMATE.start_bounded_malloc_#res.base| 1) |ULTIMATE.start_aws_hash_table_get_entry_count_harness_~#table~0.base|) (not (= ULTIMATE.start_hash_table_state_is_valid_~map.base 0)) (<= (+ (select (select |#memory_int| .cse0) 40) 1) 0) (= ULTIMATE.start_aws_hash_table_is_valid_~map.offset |ULTIMATE.start_aws_hash_table_get_entry_count_harness_~#table~0.offset|) (= ULTIMATE.start_aws_hash_table_is_valid_~map.base |ULTIMATE.start_aws_hash_table_get_entry_count_harness_~#table~0.base|) (= ULTIMATE.start_ensure_allocated_hash_table_~map.base |ULTIMATE.start_aws_hash_table_get_entry_count_harness_~#table~0.base|) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 1) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_hash_table_get_entry_count_harness_~#table~0.base|) |ULTIMATE.start_aws_hash_table_get_entry_count_harness_~#table~0.offset|) 0) (= |ULTIMATE.start_hash_table_state_required_bytes_#res| 0))) [2021-10-30 23:06:20,350 INFO L853 garLoopResultBuilder]: At program point L10044-1(lines 9999 10046) the Hoare annotation is: false [2021-10-30 23:06:20,350 INFO L853 garLoopResultBuilder]: At program point L250(lines 248 251) the Hoare annotation is: (and (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_get_entry_count_harness_~#table~0.base|) (= |ULTIMATE.start_aws_hash_table_get_entry_count_harness_~#table~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (= |ULTIMATE.start_aws_hash_table_get_entry_count_harness_~#table~0.offset| 0) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 1) 0) (not (= |ULTIMATE.start_aws_hash_table_get_entry_count_harness_~#table~0.base| 0)) (= ULTIMATE.start_ensure_allocated_hash_table_~map.base |ULTIMATE.start_aws_hash_table_get_entry_count_harness_~#table~0.base|) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 1) 0)) [2021-10-30 23:06:20,350 INFO L853 garLoopResultBuilder]: At program point L250-1(lines 248 251) the Hoare annotation is: false [2021-10-30 23:06:20,350 INFO L857 garLoopResultBuilder]: For program point L7385-3(lines 7385 7387) no Hoare annotation was computed. [2021-10-30 23:06:20,350 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-10-30 23:06:20,350 INFO L857 garLoopResultBuilder]: For program point L7385-2(lines 7385 7387) no Hoare annotation was computed. [2021-10-30 23:06:20,350 INFO L857 garLoopResultBuilder]: For program point L7385-1(lines 7385 7387) no Hoare annotation was computed. [2021-10-30 23:06:20,350 INFO L857 garLoopResultBuilder]: For program point L7385(lines 7385 7387) no Hoare annotation was computed. [2021-10-30 23:06:20,350 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-10-30 23:06:20,350 INFO L853 garLoopResultBuilder]: At program point L2630(lines 2626 2631) the Hoare annotation is: (and (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_get_entry_count_harness_~#table~0.base|) (= ULTIMATE.start_assume_abort_if_not_~cond 1) (= |ULTIMATE.start_aws_hash_table_get_entry_count_harness_~#table~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (= |ULTIMATE.start_aws_hash_table_get_entry_count_harness_~#table~0.offset| 0) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 1) 0) (not (= |ULTIMATE.start_aws_hash_table_get_entry_count_harness_~#table~0.base| 0)) (= ULTIMATE.start_ensure_allocated_hash_table_~map.base |ULTIMATE.start_aws_hash_table_get_entry_count_harness_~#table~0.base|) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 1) 0)) [2021-10-30 23:06:20,351 INFO L853 garLoopResultBuilder]: At program point L2630-2(lines 2626 2631) the Hoare annotation is: false [2021-10-30 23:06:20,351 INFO L853 garLoopResultBuilder]: At program point L2630-1(lines 2626 2631) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_hash_table_get_entry_count_harness_~#table~0.base|) |ULTIMATE.start_aws_hash_table_get_entry_count_harness_~#table~0.offset|))) (and |ULTIMATE.start_aws_hash_table_is_valid_#t~short1478| (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_get_entry_count_harness_~#table~0.base|) (= ULTIMATE.start_assume_abort_if_not_~cond 1) (= |ULTIMATE.start_bounded_malloc_#res.offset| 0) (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (< (+ .cse0 1) |ULTIMATE.start_aws_hash_table_get_entry_count_harness_~#table~0.base|) (= |ULTIMATE.start_aws_hash_table_get_entry_count_harness_~#table~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (= .cse0 ULTIMATE.start_hash_table_state_is_valid_~map.base) (= ULTIMATE.start_hash_table_state_is_valid_~map.offset 0) (= |ULTIMATE.start_aws_hash_table_get_entry_count_harness_~#table~0.offset| 0) (= ULTIMATE.start_hash_table_state_is_valid_~size_at_least_two~0 0) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 1) 0) (not (= |ULTIMATE.start_aws_hash_table_get_entry_count_harness_~#table~0.base| 0)) (< (+ |ULTIMATE.start_bounded_malloc_#res.base| 1) |ULTIMATE.start_aws_hash_table_get_entry_count_harness_~#table~0.base|) (not (= ULTIMATE.start_hash_table_state_is_valid_~map.base 0)) (<= (+ (select (select |#memory_int| .cse0) 40) 1) 0) (= ULTIMATE.start_aws_hash_table_is_valid_~map.offset |ULTIMATE.start_aws_hash_table_get_entry_count_harness_~#table~0.offset|) (= ULTIMATE.start_aws_hash_table_is_valid_~map.base |ULTIMATE.start_aws_hash_table_get_entry_count_harness_~#table~0.base|) (= ULTIMATE.start_ensure_allocated_hash_table_~map.base |ULTIMATE.start_aws_hash_table_get_entry_count_harness_~#table~0.base|) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 1) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_hash_table_get_entry_count_harness_~#table~0.base|) |ULTIMATE.start_aws_hash_table_get_entry_count_harness_~#table~0.offset|) 0) (= |ULTIMATE.start_hash_table_state_required_bytes_#res| 0))) [2021-10-30 23:06:20,351 INFO L857 garLoopResultBuilder]: For program point L2498(lines 2498 2499) no Hoare annotation was computed. [2021-10-30 23:06:20,351 INFO L857 garLoopResultBuilder]: For program point L2498-1(lines 2498 2499) no Hoare annotation was computed. [2021-10-30 23:06:20,351 INFO L853 garLoopResultBuilder]: At program point L10112(lines 10101 10113) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_aws_hash_table_get_entry_count_harness_~#table~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset)) (.cse1 (not (= |ULTIMATE.start_aws_hash_table_get_entry_count_harness_~#table~0.base| 0))) (.cse2 (= ULTIMATE.start_ensure_allocated_hash_table_~map.base |ULTIMATE.start_aws_hash_table_get_entry_count_harness_~#table~0.base|))) (or (and (<= (+ |ULTIMATE.start_hash_table_state_required_bytes_#res| 1) 0) .cse0 .cse1 .cse2) (and (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_get_entry_count_harness_~#table~0.base|) .cse0 (= |ULTIMATE.start_aws_hash_table_get_entry_count_harness_~#table~0.offset| 0) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 1) 0) .cse1 .cse2 (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 1) 0) (= |ULTIMATE.start_hash_table_state_required_bytes_#res| 0)))) [2021-10-30 23:06:20,351 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_hash_table_state_required_bytes_#res| 1) 0) (= |ULTIMATE.start_aws_hash_table_get_entry_count_harness_~#table~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (not (= |ULTIMATE.start_aws_hash_table_get_entry_count_harness_~#table~0.base| 0)) (= ULTIMATE.start_ensure_allocated_hash_table_~map.base |ULTIMATE.start_aws_hash_table_get_entry_count_harness_~#table~0.base|)) [2021-10-30 23:06:20,351 INFO L857 garLoopResultBuilder]: For program point L6809(lines 6809 6819) no Hoare annotation was computed. [2021-10-30 23:06:20,351 INFO L857 garLoopResultBuilder]: For program point L10114(lines 10114 10133) no Hoare annotation was computed. [2021-10-30 23:06:20,351 INFO L857 garLoopResultBuilder]: For program point L7274(lines 7274 7278) no Hoare annotation was computed. [2021-10-30 23:06:20,351 INFO L853 garLoopResultBuilder]: At program point L2501-1(lines 2497 2502) the Hoare annotation is: false [2021-10-30 23:06:20,351 INFO L853 garLoopResultBuilder]: At program point L2501(lines 2497 2502) the Hoare annotation is: (and (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_get_entry_count_harness_~#table~0.base|) (= |ULTIMATE.start_aws_hash_table_get_entry_count_harness_~#table~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (= |ULTIMATE.start_aws_hash_table_get_entry_count_harness_~#table~0.offset| 0) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 1) 0) (not (= |ULTIMATE.start_aws_hash_table_get_entry_count_harness_~#table~0.base| 0)) (= ULTIMATE.start_ensure_allocated_hash_table_~map.base |ULTIMATE.start_aws_hash_table_get_entry_count_harness_~#table~0.base|) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 1) 0)) [2021-10-30 23:06:20,351 INFO L853 garLoopResultBuilder]: At program point L255(lines 253 256) the Hoare annotation is: (and (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_get_entry_count_harness_~#table~0.base|) (= |ULTIMATE.start_aws_hash_table_get_entry_count_harness_~#table~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (= |ULTIMATE.start_aws_hash_table_get_entry_count_harness_~#table~0.offset| 0) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 1) 0) (not (= |ULTIMATE.start_aws_hash_table_get_entry_count_harness_~#table~0.base| 0)) (= ULTIMATE.start_ensure_allocated_hash_table_~map.base |ULTIMATE.start_aws_hash_table_get_entry_count_harness_~#table~0.base|) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 1) 0)) [2021-10-30 23:06:20,352 INFO L853 garLoopResultBuilder]: At program point L255-1(lines 253 256) the Hoare annotation is: false [2021-10-30 23:06:20,352 INFO L857 garLoopResultBuilder]: For program point L222(lines 222 224) no Hoare annotation was computed. [2021-10-30 23:06:20,352 INFO L857 garLoopResultBuilder]: For program point L222-1(lines 222 224) no Hoare annotation was computed. [2021-10-30 23:06:20,352 INFO L857 garLoopResultBuilder]: For program point L222-2(lines 222 224) no Hoare annotation was computed. [2021-10-30 23:06:20,352 INFO L853 garLoopResultBuilder]: At program point L2617-1(lines 2613 2621) the Hoare annotation is: false [2021-10-30 23:06:20,352 INFO L853 garLoopResultBuilder]: At program point L2617(lines 2613 2621) the Hoare annotation is: (and (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_get_entry_count_harness_~#table~0.base|) (= |ULTIMATE.start_aws_hash_table_get_entry_count_harness_~#table~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (= |ULTIMATE.start_aws_hash_table_get_entry_count_harness_~#table~0.offset| 0) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 1) 0) (not (= |ULTIMATE.start_aws_hash_table_get_entry_count_harness_~#table~0.base| 0)) (= ULTIMATE.start_ensure_allocated_hash_table_~map.base |ULTIMATE.start_aws_hash_table_get_entry_count_harness_~#table~0.base|) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 1) 0)) [2021-10-30 23:06:20,352 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-10-30 23:06:20,352 INFO L857 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2021-10-30 23:06:20,352 INFO L857 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2021-10-30 23:06:20,352 INFO L857 garLoopResultBuilder]: For program point L223-3(line 223) no Hoare annotation was computed. [2021-10-30 23:06:20,352 INFO L857 garLoopResultBuilder]: For program point L223-4(line 223) no Hoare annotation was computed. [2021-10-30 23:06:20,352 INFO L857 garLoopResultBuilder]: For program point L223-6(line 223) no Hoare annotation was computed. [2021-10-30 23:06:20,352 INFO L857 garLoopResultBuilder]: For program point L223-7(line 223) no Hoare annotation was computed. [2021-10-30 23:06:20,353 INFO L857 garLoopResultBuilder]: For program point L10001(lines 10001 10005) no Hoare annotation was computed. [2021-10-30 23:06:20,353 INFO L857 garLoopResultBuilder]: For program point L10001-1(lines 10001 10005) no Hoare annotation was computed. [2021-10-30 23:06:20,353 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-10-30 23:06:20,353 INFO L860 garLoopResultBuilder]: At program point L10134(line 10134) the Hoare annotation is: true [2021-10-30 23:06:20,353 INFO L853 garLoopResultBuilder]: At program point L6947(lines 6943 6948) the Hoare annotation is: (and (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_get_entry_count_harness_~#table~0.base|) (= ULTIMATE.start_assume_abort_if_not_~cond 1) (= |ULTIMATE.start_bounded_malloc_#res.offset| 0) (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (= |ULTIMATE.start_aws_hash_table_get_entry_count_harness_~#table~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (= |ULTIMATE.start_aws_hash_table_get_entry_count_harness_~#table~0.offset| 0) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 1) 0) (not (= |ULTIMATE.start_aws_hash_table_get_entry_count_harness_~#table~0.base| 0)) (< (+ |ULTIMATE.start_bounded_malloc_#res.base| 1) |ULTIMATE.start_aws_hash_table_get_entry_count_harness_~#table~0.base|) (= ULTIMATE.start_ensure_allocated_hash_table_~map.base |ULTIMATE.start_aws_hash_table_get_entry_count_harness_~#table~0.base|) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 1) 0) (= |ULTIMATE.start_hash_table_state_required_bytes_#res| 0)) [2021-10-30 23:06:20,353 INFO L857 garLoopResultBuilder]: For program point L7195(lines 7195 7201) no Hoare annotation was computed. [2021-10-30 23:06:20,353 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-10-30 23:06:20,353 INFO L857 garLoopResultBuilder]: For program point L7196(lines 7196 7200) no Hoare annotation was computed. [2021-10-30 23:06:20,353 INFO L857 garLoopResultBuilder]: For program point L210(lines 210 212) no Hoare annotation was computed. [2021-10-30 23:06:20,354 INFO L857 garLoopResultBuilder]: For program point L210-1(lines 210 212) no Hoare annotation was computed. [2021-10-30 23:06:20,354 INFO L857 garLoopResultBuilder]: For program point L210-2(lines 210 212) no Hoare annotation was computed. [2021-10-30 23:06:20,354 INFO L857 garLoopResultBuilder]: For program point L210-3(lines 210 212) no Hoare annotation was computed. [2021-10-30 23:06:20,354 INFO L857 garLoopResultBuilder]: For program point L210-4(lines 210 212) no Hoare annotation was computed. [2021-10-30 23:06:20,354 INFO L857 garLoopResultBuilder]: For program point L210-5(lines 210 212) no Hoare annotation was computed. [2021-10-30 23:06:20,354 INFO L857 garLoopResultBuilder]: For program point L210-6(lines 210 212) no Hoare annotation was computed. [2021-10-30 23:06:20,354 INFO L853 garLoopResultBuilder]: At program point L9146(lines 9144 9147) the Hoare annotation is: false [2021-10-30 23:06:20,354 INFO L857 garLoopResultBuilder]: For program point L10104(lines 10104 10106) no Hoare annotation was computed. [2021-10-30 23:06:20,354 INFO L857 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2021-10-30 23:06:20,355 INFO L857 garLoopResultBuilder]: For program point L10104-1(lines 10104 10106) no Hoare annotation was computed. [2021-10-30 23:06:20,355 INFO L857 garLoopResultBuilder]: For program point L211-2(line 211) no Hoare annotation was computed. [2021-10-30 23:06:20,355 INFO L857 garLoopResultBuilder]: For program point L211-4(line 211) no Hoare annotation was computed. [2021-10-30 23:06:20,355 INFO L857 garLoopResultBuilder]: For program point L211-6(line 211) no Hoare annotation was computed. [2021-10-30 23:06:20,355 INFO L857 garLoopResultBuilder]: For program point L211-8(line 211) no Hoare annotation was computed. [2021-10-30 23:06:20,355 INFO L857 garLoopResultBuilder]: For program point L211-10(line 211) no Hoare annotation was computed. [2021-10-30 23:06:20,355 INFO L857 garLoopResultBuilder]: For program point L211-12(line 211) no Hoare annotation was computed. [2021-10-30 23:06:20,355 INFO L853 garLoopResultBuilder]: At program point L2590(lines 2586 2594) the Hoare annotation is: (and (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_get_entry_count_harness_~#table~0.base|) (= |ULTIMATE.start_aws_hash_table_get_entry_count_harness_~#table~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (= |ULTIMATE.start_aws_hash_table_get_entry_count_harness_~#table~0.offset| 0) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 1) 0) (not (= |ULTIMATE.start_aws_hash_table_get_entry_count_harness_~#table~0.base| 0)) (= ULTIMATE.start_ensure_allocated_hash_table_~map.base |ULTIMATE.start_aws_hash_table_get_entry_count_harness_~#table~0.base|) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 1) 0)) [2021-10-30 23:06:20,355 INFO L853 garLoopResultBuilder]: At program point L2590-1(lines 2586 2594) the Hoare annotation is: false [2021-10-30 23:06:20,355 INFO L857 garLoopResultBuilder]: For program point L9990-2(line 9990) no Hoare annotation was computed. [2021-10-30 23:06:20,356 INFO L857 garLoopResultBuilder]: For program point L9990-3(line 9990) no Hoare annotation was computed. [2021-10-30 23:06:20,356 INFO L857 garLoopResultBuilder]: For program point L9990(line 9990) no Hoare annotation was computed. [2021-10-30 23:06:20,356 INFO L857 garLoopResultBuilder]: For program point L9990-9(line 9990) no Hoare annotation was computed. [2021-10-30 23:06:20,356 INFO L857 garLoopResultBuilder]: For program point L9990-10(line 9990) no Hoare annotation was computed. [2021-10-30 23:06:20,356 INFO L857 garLoopResultBuilder]: For program point L9990-12(line 9990) no Hoare annotation was computed. [2021-10-30 23:06:20,356 INFO L857 garLoopResultBuilder]: For program point L9990-5(line 9990) no Hoare annotation was computed. [2021-10-30 23:06:20,356 INFO L853 garLoopResultBuilder]: At program point L9990-6(lines 9988 9991) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_hash_table_get_entry_count_harness_~#table~0.base|) |ULTIMATE.start_aws_hash_table_get_entry_count_harness_~#table~0.offset|))) (and (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_get_entry_count_harness_~#table~0.base|) (= ULTIMATE.start_assume_abort_if_not_~cond 1) (= |ULTIMATE.start_bounded_malloc_#res.offset| 0) (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (< (+ .cse0 1) |ULTIMATE.start_aws_hash_table_get_entry_count_harness_~#table~0.base|) (= |ULTIMATE.start_aws_hash_table_is_valid_#res| 0) (= |ULTIMATE.start_aws_hash_table_get_entry_count_harness_~#table~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (= .cse0 ULTIMATE.start_hash_table_state_is_valid_~map.base) (= ULTIMATE.start_hash_table_state_is_valid_~map.offset 0) (= |ULTIMATE.start_hash_table_state_is_valid_#res| 0) (= |ULTIMATE.start_aws_hash_table_get_entry_count_harness_~#table~0.offset| 0) (= ULTIMATE.start_hash_table_state_is_valid_~size_at_least_two~0 0) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 1) 0) (not (= |ULTIMATE.start_aws_hash_table_get_entry_count_harness_~#table~0.base| 0)) (< (+ |ULTIMATE.start_bounded_malloc_#res.base| 1) |ULTIMATE.start_aws_hash_table_get_entry_count_harness_~#table~0.base|) (not (= ULTIMATE.start_hash_table_state_is_valid_~map.base 0)) (<= (+ (select (select |#memory_int| .cse0) 40) 1) 0) (= ULTIMATE.start_aws_hash_table_is_valid_~map.offset |ULTIMATE.start_aws_hash_table_get_entry_count_harness_~#table~0.offset|) (= ULTIMATE.start_aws_hash_table_is_valid_~map.base |ULTIMATE.start_aws_hash_table_get_entry_count_harness_~#table~0.base|) (= ULTIMATE.start_ensure_allocated_hash_table_~map.base |ULTIMATE.start_aws_hash_table_get_entry_count_harness_~#table~0.base|) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 1) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_hash_table_get_entry_count_harness_~#table~0.base|) |ULTIMATE.start_aws_hash_table_get_entry_count_harness_~#table~0.offset|) 0) (= |ULTIMATE.start_hash_table_state_required_bytes_#res| 0))) [2021-10-30 23:06:20,356 INFO L857 garLoopResultBuilder]: For program point L9990-7(line 9990) no Hoare annotation was computed. [2021-10-30 23:06:20,356 INFO L853 garLoopResultBuilder]: At program point L9990-13(lines 9988 9991) the Hoare annotation is: false [2021-10-30 23:06:20,356 INFO L857 garLoopResultBuilder]: For program point L2542(lines 2542 2543) no Hoare annotation was computed. [2021-10-30 23:06:20,356 INFO L857 garLoopResultBuilder]: For program point L2542-1(lines 2542 2543) no Hoare annotation was computed. [2021-10-30 23:06:20,356 INFO L853 garLoopResultBuilder]: At program point L263(line 263) the Hoare annotation is: false [2021-10-30 23:06:20,357 INFO L857 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-10-30 23:06:20,357 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-10-30 23:06:20,357 INFO L853 garLoopResultBuilder]: At program point L1998(lines 1988 1999) the Hoare annotation is: (and (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_get_entry_count_harness_~#table~0.base|) (= |ULTIMATE.start_aws_hash_table_get_entry_count_harness_~#table~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (= |ULTIMATE.start_aws_hash_table_get_entry_count_harness_~#table~0.offset| 0) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 1) 0) (not (= |ULTIMATE.start_aws_hash_table_get_entry_count_harness_~#table~0.base| 0)) (= ULTIMATE.start_ensure_allocated_hash_table_~map.base |ULTIMATE.start_aws_hash_table_get_entry_count_harness_~#table~0.base|) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 1) 0)) [2021-10-30 23:06:20,357 INFO L853 garLoopResultBuilder]: At program point L1998-1(lines 1988 1999) the Hoare annotation is: (and (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_get_entry_count_harness_~#table~0.base|) (= |ULTIMATE.start_aws_hash_table_get_entry_count_harness_~#table~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (= |ULTIMATE.start_aws_hash_table_get_entry_count_harness_~#table~0.offset| 0) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 1) 0) (not (= |ULTIMATE.start_aws_hash_table_get_entry_count_harness_~#table~0.base| 0)) (= ULTIMATE.start_ensure_allocated_hash_table_~map.base |ULTIMATE.start_aws_hash_table_get_entry_count_harness_~#table~0.base|) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 1) 0)) [2021-10-30 23:06:20,357 INFO L853 garLoopResultBuilder]: At program point L1998-2(lines 1988 1999) the Hoare annotation is: false [2021-10-30 23:06:20,357 INFO L853 garLoopResultBuilder]: At program point L1998-3(lines 1988 1999) the Hoare annotation is: false [2021-10-30 23:06:20,357 INFO L857 garLoopResultBuilder]: For program point L7267(lines 7267 7272) no Hoare annotation was computed. [2021-10-30 23:06:20,357 INFO L857 garLoopResultBuilder]: For program point L10108(lines 10108 10110) no Hoare annotation was computed. [2021-10-30 23:06:20,357 INFO L857 garLoopResultBuilder]: For program point L10108-1(lines 10108 10110) no Hoare annotation was computed. [2021-10-30 23:06:20,357 INFO L853 garLoopResultBuilder]: At program point L2545-1(lines 2541 2546) the Hoare annotation is: false [2021-10-30 23:06:20,358 INFO L853 garLoopResultBuilder]: At program point L2545(lines 2541 2546) the Hoare annotation is: (and (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_get_entry_count_harness_~#table~0.base|) (= |ULTIMATE.start_aws_hash_table_get_entry_count_harness_~#table~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (= |ULTIMATE.start_aws_hash_table_get_entry_count_harness_~#table~0.offset| 0) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 1) 0) (not (= |ULTIMATE.start_aws_hash_table_get_entry_count_harness_~#table~0.base| 0)) (= ULTIMATE.start_ensure_allocated_hash_table_~map.base |ULTIMATE.start_aws_hash_table_get_entry_count_harness_~#table~0.base|) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 1) 0)) [2021-10-30 23:06:20,358 INFO L853 garLoopResultBuilder]: At program point L266(line 266) the Hoare annotation is: (and (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_get_entry_count_harness_~#table~0.base|) (= |ULTIMATE.start_aws_hash_table_get_entry_count_harness_~#table~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (= |ULTIMATE.start_aws_hash_table_get_entry_count_harness_~#table~0.offset| 0) (not (= |ULTIMATE.start_aws_hash_table_get_entry_count_harness_~#table~0.base| 0)) (= ULTIMATE.start_ensure_allocated_hash_table_~map.base |ULTIMATE.start_aws_hash_table_get_entry_count_harness_~#table~0.base|) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 1) 0)) [2021-10-30 23:06:20,360 INFO L731 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2021-10-30 23:06:20,360 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-30 23:06:20,372 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-30 23:06:20,372 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-30 23:06:20,373 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-30 23:06:20,373 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-30 23:06:20,374 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-30 23:06:20,374 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-30 23:06:20,374 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-30 23:06:20,374 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-30 23:06:20,376 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-30 23:06:20,376 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-30 23:06:20,377 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-30 23:06:20,377 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-30 23:06:20,378 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-30 23:06:20,378 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-30 23:06:20,378 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-30 23:06:20,379 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-30 23:06:20,382 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-30 23:06:20,382 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-30 23:06:20,382 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-30 23:06:20,382 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-30 23:06:20,383 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-30 23:06:20,384 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-30 23:06:20,384 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-30 23:06:20,384 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-30 23:06:20,387 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.10 11:06:20 BoogieIcfgContainer [2021-10-30 23:06:20,387 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-30 23:06:20,388 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-30 23:06:20,388 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-30 23:06:20,388 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-30 23:06:20,389 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.10 11:05:38" (3/4) ... [2021-10-30 23:06:20,391 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-10-30 23:06:20,422 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 172 nodes and edges [2021-10-30 23:06:20,423 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 73 nodes and edges [2021-10-30 23:06:20,423 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 26 nodes and edges [2021-10-30 23:06:20,424 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2021-10-30 23:06:20,425 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2021-10-30 23:06:20,425 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2021-10-30 23:06:20,426 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-10-30 23:06:20,426 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-30 23:06:20,450 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\result + 1 <= 0 && table == map) && !(table == 0)) && map == table) || (((((((unknown-#StackHeapBarrier-unknown < table && table == map) && table == 0) && num_entries + 1 <= 0) && !(table == 0)) && map == table) && max_table_entries + 1 <= 0) && \result == 0) [2021-10-30 23:06:20,450 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((unknown-#StackHeapBarrier-unknown < table && cond == 1) && \result == 0) && !(\result == 0)) && table == map) && table == 0) && num_entries + 1 <= 0) && !(table == 0)) && \result + 1 < table) && map == table) && max_table_entries + 1 <= 0) && \result == 0 [2021-10-30 23:06:20,452 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((aux-map && map->p_impl && hash_table_state_is_valid(map->p_impl)-aux && unknown-#StackHeapBarrier-unknown < table) && cond == 1) && \result == 0) && !(\result == 0)) && #memory_$Pointer$[table][table] + 1 < table) && table == map) && #memory_$Pointer$[table][table] == map) && map == 0) && \result == 0) && table == 0) && size_at_least_two == 0) && num_entries + 1 <= 0) && !(table == 0)) && \result + 1 < table) && !(map == 0)) && unknown-#memory_int-unknown[#memory_$Pointer$[table][table]][40] + 1 <= 0) && map == table) && map == table) && map == table) && max_table_entries + 1 <= 0) && #memory_$Pointer$[table][table] == 0) && \result == 0 [2021-10-30 23:06:20,452 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((unknown-#StackHeapBarrier-unknown < table && cond == 1) && \result == 0) && !(\result == 0)) && #memory_$Pointer$[table][table] + 1 < table) && \result == 0) && table == map) && #memory_$Pointer$[table][table] == map) && map == 0) && \result == 0) && table == 0) && size_at_least_two == 0) && num_entries + 1 <= 0) && !(table == 0)) && \result + 1 < table) && !(map == 0)) && unknown-#memory_int-unknown[#memory_$Pointer$[table][table]][40] + 1 <= 0) && map == table) && map == table) && map == table) && max_table_entries + 1 <= 0) && #memory_$Pointer$[table][table] == 0) && \result == 0 [2021-10-30 23:06:20,452 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((aux-map && map->p_impl && hash_table_state_is_valid(map->p_impl)-aux && unknown-#StackHeapBarrier-unknown < table) && cond == 1) && \result == 0) && !(\result == 0)) && #memory_$Pointer$[table][table] + 1 < table) && table == map) && #memory_$Pointer$[table][table] == map) && map == 0) && table == 0) && size_at_least_two == 0) && num_entries + 1 <= 0) && !(table == 0)) && \result + 1 < table) && !(map == 0)) && unknown-#memory_int-unknown[#memory_$Pointer$[table][table]][40] + 1 <= 0) && map == table) && map == table) && map == table) && max_table_entries + 1 <= 0) && #memory_$Pointer$[table][table] == 0) && \result == 0 [2021-10-30 23:06:20,453 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((!(\result == 0) && (!(map == 0) || !(map == 0))) && \result + 1 <= 0) && table == map) && !(table == 0)) && map == table [2021-10-30 23:06:21,009 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-10-30 23:06:21,009 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-30 23:06:21,011 INFO L168 Benchmark]: Toolchain (without parser) took 51766.21 ms. Allocated memory was 115.3 MB in the beginning and 593.5 MB in the end (delta: 478.2 MB). Free memory was 73.7 MB in the beginning and 446.1 MB in the end (delta: -372.5 MB). Peak memory consumption was 387.9 MB. Max. memory is 16.1 GB. [2021-10-30 23:06:21,011 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 77.6 MB. Free memory was 35.4 MB in the beginning and 35.4 MB in the end (delta: 37.0 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-30 23:06:21,011 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1975.94 ms. Allocated memory was 115.3 MB in the beginning and 140.5 MB in the end (delta: 25.2 MB). Free memory was 73.5 MB in the beginning and 64.1 MB in the end (delta: 9.3 MB). Peak memory consumption was 78.0 MB. Max. memory is 16.1 GB. [2021-10-30 23:06:21,011 INFO L168 Benchmark]: Boogie Procedure Inliner took 170.05 ms. Allocated memory is still 140.5 MB. Free memory was 64.1 MB in the beginning and 52.3 MB in the end (delta: 11.8 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-10-30 23:06:21,012 INFO L168 Benchmark]: Boogie Preprocessor took 97.75 ms. Allocated memory was 140.5 MB in the beginning and 205.5 MB in the end (delta: 65.0 MB). Free memory was 51.6 MB in the beginning and 145.0 MB in the end (delta: -93.5 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-10-30 23:06:21,012 INFO L168 Benchmark]: RCFGBuilder took 6850.96 ms. Allocated memory was 205.5 MB in the beginning and 465.6 MB in the end (delta: 260.0 MB). Free memory was 145.0 MB in the beginning and 219.0 MB in the end (delta: -73.9 MB). Peak memory consumption was 278.5 MB. Max. memory is 16.1 GB. [2021-10-30 23:06:21,012 INFO L168 Benchmark]: TraceAbstraction took 42043.77 ms. Allocated memory was 465.6 MB in the beginning and 593.5 MB in the end (delta: 127.9 MB). Free memory was 217.9 MB in the beginning and 511.7 MB in the end (delta: -293.8 MB). Peak memory consumption was 167.6 MB. Max. memory is 16.1 GB. [2021-10-30 23:06:21,012 INFO L168 Benchmark]: Witness Printer took 621.69 ms. Allocated memory is still 593.5 MB. Free memory was 511.7 MB in the beginning and 446.1 MB in the end (delta: 65.5 MB). Peak memory consumption was 345.6 MB. Max. memory is 16.1 GB. [2021-10-30 23:06:21,014 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.13 ms. Allocated memory is still 77.6 MB. Free memory was 35.4 MB in the beginning and 35.4 MB in the end (delta: 37.0 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 1975.94 ms. Allocated memory was 115.3 MB in the beginning and 140.5 MB in the end (delta: 25.2 MB). Free memory was 73.5 MB in the beginning and 64.1 MB in the end (delta: 9.3 MB). Peak memory consumption was 78.0 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 170.05 ms. Allocated memory is still 140.5 MB. Free memory was 64.1 MB in the beginning and 52.3 MB in the end (delta: 11.8 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 97.75 ms. Allocated memory was 140.5 MB in the beginning and 205.5 MB in the end (delta: 65.0 MB). Free memory was 51.6 MB in the beginning and 145.0 MB in the end (delta: -93.5 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * RCFGBuilder took 6850.96 ms. Allocated memory was 205.5 MB in the beginning and 465.6 MB in the end (delta: 260.0 MB). Free memory was 145.0 MB in the beginning and 219.0 MB in the end (delta: -73.9 MB). Peak memory consumption was 278.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 42043.77 ms. Allocated memory was 465.6 MB in the beginning and 593.5 MB in the end (delta: 127.9 MB). Free memory was 217.9 MB in the beginning and 511.7 MB in the end (delta: -293.8 MB). Peak memory consumption was 167.6 MB. Max. memory is 16.1 GB. * Witness Printer took 621.69 ms. Allocated memory is still 593.5 MB. Free memory was 511.7 MB in the beginning and 446.1 MB in the end (delta: 65.5 MB). Peak memory consumption was 345.6 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$.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$.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$.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$.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$.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$.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 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 88 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 41.9s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 33.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.4s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 614 SDtfs, 661 SDslu, 1214 SDs, 0 SdLazy, 377 SolverSat, 58 SolverUnsat, 14 SolverUnknown, 0 SolverNotchecked, 29.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 144 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=109occurred in iteration=3, InterpolantAutomatonStates: 50, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 89 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 30 LocationsWithAnnotation, 30 PreInvPairs, 48 NumberOfFragments, 705 HoareAnnotationTreeSize, 30 FomulaSimplifications, 258 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 30 FomulaSimplificationsInter, 48 FormulaSimplificationTreeSizeReductionInter, 1.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 321 NumberOfCodeBlocks, 321 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 314 ConstructedInterpolants, 0 QuantifiedInterpolants, 1218 SizeOfPredicates, 49 NumberOfNonLiveVariables, 5142 ConjunctsInSsa, 96 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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 3 specifications checked. All of them hold - InvariantResult [Line: 9999]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2613]: Loop Invariant Derived loop invariant: (((((unknown-#StackHeapBarrier-unknown < table && table == map) && table == 0) && num_entries + 1 <= 0) && !(table == 0)) && map == table) && max_table_entries + 1 <= 0 - InvariantResult [Line: 2497]: Loop Invariant Derived loop invariant: (((((unknown-#StackHeapBarrier-unknown < table && table == map) && table == 0) && num_entries + 1 <= 0) && !(table == 0)) && map == table) && max_table_entries + 1 <= 0 - InvariantResult [Line: 253]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2586]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 266]: Loop Invariant Derived loop invariant: ((((unknown-#StackHeapBarrier-unknown < table && table == map) && table == 0) && !(table == 0)) && map == table) && max_table_entries + 1 <= 0 - InvariantResult [Line: 1988]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1988]: Loop Invariant Derived loop invariant: (((((unknown-#StackHeapBarrier-unknown < table && table == map) && table == 0) && num_entries + 1 <= 0) && !(table == 0)) && map == table) && max_table_entries + 1 <= 0 - InvariantResult [Line: 1988]: Loop Invariant Derived loop invariant: (((((unknown-#StackHeapBarrier-unknown < table && table == map) && table == 0) && num_entries + 1 <= 0) && !(table == 0)) && map == table) && max_table_entries + 1 <= 0 - InvariantResult [Line: 9988]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2626]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2626]: Loop Invariant [2021-10-30 23:06:21,023 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-30 23:06:21,025 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-30 23:06:21,025 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-30 23:06:21,025 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-30 23:06:21,027 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-30 23:06:21,027 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-30 23:06:21,027 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-30 23:06:21,028 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: ((((((((((((((((((((aux-map && map->p_impl && hash_table_state_is_valid(map->p_impl)-aux && unknown-#StackHeapBarrier-unknown < table) && cond == 1) && \result == 0) && !(\result == 0)) && #memory_$Pointer$[table][table] + 1 < table) && table == map) && #memory_$Pointer$[table][table] == map) && map == 0) && table == 0) && size_at_least_two == 0) && num_entries + 1 <= 0) && !(table == 0)) && \result + 1 < table) && !(map == 0)) && unknown-#memory_int-unknown[#memory_$Pointer$[table][table]][40] + 1 <= 0) && map == table) && map == table) && map == table) && max_table_entries + 1 <= 0) && #memory_$Pointer$[table][table] == 0) && \result == 0 - InvariantResult [Line: 9144]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1988]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 253]: Loop Invariant Derived loop invariant: (((((unknown-#StackHeapBarrier-unknown < table && table == map) && table == 0) && num_entries + 1 <= 0) && !(table == 0)) && map == table) && max_table_entries + 1 <= 0 - InvariantResult [Line: 9999]: Loop Invariant [2021-10-30 23:06:21,029 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-30 23:06:21,030 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-30 23:06:21,030 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-30 23:06:21,030 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-30 23:06:21,030 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-30 23:06:21,030 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-30 23:06:21,030 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-30 23:06:21,031 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((((((((((((((((aux-map && map->p_impl && hash_table_state_is_valid(map->p_impl)-aux && unknown-#StackHeapBarrier-unknown < table) && cond == 1) && \result == 0) && !(\result == 0)) && #memory_$Pointer$[table][table] + 1 < table) && table == map) && #memory_$Pointer$[table][table] == map) && map == 0) && \result == 0) && table == 0) && size_at_least_two == 0) && num_entries + 1 <= 0) && !(table == 0)) && \result + 1 < table) && !(map == 0)) && unknown-#memory_int-unknown[#memory_$Pointer$[table][table]][40] + 1 <= 0) && map == table) && map == table) && map == table) && max_table_entries + 1 <= 0) && #memory_$Pointer$[table][table] == 0) && \result == 0 - InvariantResult [Line: 10134]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2586]: Loop Invariant Derived loop invariant: (((((unknown-#StackHeapBarrier-unknown < table && table == map) && table == 0) && num_entries + 1 <= 0) && !(table == 0)) && map == table) && max_table_entries + 1 <= 0 - InvariantResult [Line: 248]: Loop Invariant Derived loop invariant: (((((unknown-#StackHeapBarrier-unknown < table && table == map) && table == 0) && num_entries + 1 <= 0) && !(table == 0)) && map == table) && max_table_entries + 1 <= 0 - InvariantResult [Line: 6943]: Loop Invariant Derived loop invariant: ((((((((((unknown-#StackHeapBarrier-unknown < table && cond == 1) && \result == 0) && !(\result == 0)) && table == map) && table == 0) && num_entries + 1 <= 0) && !(table == 0)) && \result + 1 < table) && map == table) && max_table_entries + 1 <= 0) && \result == 0 - InvariantResult [Line: 2613]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 263]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 248]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 9988]: Loop Invariant [2021-10-30 23:06:21,034 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-30 23:06:21,034 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-30 23:06:21,034 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-30 23:06:21,034 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-30 23:06:21,035 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-30 23:06:21,036 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-30 23:06:21,036 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-30 23:06:21,036 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((((((((((((((((unknown-#StackHeapBarrier-unknown < table && cond == 1) && \result == 0) && !(\result == 0)) && #memory_$Pointer$[table][table] + 1 < table) && \result == 0) && table == map) && #memory_$Pointer$[table][table] == map) && map == 0) && \result == 0) && table == 0) && size_at_least_two == 0) && num_entries + 1 <= 0) && !(table == 0)) && \result + 1 < table) && !(map == 0)) && unknown-#memory_int-unknown[#memory_$Pointer$[table][table]][40] + 1 <= 0) && map == table) && map == table) && map == table) && max_table_entries + 1 <= 0) && #memory_$Pointer$[table][table] == 0) && \result == 0 - InvariantResult [Line: 2626]: Loop Invariant Derived loop invariant: ((((((unknown-#StackHeapBarrier-unknown < table && cond == 1) && table == map) && table == 0) && num_entries + 1 <= 0) && !(table == 0)) && map == table) && max_table_entries + 1 <= 0 - InvariantResult [Line: 10101]: Loop Invariant Derived loop invariant: ((((!(\result == 0) && (!(map == 0) || !(map == 0))) && \result + 1 <= 0) && table == map) && !(table == 0)) && map == table - InvariantResult [Line: 2541]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 10101]: Loop Invariant Derived loop invariant: (((\result + 1 <= 0 && table == map) && !(table == 0)) && map == table) || (((((((unknown-#StackHeapBarrier-unknown < table && table == map) && table == 0) && num_entries + 1 <= 0) && !(table == 0)) && map == table) && max_table_entries + 1 <= 0) && \result == 0) - InvariantResult [Line: 2497]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2541]: Loop Invariant Derived loop invariant: (((((unknown-#StackHeapBarrier-unknown < table && table == map) && table == 0) && num_entries + 1 <= 0) && !(table == 0)) && map == table) && max_table_entries + 1 <= 0 RESULT: Ultimate proved your program to be correct! [2021-10-30 23:06:21,255 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2021-10-30 23:06:21,284 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 Received shutdown request...