./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_hash_table_swap_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c36dfa3b 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_swap_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 50333b6a17e96dff6400d2c6a85c0145ae494daf76266f6b6d6936a12a6b2527 --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-c36dfa3 [2021-11-03 23:14:44,739 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-03 23:14:44,740 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-03 23:14:44,771 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-03 23:14:44,772 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-03 23:14:44,775 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-03 23:14:44,776 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-03 23:14:44,780 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-03 23:14:44,782 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-03 23:14:44,785 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-03 23:14:44,786 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-03 23:14:44,787 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-03 23:14:44,787 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-03 23:14:44,789 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-03 23:14:44,791 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-03 23:14:44,794 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-03 23:14:44,795 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-03 23:14:44,795 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-03 23:14:44,797 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-03 23:14:44,801 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-03 23:14:44,803 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-03 23:14:44,803 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-03 23:14:44,805 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-03 23:14:44,805 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-03 23:14:44,810 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-03 23:14:44,810 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-03 23:14:44,811 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-03 23:14:44,812 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-03 23:14:44,812 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-03 23:14:44,814 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-03 23:14:44,814 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-03 23:14:44,815 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-03 23:14:44,816 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-03 23:14:44,817 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-03 23:14:44,818 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-03 23:14:44,818 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-03 23:14:44,818 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-03 23:14:44,818 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-03 23:14:44,819 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-03 23:14:44,819 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-03 23:14:44,820 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-03 23:14:44,821 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-03 23:14:44,849 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-03 23:14:44,850 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-03 23:14:44,850 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-03 23:14:44,850 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-03 23:14:44,851 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-03 23:14:44,851 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-03 23:14:44,852 INFO L138 SettingsManager]: * Use SBE=true [2021-11-03 23:14:44,852 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-03 23:14:44,852 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-03 23:14:44,852 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-03 23:14:44,853 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-03 23:14:44,853 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-03 23:14:44,853 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-03 23:14:44,853 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-03 23:14:44,853 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-03 23:14:44,853 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-03 23:14:44,854 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-03 23:14:44,854 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-03 23:14:44,854 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-03 23:14:44,854 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-03 23:14:44,854 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-03 23:14:44,854 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-03 23:14:44,854 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-03 23:14:44,854 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-03 23:14:44,855 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-03 23:14:44,855 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-03 23:14:44,855 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-03 23:14:44,855 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-03 23:14:44,855 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-03 23:14:44,855 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 -> 50333b6a17e96dff6400d2c6a85c0145ae494daf76266f6b6d6936a12a6b2527 [2021-11-03 23:14:45,055 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-03 23:14:45,069 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-03 23:14:45,071 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-03 23:14:45,074 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-03 23:14:45,075 INFO L275 PluginConnector]: CDTParser initialized [2021-11-03 23:14:45,076 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_swap_harness.i [2021-11-03 23:14:45,145 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d5de0239/d09f206f2d114fb7b80982ebccc85815/FLAG25f00fab7 [2021-11-03 23:14:45,731 INFO L306 CDTParser]: Found 1 translation units. [2021-11-03 23:14:45,732 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_swap_harness.i [2021-11-03 23:14:45,761 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d5de0239/d09f206f2d114fb7b80982ebccc85815/FLAG25f00fab7 [2021-11-03 23:14:45,909 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d5de0239/d09f206f2d114fb7b80982ebccc85815 [2021-11-03 23:14:45,911 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-03 23:14:45,913 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-03 23:14:45,915 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-03 23:14:45,916 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-03 23:14:45,918 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-03 23:14:45,919 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 11:14:45" (1/1) ... [2021-11-03 23:14:45,919 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@312407d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 11:14:45, skipping insertion in model container [2021-11-03 23:14:45,920 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 11:14:45" (1/1) ... [2021-11-03 23:14:45,924 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-03 23:14:45,998 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-03 23:14:46,256 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_swap_harness.i[4493,4506] [2021-11-03 23:14:46,264 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_swap_harness.i[4553,4566] [2021-11-03 23:14:46,294 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-03 23:14:46,302 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-03 23:14:46,963 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 23:14:46,963 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 23:14:46,964 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 23:14:46,964 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 23:14:46,965 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 23:14:46,974 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 23:14:46,974 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 23:14:46,975 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 23:14:46,976 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 23:14:46,977 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 23:14:46,977 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 23:14:46,978 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 23:14:46,978 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 23:14:47,291 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-03 23:14:47,295 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-03 23:14:47,297 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-03 23:14:47,299 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-03 23:14:47,301 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-03 23:14:47,302 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-03 23:14:47,302 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-03 23:14:47,303 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-03 23:14:47,304 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-03 23:14:47,305 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-03 23:14:47,437 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-03 23:14:47,721 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 23:14:47,722 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 23:14:47,740 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 23:14:47,742 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 23:14:47,749 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 23:14:47,749 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 23:14:47,764 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 23:14:47,766 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 23:14:47,767 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 23:14:47,767 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 23:14:47,767 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 23:14:47,768 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 23:14:47,768 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 23:14:47,803 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-03 23:14:47,837 INFO L203 MainTranslator]: Completed pre-run [2021-11-03 23:14:47,858 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_swap_harness.i[4493,4506] [2021-11-03 23:14:47,858 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_swap_harness.i[4553,4566] [2021-11-03 23:14:47,860 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-03 23:14:47,876 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-03 23:14:47,916 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 23:14:47,917 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 23:14:47,917 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 23:14:47,917 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 23:14:47,918 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 23:14:47,924 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 23:14:47,925 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 23:14:47,926 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 23:14:47,926 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 23:14:47,927 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 23:14:47,928 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 23:14:47,928 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 23:14:47,929 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 23:14:47,950 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-03 23:14:47,951 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-03 23:14:47,951 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-03 23:14:47,952 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-03 23:14:47,952 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-03 23:14:47,953 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-03 23:14:47,953 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-03 23:14:47,953 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-03 23:14:47,953 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-03 23:14:47,954 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-03 23:14:47,995 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-03 23:14:48,051 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 23:14:48,051 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 23:14:48,055 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 23:14:48,056 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 23:14:48,058 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 23:14:48,058 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 23:14:48,068 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 23:14:48,069 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 23:14:48,070 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 23:14:48,070 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 23:14:48,070 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 23:14:48,071 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 23:14:48,071 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 23:14:48,082 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-03 23:14:48,251 INFO L208 MainTranslator]: Completed translation [2021-11-03 23:14:48,252 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 11:14:48 WrapperNode [2021-11-03 23:14:48,252 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-03 23:14:48,253 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-03 23:14:48,253 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-03 23:14:48,253 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-03 23:14:48,259 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 11:14:48" (1/1) ... [2021-11-03 23:14:48,394 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 11:14:48" (1/1) ... [2021-11-03 23:14:48,471 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-03 23:14:48,472 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-03 23:14:48,472 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-03 23:14:48,472 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-03 23:14:48,478 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 11:14:48" (1/1) ... [2021-11-03 23:14:48,479 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 11:14:48" (1/1) ... [2021-11-03 23:14:48,492 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 11:14:48" (1/1) ... [2021-11-03 23:14:48,492 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 11:14:48" (1/1) ... [2021-11-03 23:14:48,522 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 11:14:48" (1/1) ... [2021-11-03 23:14:48,530 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 11:14:48" (1/1) ... [2021-11-03 23:14:48,544 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 11:14:48" (1/1) ... [2021-11-03 23:14:48,559 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-03 23:14:48,559 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-03 23:14:48,560 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-03 23:14:48,560 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-03 23:14:48,564 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 11:14:48" (1/1) ... [2021-11-03 23:14:48,569 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-03 23:14:48,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-03 23:14:48,585 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-03 23:14:48,602 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-03 23:14:48,619 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2021-11-03 23:14:48,620 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-03 23:14:48,620 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-03 23:14:48,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-03 23:14:48,620 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-03 23:14:48,620 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-03 23:14:48,620 INFO L130 BoogieDeclarations]: Found specification of procedure __builtin_uaddl_overflow [2021-11-03 23:14:48,621 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-03 23:14:48,621 INFO L130 BoogieDeclarations]: Found specification of procedure __builtin_umull_overflow [2021-11-03 23:14:48,621 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-03 23:14:48,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-03 23:14:48,621 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-03 23:14:48,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-03 23:14:48,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-03 23:14:52,563 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-03 23:14:52,563 INFO L299 CfgBuilder]: Removed 190 assume(true) statements. [2021-11-03 23:14:52,565 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 11:14:52 BoogieIcfgContainer [2021-11-03 23:14:52,565 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-03 23:14:52,566 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-03 23:14:52,566 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-03 23:14:52,569 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-03 23:14:52,570 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 11:14:45" (1/3) ... [2021-11-03 23:14:52,571 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@448f97a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 11:14:52, skipping insertion in model container [2021-11-03 23:14:52,571 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 11:14:48" (2/3) ... [2021-11-03 23:14:52,573 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@448f97a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 11:14:52, skipping insertion in model container [2021-11-03 23:14:52,573 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 11:14:52" (3/3) ... [2021-11-03 23:14:52,575 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_hash_table_swap_harness.i [2021-11-03 23:14:52,579 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-03 23:14:52,579 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2021-11-03 23:14:52,620 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-03 23:14:52,625 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-03 23:14:52,625 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2021-11-03 23:14:52,644 INFO L276 IsEmpty]: Start isEmpty. Operand has 164 states, 159 states have (on average 1.3584905660377358) internal successors, (216), 163 states have internal predecessors, (216), 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-03 23:14:52,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-03 23:14:52,649 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 23:14:52,651 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 23:14:52,651 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-03 23:14:52,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 23:14:52,655 INFO L85 PathProgramCache]: Analyzing trace with hash 67832654, now seen corresponding path program 1 times [2021-11-03 23:14:52,661 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 23:14:52,661 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523481894] [2021-11-03 23:14:52,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 23:14:52,662 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 23:14:52,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 23:14:53,187 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-03 23:14:53,187 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 23:14:53,188 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523481894] [2021-11-03 23:14:53,189 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523481894] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 23:14:53,189 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 23:14:53,189 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-03 23:14:53,190 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139437011] [2021-11-03 23:14:53,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-03 23:14:53,197 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-03 23:14:53,198 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 23:14:53,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-03 23:14:53,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-03 23:14:53,218 INFO L87 Difference]: Start difference. First operand has 164 states, 159 states have (on average 1.3584905660377358) internal successors, (216), 163 states have internal predecessors, (216), 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 7.5) internal successors, (15), 2 states have internal predecessors, (15), 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-03 23:14:55,302 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-03 23:14:56,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 23:14:56,450 INFO L93 Difference]: Finished difference Result 323 states and 425 transitions. [2021-11-03 23:14:56,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-03 23:14:56,452 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 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 15 [2021-11-03 23:14:56,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 23:14:56,459 INFO L225 Difference]: With dead ends: 323 [2021-11-03 23:14:56,459 INFO L226 Difference]: Without dead ends: 158 [2021-11-03 23:14:56,461 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-03 23:14:56,463 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2853.97ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.49ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3159.63ms IncrementalHoareTripleChecker+Time [2021-11-03 23:14:56,464 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 197 Unknown, 0 Unchecked, 3.49ms Time], IncrementalHoareTripleChecker [0 Valid, 196 Invalid, 1 Unknown, 0 Unchecked, 3159.63ms Time] [2021-11-03 23:14:56,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2021-11-03 23:14:56,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2021-11-03 23:14:56,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 154 states have (on average 1.2337662337662338) internal successors, (190), 157 states have internal predecessors, (190), 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-03 23:14:56,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 190 transitions. [2021-11-03 23:14:56,497 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 190 transitions. Word has length 15 [2021-11-03 23:14:56,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 23:14:56,497 INFO L470 AbstractCegarLoop]: Abstraction has 158 states and 190 transitions. [2021-11-03 23:14:56,497 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 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-03 23:14:56,498 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 190 transitions. [2021-11-03 23:14:56,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-03 23:14:56,499 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 23:14:56,499 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 23:14:56,500 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-03 23:14:56,500 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-03 23:14:56,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 23:14:56,502 INFO L85 PathProgramCache]: Analyzing trace with hash -325194356, now seen corresponding path program 1 times [2021-11-03 23:14:56,503 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 23:14:56,503 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517867512] [2021-11-03 23:14:56,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 23:14:56,503 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 23:14:56,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 23:14:56,717 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-03 23:14:56,717 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 23:14:56,718 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517867512] [2021-11-03 23:14:56,718 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517867512] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 23:14:56,718 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 23:14:56,718 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-03 23:14:56,718 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102337625] [2021-11-03 23:14:56,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-03 23:14:56,719 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-03 23:14:56,719 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 23:14:56,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-03 23:14:56,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-03 23:14:56,721 INFO L87 Difference]: Start difference. First operand 158 states and 190 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-03 23:14:58,764 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-03 23:15:00,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 23:15:00,510 INFO L93 Difference]: Finished difference Result 270 states and 323 transitions. [2021-11-03 23:15:00,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-03 23:15:00,511 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 15 [2021-11-03 23:15:00,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 23:15:00,513 INFO L225 Difference]: With dead ends: 270 [2021-11-03 23:15:00,513 INFO L226 Difference]: Without dead ends: 238 [2021-11-03 23:15:00,514 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.96ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-03 23:15:00,514 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 91 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3340.04ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 9.10ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3725.53ms IncrementalHoareTripleChecker+Time [2021-11-03 23:15:00,515 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [91 Valid, 0 Invalid, 378 Unknown, 0 Unchecked, 9.10ms Time], IncrementalHoareTripleChecker [1 Valid, 376 Invalid, 1 Unknown, 0 Unchecked, 3725.53ms Time] [2021-11-03 23:15:00,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2021-11-03 23:15:00,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 222. [2021-11-03 23:15:00,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 218 states have (on average 1.224770642201835) internal successors, (267), 221 states have internal predecessors, (267), 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-03 23:15:00,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 267 transitions. [2021-11-03 23:15:00,533 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 267 transitions. Word has length 15 [2021-11-03 23:15:00,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 23:15:00,533 INFO L470 AbstractCegarLoop]: Abstraction has 222 states and 267 transitions. [2021-11-03 23:15:00,533 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-03 23:15:00,533 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 267 transitions. [2021-11-03 23:15:00,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-11-03 23:15:00,534 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 23:15:00,534 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 23:15:00,534 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-03 23:15:00,534 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-03 23:15:00,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 23:15:00,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1994950714, now seen corresponding path program 1 times [2021-11-03 23:15:00,535 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 23:15:00,535 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285066448] [2021-11-03 23:15:00,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 23:15:00,536 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 23:15:00,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 23:15:00,707 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-03 23:15:00,707 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 23:15:00,707 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285066448] [2021-11-03 23:15:00,707 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285066448] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 23:15:00,708 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 23:15:00,708 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-03 23:15:00,708 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834835642] [2021-11-03 23:15:00,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-03 23:15:00,708 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-03 23:15:00,708 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 23:15:00,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-03 23:15:00,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-03 23:15:00,709 INFO L87 Difference]: Start difference. First operand 222 states and 267 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-03 23:15:02,751 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-03 23:15:04,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 23:15:04,291 INFO L93 Difference]: Finished difference Result 262 states and 313 transitions. [2021-11-03 23:15:04,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-03 23:15:04,292 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 16 [2021-11-03 23:15:04,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 23:15:04,293 INFO L225 Difference]: With dead ends: 262 [2021-11-03 23:15:04,293 INFO L226 Difference]: Without dead ends: 241 [2021-11-03 23:15:04,293 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.06ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-03 23:15:04,294 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 20 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3185.28ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.18ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3540.28ms IncrementalHoareTripleChecker+Time [2021-11-03 23:15:04,295 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 0 Invalid, 378 Unknown, 0 Unchecked, 6.18ms Time], IncrementalHoareTripleChecker [0 Valid, 377 Invalid, 1 Unknown, 0 Unchecked, 3540.28ms Time] [2021-11-03 23:15:04,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2021-11-03 23:15:04,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 237. [2021-11-03 23:15:04,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 233 states have (on average 1.2231759656652361) internal successors, (285), 236 states have internal predecessors, (285), 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-03 23:15:04,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 285 transitions. [2021-11-03 23:15:04,311 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 285 transitions. Word has length 16 [2021-11-03 23:15:04,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 23:15:04,311 INFO L470 AbstractCegarLoop]: Abstraction has 237 states and 285 transitions. [2021-11-03 23:15:04,311 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-03 23:15:04,311 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 285 transitions. [2021-11-03 23:15:04,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-11-03 23:15:04,313 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 23:15:04,313 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] [2021-11-03 23:15:04,313 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-03 23:15:04,313 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-03 23:15:04,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 23:15:04,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1734286995, now seen corresponding path program 1 times [2021-11-03 23:15:04,314 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 23:15:04,314 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618634742] [2021-11-03 23:15:04,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 23:15:04,314 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 23:15:04,360 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-03 23:15:04,361 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1667473696] [2021-11-03 23:15:04,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 23:15:04,361 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 23:15:04,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-03 23:15:04,363 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-03 23:15:04,365 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-03 23:15:05,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 23:15:05,031 INFO L263 TraceCheckSpWp]: Trace formula consists of 2525 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-03 23:15:05,041 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 23:15:05,376 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-03 23:15:05,376 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-03 23:15:05,376 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 23:15:05,376 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618634742] [2021-11-03 23:15:05,376 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-03 23:15:05,377 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1667473696] [2021-11-03 23:15:05,377 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1667473696] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 23:15:05,377 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 23:15:05,377 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-03 23:15:05,377 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080644384] [2021-11-03 23:15:05,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-03 23:15:05,377 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-03 23:15:05,377 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 23:15:05,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-03 23:15:05,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-03 23:15:05,378 INFO L87 Difference]: Start difference. First operand 237 states and 285 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 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-03 23:15:07,486 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-03 23:15:10,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 23:15:10,083 INFO L93 Difference]: Finished difference Result 627 states and 755 transitions. [2021-11-03 23:15:10,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-03 23:15:10,083 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 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 50 [2021-11-03 23:15:10,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 23:15:10,085 INFO L225 Difference]: With dead ends: 627 [2021-11-03 23:15:10,085 INFO L226 Difference]: Without dead ends: 434 [2021-11-03 23:15:10,086 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 111.32ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-03 23:15:10,086 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 294 mSDsluCounter, 624 mSDsCounter, 0 mSdLazyCounter, 974 mSolverCounterSat, 20 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4340.84ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 995 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 11.27ms SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 974 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4585.72ms IncrementalHoareTripleChecker+Time [2021-11-03 23:15:10,087 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [294 Valid, 0 Invalid, 995 Unknown, 0 Unchecked, 11.27ms Time], IncrementalHoareTripleChecker [20 Valid, 974 Invalid, 1 Unknown, 0 Unchecked, 4585.72ms Time] [2021-11-03 23:15:10,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2021-11-03 23:15:10,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 255. [2021-11-03 23:15:10,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 251 states have (on average 1.207171314741036) internal successors, (303), 254 states have internal predecessors, (303), 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-03 23:15:10,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 303 transitions. [2021-11-03 23:15:10,104 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 303 transitions. Word has length 50 [2021-11-03 23:15:10,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 23:15:10,104 INFO L470 AbstractCegarLoop]: Abstraction has 255 states and 303 transitions. [2021-11-03 23:15:10,104 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 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-03 23:15:10,104 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 303 transitions. [2021-11-03 23:15:10,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-11-03 23:15:10,106 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 23:15:10,106 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-03 23:15:10,130 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-03 23:15:10,306 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 23:15:10,306 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-03 23:15:10,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 23:15:10,307 INFO L85 PathProgramCache]: Analyzing trace with hash -569476781, now seen corresponding path program 1 times [2021-11-03 23:15:10,307 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 23:15:10,307 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490637495] [2021-11-03 23:15:10,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 23:15:10,307 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 23:15:10,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 23:15:10,694 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-03 23:15:10,694 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 23:15:10,694 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490637495] [2021-11-03 23:15:10,694 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490637495] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 23:15:10,694 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 23:15:10,694 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-03 23:15:10,694 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065612754] [2021-11-03 23:15:10,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-03 23:15:10,695 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-03 23:15:10,695 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 23:15:10,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-03 23:15:10,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-11-03 23:15:10,695 INFO L87 Difference]: Start difference. First operand 255 states and 303 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 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-03 23:15:13,633 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.94s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-03 23:15:18,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 23:15:18,320 INFO L93 Difference]: Finished difference Result 454 states and 538 transitions. [2021-11-03 23:15:18,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-03 23:15:18,321 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 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-03 23:15:18,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 23:15:18,322 INFO L225 Difference]: With dead ends: 454 [2021-11-03 23:15:18,322 INFO L226 Difference]: Without dead ends: 308 [2021-11-03 23:15:18,322 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 478.30ms TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2021-11-03 23:15:18,323 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 260 mSDsluCounter, 965 mSDsCounter, 0 mSdLazyCounter, 1358 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6693.76ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 16.93ms SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1358 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7178.29ms IncrementalHoareTripleChecker+Time [2021-11-03 23:15:18,323 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [260 Valid, 0 Invalid, 1367 Unknown, 0 Unchecked, 16.93ms Time], IncrementalHoareTripleChecker [8 Valid, 1358 Invalid, 1 Unknown, 0 Unchecked, 7178.29ms Time] [2021-11-03 23:15:18,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2021-11-03 23:15:18,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 257. [2021-11-03 23:15:18,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 253 states have (on average 1.2055335968379446) internal successors, (305), 256 states have internal predecessors, (305), 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-03 23:15:18,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 305 transitions. [2021-11-03 23:15:18,332 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 305 transitions. Word has length 54 [2021-11-03 23:15:18,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 23:15:18,332 INFO L470 AbstractCegarLoop]: Abstraction has 257 states and 305 transitions. [2021-11-03 23:15:18,332 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 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-03 23:15:18,332 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 305 transitions. [2021-11-03 23:15:18,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-11-03 23:15:18,339 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 23:15:18,339 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-03 23:15:18,339 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-03 23:15:18,340 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-03 23:15:18,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 23:15:18,340 INFO L85 PathProgramCache]: Analyzing trace with hash 132123093, now seen corresponding path program 1 times [2021-11-03 23:15:18,340 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 23:15:18,340 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750376570] [2021-11-03 23:15:18,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 23:15:18,341 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 23:15:18,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 23:15:18,584 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-03 23:15:18,584 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 23:15:18,585 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750376570] [2021-11-03 23:15:18,585 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750376570] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 23:15:18,585 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 23:15:18,585 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-03 23:15:18,585 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823963276] [2021-11-03 23:15:18,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-03 23:15:18,585 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 23:15:18,585 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 23:15:18,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 23:15:18,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-03 23:15:18,586 INFO L87 Difference]: Start difference. First operand 257 states and 305 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 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-03 23:15:20,642 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-03 23:15:21,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 23:15:21,997 INFO L93 Difference]: Finished difference Result 406 states and 483 transitions. [2021-11-03 23:15:21,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-03 23:15:21,998 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 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-03 23:15:21,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 23:15:21,999 INFO L225 Difference]: With dead ends: 406 [2021-11-03 23:15:21,999 INFO L226 Difference]: Without dead ends: 255 [2021-11-03 23:15:22,000 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 45.76ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-03 23:15:22,000 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 162 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3013.30ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.97ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3359.38ms IncrementalHoareTripleChecker+Time [2021-11-03 23:15:22,000 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [162 Valid, 0 Invalid, 375 Unknown, 0 Unchecked, 3.97ms Time], IncrementalHoareTripleChecker [4 Valid, 370 Invalid, 1 Unknown, 0 Unchecked, 3359.38ms Time] [2021-11-03 23:15:22,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2021-11-03 23:15:22,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 255. [2021-11-03 23:15:22,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 251 states have (on average 1.1952191235059761) internal successors, (300), 254 states have internal predecessors, (300), 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-03 23:15:22,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 300 transitions. [2021-11-03 23:15:22,010 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 300 transitions. Word has length 54 [2021-11-03 23:15:22,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 23:15:22,010 INFO L470 AbstractCegarLoop]: Abstraction has 255 states and 300 transitions. [2021-11-03 23:15:22,011 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 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-03 23:15:22,011 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 300 transitions. [2021-11-03 23:15:22,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-11-03 23:15:22,012 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 23:15:22,012 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 23:15:22,012 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-03 23:15:22,012 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-03 23:15:22,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 23:15:22,013 INFO L85 PathProgramCache]: Analyzing trace with hash 844082519, now seen corresponding path program 1 times [2021-11-03 23:15:22,013 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 23:15:22,013 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933961093] [2021-11-03 23:15:22,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 23:15:22,013 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 23:15:22,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 23:15:22,342 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-03 23:15:22,342 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 23:15:22,342 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933961093] [2021-11-03 23:15:22,342 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933961093] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 23:15:22,342 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 23:15:22,342 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-03 23:15:22,342 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250060410] [2021-11-03 23:15:22,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-03 23:15:22,343 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-03 23:15:22,343 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 23:15:22,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-03 23:15:22,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-11-03 23:15:22,343 INFO L87 Difference]: Start difference. First operand 255 states and 300 transitions. Second operand has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 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-03 23:15:24,597 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.25s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-03 23:15:28,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 23:15:28,866 INFO L93 Difference]: Finished difference Result 401 states and 469 transitions. [2021-11-03 23:15:28,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-03 23:15:28,866 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 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 55 [2021-11-03 23:15:28,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 23:15:28,868 INFO L225 Difference]: With dead ends: 401 [2021-11-03 23:15:28,868 INFO L226 Difference]: Without dead ends: 303 [2021-11-03 23:15:28,868 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 468.06ms TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2021-11-03 23:15:28,869 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 313 mSDsluCounter, 762 mSDsCounter, 0 mSdLazyCounter, 1128 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5610.78ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 16.28ms SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1128 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6110.74ms IncrementalHoareTripleChecker+Time [2021-11-03 23:15:28,869 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [313 Valid, 0 Invalid, 1139 Unknown, 0 Unchecked, 16.28ms Time], IncrementalHoareTripleChecker [10 Valid, 1128 Invalid, 1 Unknown, 0 Unchecked, 6110.74ms Time] [2021-11-03 23:15:28,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2021-11-03 23:15:28,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 259. [2021-11-03 23:15:28,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 255 states have (on average 1.192156862745098) internal successors, (304), 258 states have internal predecessors, (304), 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-03 23:15:28,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 304 transitions. [2021-11-03 23:15:28,883 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 304 transitions. Word has length 55 [2021-11-03 23:15:28,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 23:15:28,884 INFO L470 AbstractCegarLoop]: Abstraction has 259 states and 304 transitions. [2021-11-03 23:15:28,884 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 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-03 23:15:28,884 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 304 transitions. [2021-11-03 23:15:28,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-11-03 23:15:28,885 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 23:15:28,885 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 23:15:28,885 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-03 23:15:28,885 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-03 23:15:28,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 23:15:28,886 INFO L85 PathProgramCache]: Analyzing trace with hash 1545682393, now seen corresponding path program 1 times [2021-11-03 23:15:28,886 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 23:15:28,886 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495368374] [2021-11-03 23:15:28,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 23:15:28,886 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 23:15:28,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 23:15:29,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 23:15:29,126 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 23:15:29,126 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495368374] [2021-11-03 23:15:29,126 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495368374] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 23:15:29,126 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 23:15:29,126 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-03 23:15:29,127 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580491363] [2021-11-03 23:15:29,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-03 23:15:29,127 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 23:15:29,127 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 23:15:29,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 23:15:29,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-03 23:15:29,127 INFO L87 Difference]: Start difference. First operand 259 states and 304 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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-03 23:15:32,014 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.89s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-03 23:15:33,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 23:15:33,319 INFO L93 Difference]: Finished difference Result 373 states and 438 transitions. [2021-11-03 23:15:33,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-03 23:15:33,320 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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 55 [2021-11-03 23:15:33,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 23:15:33,320 INFO L225 Difference]: With dead ends: 373 [2021-11-03 23:15:33,320 INFO L226 Difference]: Without dead ends: 255 [2021-11-03 23:15:33,321 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 41.78ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-03 23:15:33,321 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 159 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3801.62ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.65ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4155.71ms IncrementalHoareTripleChecker+Time [2021-11-03 23:15:33,321 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [159 Valid, 0 Invalid, 369 Unknown, 0 Unchecked, 2.65ms Time], IncrementalHoareTripleChecker [4 Valid, 364 Invalid, 1 Unknown, 0 Unchecked, 4155.71ms Time] [2021-11-03 23:15:33,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2021-11-03 23:15:33,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 255. [2021-11-03 23:15:33,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 251 states have (on average 1.1713147410358566) internal successors, (294), 254 states have internal predecessors, (294), 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-03 23:15:33,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 294 transitions. [2021-11-03 23:15:33,330 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 294 transitions. Word has length 55 [2021-11-03 23:15:33,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 23:15:33,330 INFO L470 AbstractCegarLoop]: Abstraction has 255 states and 294 transitions. [2021-11-03 23:15:33,331 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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-03 23:15:33,331 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 294 transitions. [2021-11-03 23:15:33,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-11-03 23:15:33,331 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 23:15:33,331 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 23:15:33,332 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-03 23:15:33,332 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-03 23:15:33,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 23:15:33,332 INFO L85 PathProgramCache]: Analyzing trace with hash 209502350, now seen corresponding path program 1 times [2021-11-03 23:15:33,332 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 23:15:33,333 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698149442] [2021-11-03 23:15:33,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 23:15:33,333 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 23:15:33,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 23:15:33,600 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-03 23:15:33,600 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 23:15:33,600 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698149442] [2021-11-03 23:15:33,600 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698149442] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 23:15:33,600 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 23:15:33,601 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-03 23:15:33,601 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947599422] [2021-11-03 23:15:33,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-03 23:15:33,601 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-03 23:15:33,601 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 23:15:33,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-03 23:15:33,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-03 23:15:33,601 INFO L87 Difference]: Start difference. First operand 255 states and 294 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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-03 23:15:35,640 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-03 23:15:38,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 23:15:38,171 INFO L93 Difference]: Finished difference Result 439 states and 506 transitions. [2021-11-03 23:15:38,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-03 23:15:38,172 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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 56 [2021-11-03 23:15:38,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 23:15:38,173 INFO L225 Difference]: With dead ends: 439 [2021-11-03 23:15:38,173 INFO L226 Difference]: Without dead ends: 258 [2021-11-03 23:15:38,173 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 319.60ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-03 23:15:38,174 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 171 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 663 mSolverCounterSat, 18 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3927.67ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.71ms SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 663 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4282.10ms IncrementalHoareTripleChecker+Time [2021-11-03 23:15:38,174 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [171 Valid, 0 Invalid, 682 Unknown, 0 Unchecked, 5.71ms Time], IncrementalHoareTripleChecker [18 Valid, 663 Invalid, 1 Unknown, 0 Unchecked, 4282.10ms Time] [2021-11-03 23:15:38,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2021-11-03 23:15:38,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 255. [2021-11-03 23:15:38,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 251 states have (on average 1.1474103585657371) internal successors, (288), 254 states have internal predecessors, (288), 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-03 23:15:38,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 288 transitions. [2021-11-03 23:15:38,185 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 288 transitions. Word has length 56 [2021-11-03 23:15:38,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 23:15:38,185 INFO L470 AbstractCegarLoop]: Abstraction has 255 states and 288 transitions. [2021-11-03 23:15:38,185 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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-03 23:15:38,186 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 288 transitions. [2021-11-03 23:15:38,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-11-03 23:15:38,186 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 23:15:38,186 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 23:15:38,186 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-03 23:15:38,187 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-03 23:15:38,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 23:15:38,187 INFO L85 PathProgramCache]: Analyzing trace with hash -693818886, now seen corresponding path program 1 times [2021-11-03 23:15:38,187 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 23:15:38,187 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047188430] [2021-11-03 23:15:38,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 23:15:38,188 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 23:15:38,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 23:15:40,491 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-03 23:15:40,491 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 23:15:40,492 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047188430] [2021-11-03 23:15:40,492 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047188430] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 23:15:40,492 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 23:15:40,492 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-11-03 23:15:40,492 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804857553] [2021-11-03 23:15:40,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-03 23:15:40,492 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-11-03 23:15:40,492 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 23:15:40,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-11-03 23:15:40,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2021-11-03 23:15:40,493 INFO L87 Difference]: Start difference. First operand 255 states and 288 transitions. Second operand has 20 states, 20 states have (on average 2.85) internal successors, (57), 20 states have internal predecessors, (57), 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-03 23:15:42,999 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.50s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-03 23:15:54,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 23:15:54,561 INFO L93 Difference]: Finished difference Result 336 states and 378 transitions. [2021-11-03 23:15:54,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-11-03 23:15:54,562 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.85) internal successors, (57), 20 states have internal predecessors, (57), 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 57 [2021-11-03 23:15:54,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 23:15:54,564 INFO L225 Difference]: With dead ends: 336 [2021-11-03 23:15:54,564 INFO L226 Difference]: Without dead ends: 327 [2021-11-03 23:15:54,565 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 3630.36ms TimeCoverageRelationStatistics Valid=218, Invalid=972, Unknown=0, NotChecked=0, Total=1190 [2021-11-03 23:15:54,565 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 397 mSDsluCounter, 1976 mSDsCounter, 0 mSdLazyCounter, 3196 mSolverCounterSat, 83 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10605.31ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 397 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 29.69ms SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 3196 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11455.37ms IncrementalHoareTripleChecker+Time [2021-11-03 23:15:54,566 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [397 Valid, 0 Invalid, 3280 Unknown, 0 Unchecked, 29.69ms Time], IncrementalHoareTripleChecker [83 Valid, 3196 Invalid, 1 Unknown, 0 Unchecked, 11455.37ms Time] [2021-11-03 23:15:54,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2021-11-03 23:15:54,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 275. [2021-11-03 23:15:54,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 271 states have (on average 1.151291512915129) internal successors, (312), 274 states have internal predecessors, (312), 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-03 23:15:54,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 312 transitions. [2021-11-03 23:15:54,578 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 312 transitions. Word has length 57 [2021-11-03 23:15:54,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 23:15:54,578 INFO L470 AbstractCegarLoop]: Abstraction has 275 states and 312 transitions. [2021-11-03 23:15:54,578 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.85) internal successors, (57), 20 states have internal predecessors, (57), 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-03 23:15:54,578 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 312 transitions. [2021-11-03 23:15:54,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-11-03 23:15:54,579 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 23:15:54,579 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 23:15:54,579 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-03 23:15:54,579 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-03 23:15:54,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 23:15:54,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1205998898, now seen corresponding path program 1 times [2021-11-03 23:15:54,580 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 23:15:54,580 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905113263] [2021-11-03 23:15:54,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 23:15:54,580 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 23:15:54,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 23:15:55,537 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-03 23:15:55,537 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 23:15:55,537 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905113263] [2021-11-03 23:15:55,537 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905113263] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 23:15:55,537 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 23:15:55,537 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-03 23:15:55,537 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416603715] [2021-11-03 23:15:55,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-03 23:15:55,538 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-03 23:15:55,538 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 23:15:55,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-03 23:15:55,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-11-03 23:15:55,538 INFO L87 Difference]: Start difference. First operand 275 states and 312 transitions. Second operand has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 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-03 23:15:58,318 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.78s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-03 23:16:04,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 23:16:04,684 INFO L93 Difference]: Finished difference Result 354 states and 396 transitions. [2021-11-03 23:16:04,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-03 23:16:04,685 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 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 58 [2021-11-03 23:16:04,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 23:16:04,686 INFO L225 Difference]: With dead ends: 354 [2021-11-03 23:16:04,686 INFO L226 Difference]: Without dead ends: 345 [2021-11-03 23:16:04,687 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 1414.93ms TimeCoverageRelationStatistics Valid=145, Invalid=455, Unknown=0, NotChecked=0, Total=600 [2021-11-03 23:16:04,687 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 455 mSDsluCounter, 1203 mSDsCounter, 0 mSdLazyCounter, 1771 mSolverCounterSat, 12 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7408.92ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 455 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 18.25ms SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1771 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8105.20ms IncrementalHoareTripleChecker+Time [2021-11-03 23:16:04,688 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [455 Valid, 0 Invalid, 1784 Unknown, 0 Unchecked, 18.25ms Time], IncrementalHoareTripleChecker [12 Valid, 1771 Invalid, 1 Unknown, 0 Unchecked, 8105.20ms Time] [2021-11-03 23:16:04,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2021-11-03 23:16:04,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 323. [2021-11-03 23:16:04,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 319 states have (on average 1.1598746081504703) internal successors, (370), 322 states have internal predecessors, (370), 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-03 23:16:04,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 370 transitions. [2021-11-03 23:16:04,716 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 370 transitions. Word has length 58 [2021-11-03 23:16:04,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 23:16:04,716 INFO L470 AbstractCegarLoop]: Abstraction has 323 states and 370 transitions. [2021-11-03 23:16:04,717 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 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-03 23:16:04,717 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 370 transitions. [2021-11-03 23:16:04,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-11-03 23:16:04,717 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 23:16:04,718 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 23:16:04,718 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-03 23:16:04,718 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-03 23:16:04,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 23:16:04,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1380900098, now seen corresponding path program 1 times [2021-11-03 23:16:04,719 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 23:16:04,719 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775309815] [2021-11-03 23:16:04,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 23:16:04,719 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 23:16:05,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 23:16:05,608 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-03 23:16:05,608 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 23:16:05,608 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775309815] [2021-11-03 23:16:05,608 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775309815] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 23:16:05,608 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 23:16:05,608 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-03 23:16:05,608 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584308381] [2021-11-03 23:16:05,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-03 23:16:05,608 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 23:16:05,608 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 23:16:05,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 23:16:05,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-03 23:16:05,609 INFO L87 Difference]: Start difference. First operand 323 states and 370 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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-03 23:16:07,649 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-03 23:16:09,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 23:16:09,405 INFO L93 Difference]: Finished difference Result 610 states and 695 transitions. [2021-11-03 23:16:09,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-03 23:16:09,406 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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 60 [2021-11-03 23:16:09,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 23:16:09,407 INFO L225 Difference]: With dead ends: 610 [2021-11-03 23:16:09,407 INFO L226 Difference]: Without dead ends: 323 [2021-11-03 23:16:09,407 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 69.72ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-03 23:16:09,407 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 4 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 13 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3432.56ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.28ms SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3727.72ms IncrementalHoareTripleChecker+Time [2021-11-03 23:16:09,408 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 0 Invalid, 543 Unknown, 0 Unchecked, 2.28ms Time], IncrementalHoareTripleChecker [13 Valid, 529 Invalid, 1 Unknown, 0 Unchecked, 3727.72ms Time] [2021-11-03 23:16:09,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2021-11-03 23:16:09,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 314. [2021-11-03 23:16:09,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 310 states have (on average 1.1161290322580646) internal successors, (346), 313 states have internal predecessors, (346), 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-03 23:16:09,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 346 transitions. [2021-11-03 23:16:09,419 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 346 transitions. Word has length 60 [2021-11-03 23:16:09,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 23:16:09,420 INFO L470 AbstractCegarLoop]: Abstraction has 314 states and 346 transitions. [2021-11-03 23:16:09,420 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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-03 23:16:09,420 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 346 transitions. [2021-11-03 23:16:09,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-11-03 23:16:09,420 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 23:16:09,421 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 23:16:09,421 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-03 23:16:09,421 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-03 23:16:09,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 23:16:09,421 INFO L85 PathProgramCache]: Analyzing trace with hash 778166894, now seen corresponding path program 1 times [2021-11-03 23:16:09,421 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 23:16:09,422 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068379850] [2021-11-03 23:16:09,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 23:16:09,422 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 23:16:09,468 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-03 23:16:09,468 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [52296264] [2021-11-03 23:16:09,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 23:16:09,468 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 23:16:09,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-03 23:16:09,469 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-03 23:16:09,470 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-03 23:16:10,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 23:16:10,130 INFO L263 TraceCheckSpWp]: Trace formula consists of 2717 conjuncts, 87 conjunts are in the unsatisfiable core [2021-11-03 23:16:10,137 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 23:16:11,446 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-03 23:16:11,465 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-03 23:16:11,476 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-03 23:16:11,773 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-03 23:16:11,887 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-03 23:16:12,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 23:16:12,509 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-03 23:16:12,509 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 23:16:12,509 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068379850] [2021-11-03 23:16:12,509 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-03 23:16:12,509 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [52296264] [2021-11-03 23:16:12,509 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [52296264] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 23:16:12,509 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 23:16:12,509 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-11-03 23:16:12,509 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620773563] [2021-11-03 23:16:12,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-03 23:16:12,510 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-03 23:16:12,510 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 23:16:12,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-03 23:16:12,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-11-03 23:16:12,510 INFO L87 Difference]: Start difference. First operand 314 states and 346 transitions. Second operand has 15 states, 15 states have (on average 4.2) internal successors, (63), 15 states have internal predecessors, (63), 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-03 23:16:15,313 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.80s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-03 23:16:21,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 23:16:21,710 INFO L93 Difference]: Finished difference Result 334 states and 366 transitions. [2021-11-03 23:16:21,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-03 23:16:21,711 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.2) internal successors, (63), 15 states have internal predecessors, (63), 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 63 [2021-11-03 23:16:21,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 23:16:21,712 INFO L225 Difference]: With dead ends: 334 [2021-11-03 23:16:21,712 INFO L226 Difference]: Without dead ends: 106 [2021-11-03 23:16:21,715 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 3177.62ms TimeCoverageRelationStatistics Valid=207, Invalid=495, Unknown=0, NotChecked=0, Total=702 [2021-11-03 23:16:21,718 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 175 mSDsluCounter, 836 mSDsCounter, 0 mSdLazyCounter, 1369 mSolverCounterSat, 21 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6260.32ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 10.06ms SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1369 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6807.00ms IncrementalHoareTripleChecker+Time [2021-11-03 23:16:21,719 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [175 Valid, 0 Invalid, 1391 Unknown, 0 Unchecked, 10.06ms Time], IncrementalHoareTripleChecker [21 Valid, 1369 Invalid, 1 Unknown, 0 Unchecked, 6807.00ms Time] [2021-11-03 23:16:21,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2021-11-03 23:16:21,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2021-11-03 23:16:21,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 104 states have (on average 1.0865384615384615) internal successors, (113), 105 states have internal predecessors, (113), 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-03 23:16:21,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 113 transitions. [2021-11-03 23:16:21,724 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 113 transitions. Word has length 63 [2021-11-03 23:16:21,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 23:16:21,724 INFO L470 AbstractCegarLoop]: Abstraction has 106 states and 113 transitions. [2021-11-03 23:16:21,724 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.2) internal successors, (63), 15 states have internal predecessors, (63), 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-03 23:16:21,724 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 113 transitions. [2021-11-03 23:16:21,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-11-03 23:16:21,725 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 23:16:21,725 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 23:16:21,747 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-11-03 23:16:21,931 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,SelfDestructingSolverStorable12 [2021-11-03 23:16:21,932 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-03 23:16:21,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 23:16:21,932 INFO L85 PathProgramCache]: Analyzing trace with hash -135931354, now seen corresponding path program 1 times [2021-11-03 23:16:21,932 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 23:16:21,932 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967771364] [2021-11-03 23:16:21,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 23:16:21,932 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 23:16:21,976 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-03 23:16:21,976 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [172700630] [2021-11-03 23:16:21,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 23:16:21,977 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 23:16:21,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-03 23:16:21,978 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-03 23:16:21,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-03 23:16:22,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 23:16:22,624 INFO L263 TraceCheckSpWp]: Trace formula consists of 2719 conjuncts, 83 conjunts are in the unsatisfiable core [2021-11-03 23:16:22,629 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 23:16:23,755 INFO L354 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2021-11-03 23:16:23,755 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 1 case distinctions, treesize of input 68 treesize of output 42 [2021-11-03 23:16:23,765 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 39 treesize of output 35 [2021-11-03 23:16:23,772 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 36 treesize of output 32 [2021-11-03 23:16:24,144 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 19 treesize of output 5 [2021-11-03 23:16:24,699 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-03 23:16:24,700 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-03 23:16:24,700 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 23:16:24,700 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967771364] [2021-11-03 23:16:24,700 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-03 23:16:24,700 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [172700630] [2021-11-03 23:16:24,700 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [172700630] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 23:16:24,700 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 23:16:24,700 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-11-03 23:16:24,700 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118388906] [2021-11-03 23:16:24,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-03 23:16:24,701 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-03 23:16:24,701 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 23:16:24,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-03 23:16:24,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2021-11-03 23:16:24,702 INFO L87 Difference]: Start difference. First operand 106 states and 113 transitions. Second operand has 15 states, 15 states have (on average 4.266666666666667) internal successors, (64), 15 states have internal predecessors, (64), 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-03 23:16:27,572 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.87s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-03 23:16:30,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 23:16:30,860 INFO L93 Difference]: Finished difference Result 106 states and 113 transitions. [2021-11-03 23:16:30,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-03 23:16:30,860 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.266666666666667) internal successors, (64), 15 states have internal predecessors, (64), 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 64 [2021-11-03 23:16:30,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 23:16:30,860 INFO L225 Difference]: With dead ends: 106 [2021-11-03 23:16:30,860 INFO L226 Difference]: Without dead ends: 0 [2021-11-03 23:16:30,861 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 2822.04ms TimeCoverageRelationStatistics Valid=208, Invalid=494, Unknown=0, NotChecked=0, Total=702 [2021-11-03 23:16:30,861 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 121 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 21 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3677.29ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.84ms SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4050.23ms IncrementalHoareTripleChecker+Time [2021-11-03 23:16:30,861 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [121 Valid, 0 Invalid, 371 Unknown, 0 Unchecked, 2.84ms Time], IncrementalHoareTripleChecker [21 Valid, 349 Invalid, 1 Unknown, 0 Unchecked, 4050.23ms Time] [2021-11-03 23:16:30,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-11-03 23:16:30,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-11-03 23:16:30,862 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-03 23:16:30,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-11-03 23:16:30,862 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 64 [2021-11-03 23:16:30,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 23:16:30,862 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-11-03 23:16:30,863 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.266666666666667) internal successors, (64), 15 states have internal predecessors, (64), 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-03 23:16:30,863 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-11-03 23:16:30,863 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-11-03 23:16:30,865 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2021-11-03 23:16:30,865 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2021-11-03 23:16:30,865 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2021-11-03 23:16:30,865 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2021-11-03 23:16:30,887 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2021-11-03 23:16:31,079 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 23:16:31,081 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-11-03 23:16:31,085 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:16:31,087 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:16:31,103 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:16:31,119 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:16:31,120 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:16:31,124 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:16:31,124 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:16:31,125 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:16:31,126 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:16:31,127 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:16:31,131 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:16:31,138 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:16:31,141 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:16:31,153 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:16:31,153 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:16:31,158 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:16:31,160 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:16:31,161 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:16:31,161 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:16:31,165 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:16:31,166 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:16:31,166 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:16:31,168 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:16:31,171 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:16:31,171 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:16:31,172 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:16:31,172 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:16:31,172 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:16:31,176 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:16:31,178 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:16:31,178 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:16:31,178 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:16:31,179 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:16:31,180 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:16:31,181 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:16:31,181 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:16:31,182 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:16:31,185 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:16:31,187 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:16:31,187 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:16:31,188 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:16:31,189 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:16:31,190 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:16:31,192 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:16:31,192 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:16:31,194 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:16:31,195 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:16:31,196 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:16:31,199 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:16:31,200 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:16:31,205 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:16:31,205 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:16:31,206 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:16:31,208 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:16:31,208 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:16:31,209 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:16:31,212 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:16:37,913 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_swap_harness_~#a~5.base|) |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.offset|))) (and |ULTIMATE.start_aws_hash_table_is_valid_#t~short1478| (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.offset| 0) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| 0)) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| |ULTIMATE.start_aws_hash_table_swap_harness_~#stored_byte_a~0.base|)) (= |ULTIMATE.start_bounded_malloc_#res.offset| 0) (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (< (+ .cse0 1) |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base|) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| ULTIMATE.start_aws_hash_table_is_valid_~map.base) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base) (= ULTIMATE.start_aws_hash_table_is_valid_~map.offset |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.offset|) (= (select (select |#memory_$Pointer$.offset| ULTIMATE.start_aws_hash_table_is_valid_~map.base) ULTIMATE.start_aws_hash_table_is_valid_~map.offset) 0) (= (select |#valid| |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base|) 1) (= ULTIMATE.start_hash_table_state_is_valid_~map.offset 0) (= |ULTIMATE.start_hash_table_state_is_valid_#res| 0) (< (+ |ULTIMATE.start_bounded_malloc_#res.base| 1) |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base|) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.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_~size_at_least_two~0 0) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 1) 0) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base|)) (or (= ULTIMATE.start_assume_abort_if_not_~cond 1) (= ULTIMATE.start_assume_abort_if_not_~cond 0)) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base| 0)) (<= (+ (select (select |#memory_int| .cse0) 40) 1) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base|) (not (= ULTIMATE.start_hash_table_state_is_valid_~map.base 0)) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.offset| |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.offset|) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 1) 0))) [2021-11-03 23:16:37,913 INFO L854 garLoopResultBuilder]: At program point L10044-1(lines 9999 10046) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base|) |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.offset|)) (.cse1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base|) |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.offset|))) (and (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base|) (= ULTIMATE.start_hash_table_state_is_valid_~map.offset .cse0) (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base|) |ULTIMATE.start_aws_hash_table_is_valid_#t~short1475| |ULTIMATE.start_aws_hash_table_is_valid_#t~short1478| (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| 0)) (<= (+ (select (select |#memory_int| .cse1) (+ 40 .cse0)) 1) 0) (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.offset| ULTIMATE.start_aws_hash_table_is_valid_~map.offset) (= .cse1 ULTIMATE.start_hash_table_state_is_valid_~map.base) (= |ULTIMATE.start_hash_table_state_is_valid_#res| 0) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (< (+ |ULTIMATE.start_bounded_malloc_#res.base| 1) |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base|) (= ULTIMATE.start_ensure_allocated_hash_table_~map.base |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base|) (= ULTIMATE.start_hash_table_state_is_valid_~size_at_least_two~0 0) (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_hash_table_is_valid_~map.base) ULTIMATE.start_aws_hash_table_is_valid_~map.offset) 0)) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 1) 0) (or (= ULTIMATE.start_assume_abort_if_not_~cond 1) (= ULTIMATE.start_assume_abort_if_not_~cond 0)) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base| 0)) (= ULTIMATE.start_aws_hash_table_swap_harness_~inita~0 (* 256 (div ULTIMATE.start_aws_hash_table_swap_harness_~inita~0 256))) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.offset| 0) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.offset| |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.offset|) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 1) 0) (= ULTIMATE.start_aws_hash_table_is_valid_~map.base |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base|) (< (+ .cse1 1) |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base|))) [2021-11-03 23:16:37,913 INFO L854 garLoopResultBuilder]: At program point L10044-2(lines 9999 10046) the Hoare annotation is: false [2021-11-03 23:16:37,913 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-03 23:16:37,914 INFO L854 garLoopResultBuilder]: At program point L10044-3(lines 9999 10046) the Hoare annotation is: false [2021-11-03 23:16:37,914 INFO L858 garLoopResultBuilder]: For program point L10144(lines 10114 10152) no Hoare annotation was computed. [2021-11-03 23:16:37,914 INFO L854 garLoopResultBuilder]: At program point L10112-3(lines 10101 10113) the Hoare annotation is: (and (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| 0)) (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (or (not (= ULTIMATE.start_hash_table_state_is_valid_~map.offset 0)) (not (= ULTIMATE.start_hash_table_state_is_valid_~map.base 0))) (<= (+ |ULTIMATE.start_hash_table_state_required_bytes_#res| 1) 0) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (= ULTIMATE.start_ensure_allocated_hash_table_~map.base |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base|) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base| 0)) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.offset| |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.offset|)) [2021-11-03 23:16:37,914 INFO L854 garLoopResultBuilder]: At program point L10112(lines 10101 10113) the Hoare annotation is: (let ((.cse0 (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| 0))) (.cse1 (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| |ULTIMATE.start_aws_hash_table_swap_harness_~#stored_byte_a~0.base|))) (.cse2 (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base|))) (.cse3 (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base)) (.cse4 (= (select |#valid| |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base|) 1)) (.cse5 (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset)) (.cse6 (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base|))) (.cse7 (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base| 0))) (.cse8 (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base|)) (.cse9 (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.offset| |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.offset|))) (or (and .cse0 .cse1 .cse2 (<= (+ |ULTIMATE.start_hash_table_state_required_bytes_#res| 1) 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.offset| 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 1) 0) .cse6 .cse7 .cse8 .cse9 (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 1) 0)))) [2021-11-03 23:16:37,914 INFO L854 garLoopResultBuilder]: At program point L10112-1(lines 10101 10113) the Hoare annotation is: (and (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| 0)) (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (or (not (= ULTIMATE.start_hash_table_state_is_valid_~map.offset 0)) (not (= ULTIMATE.start_hash_table_state_is_valid_~map.base 0))) (<= (+ |ULTIMATE.start_hash_table_state_required_bytes_#res| 1) 0) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base| 0)) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.offset| |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.offset|)) [2021-11-03 23:16:37,914 INFO L854 garLoopResultBuilder]: At program point L10112-2(lines 10101 10113) the Hoare annotation is: (let ((.cse1 (<= (+ |ULTIMATE.start_hash_table_state_required_bytes_#res| 1) 0)) (.cse0 (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| 0))) (.cse2 (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset)) (.cse3 (= ULTIMATE.start_ensure_allocated_hash_table_~map.base |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base|)) (.cse4 (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base| 0))) (.cse5 (= ULTIMATE.start_aws_hash_table_swap_harness_~inita~0 (* 256 (div ULTIMATE.start_aws_hash_table_swap_harness_~inita~0 256)))) (.cse6 (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.offset| |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.offset|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 (or (not (= ULTIMATE.start_hash_table_state_is_valid_~map.offset 0)) (not (= ULTIMATE.start_hash_table_state_is_valid_~map.base 0))) .cse1 .cse2 .cse3 .cse4 .cse6) (and (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base|) (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base|) .cse0 .cse2 .cse3 (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 1) 0) .cse4 .cse5 (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.offset| 0) .cse6 (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 1) 0)))) [2021-11-03 23:16:37,914 INFO L858 garLoopResultBuilder]: For program point L6809-1(lines 6809 6819) no Hoare annotation was computed. [2021-11-03 23:16:37,914 INFO L858 garLoopResultBuilder]: For program point L6809(lines 6809 6819) no Hoare annotation was computed. [2021-11-03 23:16:37,914 INFO L858 garLoopResultBuilder]: For program point L10114(lines 10114 10152) no Hoare annotation was computed. [2021-11-03 23:16:37,914 INFO L858 garLoopResultBuilder]: For program point L10148(lines 10148 10151) no Hoare annotation was computed. [2021-11-03 23:16:37,914 INFO L854 garLoopResultBuilder]: At program point L2617-1(lines 2613 2621) the Hoare annotation is: false [2021-11-03 23:16:37,914 INFO L854 garLoopResultBuilder]: At program point L2617(lines 2613 2621) the Hoare annotation is: (and (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.offset| 0) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| 0)) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| |ULTIMATE.start_aws_hash_table_swap_harness_~#stored_byte_a~0.base|)) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base|)) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base) (= (select (store |#valid| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base| 0) |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base|) 1) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 1) 0) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base|)) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base| 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base|) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.offset| |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.offset|) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 1) 0)) [2021-11-03 23:16:37,914 INFO L854 garLoopResultBuilder]: At program point L2617-3(lines 2613 2621) the Hoare annotation is: false [2021-11-03 23:16:37,914 INFO L854 garLoopResultBuilder]: At program point L2617-2(lines 2613 2621) the Hoare annotation is: (and (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base|) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| 0)) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| |ULTIMATE.start_aws_hash_table_swap_harness_~#stored_byte_a~0.base|)) (= (select |#valid| |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base|) 1) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (= ULTIMATE.start_ensure_allocated_hash_table_~map.base |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base|) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 1) 0) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base|)) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base| 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base|) (= ULTIMATE.start_aws_hash_table_swap_harness_~inita~0 (* 256 (div ULTIMATE.start_aws_hash_table_swap_harness_~inita~0 256))) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.offset| 0) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.offset| |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.offset|) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 1) 0)) [2021-11-03 23:16:37,914 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-03 23:16:37,915 INFO L854 garLoopResultBuilder]: At program point L6947-1(lines 6943 6948) the Hoare annotation is: (and (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base|) (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base|) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| 0)) (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (< (+ |ULTIMATE.start_bounded_malloc_#res.base| 1) |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base|) (= ULTIMATE.start_ensure_allocated_hash_table_~map.base |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base|) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 1) 0) (or (= ULTIMATE.start_assume_abort_if_not_~cond 1) (= ULTIMATE.start_assume_abort_if_not_~cond 0)) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base| 0)) (= ULTIMATE.start_aws_hash_table_swap_harness_~inita~0 (* 256 (div ULTIMATE.start_aws_hash_table_swap_harness_~inita~0 256))) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.offset| 0) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.offset| |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.offset|) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 1) 0)) [2021-11-03 23:16:37,915 INFO L854 garLoopResultBuilder]: At program point L6947(lines 6943 6948) the Hoare annotation is: (and (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.offset| 0) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| 0)) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| |ULTIMATE.start_aws_hash_table_swap_harness_~#stored_byte_a~0.base|)) (= |ULTIMATE.start_bounded_malloc_#res.offset| 0) (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base) (< (+ |ULTIMATE.start_bounded_malloc_#res.base| 1) |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base|) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 1) 0) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base|)) (= (select (store |#valid| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base| 0) |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base|) 1) (or (= ULTIMATE.start_assume_abort_if_not_~cond 1) (= ULTIMATE.start_assume_abort_if_not_~cond 0)) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base| 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base|) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.offset| |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.offset|) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 1) 0)) [2021-11-03 23:16:37,915 INFO L858 garLoopResultBuilder]: For program point L210(lines 210 212) no Hoare annotation was computed. [2021-11-03 23:16:37,915 INFO L858 garLoopResultBuilder]: For program point L210-1(lines 210 212) no Hoare annotation was computed. [2021-11-03 23:16:37,915 INFO L858 garLoopResultBuilder]: For program point L210-2(lines 210 212) no Hoare annotation was computed. [2021-11-03 23:16:37,915 INFO L858 garLoopResultBuilder]: For program point L210-3(lines 210 212) no Hoare annotation was computed. [2021-11-03 23:16:37,915 INFO L858 garLoopResultBuilder]: For program point L210-4(lines 210 212) no Hoare annotation was computed. [2021-11-03 23:16:37,915 INFO L858 garLoopResultBuilder]: For program point L210-5(lines 210 212) no Hoare annotation was computed. [2021-11-03 23:16:37,915 INFO L858 garLoopResultBuilder]: For program point L210-6(lines 210 212) no Hoare annotation was computed. [2021-11-03 23:16:37,915 INFO L858 garLoopResultBuilder]: For program point L210-7(lines 210 212) no Hoare annotation was computed. [2021-11-03 23:16:37,915 INFO L858 garLoopResultBuilder]: For program point L210-8(lines 210 212) no Hoare annotation was computed. [2021-11-03 23:16:37,916 INFO L858 garLoopResultBuilder]: For program point L210-9(lines 210 212) no Hoare annotation was computed. [2021-11-03 23:16:37,916 INFO L858 garLoopResultBuilder]: For program point L210-10(lines 210 212) no Hoare annotation was computed. [2021-11-03 23:16:37,916 INFO L858 garLoopResultBuilder]: For program point L210-11(lines 210 212) no Hoare annotation was computed. [2021-11-03 23:16:37,916 INFO L858 garLoopResultBuilder]: For program point L210-12(lines 210 212) no Hoare annotation was computed. [2021-11-03 23:16:37,916 INFO L858 garLoopResultBuilder]: For program point L210-13(lines 210 212) no Hoare annotation was computed. [2021-11-03 23:16:37,916 INFO L861 garLoopResultBuilder]: At program point L10153(line 10153) the Hoare annotation is: true [2021-11-03 23:16:37,916 INFO L858 garLoopResultBuilder]: For program point L210-14(lines 210 212) no Hoare annotation was computed. [2021-11-03 23:16:37,916 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-03 23:16:37,916 INFO L858 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2021-11-03 23:16:37,916 INFO L858 garLoopResultBuilder]: For program point L211-2(line 211) no Hoare annotation was computed. [2021-11-03 23:16:37,916 INFO L858 garLoopResultBuilder]: For program point L211-4(line 211) no Hoare annotation was computed. [2021-11-03 23:16:37,917 INFO L858 garLoopResultBuilder]: For program point L211-6(line 211) no Hoare annotation was computed. [2021-11-03 23:16:37,917 INFO L858 garLoopResultBuilder]: For program point L211-8(line 211) no Hoare annotation was computed. [2021-11-03 23:16:37,917 INFO L858 garLoopResultBuilder]: For program point L211-10(line 211) no Hoare annotation was computed. [2021-11-03 23:16:37,917 INFO L858 garLoopResultBuilder]: For program point L211-12(line 211) no Hoare annotation was computed. [2021-11-03 23:16:37,917 INFO L858 garLoopResultBuilder]: For program point L211-14(line 211) no Hoare annotation was computed. [2021-11-03 23:16:37,917 INFO L858 garLoopResultBuilder]: For program point L211-16(line 211) no Hoare annotation was computed. [2021-11-03 23:16:37,917 INFO L858 garLoopResultBuilder]: For program point L211-18(line 211) no Hoare annotation was computed. [2021-11-03 23:16:37,917 INFO L854 garLoopResultBuilder]: At program point L2590(lines 2586 2594) the Hoare annotation is: (and (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.offset| 0) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| 0)) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| |ULTIMATE.start_aws_hash_table_swap_harness_~#stored_byte_a~0.base|)) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base|)) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base) (= (select (store |#valid| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base| 0) |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base|) 1) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 1) 0) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base|)) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base| 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base|) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.offset| |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.offset|) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 1) 0)) [2021-11-03 23:16:37,917 INFO L858 garLoopResultBuilder]: For program point L211-20(line 211) no Hoare annotation was computed. [2021-11-03 23:16:37,917 INFO L854 garLoopResultBuilder]: At program point L2590-2(lines 2586 2594) the Hoare annotation is: (and (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base|) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| 0)) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| |ULTIMATE.start_aws_hash_table_swap_harness_~#stored_byte_a~0.base|)) (= (select |#valid| |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base|) 1) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (= ULTIMATE.start_ensure_allocated_hash_table_~map.base |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base|) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 1) 0) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base|)) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base| 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base|) (= ULTIMATE.start_aws_hash_table_swap_harness_~inita~0 (* 256 (div ULTIMATE.start_aws_hash_table_swap_harness_~inita~0 256))) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.offset| 0) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.offset| |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.offset|) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 1) 0)) [2021-11-03 23:16:37,918 INFO L858 garLoopResultBuilder]: For program point L211-22(line 211) no Hoare annotation was computed. [2021-11-03 23:16:37,918 INFO L854 garLoopResultBuilder]: At program point L2590-1(lines 2586 2594) the Hoare annotation is: false [2021-11-03 23:16:37,918 INFO L858 garLoopResultBuilder]: For program point L211-24(line 211) no Hoare annotation was computed. [2021-11-03 23:16:37,918 INFO L854 garLoopResultBuilder]: At program point L2590-3(lines 2586 2594) the Hoare annotation is: false [2021-11-03 23:16:37,918 INFO L858 garLoopResultBuilder]: For program point L211-26(line 211) no Hoare annotation was computed. [2021-11-03 23:16:37,918 INFO L858 garLoopResultBuilder]: For program point L211-28(line 211) no Hoare annotation was computed. [2021-11-03 23:16:37,918 INFO L858 garLoopResultBuilder]: For program point L9990-2(line 9990) no Hoare annotation was computed. [2021-11-03 23:16:37,918 INFO L858 garLoopResultBuilder]: For program point L9990-3(line 9990) no Hoare annotation was computed. [2021-11-03 23:16:37,918 INFO L858 garLoopResultBuilder]: For program point L9990(line 9990) no Hoare annotation was computed. [2021-11-03 23:16:37,919 INFO L858 garLoopResultBuilder]: For program point L9990-9(line 9990) no Hoare annotation was computed. [2021-11-03 23:16:37,919 INFO L858 garLoopResultBuilder]: For program point L9990-10(line 9990) no Hoare annotation was computed. [2021-11-03 23:16:37,919 INFO L858 garLoopResultBuilder]: For program point L9990-12(line 9990) no Hoare annotation was computed. [2021-11-03 23:16:37,919 INFO L858 garLoopResultBuilder]: For program point L9990-5(line 9990) no Hoare annotation was computed. [2021-11-03 23:16:37,919 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_swap_harness_~#a~5.base|) |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.offset|))) (and (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.offset| 0) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| 0)) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| |ULTIMATE.start_aws_hash_table_swap_harness_~#stored_byte_a~0.base|)) (= |ULTIMATE.start_bounded_malloc_#res.offset| 0) (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (< (+ .cse0 1) |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base|) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| ULTIMATE.start_aws_hash_table_is_valid_~map.base) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base) (= |ULTIMATE.start_aws_hash_table_is_valid_#res| 0) (= ULTIMATE.start_aws_hash_table_is_valid_~map.offset |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.offset|) (= (select (select |#memory_$Pointer$.offset| ULTIMATE.start_aws_hash_table_is_valid_~map.base) ULTIMATE.start_aws_hash_table_is_valid_~map.offset) 0) (= (select |#valid| |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base|) 1) (= ULTIMATE.start_hash_table_state_is_valid_~map.offset 0) (= |ULTIMATE.start_hash_table_state_is_valid_#res| 0) (< (+ |ULTIMATE.start_bounded_malloc_#res.base| 1) |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base|) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.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_~size_at_least_two~0 0) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 1) 0) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base|)) (or (= ULTIMATE.start_assume_abort_if_not_~cond 1) (= ULTIMATE.start_assume_abort_if_not_~cond 0)) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base| 0)) (<= (+ (select (select |#memory_int| .cse0) 40) 1) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base|) (not (= ULTIMATE.start_hash_table_state_is_valid_~map.base 0)) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.offset| |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.offset|) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 1) 0))) [2021-11-03 23:16:37,919 INFO L858 garLoopResultBuilder]: For program point L9990-7(line 9990) no Hoare annotation was computed. [2021-11-03 23:16:37,919 INFO L858 garLoopResultBuilder]: For program point L9990-17(line 9990) no Hoare annotation was computed. [2021-11-03 23:16:37,919 INFO L858 garLoopResultBuilder]: For program point L9990-19(line 9990) no Hoare annotation was computed. [2021-11-03 23:16:37,919 INFO L854 garLoopResultBuilder]: At program point L9990-20(lines 9988 9991) the Hoare annotation is: false [2021-11-03 23:16:37,920 INFO L854 garLoopResultBuilder]: At program point L9990-13(lines 9988 9991) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base|) |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.offset|)) (.cse1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base|) |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.offset|))) (and (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base|) (= ULTIMATE.start_hash_table_state_is_valid_~map.offset .cse0) (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base|) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| 0)) (<= (+ (select (select |#memory_int| .cse1) (+ 40 .cse0)) 1) 0) (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.offset| ULTIMATE.start_aws_hash_table_is_valid_~map.offset) (= |ULTIMATE.start_aws_hash_table_is_valid_#res| 0) (= .cse1 ULTIMATE.start_hash_table_state_is_valid_~map.base) (= |ULTIMATE.start_hash_table_state_is_valid_#res| 0) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (< (+ |ULTIMATE.start_bounded_malloc_#res.base| 1) |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base|) (= ULTIMATE.start_ensure_allocated_hash_table_~map.base |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base|) (= ULTIMATE.start_hash_table_state_is_valid_~size_at_least_two~0 0) (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_hash_table_is_valid_~map.base) ULTIMATE.start_aws_hash_table_is_valid_~map.offset) 0)) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 1) 0) (or (= ULTIMATE.start_assume_abort_if_not_~cond 1) (= ULTIMATE.start_assume_abort_if_not_~cond 0)) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base| 0)) (= ULTIMATE.start_aws_hash_table_swap_harness_~inita~0 (* 256 (div ULTIMATE.start_aws_hash_table_swap_harness_~inita~0 256))) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.offset| 0) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.offset| |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.offset|) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 1) 0) (= ULTIMATE.start_aws_hash_table_is_valid_~map.base |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base|) (< (+ .cse1 1) |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base|))) [2021-11-03 23:16:37,920 INFO L858 garLoopResultBuilder]: For program point L9990-14(line 9990) no Hoare annotation was computed. [2021-11-03 23:16:37,920 INFO L858 garLoopResultBuilder]: For program point L9990-16(line 9990) no Hoare annotation was computed. [2021-11-03 23:16:37,920 INFO L858 garLoopResultBuilder]: For program point L9990-26(line 9990) no Hoare annotation was computed. [2021-11-03 23:16:37,920 INFO L854 garLoopResultBuilder]: At program point L9990-27(lines 9988 9991) the Hoare annotation is: false [2021-11-03 23:16:37,920 INFO L858 garLoopResultBuilder]: For program point L9990-21(line 9990) no Hoare annotation was computed. [2021-11-03 23:16:37,920 INFO L858 garLoopResultBuilder]: For program point L9990-23(line 9990) no Hoare annotation was computed. [2021-11-03 23:16:37,920 INFO L858 garLoopResultBuilder]: For program point L9990-24(line 9990) no Hoare annotation was computed. [2021-11-03 23:16:37,920 INFO L854 garLoopResultBuilder]: At program point L1998(lines 1988 1999) the Hoare annotation is: (and (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.offset| 0) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| 0)) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| |ULTIMATE.start_aws_hash_table_swap_harness_~#stored_byte_a~0.base|)) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base|)) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base) (= (select (store |#valid| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base| 0) |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base|) 1) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 1) 0) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base|)) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base| 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base|) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.offset| |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.offset|) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 1) 0)) [2021-11-03 23:16:37,921 INFO L854 garLoopResultBuilder]: At program point L1998-1(lines 1988 1999) the Hoare annotation is: (and (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.offset| 0) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| 0)) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| |ULTIMATE.start_aws_hash_table_swap_harness_~#stored_byte_a~0.base|)) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base|)) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base) (= (select (store |#valid| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base| 0) |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base|) 1) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 1) 0) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base|)) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base| 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base|) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.offset| |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.offset|) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 1) 0)) [2021-11-03 23:16:37,921 INFO L854 garLoopResultBuilder]: At program point L1998-2(lines 1988 1999) the Hoare annotation is: false [2021-11-03 23:16:37,921 INFO L854 garLoopResultBuilder]: At program point L1998-3(lines 1988 1999) the Hoare annotation is: false [2021-11-03 23:16:37,921 INFO L854 garLoopResultBuilder]: At program point L1998-4(lines 1988 1999) the Hoare annotation is: (and (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base|) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| 0)) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| |ULTIMATE.start_aws_hash_table_swap_harness_~#stored_byte_a~0.base|)) (= (select |#valid| |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base|) 1) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (= ULTIMATE.start_ensure_allocated_hash_table_~map.base |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base|) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 1) 0) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base|)) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base| 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base|) (= ULTIMATE.start_aws_hash_table_swap_harness_~inita~0 (* 256 (div ULTIMATE.start_aws_hash_table_swap_harness_~inita~0 256))) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.offset| 0) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.offset| |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.offset|) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 1) 0)) [2021-11-03 23:16:37,921 INFO L854 garLoopResultBuilder]: At program point L1998-5(lines 1988 1999) the Hoare annotation is: (and (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base|) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| 0)) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| |ULTIMATE.start_aws_hash_table_swap_harness_~#stored_byte_a~0.base|)) (= (select |#valid| |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base|) 1) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (= ULTIMATE.start_ensure_allocated_hash_table_~map.base |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base|) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 1) 0) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base|)) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base| 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base|) (= ULTIMATE.start_aws_hash_table_swap_harness_~inita~0 (* 256 (div ULTIMATE.start_aws_hash_table_swap_harness_~inita~0 256))) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.offset| 0) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.offset| |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.offset|) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 1) 0)) [2021-11-03 23:16:37,921 INFO L854 garLoopResultBuilder]: At program point L1998-6(lines 1988 1999) the Hoare annotation is: false [2021-11-03 23:16:37,922 INFO L854 garLoopResultBuilder]: At program point L1998-7(lines 1988 1999) the Hoare annotation is: false [2021-11-03 23:16:37,922 INFO L854 garLoopResultBuilder]: At program point L250(lines 248 251) the Hoare annotation is: (and (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.offset| 0) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| 0)) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| |ULTIMATE.start_aws_hash_table_swap_harness_~#stored_byte_a~0.base|)) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base|)) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base) (= (select (store |#valid| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base| 0) |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base|) 1) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 1) 0) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base|)) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base| 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base|) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.offset| |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.offset|) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 1) 0)) [2021-11-03 23:16:37,922 INFO L854 garLoopResultBuilder]: At program point L250-1(lines 248 251) the Hoare annotation is: false [2021-11-03 23:16:37,922 INFO L858 garLoopResultBuilder]: For program point L7385-3(lines 7385 7387) no Hoare annotation was computed. [2021-11-03 23:16:37,922 INFO L858 garLoopResultBuilder]: For program point L7385-2(lines 7385 7387) no Hoare annotation was computed. [2021-11-03 23:16:37,922 INFO L854 garLoopResultBuilder]: At program point L250-2(lines 248 251) the Hoare annotation is: (and (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base|) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| 0)) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| |ULTIMATE.start_aws_hash_table_swap_harness_~#stored_byte_a~0.base|)) (= (select |#valid| |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base|) 1) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (= ULTIMATE.start_ensure_allocated_hash_table_~map.base |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base|) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 1) 0) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base|)) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base| 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base|) (= ULTIMATE.start_aws_hash_table_swap_harness_~inita~0 (* 256 (div ULTIMATE.start_aws_hash_table_swap_harness_~inita~0 256))) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.offset| 0) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.offset| |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.offset|) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 1) 0)) [2021-11-03 23:16:37,922 INFO L858 garLoopResultBuilder]: For program point L7385-1(lines 7385 7387) no Hoare annotation was computed. [2021-11-03 23:16:37,922 INFO L854 garLoopResultBuilder]: At program point L250-3(lines 248 251) the Hoare annotation is: false [2021-11-03 23:16:37,922 INFO L858 garLoopResultBuilder]: For program point L7385(lines 7385 7387) no Hoare annotation was computed. [2021-11-03 23:16:37,923 INFO L858 garLoopResultBuilder]: For program point L7385-7(lines 7385 7387) no Hoare annotation was computed. [2021-11-03 23:16:37,923 INFO L858 garLoopResultBuilder]: For program point L7385-6(lines 7385 7387) no Hoare annotation was computed. [2021-11-03 23:16:37,923 INFO L858 garLoopResultBuilder]: For program point L7385-5(lines 7385 7387) no Hoare annotation was computed. [2021-11-03 23:16:37,923 INFO L858 garLoopResultBuilder]: For program point L7385-4(lines 7385 7387) no Hoare annotation was computed. [2021-11-03 23:16:37,923 INFO L858 garLoopResultBuilder]: For program point L10127(lines 10127 10133) no Hoare annotation was computed. [2021-11-03 23:16:37,923 INFO L858 garLoopResultBuilder]: For program point L10127-1(lines 10114 10152) no Hoare annotation was computed. [2021-11-03 23:16:37,923 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-11-03 23:16:37,923 INFO L854 garLoopResultBuilder]: At program point L2630(lines 2626 2631) the Hoare annotation is: (and (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.offset| 0) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| 0)) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| |ULTIMATE.start_aws_hash_table_swap_harness_~#stored_byte_a~0.base|)) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base) (= (select |#valid| |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base|) 1) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 1) 0) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base|)) (or (= ULTIMATE.start_assume_abort_if_not_~cond 1) (= ULTIMATE.start_assume_abort_if_not_~cond 0)) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base| 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base|) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.offset| |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.offset|) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 1) 0)) [2021-11-03 23:16:37,924 INFO L854 garLoopResultBuilder]: At program point L2630-2(lines 2626 2631) the Hoare annotation is: (and (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base|) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| 0)) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| |ULTIMATE.start_aws_hash_table_swap_harness_~#stored_byte_a~0.base|)) (= (select |#valid| |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base|) 1) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (= ULTIMATE.start_ensure_allocated_hash_table_~map.base |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base|) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 1) 0) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base|)) (or (= ULTIMATE.start_assume_abort_if_not_~cond 1) (= ULTIMATE.start_assume_abort_if_not_~cond 0)) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base| 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base|) (= ULTIMATE.start_aws_hash_table_swap_harness_~inita~0 (* 256 (div ULTIMATE.start_aws_hash_table_swap_harness_~inita~0 256))) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.offset| 0) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.offset| |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.offset|) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 1) 0)) [2021-11-03 23:16:37,924 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_swap_harness_~#a~5.base|) |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.offset|))) (and |ULTIMATE.start_aws_hash_table_is_valid_#t~short1478| (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.offset| 0) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| 0)) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| |ULTIMATE.start_aws_hash_table_swap_harness_~#stored_byte_a~0.base|)) (= |ULTIMATE.start_bounded_malloc_#res.offset| 0) (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (< (+ .cse0 1) |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base|) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| ULTIMATE.start_aws_hash_table_is_valid_~map.base) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base) (= ULTIMATE.start_aws_hash_table_is_valid_~map.offset |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.offset|) (= (select (select |#memory_$Pointer$.offset| ULTIMATE.start_aws_hash_table_is_valid_~map.base) ULTIMATE.start_aws_hash_table_is_valid_~map.offset) 0) (= (select |#valid| |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base|) 1) (= ULTIMATE.start_hash_table_state_is_valid_~map.offset 0) (< (+ |ULTIMATE.start_bounded_malloc_#res.base| 1) |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base|) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.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_~size_at_least_two~0 0) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 1) 0) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base|)) (or (= ULTIMATE.start_assume_abort_if_not_~cond 1) (= ULTIMATE.start_assume_abort_if_not_~cond 0)) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base| 0)) (<= (+ (select (select |#memory_int| .cse0) 40) 1) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base|) (not (= ULTIMATE.start_hash_table_state_is_valid_~map.base 0)) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.offset| |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.offset|) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 1) 0))) [2021-11-03 23:16:37,924 INFO L858 garLoopResultBuilder]: For program point L2498(lines 2498 2499) no Hoare annotation was computed. [2021-11-03 23:16:37,924 INFO L854 garLoopResultBuilder]: At program point L2630-4(lines 2626 2631) the Hoare annotation is: false [2021-11-03 23:16:37,924 INFO L854 garLoopResultBuilder]: At program point L2630-3(lines 2626 2631) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base|) |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.offset|)) (.cse1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base|) |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.offset|))) (and (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base|) (= ULTIMATE.start_hash_table_state_is_valid_~map.offset .cse0) (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base|) |ULTIMATE.start_aws_hash_table_is_valid_#t~short1475| |ULTIMATE.start_aws_hash_table_is_valid_#t~short1478| (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| 0)) (<= (+ (select (select |#memory_int| .cse1) (+ 40 .cse0)) 1) 0) (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.offset| ULTIMATE.start_aws_hash_table_is_valid_~map.offset) (= .cse1 ULTIMATE.start_hash_table_state_is_valid_~map.base) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (< (+ |ULTIMATE.start_bounded_malloc_#res.base| 1) |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base|) (= ULTIMATE.start_ensure_allocated_hash_table_~map.base |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base|) (= ULTIMATE.start_hash_table_state_is_valid_~size_at_least_two~0 0) (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_hash_table_is_valid_~map.base) ULTIMATE.start_aws_hash_table_is_valid_~map.offset) 0)) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 1) 0) (or (= ULTIMATE.start_assume_abort_if_not_~cond 1) (= ULTIMATE.start_assume_abort_if_not_~cond 0)) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base| 0)) (= ULTIMATE.start_aws_hash_table_swap_harness_~inita~0 (* 256 (div ULTIMATE.start_aws_hash_table_swap_harness_~inita~0 256))) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.offset| 0) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.offset| |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.offset|) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 1) 0) (= ULTIMATE.start_aws_hash_table_is_valid_~map.base |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base|) (< (+ .cse1 1) |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base|))) [2021-11-03 23:16:37,924 INFO L858 garLoopResultBuilder]: For program point L2498-2(lines 2498 2499) no Hoare annotation was computed. [2021-11-03 23:16:37,924 INFO L858 garLoopResultBuilder]: For program point L2498-1(lines 2498 2499) no Hoare annotation was computed. [2021-11-03 23:16:37,925 INFO L854 garLoopResultBuilder]: At program point L2630-5(lines 2626 2631) the Hoare annotation is: false [2021-11-03 23:16:37,925 INFO L858 garLoopResultBuilder]: For program point L2498-3(lines 2498 2499) no Hoare annotation was computed. [2021-11-03 23:16:37,925 INFO L854 garLoopResultBuilder]: At program point L2501-1(lines 2497 2502) the Hoare annotation is: false [2021-11-03 23:16:37,925 INFO L854 garLoopResultBuilder]: At program point L2501(lines 2497 2502) the Hoare annotation is: (and (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.offset| 0) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| 0)) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| |ULTIMATE.start_aws_hash_table_swap_harness_~#stored_byte_a~0.base|)) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base|)) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base) (= (select (store |#valid| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base| 0) |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base|) 1) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 1) 0) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base|)) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base| 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base|) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.offset| |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.offset|) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 1) 0)) [2021-11-03 23:16:37,925 INFO L854 garLoopResultBuilder]: At program point L2501-3(lines 2497 2502) the Hoare annotation is: false [2021-11-03 23:16:37,925 INFO L854 garLoopResultBuilder]: At program point L2501-2(lines 2497 2502) the Hoare annotation is: (and (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base|) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| 0)) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| |ULTIMATE.start_aws_hash_table_swap_harness_~#stored_byte_a~0.base|)) (= (select |#valid| |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base|) 1) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (= ULTIMATE.start_ensure_allocated_hash_table_~map.base |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base|) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 1) 0) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base|)) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base| 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base|) (= ULTIMATE.start_aws_hash_table_swap_harness_~inita~0 (* 256 (div ULTIMATE.start_aws_hash_table_swap_harness_~inita~0 256))) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.offset| 0) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.offset| |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.offset|) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 1) 0)) [2021-11-03 23:16:37,925 INFO L854 garLoopResultBuilder]: At program point L255(lines 253 256) the Hoare annotation is: (and (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.offset| 0) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| 0)) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| |ULTIMATE.start_aws_hash_table_swap_harness_~#stored_byte_a~0.base|)) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base|)) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base) (= (select (store |#valid| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base| 0) |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base|) 1) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 1) 0) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base|)) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base| 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base|) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.offset| |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.offset|) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 1) 0)) [2021-11-03 23:16:37,925 INFO L854 garLoopResultBuilder]: At program point L255-1(lines 253 256) the Hoare annotation is: false [2021-11-03 23:16:37,925 INFO L858 garLoopResultBuilder]: For program point L222(lines 222 224) no Hoare annotation was computed. [2021-11-03 23:16:37,925 INFO L854 garLoopResultBuilder]: At program point L255-2(lines 253 256) the Hoare annotation is: (and (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base|) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| 0)) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| |ULTIMATE.start_aws_hash_table_swap_harness_~#stored_byte_a~0.base|)) (= (select |#valid| |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base|) 1) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (= ULTIMATE.start_ensure_allocated_hash_table_~map.base |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base|) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 1) 0) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base|)) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base| 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base|) (= ULTIMATE.start_aws_hash_table_swap_harness_~inita~0 (* 256 (div ULTIMATE.start_aws_hash_table_swap_harness_~inita~0 256))) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.offset| 0) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.offset| |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.offset|) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 1) 0)) [2021-11-03 23:16:37,926 INFO L858 garLoopResultBuilder]: For program point L222-1(lines 222 224) no Hoare annotation was computed. [2021-11-03 23:16:37,926 INFO L854 garLoopResultBuilder]: At program point L255-3(lines 253 256) the Hoare annotation is: false [2021-11-03 23:16:37,926 INFO L858 garLoopResultBuilder]: For program point L222-2(lines 222 224) no Hoare annotation was computed. [2021-11-03 23:16:37,926 INFO L858 garLoopResultBuilder]: For program point L222-3(lines 222 224) no Hoare annotation was computed. [2021-11-03 23:16:37,926 INFO L858 garLoopResultBuilder]: For program point L9273(lines 10144 10147) no Hoare annotation was computed. [2021-11-03 23:16:37,926 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-11-03 23:16:37,926 INFO L858 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2021-11-03 23:16:37,926 INFO L858 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2021-11-03 23:16:37,926 INFO L858 garLoopResultBuilder]: For program point L223-3(line 223) no Hoare annotation was computed. [2021-11-03 23:16:37,926 INFO L858 garLoopResultBuilder]: For program point L223-4(line 223) no Hoare annotation was computed. [2021-11-03 23:16:37,926 INFO L858 garLoopResultBuilder]: For program point L223-6(line 223) no Hoare annotation was computed. [2021-11-03 23:16:37,926 INFO L858 garLoopResultBuilder]: For program point L223-7(line 223) no Hoare annotation was computed. [2021-11-03 23:16:37,926 INFO L858 garLoopResultBuilder]: For program point L223-9(line 223) no Hoare annotation was computed. [2021-11-03 23:16:37,926 INFO L858 garLoopResultBuilder]: For program point L223-10(line 223) no Hoare annotation was computed. [2021-11-03 23:16:37,926 INFO L858 garLoopResultBuilder]: For program point L10001(lines 10001 10005) no Hoare annotation was computed. [2021-11-03 23:16:37,927 INFO L858 garLoopResultBuilder]: For program point L10001-1(lines 10001 10005) no Hoare annotation was computed. [2021-11-03 23:16:37,927 INFO L858 garLoopResultBuilder]: For program point L10001-2(lines 10001 10005) no Hoare annotation was computed. [2021-11-03 23:16:37,927 INFO L858 garLoopResultBuilder]: For program point L10001-3(lines 10001 10005) no Hoare annotation was computed. [2021-11-03 23:16:37,927 INFO L858 garLoopResultBuilder]: For program point L7195-1(lines 7195 7201) no Hoare annotation was computed. [2021-11-03 23:16:37,927 INFO L858 garLoopResultBuilder]: For program point L7195(lines 7195 7201) no Hoare annotation was computed. [2021-11-03 23:16:37,927 INFO L858 garLoopResultBuilder]: For program point L10135(lines 10135 10141) no Hoare annotation was computed. [2021-11-03 23:16:37,927 INFO L858 garLoopResultBuilder]: For program point L7196-2(lines 7196 7200) no Hoare annotation was computed. [2021-11-03 23:16:37,927 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-11-03 23:16:37,927 INFO L858 garLoopResultBuilder]: For program point L7196(lines 7196 7200) no Hoare annotation was computed. [2021-11-03 23:16:37,927 INFO L858 garLoopResultBuilder]: For program point L10104-3(lines 10104 10106) no Hoare annotation was computed. [2021-11-03 23:16:37,927 INFO L858 garLoopResultBuilder]: For program point L10104(lines 10104 10106) no Hoare annotation was computed. [2021-11-03 23:16:37,927 INFO L858 garLoopResultBuilder]: For program point L10104-1(lines 10104 10106) no Hoare annotation was computed. [2021-11-03 23:16:37,927 INFO L858 garLoopResultBuilder]: For program point L10104-2(lines 10104 10106) no Hoare annotation was computed. [2021-11-03 23:16:37,927 INFO L858 garLoopResultBuilder]: For program point L2542(lines 2542 2543) no Hoare annotation was computed. [2021-11-03 23:16:37,927 INFO L858 garLoopResultBuilder]: For program point L2542-2(lines 2542 2543) no Hoare annotation was computed. [2021-11-03 23:16:37,927 INFO L858 garLoopResultBuilder]: For program point L2542-1(lines 2542 2543) no Hoare annotation was computed. [2021-11-03 23:16:37,927 INFO L858 garLoopResultBuilder]: For program point L2542-3(lines 2542 2543) no Hoare annotation was computed. [2021-11-03 23:16:37,927 INFO L854 garLoopResultBuilder]: At program point L263(line 263) the Hoare annotation is: false [2021-11-03 23:16:37,927 INFO L854 garLoopResultBuilder]: At program point L263-1(line 263) the Hoare annotation is: false [2021-11-03 23:16:37,927 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-11-03 23:16:37,927 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-03 23:16:37,928 INFO L858 garLoopResultBuilder]: For program point L10108(lines 10108 10110) no Hoare annotation was computed. [2021-11-03 23:16:37,928 INFO L858 garLoopResultBuilder]: For program point L10108-1(lines 10108 10110) no Hoare annotation was computed. [2021-11-03 23:16:37,928 INFO L858 garLoopResultBuilder]: For program point L10108-2(lines 10108 10110) no Hoare annotation was computed. [2021-11-03 23:16:37,928 INFO L858 garLoopResultBuilder]: For program point L10108-3(lines 10108 10110) no Hoare annotation was computed. [2021-11-03 23:16:37,928 INFO L854 garLoopResultBuilder]: At program point L2545-1(lines 2541 2546) the Hoare annotation is: false [2021-11-03 23:16:37,928 INFO L854 garLoopResultBuilder]: At program point L2545(lines 2541 2546) the Hoare annotation is: (and (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.offset| 0) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| 0)) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| |ULTIMATE.start_aws_hash_table_swap_harness_~#stored_byte_a~0.base|)) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base|)) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base) (= (select (store |#valid| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base| 0) |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base|) 1) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 1) 0) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base|)) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base| 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base|) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.offset| |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.offset|) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 1) 0)) [2021-11-03 23:16:37,928 INFO L854 garLoopResultBuilder]: At program point L2545-3(lines 2541 2546) the Hoare annotation is: false [2021-11-03 23:16:37,928 INFO L854 garLoopResultBuilder]: At program point L2545-2(lines 2541 2546) the Hoare annotation is: (and (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base|) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| 0)) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| |ULTIMATE.start_aws_hash_table_swap_harness_~#stored_byte_a~0.base|)) (= (select |#valid| |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base|) 1) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (= ULTIMATE.start_ensure_allocated_hash_table_~map.base |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base|) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 1) 0) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base|)) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base| 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base|) (= ULTIMATE.start_aws_hash_table_swap_harness_~inita~0 (* 256 (div ULTIMATE.start_aws_hash_table_swap_harness_~inita~0 256))) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.offset| 0) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.offset| |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.offset|) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 1) 0)) [2021-11-03 23:16:37,928 INFO L854 garLoopResultBuilder]: At program point L266(line 266) the Hoare annotation is: (and (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.offset| 0) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| 0)) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| |ULTIMATE.start_aws_hash_table_swap_harness_~#stored_byte_a~0.base|)) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base) (= (select |#valid| |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base|) 1) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base|)) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base| 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base|) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.offset| |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.offset|) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 1) 0)) [2021-11-03 23:16:37,928 INFO L854 garLoopResultBuilder]: At program point L266-1(line 266) the Hoare annotation is: (and (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base|) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| 0)) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| |ULTIMATE.start_aws_hash_table_swap_harness_~#stored_byte_a~0.base|)) (= (select |#valid| |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base|) 1) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (= ULTIMATE.start_ensure_allocated_hash_table_~map.base |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base|) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base|)) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base| 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base|) (= ULTIMATE.start_aws_hash_table_swap_harness_~inita~0 (* 256 (div ULTIMATE.start_aws_hash_table_swap_harness_~inita~0 256))) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.offset| 0) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.offset| |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.offset|) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 1) 0)) [2021-11-03 23:16:37,931 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 23:16:37,932 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-03 23:16:37,950 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-03 23:16:37,951 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-03 23:16:37,951 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-03 23:16:37,951 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-03 23:16:37,951 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-03 23:16:37,951 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-03 23:16:37,952 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-03 23:16:37,952 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-03 23:16:37,953 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-03 23:16:37,953 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-03 23:16:37,953 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-03 23:16:37,954 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-03 23:16:37,966 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-03 23:16:37,967 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-03 23:16:37,967 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-03 23:16:37,967 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-03 23:16:37,968 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-03 23:16:37,968 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-03 23:16:37,968 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-03 23:16:37,968 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-03 23:16:37,970 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-03 23:16:37,970 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-03 23:16:37,970 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-03 23:16:37,970 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-03 23:16:37,971 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-03 23:16:37,971 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-03 23:16:37,971 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-03 23:16:37,972 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-03 23:16:37,977 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-03 23:16:37,977 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-03 23:16:37,977 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-03 23:16:37,977 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-03 23:16:37,978 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-03 23:16:37,978 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-03 23:16:37,981 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-03 23:16:37,981 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-03 23:16:37,981 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-03 23:16:37,981 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-03 23:16:37,981 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-03 23:16:37,981 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-03 23:16:37,983 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-03 23:16:37,983 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-03 23:16:37,983 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-03 23:16:37,983 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-03 23:16:37,983 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-03 23:16:37,983 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-03 23:16:37,983 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-03 23:16:37,984 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-03 23:16:37,984 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-03 23:16:37,984 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-03 23:16:37,984 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-03 23:16:37,984 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-03 23:16:38,001 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-03 23:16:38,004 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-03 23:16:38,004 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-03 23:16:38,004 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-03 23:16:38,005 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-03 23:16:38,005 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-03 23:16:38,005 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-03 23:16:38,005 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-03 23:16:38,007 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.11 11:16:38 BoogieIcfgContainer [2021-11-03 23:16:38,009 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-03 23:16:38,009 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-03 23:16:38,009 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-03 23:16:38,010 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-03 23:16:38,010 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 11:14:52" (3/4) ... [2021-11-03 23:16:38,012 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-11-03 23:16:38,032 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 238 nodes and edges [2021-11-03 23:16:38,033 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 93 nodes and edges [2021-11-03 23:16:38,034 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 26 nodes and edges [2021-11-03 23:16:38,035 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2021-11-03 23:16:38,037 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2021-11-03 23:16:38,038 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2021-11-03 23:16:38,039 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-11-03 23:16:38,040 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-11-03 23:16:38,063 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((!(a == 0) && !(a == stored_byte_a)) && !(a == required_bytes)) && \result + 1 <= 0) && a == map) && \valid[a] == 1) && a == map) && !(a == b)) && !(b == 0)) && unknown-#StackHeapBarrier-unknown + 1 <= a) && b == a) || ((((((((((((a == 0 && !(a == 0)) && !(a == stored_byte_a)) && !(a == required_bytes)) && a == map) && \valid[a] == 1) && a == map) && num_entries + 1 <= 0) && !(a == b)) && !(b == 0)) && unknown-#StackHeapBarrier-unknown + 1 <= a) && b == a) && max_table_entries + 1 <= 0) [2021-11-03 23:16:38,064 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((!(a == 0) && \result + 1 <= 0) && b == map) && map == b) && !(b == 0)) && inita == 256 * (inita / 256)) && b == a) || ((((((!(a == 0) && (!(map == 0) || !(map == 0))) && \result + 1 <= 0) && b == map) && map == b) && !(b == 0)) && b == a)) || ((((((((((unknown-#StackHeapBarrier-unknown < b && unknown-#StackHeapBarrier-unknown < a) && !(a == 0)) && b == map) && map == b) && num_entries + 1 <= 0) && !(b == 0)) && inita == 256 * (inita / 256)) && b == 0) && b == a) && max_table_entries + 1 <= 0) [2021-11-03 23:16:38,064 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((a == 0 && !(a == 0)) && !(a == stored_byte_a)) && \result == 0) && !(\result == 0)) && a == map) && \result + 1 < a) && a == map) && num_entries + 1 <= 0) && !(a == b)) && \valid[required_bytes := 0][a] == 1) && (cond == 1 || cond == 0)) && !(b == 0)) && unknown-#StackHeapBarrier-unknown + 1 <= a) && b == a) && max_table_entries + 1 <= 0 [2021-11-03 23:16:38,064 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((unknown-#StackHeapBarrier-unknown < b && unknown-#StackHeapBarrier-unknown < a) && !(a == 0)) && !(\result == 0)) && b == map) && \result + 1 < b) && map == b) && num_entries + 1 <= 0) && (cond == 1 || cond == 0)) && !(b == 0)) && inita == 256 * (inita / 256)) && b == 0) && b == a) && max_table_entries + 1 <= 0 [2021-11-03 23:16:38,065 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((aux-map && map->p_impl && hash_table_state_is_valid(map->p_impl)-aux && a == 0) && !(a == 0)) && !(a == stored_byte_a)) && \result == 0) && !(\result == 0)) && #memory_$Pointer$[a][a] + 1 < a) && a == map) && a == map) && map == a) && #memory_$Pointer$[map][map] == 0) && \valid[a] == 1) && map == 0) && \result == 0) && \result + 1 < a) && a == map) && #memory_$Pointer$[a][a] == map) && size_at_least_two == 0) && num_entries + 1 <= 0) && !(a == b)) && (cond == 1 || cond == 0)) && !(b == 0)) && unknown-#memory_int-unknown[#memory_$Pointer$[a][a]][40] + 1 <= 0) && unknown-#StackHeapBarrier-unknown + 1 <= a) && !(map == 0)) && b == a) && max_table_entries + 1 <= 0 [2021-11-03 23:16:38,065 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((a == 0 && !(a == 0)) && !(a == stored_byte_a)) && \result == 0) && !(\result == 0)) && #memory_$Pointer$[a][a] + 1 < a) && a == map) && a == map) && \result == 0) && map == a) && #memory_$Pointer$[map][map] == 0) && \valid[a] == 1) && map == 0) && \result == 0) && \result + 1 < a) && a == map) && #memory_$Pointer$[a][a] == map) && size_at_least_two == 0) && num_entries + 1 <= 0) && !(a == b)) && (cond == 1 || cond == 0)) && !(b == 0)) && unknown-#memory_int-unknown[#memory_$Pointer$[a][a]][40] + 1 <= 0) && unknown-#StackHeapBarrier-unknown + 1 <= a) && !(map == 0)) && b == a) && max_table_entries + 1 <= 0 [2021-11-03 23:16:38,065 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((unknown-#StackHeapBarrier-unknown < b && map == #memory_$Pointer$[b][b]) && unknown-#StackHeapBarrier-unknown < a) && aux-map && map->p_impl-aux) && aux-map && map->p_impl && hash_table_state_is_valid(map->p_impl)-aux) && !(a == 0)) && unknown-#memory_int-unknown[#memory_$Pointer$[b][b]][40 + #memory_$Pointer$[b][b]] + 1 <= 0) && !(\result == 0)) && b == map) && #memory_$Pointer$[b][b] == map) && \result == 0) && b == map) && \result + 1 < b) && map == b) && size_at_least_two == 0) && !(#memory_$Pointer$[map][map] == 0)) && num_entries + 1 <= 0) && (cond == 1 || cond == 0)) && !(b == 0)) && inita == 256 * (inita / 256)) && b == 0) && b == a) && max_table_entries + 1 <= 0) && map == b) && #memory_$Pointer$[b][b] + 1 < b [2021-11-03 23:16:38,065 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((unknown-#StackHeapBarrier-unknown < b && map == #memory_$Pointer$[b][b]) && unknown-#StackHeapBarrier-unknown < a) && !(a == 0)) && unknown-#memory_int-unknown[#memory_$Pointer$[b][b]][40 + #memory_$Pointer$[b][b]] + 1 <= 0) && !(\result == 0)) && b == map) && \result == 0) && #memory_$Pointer$[b][b] == map) && \result == 0) && b == map) && \result + 1 < b) && map == b) && size_at_least_two == 0) && !(#memory_$Pointer$[map][map] == 0)) && num_entries + 1 <= 0) && (cond == 1 || cond == 0)) && !(b == 0)) && inita == 256 * (inita / 256)) && b == 0) && b == a) && max_table_entries + 1 <= 0) && map == b) && #memory_$Pointer$[b][b] + 1 < b [2021-11-03 23:16:38,065 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((aux-map && map->p_impl && hash_table_state_is_valid(map->p_impl)-aux && a == 0) && !(a == 0)) && !(a == stored_byte_a)) && \result == 0) && !(\result == 0)) && #memory_$Pointer$[a][a] + 1 < a) && a == map) && a == map) && map == a) && #memory_$Pointer$[map][map] == 0) && \valid[a] == 1) && map == 0) && \result + 1 < a) && a == map) && #memory_$Pointer$[a][a] == map) && size_at_least_two == 0) && num_entries + 1 <= 0) && !(a == b)) && (cond == 1 || cond == 0)) && !(b == 0)) && unknown-#memory_int-unknown[#memory_$Pointer$[a][a]][40] + 1 <= 0) && unknown-#StackHeapBarrier-unknown + 1 <= a) && !(map == 0)) && b == a) && max_table_entries + 1 <= 0 [2021-11-03 23:16:38,065 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((unknown-#StackHeapBarrier-unknown < b && map == #memory_$Pointer$[b][b]) && unknown-#StackHeapBarrier-unknown < a) && aux-map && map->p_impl-aux) && aux-map && map->p_impl && hash_table_state_is_valid(map->p_impl)-aux) && !(a == 0)) && unknown-#memory_int-unknown[#memory_$Pointer$[b][b]][40 + #memory_$Pointer$[b][b]] + 1 <= 0) && !(\result == 0)) && b == map) && #memory_$Pointer$[b][b] == map) && b == map) && \result + 1 < b) && map == b) && size_at_least_two == 0) && !(#memory_$Pointer$[map][map] == 0)) && num_entries + 1 <= 0) && (cond == 1 || cond == 0)) && !(b == 0)) && inita == 256 * (inita / 256)) && b == 0) && b == a) && max_table_entries + 1 <= 0) && map == b) && #memory_$Pointer$[b][b] + 1 < b [2021-11-03 23:16:38,066 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!(a == 0) && !(\result == 0)) && (!(map == 0) || !(map == 0))) && \result + 1 <= 0) && a == map) && a == map) && !(b == 0)) && b == a [2021-11-03 23:16:38,066 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!(a == 0) && !(\result == 0)) && (!(map == 0) || !(map == 0))) && \result + 1 <= 0) && b == map) && map == b) && !(b == 0)) && b == a [2021-11-03 23:16:38,552 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-11-03 23:16:38,553 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-03 23:16:38,553 INFO L158 Benchmark]: Toolchain (without parser) took 112640.05ms. Allocated memory was 90.2MB in the beginning and 434.1MB in the end (delta: 343.9MB). Free memory was 63.5MB in the beginning and 200.1MB in the end (delta: -136.7MB). Peak memory consumption was 320.4MB. Max. memory is 16.1GB. [2021-11-03 23:16:38,553 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 90.2MB. Free memory is still 70.9MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-03 23:16:38,554 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2337.00ms. Allocated memory was 90.2MB in the beginning and 176.2MB in the end (delta: 86.0MB). Free memory was 63.2MB in the beginning and 107.5MB in the end (delta: -44.3MB). Peak memory consumption was 65.0MB. Max. memory is 16.1GB. [2021-11-03 23:16:38,554 INFO L158 Benchmark]: Boogie Procedure Inliner took 217.97ms. Allocated memory is still 176.2MB. Free memory was 107.5MB in the beginning and 92.8MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2021-11-03 23:16:38,554 INFO L158 Benchmark]: Boogie Preprocessor took 86.84ms. Allocated memory is still 176.2MB. Free memory was 92.8MB in the beginning and 83.3MB in the end (delta: 9.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-11-03 23:16:38,554 INFO L158 Benchmark]: RCFGBuilder took 4005.66ms. Allocated memory was 176.2MB in the beginning and 434.1MB in the end (delta: 257.9MB). Free memory was 83.3MB in the beginning and 188.2MB in the end (delta: -104.9MB). Peak memory consumption was 234.7MB. Max. memory is 16.1GB. [2021-11-03 23:16:38,554 INFO L158 Benchmark]: TraceAbstraction took 105442.64ms. Allocated memory is still 434.1MB. Free memory was 187.1MB in the beginning and 214.0MB in the end (delta: -26.9MB). Peak memory consumption was 75.9MB. Max. memory is 16.1GB. [2021-11-03 23:16:38,554 INFO L158 Benchmark]: Witness Printer took 543.45ms. Allocated memory is still 434.1MB. Free memory was 214.0MB in the beginning and 200.1MB in the end (delta: 13.9MB). Peak memory consumption was 128.2MB. Max. memory is 16.1GB. [2021-11-03 23:16:38,555 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.19ms. Allocated memory is still 90.2MB. Free memory is still 70.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2337.00ms. Allocated memory was 90.2MB in the beginning and 176.2MB in the end (delta: 86.0MB). Free memory was 63.2MB in the beginning and 107.5MB in the end (delta: -44.3MB). Peak memory consumption was 65.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 217.97ms. Allocated memory is still 176.2MB. Free memory was 107.5MB in the beginning and 92.8MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 86.84ms. Allocated memory is still 176.2MB. Free memory was 92.8MB in the beginning and 83.3MB in the end (delta: 9.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * RCFGBuilder took 4005.66ms. Allocated memory was 176.2MB in the beginning and 434.1MB in the end (delta: 257.9MB). Free memory was 83.3MB in the beginning and 188.2MB in the end (delta: -104.9MB). Peak memory consumption was 234.7MB. Max. memory is 16.1GB. * TraceAbstraction took 105442.64ms. Allocated memory is still 434.1MB. Free memory was 187.1MB in the beginning and 214.0MB in the end (delta: -26.9MB). Peak memory consumption was 75.9MB. Max. memory is 16.1GB. * Witness Printer took 543.45ms. Allocated memory is still 434.1MB. Free memory was 214.0MB in the beginning and 200.1MB in the end (delta: 13.9MB). Peak memory consumption was 128.2MB. 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$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.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$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.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 * 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 - 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, 164 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 105312.60ms, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 28.69ms, AutomataDifference: 84095.07ms, DeadEndRemovalTime: 0.00ms, HoareAnnotationTime: 6833.04ms, InitialAbstractionConstructionTime: 10.51ms, PartialOrderReductionTime: 0.00ms, HoareTripleCheckerStatistics: 14 mSolverCounterUnknown, 2622 SdHoareTripleChecker+Valid, 74242.90ms IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2622 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 68151.65ms Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7906 mSDsCounter, 215 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 13020 IncrementalHoareTripleChecker+Invalid, 13249 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 215 mSolverCounterUnsat, 0 mSDtfsCounter, 13020 mSolverCounterSat, 138.69ms SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 318 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 373 ImplicationChecksByTransitivity, 12608.52ms Time, 0.00ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=323occurred in iteration=11, InterpolantAutomatonStates: 128, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.00ms DumpTime, AutomataMinimizationStatistics: 174.48ms AutomataMinimizationTime, 14 MinimizatonAttempts, 380 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.00ms HoareAnnotationTime, 57 LocationsWithAnnotation, 57 PreInvPairs, 96 NumberOfFragments, 2315 HoareAnnotationTreeSize, 57 FomulaSimplifications, 1320 FormulaSimplificationTreeSizeReduction, 129.96ms HoareSimplificationTime, 57 FomulaSimplificationsInter, 307 FormulaSimplificationTreeSizeReductionInter, 6687.85ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 409.69ms SsaConstructionTime, 3156.49ms SatisfiabilityAnalysisTime, 9293.72ms InterpolantComputationTime, 672 NumberOfCodeBlocks, 672 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 658 ConstructedInterpolants, 0 QuantifiedInterpolants, 4171 SizeOfPredicates, 87 NumberOfNonLiveVariables, 7961 ConjunctsInSsa, 177 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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 4 specifications checked. All of them hold - InvariantResult [Line: 2613]: Loop Invariant Derived loop invariant: (((((((((((a == 0 && !(a == 0)) && !(a == stored_byte_a)) && !(a == required_bytes)) && a == map) && \valid[elemsize := 0][a] == 1) && a == map) && num_entries + 1 <= 0) && !(a == b)) && !(b == 0)) && unknown-#StackHeapBarrier-unknown + 1 <= a) && b == a) && max_table_entries + 1 <= 0 - InvariantResult [Line: 2497]: Loop Invariant Derived loop invariant: (((((((((((a == 0 && !(a == 0)) && !(a == stored_byte_a)) && !(a == required_bytes)) && a == map) && \valid[elemsize := 0][a] == 1) && a == map) && num_entries + 1 <= 0) && !(a == b)) && !(b == 0)) && unknown-#StackHeapBarrier-unknown + 1 <= a) && b == a) && max_table_entries + 1 <= 0 - InvariantResult [Line: 10101]: Loop Invariant Derived loop invariant: ((((((!(a == 0) && !(\result == 0)) && (!(map == 0) || !(map == 0))) && \result + 1 <= 0) && b == map) && map == b) && !(b == 0)) && b == a - InvariantResult [Line: 1988]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2626]: Loop Invariant [2021-11-03 23:16:38,566 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-03 23:16:38,567 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-03 23:16:38,567 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-03 23:16:38,567 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-03 23:16:38,567 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-03 23:16:38,567 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-03 23:16:38,568 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-03 23:16:38,568 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-03 23:16:38,568 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-03 23:16:38,568 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-03 23:16:38,568 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-03 23:16:38,569 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((((((((((((((((((((unknown-#StackHeapBarrier-unknown < b && map == #memory_$Pointer$[b][b]) && unknown-#StackHeapBarrier-unknown < a) && aux-map && map->p_impl-aux) && aux-map && map->p_impl && hash_table_state_is_valid(map->p_impl)-aux) && !(a == 0)) && unknown-#memory_int-unknown[#memory_$Pointer$[b][b]][40 + #memory_$Pointer$[b][b]] + 1 <= 0) && !(\result == 0)) && b == map) && #memory_$Pointer$[b][b] == map) && b == map) && \result + 1 < b) && map == b) && size_at_least_two == 0) && !(#memory_$Pointer$[map][map] == 0)) && num_entries + 1 <= 0) && (cond == 1 || cond == 0)) && !(b == 0)) && inita == 256 * (inita / 256)) && b == 0) && b == a) && max_table_entries + 1 <= 0) && map == b) && #memory_$Pointer$[b][b] + 1 < b - InvariantResult [Line: 266]: Loop Invariant Derived loop invariant: (((((((((a == 0 && !(a == 0)) && !(a == stored_byte_a)) && a == map) && \valid[a] == 1) && a == map) && !(a == b)) && !(b == 0)) && unknown-#StackHeapBarrier-unknown + 1 <= a) && b == a) && max_table_entries + 1 <= 0 - InvariantResult [Line: 1988]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1988]: Loop Invariant Derived loop invariant: (((((((((((a == 0 && !(a == 0)) && !(a == stored_byte_a)) && !(a == required_bytes)) && a == map) && \valid[elemsize := 0][a] == 1) && a == map) && num_entries + 1 <= 0) && !(a == b)) && !(b == 0)) && unknown-#StackHeapBarrier-unknown + 1 <= a) && b == a) && max_table_entries + 1 <= 0 - InvariantResult [Line: 1988]: Loop Invariant Derived loop invariant: (((((((((((a == 0 && !(a == 0)) && !(a == stored_byte_a)) && !(a == required_bytes)) && a == map) && \valid[elemsize := 0][a] == 1) && a == map) && num_entries + 1 <= 0) && !(a == b)) && !(b == 0)) && unknown-#StackHeapBarrier-unknown + 1 <= a) && b == a) && max_table_entries + 1 <= 0 - InvariantResult [Line: 2626]: Loop Invariant [2021-11-03 23:16:38,570 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-03 23:16:38,570 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-03 23:16:38,570 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-03 23:16:38,570 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-03 23:16:38,571 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-03 23:16:38,571 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-03 23:16:38,571 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-03 23:16:38,571 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((((((((((((((((((((((aux-map && map->p_impl && hash_table_state_is_valid(map->p_impl)-aux && a == 0) && !(a == 0)) && !(a == stored_byte_a)) && \result == 0) && !(\result == 0)) && #memory_$Pointer$[a][a] + 1 < a) && a == map) && a == map) && map == a) && #memory_$Pointer$[map][map] == 0) && \valid[a] == 1) && map == 0) && \result + 1 < a) && a == map) && #memory_$Pointer$[a][a] == map) && size_at_least_two == 0) && num_entries + 1 <= 0) && !(a == b)) && (cond == 1 || cond == 0)) && !(b == 0)) && unknown-#memory_int-unknown[#memory_$Pointer$[a][a]][40] + 1 <= 0) && unknown-#StackHeapBarrier-unknown + 1 <= a) && !(map == 0)) && b == a) && max_table_entries + 1 <= 0 - InvariantResult [Line: 253]: Loop Invariant Derived loop invariant: (((((((((((a == 0 && !(a == 0)) && !(a == stored_byte_a)) && !(a == required_bytes)) && a == map) && \valid[elemsize := 0][a] == 1) && a == map) && num_entries + 1 <= 0) && !(a == b)) && !(b == 0)) && unknown-#StackHeapBarrier-unknown + 1 <= a) && b == a) && max_table_entries + 1 <= 0 - InvariantResult [Line: 2497]: Loop Invariant Derived loop invariant: ((((((((((((unknown-#StackHeapBarrier-unknown < b && !(a == 0)) && !(a == stored_byte_a)) && \valid[a] == 1) && b == map) && map == b) && num_entries + 1 <= 0) && !(a == b)) && !(b == 0)) && unknown-#StackHeapBarrier-unknown + 1 <= a) && inita == 256 * (inita / 256)) && b == 0) && b == a) && max_table_entries + 1 <= 0 - InvariantResult [Line: 9999]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 9999]: Loop Invariant [2021-11-03 23:16:38,572 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-03 23:16:38,573 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-03 23:16:38,573 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-03 23:16:38,573 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-03 23:16:38,573 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-03 23:16:38,573 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-03 23:16:38,574 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-03 23:16:38,574 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (((((((((((((((((((((((((aux-map && map->p_impl && hash_table_state_is_valid(map->p_impl)-aux && a == 0) && !(a == 0)) && !(a == stored_byte_a)) && \result == 0) && !(\result == 0)) && #memory_$Pointer$[a][a] + 1 < a) && a == map) && a == map) && map == a) && #memory_$Pointer$[map][map] == 0) && \valid[a] == 1) && map == 0) && \result == 0) && \result + 1 < a) && a == map) && #memory_$Pointer$[a][a] == map) && size_at_least_two == 0) && num_entries + 1 <= 0) && !(a == b)) && (cond == 1 || cond == 0)) && !(b == 0)) && unknown-#memory_int-unknown[#memory_$Pointer$[a][a]][40] + 1 <= 0) && unknown-#StackHeapBarrier-unknown + 1 <= a) && !(map == 0)) && b == a) && max_table_entries + 1 <= 0 - InvariantResult [Line: 248]: Loop Invariant Derived loop invariant: (((((((((((a == 0 && !(a == 0)) && !(a == stored_byte_a)) && !(a == required_bytes)) && a == map) && \valid[elemsize := 0][a] == 1) && a == map) && num_entries + 1 <= 0) && !(a == b)) && !(b == 0)) && unknown-#StackHeapBarrier-unknown + 1 <= a) && b == a) && max_table_entries + 1 <= 0 - InvariantResult [Line: 2613]: Loop Invariant Derived loop invariant: ((((((((((((unknown-#StackHeapBarrier-unknown < b && !(a == 0)) && !(a == stored_byte_a)) && \valid[a] == 1) && b == map) && map == b) && num_entries + 1 <= 0) && !(a == b)) && !(b == 0)) && unknown-#StackHeapBarrier-unknown + 1 <= a) && inita == 256 * (inita / 256)) && b == 0) && b == a) && max_table_entries + 1 <= 0 - InvariantResult [Line: 6943]: Loop Invariant Derived loop invariant: ((((((((((((unknown-#StackHeapBarrier-unknown < b && unknown-#StackHeapBarrier-unknown < a) && !(a == 0)) && !(\result == 0)) && b == map) && \result + 1 < b) && map == b) && num_entries + 1 <= 0) && (cond == 1 || cond == 0)) && !(b == 0)) && inita == 256 * (inita / 256)) && b == 0) && b == a) && max_table_entries + 1 <= 0 - InvariantResult [Line: 248]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1988]: Loop Invariant Derived loop invariant: ((((((((((((unknown-#StackHeapBarrier-unknown < b && !(a == 0)) && !(a == stored_byte_a)) && \valid[a] == 1) && b == map) && map == b) && num_entries + 1 <= 0) && !(a == b)) && !(b == 0)) && unknown-#StackHeapBarrier-unknown + 1 <= a) && inita == 256 * (inita / 256)) && b == 0) && b == a) && max_table_entries + 1 <= 0 - InvariantResult [Line: 2626]: Loop Invariant Derived loop invariant: (((((((((((a == 0 && !(a == 0)) && !(a == stored_byte_a)) && a == map) && \valid[a] == 1) && a == map) && num_entries + 1 <= 0) && !(a == b)) && (cond == 1 || cond == 0)) && !(b == 0)) && unknown-#StackHeapBarrier-unknown + 1 <= a) && b == a) && max_table_entries + 1 <= 0 - InvariantResult [Line: 2586]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 266]: Loop Invariant Derived loop invariant: (((((((((((unknown-#StackHeapBarrier-unknown < b && !(a == 0)) && !(a == stored_byte_a)) && \valid[a] == 1) && b == map) && map == b) && !(a == b)) && !(b == 0)) && unknown-#StackHeapBarrier-unknown + 1 <= a) && inita == 256 * (inita / 256)) && b == 0) && b == a) && max_table_entries + 1 <= 0 - InvariantResult [Line: 1988]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2626]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2497]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 9988]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 253]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 9988]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 9999]: Loop Invariant [2021-11-03 23:16:38,577 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-03 23:16:38,577 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-03 23:16:38,577 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-03 23:16:38,577 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-03 23:16:38,578 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-03 23:16:38,578 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-03 23:16:38,578 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-03 23:16:38,578 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-03 23:16:38,578 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-03 23:16:38,579 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-03 23:16:38,579 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-03 23:16:38,579 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (((((((((((((((((((((((unknown-#StackHeapBarrier-unknown < b && map == #memory_$Pointer$[b][b]) && unknown-#StackHeapBarrier-unknown < a) && aux-map && map->p_impl-aux) && aux-map && map->p_impl && hash_table_state_is_valid(map->p_impl)-aux) && !(a == 0)) && unknown-#memory_int-unknown[#memory_$Pointer$[b][b]][40 + #memory_$Pointer$[b][b]] + 1 <= 0) && !(\result == 0)) && b == map) && #memory_$Pointer$[b][b] == map) && \result == 0) && b == map) && \result + 1 < b) && map == b) && size_at_least_two == 0) && !(#memory_$Pointer$[map][map] == 0)) && num_entries + 1 <= 0) && (cond == 1 || cond == 0)) && !(b == 0)) && inita == 256 * (inita / 256)) && b == 0) && b == a) && max_table_entries + 1 <= 0) && map == b) && #memory_$Pointer$[b][b] + 1 < b - InvariantResult [Line: 2497]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 253]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2541]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 248]: Loop Invariant Derived loop invariant: ((((((((((((unknown-#StackHeapBarrier-unknown < b && !(a == 0)) && !(a == stored_byte_a)) && \valid[a] == 1) && b == map) && map == b) && num_entries + 1 <= 0) && !(a == b)) && !(b == 0)) && unknown-#StackHeapBarrier-unknown + 1 <= a) && inita == 256 * (inita / 256)) && b == 0) && b == a) && max_table_entries + 1 <= 0 - InvariantResult [Line: 10153]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2586]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2541]: Loop Invariant Derived loop invariant: ((((((((((((unknown-#StackHeapBarrier-unknown < b && !(a == 0)) && !(a == stored_byte_a)) && \valid[a] == 1) && b == map) && map == b) && num_entries + 1 <= 0) && !(a == b)) && !(b == 0)) && unknown-#StackHeapBarrier-unknown + 1 <= a) && inita == 256 * (inita / 256)) && b == 0) && b == a) && max_table_entries + 1 <= 0 - InvariantResult [Line: 9988]: Loop Invariant [2021-11-03 23:16:38,580 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-03 23:16:38,581 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-03 23:16:38,581 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-03 23:16:38,581 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-03 23:16:38,581 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-03 23:16:38,581 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-03 23:16:38,581 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-03 23:16:38,582 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-03 23:16:38,582 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-03 23:16:38,582 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-03 23:16:38,582 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-03 23:16:38,582 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((((((((((((((((((((unknown-#StackHeapBarrier-unknown < b && map == #memory_$Pointer$[b][b]) && unknown-#StackHeapBarrier-unknown < a) && !(a == 0)) && unknown-#memory_int-unknown[#memory_$Pointer$[b][b]][40 + #memory_$Pointer$[b][b]] + 1 <= 0) && !(\result == 0)) && b == map) && \result == 0) && #memory_$Pointer$[b][b] == map) && \result == 0) && b == map) && \result + 1 < b) && map == b) && size_at_least_two == 0) && !(#memory_$Pointer$[map][map] == 0)) && num_entries + 1 <= 0) && (cond == 1 || cond == 0)) && !(b == 0)) && inita == 256 * (inita / 256)) && b == 0) && b == a) && max_table_entries + 1 <= 0) && map == b) && #memory_$Pointer$[b][b] + 1 < b - InvariantResult [Line: 2626]: Loop Invariant Derived loop invariant: (((((((((((((unknown-#StackHeapBarrier-unknown < b && !(a == 0)) && !(a == stored_byte_a)) && \valid[a] == 1) && b == map) && map == b) && num_entries + 1 <= 0) && !(a == b)) && (cond == 1 || cond == 0)) && !(b == 0)) && unknown-#StackHeapBarrier-unknown + 1 <= a) && inita == 256 * (inita / 256)) && b == 0) && b == a) && max_table_entries + 1 <= 0 - InvariantResult [Line: 1988]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 248]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2586]: Loop Invariant Derived loop invariant: (((((((((((a == 0 && !(a == 0)) && !(a == stored_byte_a)) && !(a == required_bytes)) && a == map) && \valid[elemsize := 0][a] == 1) && a == map) && num_entries + 1 <= 0) && !(a == b)) && !(b == 0)) && unknown-#StackHeapBarrier-unknown + 1 <= a) && b == a) && max_table_entries + 1 <= 0 - InvariantResult [Line: 6943]: Loop Invariant Derived loop invariant: ((((((((((((((a == 0 && !(a == 0)) && !(a == stored_byte_a)) && \result == 0) && !(\result == 0)) && a == map) && \result + 1 < a) && a == map) && num_entries + 1 <= 0) && !(a == b)) && \valid[required_bytes := 0][a] == 1) && (cond == 1 || cond == 0)) && !(b == 0)) && unknown-#StackHeapBarrier-unknown + 1 <= a) && b == a) && max_table_entries + 1 <= 0 - InvariantResult [Line: 2613]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2613]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2586]: Loop Invariant Derived loop invariant: ((((((((((((unknown-#StackHeapBarrier-unknown < b && !(a == 0)) && !(a == stored_byte_a)) && \valid[a] == 1) && b == map) && map == b) && num_entries + 1 <= 0) && !(a == b)) && !(b == 0)) && unknown-#StackHeapBarrier-unknown + 1 <= a) && inita == 256 * (inita / 256)) && b == 0) && b == a) && max_table_entries + 1 <= 0 - InvariantResult [Line: 253]: Loop Invariant Derived loop invariant: ((((((((((((unknown-#StackHeapBarrier-unknown < b && !(a == 0)) && !(a == stored_byte_a)) && \valid[a] == 1) && b == map) && map == b) && num_entries + 1 <= 0) && !(a == b)) && !(b == 0)) && unknown-#StackHeapBarrier-unknown + 1 <= a) && inita == 256 * (inita / 256)) && b == 0) && b == a) && max_table_entries + 1 <= 0 - InvariantResult [Line: 263]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1988]: Loop Invariant Derived loop invariant: ((((((((((((unknown-#StackHeapBarrier-unknown < b && !(a == 0)) && !(a == stored_byte_a)) && \valid[a] == 1) && b == map) && map == b) && num_entries + 1 <= 0) && !(a == b)) && !(b == 0)) && unknown-#StackHeapBarrier-unknown + 1 <= a) && inita == 256 * (inita / 256)) && b == 0) && b == a) && max_table_entries + 1 <= 0 - InvariantResult [Line: 9988]: Loop Invariant [2021-11-03 23:16:38,585 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-03 23:16:38,585 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-03 23:16:38,585 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-03 23:16:38,586 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-03 23:16:38,586 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-03 23:16:38,586 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-03 23:16:38,586 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-03 23:16:38,586 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (((((((((((((((((((((((((a == 0 && !(a == 0)) && !(a == stored_byte_a)) && \result == 0) && !(\result == 0)) && #memory_$Pointer$[a][a] + 1 < a) && a == map) && a == map) && \result == 0) && map == a) && #memory_$Pointer$[map][map] == 0) && \valid[a] == 1) && map == 0) && \result == 0) && \result + 1 < a) && a == map) && #memory_$Pointer$[a][a] == map) && size_at_least_two == 0) && num_entries + 1 <= 0) && !(a == b)) && (cond == 1 || cond == 0)) && !(b == 0)) && unknown-#memory_int-unknown[#memory_$Pointer$[a][a]][40] + 1 <= 0) && unknown-#StackHeapBarrier-unknown + 1 <= a) && !(map == 0)) && b == a) && max_table_entries + 1 <= 0 - InvariantResult [Line: 10101]: Loop Invariant Derived loop invariant: ((((((!(a == 0) && !(\result == 0)) && (!(map == 0) || !(map == 0))) && \result + 1 <= 0) && a == map) && a == map) && !(b == 0)) && b == a - InvariantResult [Line: 2626]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2541]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 10101]: Loop Invariant Derived loop invariant: ((((((((((!(a == 0) && !(a == stored_byte_a)) && !(a == required_bytes)) && \result + 1 <= 0) && a == map) && \valid[a] == 1) && a == map) && !(a == b)) && !(b == 0)) && unknown-#StackHeapBarrier-unknown + 1 <= a) && b == a) || ((((((((((((a == 0 && !(a == 0)) && !(a == stored_byte_a)) && !(a == required_bytes)) && a == map) && \valid[a] == 1) && a == map) && num_entries + 1 <= 0) && !(a == b)) && !(b == 0)) && unknown-#StackHeapBarrier-unknown + 1 <= a) && b == a) && max_table_entries + 1 <= 0) - InvariantResult [Line: 9999]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 263]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 10101]: Loop Invariant Derived loop invariant: (((((((!(a == 0) && \result + 1 <= 0) && b == map) && map == b) && !(b == 0)) && inita == 256 * (inita / 256)) && b == a) || ((((((!(a == 0) && (!(map == 0) || !(map == 0))) && \result + 1 <= 0) && b == map) && map == b) && !(b == 0)) && b == a)) || ((((((((((unknown-#StackHeapBarrier-unknown < b && unknown-#StackHeapBarrier-unknown < a) && !(a == 0)) && b == map) && map == b) && num_entries + 1 <= 0) && !(b == 0)) && inita == 256 * (inita / 256)) && b == 0) && b == a) && max_table_entries + 1 <= 0) - InvariantResult [Line: 2541]: Loop Invariant Derived loop invariant: (((((((((((a == 0 && !(a == 0)) && !(a == stored_byte_a)) && !(a == required_bytes)) && a == map) && \valid[elemsize := 0][a] == 1) && a == map) && num_entries + 1 <= 0) && !(a == b)) && !(b == 0)) && unknown-#StackHeapBarrier-unknown + 1 <= a) && b == a) && max_table_entries + 1 <= 0 RESULT: Ultimate proved your program to be correct! [2021-11-03 23:16:38,803 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-03 23:16:38,838 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE