./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 4d014703 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 --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-4d01470 [2021-11-02 13:31:10,714 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-02 13:31:10,716 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-02 13:31:10,755 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-02 13:31:10,756 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-02 13:31:10,758 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-02 13:31:10,760 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-02 13:31:10,762 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-02 13:31:10,764 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-02 13:31:10,768 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-02 13:31:10,769 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-02 13:31:10,769 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-02 13:31:10,770 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-02 13:31:10,772 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-02 13:31:10,773 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-02 13:31:10,774 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-02 13:31:10,777 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-02 13:31:10,778 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-02 13:31:10,779 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-02 13:31:10,781 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-02 13:31:10,785 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-02 13:31:10,786 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-02 13:31:10,786 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-02 13:31:10,787 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-02 13:31:10,794 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-02 13:31:10,795 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-02 13:31:10,795 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-02 13:31:10,796 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-02 13:31:10,797 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-02 13:31:10,798 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-02 13:31:10,798 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-02 13:31:10,799 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-02 13:31:10,800 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-02 13:31:10,801 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-02 13:31:10,802 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-02 13:31:10,802 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-02 13:31:10,802 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-02 13:31:10,802 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-02 13:31:10,803 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-02 13:31:10,803 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-02 13:31:10,804 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-02 13:31:10,804 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-02 13:31:10,835 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-02 13:31:10,841 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-02 13:31:10,842 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-02 13:31:10,842 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-02 13:31:10,843 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-02 13:31:10,843 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-02 13:31:10,844 INFO L138 SettingsManager]: * Use SBE=true [2021-11-02 13:31:10,844 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-02 13:31:10,844 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-02 13:31:10,850 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-02 13:31:10,850 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-02 13:31:10,851 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-02 13:31:10,851 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-02 13:31:10,851 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-02 13:31:10,851 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-02 13:31:10,851 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-02 13:31:10,852 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-02 13:31:10,852 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-02 13:31:10,852 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-02 13:31:10,852 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-02 13:31:10,852 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-02 13:31:10,852 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-02 13:31:10,852 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-02 13:31:10,853 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-02 13:31:10,853 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-02 13:31:10,853 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-02 13:31:10,853 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-02 13:31:10,853 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-02 13:31:10,853 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-02 13:31:10,853 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-11-02 13:31:11,091 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-02 13:31:11,127 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-02 13:31:11,129 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-02 13:31:11,130 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-02 13:31:11,130 INFO L275 PluginConnector]: CDTParser initialized [2021-11-02 13:31:11,131 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-11-02 13:31:11,190 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed59a1dea/dba0aeccaae7486aa32a848e01462dea/FLAGfa3ac59e3 [2021-11-02 13:31:11,812 INFO L306 CDTParser]: Found 1 translation units. [2021-11-02 13:31:11,813 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_get_entry_count_harness.i [2021-11-02 13:31:11,843 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed59a1dea/dba0aeccaae7486aa32a848e01462dea/FLAGfa3ac59e3 [2021-11-02 13:31:12,208 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed59a1dea/dba0aeccaae7486aa32a848e01462dea [2021-11-02 13:31:12,210 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-02 13:31:12,211 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-02 13:31:12,212 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-02 13:31:12,212 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-02 13:31:12,223 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-02 13:31:12,224 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 01:31:12" (1/1) ... [2021-11-02 13:31:12,224 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@689770bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 01:31:12, skipping insertion in model container [2021-11-02 13:31:12,225 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 01:31:12" (1/1) ... [2021-11-02 13:31:12,229 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-02 13:31:12,319 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-02 13:31:12,488 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-11-02 13:31:12,497 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-11-02 13:31:12,522 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-02 13:31:12,528 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-02 13:31:13,183 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:31:13,190 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:31:13,191 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:31:13,192 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:31:13,193 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:31:13,203 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:31:13,206 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:31:13,208 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:31:13,211 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:31:13,225 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:31:13,226 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:31:13,227 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:31:13,227 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:31:13,493 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-02 13:31:13,494 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-02 13:31:13,494 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-02 13:31:13,495 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-02 13:31:13,496 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-02 13:31:13,497 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-02 13:31:13,497 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-02 13:31:13,497 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-02 13:31:13,498 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-02 13:31:13,505 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-02 13:31:13,648 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-02 13:31:13,866 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:31:13,867 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:31:13,886 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:31:13,887 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:31:13,892 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:31:13,893 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:31:13,911 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:31:13,912 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:31:13,913 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:31:13,913 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:31:13,913 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:31:13,914 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:31:13,914 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:31:13,949 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-02 13:31:13,982 INFO L203 MainTranslator]: Completed pre-run [2021-11-02 13:31:14,001 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-11-02 13:31:14,002 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-11-02 13:31:14,003 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-02 13:31:14,004 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-02 13:31:14,037 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:31:14,038 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:31:14,038 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:31:14,038 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:31:14,039 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:31:14,045 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:31:14,046 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:31:14,047 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:31:14,048 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:31:14,048 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:31:14,048 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:31:14,049 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:31:14,049 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:31:14,069 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-02 13:31:14,070 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-02 13:31:14,070 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-02 13:31:14,070 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-02 13:31:14,073 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-02 13:31:14,073 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-02 13:31:14,073 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-02 13:31:14,074 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-02 13:31:14,074 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-02 13:31:14,074 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-02 13:31:14,113 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-02 13:31:14,179 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:31:14,179 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:31:14,184 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:31:14,184 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:31:14,186 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:31:14,186 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:31:14,197 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:31:14,198 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:31:14,199 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:31:14,199 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:31:14,199 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:31:14,200 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:31:14,200 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:31:14,214 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-02 13:31:14,383 INFO L208 MainTranslator]: Completed translation [2021-11-02 13:31:14,383 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 01:31:14 WrapperNode [2021-11-02 13:31:14,384 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-02 13:31:14,384 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-02 13:31:14,385 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-02 13:31:14,385 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-02 13:31:14,390 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 01:31:14" (1/1) ... [2021-11-02 13:31:14,464 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 01:31:14" (1/1) ... [2021-11-02 13:31:14,519 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-02 13:31:14,520 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-02 13:31:14,520 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-02 13:31:14,520 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-02 13:31:14,527 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 01:31:14" (1/1) ... [2021-11-02 13:31:14,527 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 01:31:14" (1/1) ... [2021-11-02 13:31:14,535 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 01:31:14" (1/1) ... [2021-11-02 13:31:14,535 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 01:31:14" (1/1) ... [2021-11-02 13:31:14,574 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 01:31:14" (1/1) ... [2021-11-02 13:31:14,577 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 01:31:14" (1/1) ... [2021-11-02 13:31:14,583 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 01:31:14" (1/1) ... [2021-11-02 13:31:14,606 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-02 13:31:14,607 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-02 13:31:14,607 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-02 13:31:14,608 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-02 13:31:14,618 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 01:31:14" (1/1) ... [2021-11-02 13:31:14,624 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-02 13:31:14,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-02 13:31:14,653 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-02 13:31:14,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-02 13:31:14,700 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2021-11-02 13:31:14,701 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-02 13:31:14,701 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-02 13:31:14,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-02 13:31:14,701 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-02 13:31:14,701 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-02 13:31:14,701 INFO L130 BoogieDeclarations]: Found specification of procedure __builtin_uaddl_overflow [2021-11-02 13:31:14,702 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-02 13:31:14,702 INFO L130 BoogieDeclarations]: Found specification of procedure __builtin_umull_overflow [2021-11-02 13:31:14,702 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-02 13:31:14,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-02 13:31:14,702 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-02 13:31:14,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-02 13:31:14,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-02 13:31:18,769 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-02 13:31:18,769 INFO L299 CfgBuilder]: Removed 100 assume(true) statements. [2021-11-02 13:31:18,771 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 01:31:18 BoogieIcfgContainer [2021-11-02 13:31:18,771 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-02 13:31:18,772 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-02 13:31:18,772 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-02 13:31:18,775 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-02 13:31:18,775 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 01:31:12" (1/3) ... [2021-11-02 13:31:18,776 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b96b041 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 01:31:18, skipping insertion in model container [2021-11-02 13:31:18,776 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 01:31:14" (2/3) ... [2021-11-02 13:31:18,776 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b96b041 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 01:31:18, skipping insertion in model container [2021-11-02 13:31:18,776 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 01:31:18" (3/3) ... [2021-11-02 13:31:18,777 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_hash_table_get_entry_count_harness.i [2021-11-02 13:31:18,781 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-02 13:31:18,781 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2021-11-02 13:31:18,813 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-02 13:31:18,818 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-02 13:31:18,819 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2021-11-02 13:31:18,830 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-11-02 13:31:18,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-11-02 13:31:18,835 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:31:18,836 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 13:31:18,836 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 13:31:18,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:31:18,841 INFO L85 PathProgramCache]: Analyzing trace with hash -2070018022, now seen corresponding path program 1 times [2021-11-02 13:31:18,847 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 13:31:18,847 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15170317] [2021-11-02 13:31:18,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:31:18,848 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 13:31:19,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:31:19,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 13:31:19,294 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 13:31:19,295 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15170317] [2021-11-02 13:31:19,295 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15170317] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 13:31:19,295 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 13:31:19,296 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-02 13:31:19,297 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12120811] [2021-11-02 13:31:19,300 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-02 13:31:19,301 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 13:31:19,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-02 13:31:19,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-02 13:31:19,321 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-11-02 13:31:21,379 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:31:22,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 13:31:22,055 INFO L93 Difference]: Finished difference Result 172 states and 219 transitions. [2021-11-02 13:31:22,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-02 13:31:22,058 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-11-02 13:31:22,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 13:31:22,066 INFO L225 Difference]: With dead ends: 172 [2021-11-02 13:31:22,066 INFO L226 Difference]: Without dead ends: 82 [2021-11-02 13:31:22,068 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.03ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-02 13:31:22,075 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2433.36ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.88ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2680.50ms IncrementalHoareTripleChecker+Time [2021-11-02 13:31:22,076 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 102 Unknown, 0 Unchecked, 1.88ms Time], IncrementalHoareTripleChecker [0 Valid, 101 Invalid, 1 Unknown, 0 Unchecked, 2680.50ms Time] [2021-11-02 13:31:22,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2021-11-02 13:31:22,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2021-11-02 13:31:22,108 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-11-02 13:31:22,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 96 transitions. [2021-11-02 13:31:22,116 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 96 transitions. Word has length 41 [2021-11-02 13:31:22,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 13:31:22,116 INFO L470 AbstractCegarLoop]: Abstraction has 82 states and 96 transitions. [2021-11-02 13:31:22,116 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-11-02 13:31:22,117 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 96 transitions. [2021-11-02 13:31:22,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-11-02 13:31:22,119 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:31:22,119 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 13:31:22,119 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-02 13:31:22,119 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 13:31:22,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:31:22,122 INFO L85 PathProgramCache]: Analyzing trace with hash 584946138, now seen corresponding path program 1 times [2021-11-02 13:31:22,122 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 13:31:22,123 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797405203] [2021-11-02 13:31:22,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:31:22,123 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 13:31:22,202 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-02 13:31:22,202 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [311718420] [2021-11-02 13:31:22,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:31:22,202 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-02 13:31:22,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-02 13:31:22,204 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-02 13:31:22,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-02 13:31:22,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:31:22,915 INFO L263 TraceCheckSpWp]: Trace formula consists of 2475 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-02 13:31:22,921 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 13:31:23,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 13:31:23,206 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-02 13:31:23,206 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 13:31:23,206 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797405203] [2021-11-02 13:31:23,206 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-02 13:31:23,206 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [311718420] [2021-11-02 13:31:23,206 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [311718420] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 13:31:23,206 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 13:31:23,206 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-02 13:31:23,207 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174165918] [2021-11-02 13:31:23,208 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-02 13:31:23,208 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 13:31:23,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-02 13:31:23,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-02 13:31:23,208 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-11-02 13:31:25,247 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:31:27,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 13:31:27,156 INFO L93 Difference]: Finished difference Result 208 states and 244 transitions. [2021-11-02 13:31:27,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-02 13:31:27,157 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-11-02 13:31:27,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 13:31:27,158 INFO L225 Difference]: With dead ends: 208 [2021-11-02 13:31:27,158 INFO L226 Difference]: Without dead ends: 148 [2021-11-02 13:31:27,159 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 114.86ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-02 13:31:27,160 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 144 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3446.03ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 12.52ms SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3817.95ms IncrementalHoareTripleChecker+Time [2021-11-02 13:31:27,160 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [144 Valid, 0 Invalid, 493 Unknown, 0 Unchecked, 12.52ms Time], IncrementalHoareTripleChecker [8 Valid, 484 Invalid, 1 Unknown, 0 Unchecked, 3817.95ms Time] [2021-11-02 13:31:27,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2021-11-02 13:31:27,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 88. [2021-11-02 13:31:27,166 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-11-02 13:31:27,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 102 transitions. [2021-11-02 13:31:27,166 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 102 transitions. Word has length 41 [2021-11-02 13:31:27,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 13:31:27,166 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 102 transitions. [2021-11-02 13:31:27,166 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-11-02 13:31:27,166 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 102 transitions. [2021-11-02 13:31:27,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-02 13:31:27,167 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:31:27,167 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 13:31:27,211 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-11-02 13:31:27,391 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-02 13:31:27,392 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 13:31:27,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:31:27,392 INFO L85 PathProgramCache]: Analyzing trace with hash 976385498, now seen corresponding path program 1 times [2021-11-02 13:31:27,392 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 13:31:27,392 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425198888] [2021-11-02 13:31:27,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:31:27,393 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 13:31:27,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:31:27,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 13:31:27,853 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 13:31:27,853 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425198888] [2021-11-02 13:31:27,853 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425198888] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 13:31:27,853 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 13:31:27,853 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-02 13:31:27,853 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888045025] [2021-11-02 13:31:27,853 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-02 13:31:27,853 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 13:31:27,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-02 13:31:27,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-11-02 13:31:27,854 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-11-02 13:31:29,891 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:31:32,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 13:31:32,138 INFO L93 Difference]: Finished difference Result 184 states and 214 transitions. [2021-11-02 13:31:32,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-02 13:31:32,139 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-11-02 13:31:32,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 13:31:32,140 INFO L225 Difference]: With dead ends: 184 [2021-11-02 13:31:32,140 INFO L226 Difference]: Without dead ends: 134 [2021-11-02 13:31:32,140 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 485.70ms TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2021-11-02 13:31:32,141 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 284 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 500 mSolverCounterSat, 11 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3556.58ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 11.58ms SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 500 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3914.36ms IncrementalHoareTripleChecker+Time [2021-11-02 13:31:32,142 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [284 Valid, 0 Invalid, 512 Unknown, 0 Unchecked, 11.58ms Time], IncrementalHoareTripleChecker [11 Valid, 500 Invalid, 1 Unknown, 0 Unchecked, 3914.36ms Time] [2021-11-02 13:31:32,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2021-11-02 13:31:32,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 109. [2021-11-02 13:31:32,150 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-11-02 13:31:32,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 128 transitions. [2021-11-02 13:31:32,151 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 128 transitions. Word has length 45 [2021-11-02 13:31:32,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 13:31:32,151 INFO L470 AbstractCegarLoop]: Abstraction has 109 states and 128 transitions. [2021-11-02 13:31:32,151 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-11-02 13:31:32,151 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 128 transitions. [2021-11-02 13:31:32,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-02 13:31:32,152 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:31:32,152 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 13:31:32,153 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-02 13:31:32,165 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 13:31:32,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:31:32,170 INFO L85 PathProgramCache]: Analyzing trace with hash -829052836, now seen corresponding path program 1 times [2021-11-02 13:31:32,170 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 13:31:32,170 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279167914] [2021-11-02 13:31:32,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:31:32,170 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 13:31:32,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:31:32,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 13:31:32,465 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 13:31:32,465 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279167914] [2021-11-02 13:31:32,465 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279167914] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 13:31:32,465 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 13:31:32,465 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-02 13:31:32,466 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162063243] [2021-11-02 13:31:32,466 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 13:31:32,466 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 13:31:32,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 13:31:32,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 13:31:32,467 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-11-02 13:31:34,515 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:31:35,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 13:31:35,409 INFO L93 Difference]: Finished difference Result 181 states and 213 transitions. [2021-11-02 13:31:35,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-02 13:31:35,409 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-11-02 13:31:35,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 13:31:35,410 INFO L225 Difference]: With dead ends: 181 [2021-11-02 13:31:35,410 INFO L226 Difference]: Without dead ends: 107 [2021-11-02 13:31:35,411 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 75.02ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-02 13:31:35,411 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 70 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2601.60ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.48ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2891.59ms IncrementalHoareTripleChecker+Time [2021-11-02 13:31:35,411 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 0 Invalid, 187 Unknown, 0 Unchecked, 3.48ms Time], IncrementalHoareTripleChecker [4 Valid, 182 Invalid, 1 Unknown, 0 Unchecked, 2891.59ms Time] [2021-11-02 13:31:35,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2021-11-02 13:31:35,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2021-11-02 13:31:35,448 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-11-02 13:31:35,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 122 transitions. [2021-11-02 13:31:35,449 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 122 transitions. Word has length 45 [2021-11-02 13:31:35,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 13:31:35,449 INFO L470 AbstractCegarLoop]: Abstraction has 107 states and 122 transitions. [2021-11-02 13:31:35,449 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-11-02 13:31:35,449 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 122 transitions. [2021-11-02 13:31:35,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-11-02 13:31:35,450 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:31:35,450 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 13:31:35,450 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-02 13:31:35,450 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 13:31:35,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:31:35,450 INFO L85 PathProgramCache]: Analyzing trace with hash 99946677, now seen corresponding path program 1 times [2021-11-02 13:31:35,450 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 13:31:35,451 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735125749] [2021-11-02 13:31:35,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:31:35,451 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 13:31:35,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:31:35,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 13:31:35,767 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 13:31:35,767 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735125749] [2021-11-02 13:31:35,768 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735125749] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 13:31:35,768 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 13:31:35,768 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-02 13:31:35,768 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387143828] [2021-11-02 13:31:35,768 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-02 13:31:35,768 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 13:31:35,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-02 13:31:35,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-02 13:31:35,769 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-11-02 13:31:37,808 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:31:39,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 13:31:39,261 INFO L93 Difference]: Finished difference Result 178 states and 203 transitions. [2021-11-02 13:31:39,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-02 13:31:39,262 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-11-02 13:31:39,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 13:31:39,262 INFO L225 Difference]: With dead ends: 178 [2021-11-02 13:31:39,262 INFO L226 Difference]: Without dead ends: 108 [2021-11-02 13:31:39,263 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 322.83ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-02 13:31:39,263 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 70 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2908.05ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.49ms SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3247.24ms IncrementalHoareTripleChecker+Time [2021-11-02 13:31:39,263 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 0 Invalid, 290 Unknown, 0 Unchecked, 4.49ms Time], IncrementalHoareTripleChecker [7 Valid, 282 Invalid, 1 Unknown, 0 Unchecked, 3247.24ms Time] [2021-11-02 13:31:39,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2021-11-02 13:31:39,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2021-11-02 13:31:39,269 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-11-02 13:31:39,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 120 transitions. [2021-11-02 13:31:39,270 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 120 transitions. Word has length 47 [2021-11-02 13:31:39,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 13:31:39,270 INFO L470 AbstractCegarLoop]: Abstraction has 107 states and 120 transitions. [2021-11-02 13:31:39,270 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-11-02 13:31:39,270 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 120 transitions. [2021-11-02 13:31:39,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-11-02 13:31:39,271 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:31:39,271 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 13:31:39,271 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-02 13:31:39,271 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 13:31:39,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:31:39,272 INFO L85 PathProgramCache]: Analyzing trace with hash -416077786, now seen corresponding path program 1 times [2021-11-02 13:31:39,272 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 13:31:39,272 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410812529] [2021-11-02 13:31:39,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:31:39,273 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 13:31:39,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:31:40,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 13:31:40,015 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 13:31:40,015 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410812529] [2021-11-02 13:31:40,015 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410812529] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 13:31:40,015 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 13:31:40,015 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-02 13:31:40,016 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543248381] [2021-11-02 13:31:40,016 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 13:31:40,016 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 13:31:40,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 13:31:40,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 13:31:40,017 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-11-02 13:31:42,058 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:31:43,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 13:31:43,144 INFO L93 Difference]: Finished difference Result 193 states and 215 transitions. [2021-11-02 13:31:43,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-02 13:31:43,144 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-11-02 13:31:43,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 13:31:43,145 INFO L225 Difference]: With dead ends: 193 [2021-11-02 13:31:43,145 INFO L226 Difference]: Without dead ends: 107 [2021-11-02 13:31:43,145 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 86.01ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-02 13:31:43,146 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 2 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2836.28ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.42ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3065.15ms IncrementalHoareTripleChecker+Time [2021-11-02 13:31:43,146 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 0 Invalid, 272 Unknown, 0 Unchecked, 3.42ms Time], IncrementalHoareTripleChecker [5 Valid, 266 Invalid, 1 Unknown, 0 Unchecked, 3065.15ms Time] [2021-11-02 13:31:43,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2021-11-02 13:31:43,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 104. [2021-11-02 13:31:43,152 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-11-02 13:31:43,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 112 transitions. [2021-11-02 13:31:43,152 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 112 transitions. Word has length 48 [2021-11-02 13:31:43,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 13:31:43,152 INFO L470 AbstractCegarLoop]: Abstraction has 104 states and 112 transitions. [2021-11-02 13:31:43,152 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-11-02 13:31:43,152 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 112 transitions. [2021-11-02 13:31:43,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-11-02 13:31:43,153 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:31:43,153 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 13:31:43,153 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-02 13:31:43,153 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 13:31:43,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:31:43,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1407256250, now seen corresponding path program 1 times [2021-11-02 13:31:43,154 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 13:31:43,156 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513727450] [2021-11-02 13:31:43,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:31:43,157 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 13:31:43,229 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-02 13:31:43,230 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [663715238] [2021-11-02 13:31:43,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:31:43,230 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-02 13:31:43,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-02 13:31:43,231 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-02 13:31:43,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-02 13:31:43,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:31:43,900 INFO L263 TraceCheckSpWp]: Trace formula consists of 2667 conjuncts, 89 conjunts are in the unsatisfiable core [2021-11-02 13:31:43,906 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 13:31:45,326 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-02 13:31:45,348 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-11-02 13:31:45,358 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-11-02 13:31:45,734 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-11-02 13:31:45,863 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-11-02 13:31:46,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 13:31:46,440 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-02 13:31:46,440 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 13:31:46,440 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513727450] [2021-11-02 13:31:46,440 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-02 13:31:46,440 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [663715238] [2021-11-02 13:31:46,440 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [663715238] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 13:31:46,440 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 13:31:46,440 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-11-02 13:31:46,440 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447259447] [2021-11-02 13:31:46,441 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-02 13:31:46,441 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 13:31:46,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-02 13:31:46,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2021-11-02 13:31:46,441 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-11-02 13:31:48,481 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:31:52,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 13:31:52,187 INFO L93 Difference]: Finished difference Result 104 states and 112 transitions. [2021-11-02 13:31:52,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-02 13:31:52,188 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-11-02 13:31:52,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 13:31:52,188 INFO L225 Difference]: With dead ends: 104 [2021-11-02 13:31:52,188 INFO L226 Difference]: Without dead ends: 0 [2021-11-02 13:31:52,189 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 3072.56ms TimeCoverageRelationStatistics Valid=260, Invalid=670, Unknown=0, NotChecked=0, Total=930 [2021-11-02 13:31:52,189 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 91 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 23 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3233.48ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.06ms SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3588.21ms IncrementalHoareTripleChecker+Time [2021-11-02 13:31:52,189 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [91 Valid, 0 Invalid, 394 Unknown, 0 Unchecked, 5.06ms Time], IncrementalHoareTripleChecker [23 Valid, 370 Invalid, 1 Unknown, 0 Unchecked, 3588.21ms Time] [2021-11-02 13:31:52,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-11-02 13:31:52,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-11-02 13:31:52,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 13:31:52,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-11-02 13:31:52,190 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 54 [2021-11-02 13:31:52,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 13:31:52,190 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-11-02 13:31:52,190 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-11-02 13:31:52,190 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-11-02 13:31:52,190 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-11-02 13:31:52,192 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2021-11-02 13:31:52,192 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2021-11-02 13:31:52,192 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2021-11-02 13:31:52,220 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-02 13:31:52,393 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-11-02 13:31:52,395 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-11-02 13:31:52,400 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 13:31:52,402 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 13:31:52,409 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 13:31:52,414 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 13:31:52,416 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 13:31:52,417 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 13:31:52,417 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 13:31:52,417 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 13:31:52,418 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 13:31:52,419 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 13:31:52,420 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 13:31:52,420 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 13:31:52,420 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 13:31:52,427 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 13:31:52,428 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 13:31:52,429 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 13:31:52,434 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 13:31:52,434 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 13:31:52,436 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 13:31:52,437 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 13:31:52,438 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 13:31:52,439 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 13:31:52,439 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 13:31:52,439 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 13:31:52,442 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 13:31:52,442 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 13:31:52,443 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 13:31:52,444 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 13:31:52,445 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 13:31:52,446 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 13:31:54,438 INFO L854 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-11-02 13:31:54,438 INFO L854 garLoopResultBuilder]: At program point L10044-1(lines 9999 10046) the Hoare annotation is: false [2021-11-02 13:31:54,438 INFO L854 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-11-02 13:31:54,438 INFO L854 garLoopResultBuilder]: At program point L250-1(lines 248 251) the Hoare annotation is: false [2021-11-02 13:31:54,438 INFO L858 garLoopResultBuilder]: For program point L7385-3(lines 7385 7387) no Hoare annotation was computed. [2021-11-02 13:31:54,438 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-02 13:31:54,438 INFO L858 garLoopResultBuilder]: For program point L7385-2(lines 7385 7387) no Hoare annotation was computed. [2021-11-02 13:31:54,438 INFO L858 garLoopResultBuilder]: For program point L7385-1(lines 7385 7387) no Hoare annotation was computed. [2021-11-02 13:31:54,438 INFO L858 garLoopResultBuilder]: For program point L7385(lines 7385 7387) no Hoare annotation was computed. [2021-11-02 13:31:54,438 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-11-02 13:31:54,438 INFO L854 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-11-02 13:31:54,438 INFO L854 garLoopResultBuilder]: At program point L2630-2(lines 2626 2631) the Hoare annotation is: false [2021-11-02 13:31:54,439 INFO L854 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-11-02 13:31:54,439 INFO L858 garLoopResultBuilder]: For program point L2498(lines 2498 2499) no Hoare annotation was computed. [2021-11-02 13:31:54,439 INFO L858 garLoopResultBuilder]: For program point L2498-1(lines 2498 2499) no Hoare annotation was computed. [2021-11-02 13:31:54,439 INFO L854 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-11-02 13:31:54,439 INFO L854 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-11-02 13:31:54,439 INFO L858 garLoopResultBuilder]: For program point L6809(lines 6809 6819) no Hoare annotation was computed. [2021-11-02 13:31:54,439 INFO L858 garLoopResultBuilder]: For program point L10114(lines 10114 10133) no Hoare annotation was computed. [2021-11-02 13:31:54,439 INFO L858 garLoopResultBuilder]: For program point L7274(lines 7274 7278) no Hoare annotation was computed. [2021-11-02 13:31:54,439 INFO L854 garLoopResultBuilder]: At program point L2501-1(lines 2497 2502) the Hoare annotation is: false [2021-11-02 13:31:54,439 INFO L854 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-11-02 13:31:54,439 INFO L854 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-11-02 13:31:54,439 INFO L854 garLoopResultBuilder]: At program point L255-1(lines 253 256) the Hoare annotation is: false [2021-11-02 13:31:54,439 INFO L858 garLoopResultBuilder]: For program point L222(lines 222 224) no Hoare annotation was computed. [2021-11-02 13:31:54,439 INFO L858 garLoopResultBuilder]: For program point L222-1(lines 222 224) no Hoare annotation was computed. [2021-11-02 13:31:54,439 INFO L858 garLoopResultBuilder]: For program point L222-2(lines 222 224) no Hoare annotation was computed. [2021-11-02 13:31:54,439 INFO L854 garLoopResultBuilder]: At program point L2617-1(lines 2613 2621) the Hoare annotation is: false [2021-11-02 13:31:54,439 INFO L854 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-11-02 13:31:54,440 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-11-02 13:31:54,440 INFO L858 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2021-11-02 13:31:54,440 INFO L858 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2021-11-02 13:31:54,440 INFO L858 garLoopResultBuilder]: For program point L223-3(line 223) no Hoare annotation was computed. [2021-11-02 13:31:54,440 INFO L858 garLoopResultBuilder]: For program point L223-4(line 223) no Hoare annotation was computed. [2021-11-02 13:31:54,440 INFO L858 garLoopResultBuilder]: For program point L223-6(line 223) no Hoare annotation was computed. [2021-11-02 13:31:54,440 INFO L858 garLoopResultBuilder]: For program point L223-7(line 223) no Hoare annotation was computed. [2021-11-02 13:31:54,440 INFO L858 garLoopResultBuilder]: For program point L10001(lines 10001 10005) no Hoare annotation was computed. [2021-11-02 13:31:54,440 INFO L858 garLoopResultBuilder]: For program point L10001-1(lines 10001 10005) no Hoare annotation was computed. [2021-11-02 13:31:54,440 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-02 13:31:54,440 INFO L861 garLoopResultBuilder]: At program point L10134(line 10134) the Hoare annotation is: true [2021-11-02 13:31:54,440 INFO L854 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-11-02 13:31:54,440 INFO L858 garLoopResultBuilder]: For program point L7195(lines 7195 7201) no Hoare annotation was computed. [2021-11-02 13:31:54,440 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-11-02 13:31:54,440 INFO L858 garLoopResultBuilder]: For program point L7196(lines 7196 7200) no Hoare annotation was computed. [2021-11-02 13:31:54,440 INFO L858 garLoopResultBuilder]: For program point L210(lines 210 212) no Hoare annotation was computed. [2021-11-02 13:31:54,440 INFO L858 garLoopResultBuilder]: For program point L210-1(lines 210 212) no Hoare annotation was computed. [2021-11-02 13:31:54,440 INFO L858 garLoopResultBuilder]: For program point L210-2(lines 210 212) no Hoare annotation was computed. [2021-11-02 13:31:54,440 INFO L858 garLoopResultBuilder]: For program point L210-3(lines 210 212) no Hoare annotation was computed. [2021-11-02 13:31:54,441 INFO L858 garLoopResultBuilder]: For program point L210-4(lines 210 212) no Hoare annotation was computed. [2021-11-02 13:31:54,441 INFO L858 garLoopResultBuilder]: For program point L210-5(lines 210 212) no Hoare annotation was computed. [2021-11-02 13:31:54,441 INFO L858 garLoopResultBuilder]: For program point L210-6(lines 210 212) no Hoare annotation was computed. [2021-11-02 13:31:54,441 INFO L854 garLoopResultBuilder]: At program point L9146(lines 9144 9147) the Hoare annotation is: false [2021-11-02 13:31:54,441 INFO L858 garLoopResultBuilder]: For program point L10104(lines 10104 10106) no Hoare annotation was computed. [2021-11-02 13:31:54,441 INFO L858 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2021-11-02 13:31:54,441 INFO L858 garLoopResultBuilder]: For program point L10104-1(lines 10104 10106) no Hoare annotation was computed. [2021-11-02 13:31:54,441 INFO L858 garLoopResultBuilder]: For program point L211-2(line 211) no Hoare annotation was computed. [2021-11-02 13:31:54,441 INFO L858 garLoopResultBuilder]: For program point L211-4(line 211) no Hoare annotation was computed. [2021-11-02 13:31:54,441 INFO L858 garLoopResultBuilder]: For program point L211-6(line 211) no Hoare annotation was computed. [2021-11-02 13:31:54,441 INFO L858 garLoopResultBuilder]: For program point L211-8(line 211) no Hoare annotation was computed. [2021-11-02 13:31:54,441 INFO L858 garLoopResultBuilder]: For program point L211-10(line 211) no Hoare annotation was computed. [2021-11-02 13:31:54,441 INFO L858 garLoopResultBuilder]: For program point L211-12(line 211) no Hoare annotation was computed. [2021-11-02 13:31:54,441 INFO L854 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-11-02 13:31:54,441 INFO L854 garLoopResultBuilder]: At program point L2590-1(lines 2586 2594) the Hoare annotation is: false [2021-11-02 13:31:54,441 INFO L858 garLoopResultBuilder]: For program point L9990-2(line 9990) no Hoare annotation was computed. [2021-11-02 13:31:54,441 INFO L858 garLoopResultBuilder]: For program point L9990-3(line 9990) no Hoare annotation was computed. [2021-11-02 13:31:54,441 INFO L858 garLoopResultBuilder]: For program point L9990(line 9990) no Hoare annotation was computed. [2021-11-02 13:31:54,441 INFO L858 garLoopResultBuilder]: For program point L9990-9(line 9990) no Hoare annotation was computed. [2021-11-02 13:31:54,442 INFO L858 garLoopResultBuilder]: For program point L9990-10(line 9990) no Hoare annotation was computed. [2021-11-02 13:31:54,442 INFO L858 garLoopResultBuilder]: For program point L9990-12(line 9990) no Hoare annotation was computed. [2021-11-02 13:31:54,442 INFO L858 garLoopResultBuilder]: For program point L9990-5(line 9990) no Hoare annotation was computed. [2021-11-02 13:31:54,442 INFO L854 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-11-02 13:31:54,442 INFO L858 garLoopResultBuilder]: For program point L9990-7(line 9990) no Hoare annotation was computed. [2021-11-02 13:31:54,442 INFO L854 garLoopResultBuilder]: At program point L9990-13(lines 9988 9991) the Hoare annotation is: false [2021-11-02 13:31:54,442 INFO L858 garLoopResultBuilder]: For program point L2542(lines 2542 2543) no Hoare annotation was computed. [2021-11-02 13:31:54,442 INFO L858 garLoopResultBuilder]: For program point L2542-1(lines 2542 2543) no Hoare annotation was computed. [2021-11-02 13:31:54,442 INFO L854 garLoopResultBuilder]: At program point L263(line 263) the Hoare annotation is: false [2021-11-02 13:31:54,442 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-11-02 13:31:54,442 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-02 13:31:54,442 INFO L854 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-11-02 13:31:54,442 INFO L854 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-11-02 13:31:54,442 INFO L854 garLoopResultBuilder]: At program point L1998-2(lines 1988 1999) the Hoare annotation is: false [2021-11-02 13:31:54,442 INFO L854 garLoopResultBuilder]: At program point L1998-3(lines 1988 1999) the Hoare annotation is: false [2021-11-02 13:31:54,442 INFO L858 garLoopResultBuilder]: For program point L7267(lines 7267 7272) no Hoare annotation was computed. [2021-11-02 13:31:54,443 INFO L858 garLoopResultBuilder]: For program point L10108(lines 10108 10110) no Hoare annotation was computed. [2021-11-02 13:31:54,443 INFO L858 garLoopResultBuilder]: For program point L10108-1(lines 10108 10110) no Hoare annotation was computed. [2021-11-02 13:31:54,443 INFO L854 garLoopResultBuilder]: At program point L2545-1(lines 2541 2546) the Hoare annotation is: false [2021-11-02 13:31:54,443 INFO L854 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-11-02 13:31:54,443 INFO L854 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-11-02 13:31:54,461 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2021-11-02 13:31:54,463 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-02 13:31:54,495 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:31:54,499 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:31:54,501 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:31:54,502 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:31:54,503 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:31:54,510 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:31:54,510 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:31:54,510 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:31:54,511 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:31:54,512 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:31:54,512 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:31:54,512 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:31:54,513 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:31:54,513 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:31:54,513 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:31:54,513 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:31:54,515 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:31:54,518 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:31:54,518 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:31:54,518 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:31:54,519 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:31:54,522 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:31:54,522 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:31:54,523 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:31:54,525 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 01:31:54 BoogieIcfgContainer [2021-11-02 13:31:54,525 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-02 13:31:54,525 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-02 13:31:54,530 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-02 13:31:54,530 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-02 13:31:54,531 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 01:31:18" (3/4) ... [2021-11-02 13:31:54,533 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-11-02 13:31:54,549 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 172 nodes and edges [2021-11-02 13:31:54,555 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 73 nodes and edges [2021-11-02 13:31:54,556 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 26 nodes and edges [2021-11-02 13:31:54,556 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2021-11-02 13:31:54,557 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2021-11-02 13:31:54,558 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2021-11-02 13:31:54,558 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-11-02 13:31:54,559 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-11-02 13:31:54,581 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-11-02 13:31:54,581 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-11-02 13:31:54,583 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-11-02 13:31:54,583 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-11-02 13:31:54,583 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-11-02 13:31:54,584 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-11-02 13:31:55,339 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-11-02 13:31:55,339 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-02 13:31:55,340 INFO L158 Benchmark]: Toolchain (without parser) took 43128.71ms. Allocated memory was 92.3MB in the beginning and 543.2MB in the end (delta: 450.9MB). Free memory was 60.4MB in the beginning and 455.6MB in the end (delta: -395.3MB). Peak memory consumption was 382.8MB. Max. memory is 16.1GB. [2021-11-02 13:31:55,340 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 73.4MB. Free memory was 44.8MB in the beginning and 44.8MB in the end (delta: 44.2kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-02 13:31:55,340 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2172.17ms. Allocated memory was 92.3MB in the beginning and 174.1MB in the end (delta: 81.8MB). Free memory was 60.2MB in the beginning and 111.3MB in the end (delta: -51.0MB). Peak memory consumption was 67.6MB. Max. memory is 16.1GB. [2021-11-02 13:31:55,340 INFO L158 Benchmark]: Boogie Procedure Inliner took 135.06ms. Allocated memory is still 174.1MB. Free memory was 111.3MB in the beginning and 98.7MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-11-02 13:31:55,341 INFO L158 Benchmark]: Boogie Preprocessor took 86.69ms. Allocated memory is still 174.1MB. Free memory was 98.7MB in the beginning and 91.5MB in the end (delta: 7.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-11-02 13:31:55,341 INFO L158 Benchmark]: RCFGBuilder took 4163.92ms. Allocated memory was 174.1MB in the beginning and 396.4MB in the end (delta: 222.3MB). Free memory was 91.5MB in the beginning and 112.8MB in the end (delta: -21.3MB). Peak memory consumption was 206.0MB. Max. memory is 16.1GB. [2021-11-02 13:31:55,341 INFO L158 Benchmark]: TraceAbstraction took 35752.55ms. Allocated memory was 396.4MB in the beginning and 543.2MB in the end (delta: 146.8MB). Free memory was 112.8MB in the beginning and 256.5MB in the end (delta: -143.8MB). Peak memory consumption was 3.0MB. Max. memory is 16.1GB. [2021-11-02 13:31:55,341 INFO L158 Benchmark]: Witness Printer took 813.86ms. Allocated memory is still 543.2MB. Free memory was 256.5MB in the beginning and 455.6MB in the end (delta: -199.1MB). Peak memory consumption was 126.0MB. Max. memory is 16.1GB. [2021-11-02 13:31:55,342 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.10ms. Allocated memory is still 73.4MB. Free memory was 44.8MB in the beginning and 44.8MB in the end (delta: 44.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2172.17ms. Allocated memory was 92.3MB in the beginning and 174.1MB in the end (delta: 81.8MB). Free memory was 60.2MB in the beginning and 111.3MB in the end (delta: -51.0MB). Peak memory consumption was 67.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 135.06ms. Allocated memory is still 174.1MB. Free memory was 111.3MB in the beginning and 98.7MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 86.69ms. Allocated memory is still 174.1MB. Free memory was 98.7MB in the beginning and 91.5MB in the end (delta: 7.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 4163.92ms. Allocated memory was 174.1MB in the beginning and 396.4MB in the end (delta: 222.3MB). Free memory was 91.5MB in the beginning and 112.8MB in the end (delta: -21.3MB). Peak memory consumption was 206.0MB. Max. memory is 16.1GB. * TraceAbstraction took 35752.55ms. Allocated memory was 396.4MB in the beginning and 543.2MB in the end (delta: 146.8MB). Free memory was 112.8MB in the beginning and 256.5MB in the end (delta: -143.8MB). Peak memory consumption was 3.0MB. Max. memory is 16.1GB. * Witness Printer took 813.86ms. Allocated memory is still 543.2MB. Free memory was 256.5MB in the beginning and 455.6MB in the end (delta: -199.1MB). Peak memory consumption was 126.0MB. Max. memory is 16.1GB. * 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.00ms ErrorAutomatonConstructionTimeTotal, 0.00ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.00ms ErrorAutomatonConstructionTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeAvg, 0.00ms 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: 35650.51ms, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 14.17ms, AutomataDifference: 26370.30ms, DeadEndRemovalTime: 0.00ms, HoareAnnotationTime: 2043.65ms, InitialAbstractionConstructionTime: 7.97ms, PartialOrderReductionTime: 0.00ms, HoareTripleCheckerStatistics: 7 mSolverCounterUnknown, 661 SdHoareTripleChecker+Valid, 23205.00ms IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 661 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 21015.39ms Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1201 mSDsCounter, 58 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2185 IncrementalHoareTripleChecker+Invalid, 2250 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 58 mSolverCounterUnsat, 0 mSDtfsCounter, 2185 mSolverCounterSat, 42.44ms SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 144 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 4157.01ms Time, 0.00ms 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.00ms DumpTime, AutomataMinimizationStatistics: 59.18ms AutomataMinimizationTime, 7 MinimizatonAttempts, 89 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.00ms HoareAnnotationTime, 30 LocationsWithAnnotation, 30 PreInvPairs, 48 NumberOfFragments, 705 HoareAnnotationTreeSize, 30 FomulaSimplifications, 258 FormulaSimplificationTreeSizeReduction, 49.34ms HoareSimplificationTime, 30 FomulaSimplificationsInter, 48 FormulaSimplificationTreeSizeReductionInter, 1983.05ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 271.62ms SsaConstructionTime, 1820.83ms SatisfiabilityAnalysisTime, 4095.31ms 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-11-02 13:31:55,352 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:31:55,352 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:31:55,352 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:31:55,353 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:31:55,353 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:31:55,353 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:31:55,353 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:31:55,354 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-11-02 13:31:55,355 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:31:55,355 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:31:55,355 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:31:55,355 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:31:55,356 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:31:55,356 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:31:55,356 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:31:55,356 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-11-02 13:31:55,358 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:31:55,358 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:31:55,358 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:31:55,358 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:31:55,359 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:31:55,359 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:31:55,359 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:31:55,359 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-11-02 13:31:55,563 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-11-02 13:31:55,580 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE