./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 b2eff8ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a74e492e-64fe-4878-9f27-d415726a3cf3/bin/uautomizer-UnR33cPsHg/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a74e492e-64fe-4878-9f27-d415726a3cf3/bin/uautomizer-UnR33cPsHg/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a74e492e-64fe-4878-9f27-d415726a3cf3/bin/uautomizer-UnR33cPsHg/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a74e492e-64fe-4878-9f27-d415726a3cf3/bin/uautomizer-UnR33cPsHg/config/AutomizerReach.xml -i ../../sv-benchmarks/c/aws-c-common/aws_hash_table_swap_harness.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a74e492e-64fe-4878-9f27-d415726a3cf3/bin/uautomizer-UnR33cPsHg/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a74e492e-64fe-4878-9f27-d415726a3cf3/bin/uautomizer-UnR33cPsHg --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 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-b2eff8b [2021-10-28 09:37:25,022 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-28 09:37:25,025 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-28 09:37:25,081 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-28 09:37:25,081 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-28 09:37:25,086 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-28 09:37:25,088 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-28 09:37:25,093 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-28 09:37:25,096 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-28 09:37:25,103 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-28 09:37:25,104 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-28 09:37:25,106 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-28 09:37:25,107 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-28 09:37:25,110 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-28 09:37:25,112 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-28 09:37:25,117 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-28 09:37:25,119 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-28 09:37:25,120 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-28 09:37:25,123 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-28 09:37:25,131 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-28 09:37:25,133 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-28 09:37:25,135 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-28 09:37:25,139 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-28 09:37:25,140 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-28 09:37:25,149 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-28 09:37:25,150 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-28 09:37:25,150 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-28 09:37:25,153 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-28 09:37:25,154 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-28 09:37:25,155 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-28 09:37:25,156 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-28 09:37:25,157 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-28 09:37:25,159 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-28 09:37:25,160 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-28 09:37:25,162 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-28 09:37:25,162 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-28 09:37:25,163 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-28 09:37:25,164 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-28 09:37:25,164 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-28 09:37:25,165 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-28 09:37:25,166 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-28 09:37:25,167 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a74e492e-64fe-4878-9f27-d415726a3cf3/bin/uautomizer-UnR33cPsHg/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-10-28 09:37:25,211 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-28 09:37:25,211 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-28 09:37:25,212 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-28 09:37:25,212 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-28 09:37:25,220 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-28 09:37:25,221 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-28 09:37:25,221 INFO L138 SettingsManager]: * Use SBE=true [2021-10-28 09:37:25,221 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-28 09:37:25,222 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-28 09:37:25,222 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-28 09:37:25,223 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-28 09:37:25,223 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-28 09:37:25,223 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-28 09:37:25,224 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-28 09:37:25,224 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-28 09:37:25,224 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-28 09:37:25,224 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-28 09:37:25,225 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-28 09:37:25,225 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-28 09:37:25,225 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-28 09:37:25,225 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-28 09:37:25,226 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-28 09:37:25,226 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-28 09:37:25,226 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-28 09:37:25,226 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-28 09:37:25,227 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-10-28 09:37:25,227 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-10-28 09:37:25,227 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-28 09:37:25,227 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-28 09:37:25,229 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a74e492e-64fe-4878-9f27-d415726a3cf3/bin/uautomizer-UnR33cPsHg/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a74e492e-64fe-4878-9f27-d415726a3cf3/bin/uautomizer-UnR33cPsHg 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-10-28 09:37:25,508 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-28 09:37:25,530 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-28 09:37:25,532 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-28 09:37:25,534 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-28 09:37:25,535 INFO L275 PluginConnector]: CDTParser initialized [2021-10-28 09:37:25,536 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a74e492e-64fe-4878-9f27-d415726a3cf3/bin/uautomizer-UnR33cPsHg/../../sv-benchmarks/c/aws-c-common/aws_hash_table_swap_harness.i [2021-10-28 09:37:25,610 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a74e492e-64fe-4878-9f27-d415726a3cf3/bin/uautomizer-UnR33cPsHg/data/1c4b19a94/c6568989a51d4da2b96fc32c77c249ab/FLAG1e76889a9 [2021-10-28 09:37:26,518 INFO L306 CDTParser]: Found 1 translation units. [2021-10-28 09:37:26,519 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a74e492e-64fe-4878-9f27-d415726a3cf3/sv-benchmarks/c/aws-c-common/aws_hash_table_swap_harness.i [2021-10-28 09:37:26,552 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a74e492e-64fe-4878-9f27-d415726a3cf3/bin/uautomizer-UnR33cPsHg/data/1c4b19a94/c6568989a51d4da2b96fc32c77c249ab/FLAG1e76889a9 [2021-10-28 09:37:27,006 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a74e492e-64fe-4878-9f27-d415726a3cf3/bin/uautomizer-UnR33cPsHg/data/1c4b19a94/c6568989a51d4da2b96fc32c77c249ab [2021-10-28 09:37:27,009 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-28 09:37:27,010 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-28 09:37:27,012 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-28 09:37:27,012 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-28 09:37:27,017 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-28 09:37:27,017 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.10 09:37:27" (1/1) ... [2021-10-28 09:37:27,018 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e12980d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:37:27, skipping insertion in model container [2021-10-28 09:37:27,019 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.10 09:37:27" (1/1) ... [2021-10-28 09:37:27,026 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-28 09:37:27,179 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-28 09:37:27,545 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a74e492e-64fe-4878-9f27-d415726a3cf3/sv-benchmarks/c/aws-c-common/aws_hash_table_swap_harness.i[4493,4506] [2021-10-28 09:37:27,554 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a74e492e-64fe-4878-9f27-d415726a3cf3/sv-benchmarks/c/aws-c-common/aws_hash_table_swap_harness.i[4553,4566] [2021-10-28 09:37:27,586 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-10-28 09:37:27,593 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-10-28 09:37:29,003 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 09:37:29,004 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 09:37:29,004 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 09:37:29,005 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 09:37:29,007 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 09:37:29,025 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 09:37:29,026 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 09:37:29,029 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 09:37:29,030 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 09:37:29,036 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 09:37:29,037 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 09:37:29,040 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 09:37:29,041 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 09:37:29,658 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-10-28 09:37:29,662 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-10-28 09:37:29,664 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-10-28 09:37:29,665 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-10-28 09:37:29,666 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-10-28 09:37:29,668 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-10-28 09:37:29,668 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-10-28 09:37:29,670 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-10-28 09:37:29,673 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-10-28 09:37:29,682 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-10-28 09:37:29,913 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-10-28 09:37:30,298 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 09:37:30,299 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 09:37:30,343 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 09:37:30,346 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 09:37:30,357 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 09:37:30,358 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 09:37:30,388 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 09:37:30,390 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 09:37:30,394 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 09:37:30,394 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 09:37:30,395 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 09:37:30,395 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 09:37:30,396 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 09:37:30,559 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-28 09:37:30,644 INFO L203 MainTranslator]: Completed pre-run [2021-10-28 09:37:30,673 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a74e492e-64fe-4878-9f27-d415726a3cf3/sv-benchmarks/c/aws-c-common/aws_hash_table_swap_harness.i[4493,4506] [2021-10-28 09:37:30,674 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a74e492e-64fe-4878-9f27-d415726a3cf3/sv-benchmarks/c/aws-c-common/aws_hash_table_swap_harness.i[4553,4566] [2021-10-28 09:37:30,675 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-10-28 09:37:30,676 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-10-28 09:37:30,722 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 09:37:30,723 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 09:37:30,723 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 09:37:30,724 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 09:37:30,724 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 09:37:30,735 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 09:37:30,736 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 09:37:30,737 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 09:37:30,738 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 09:37:30,739 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 09:37:30,740 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 09:37:30,741 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 09:37:30,741 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 09:37:30,813 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-10-28 09:37:30,814 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-10-28 09:37:30,815 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-10-28 09:37:30,815 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-10-28 09:37:30,816 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-10-28 09:37:30,816 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-10-28 09:37:30,817 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-10-28 09:37:30,817 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-10-28 09:37:30,820 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-10-28 09:37:30,821 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-10-28 09:37:30,855 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-10-28 09:37:30,975 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 09:37:30,975 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 09:37:30,982 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 09:37:30,983 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 09:37:30,986 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 09:37:30,986 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 09:37:31,001 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 09:37:31,002 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 09:37:31,003 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 09:37:31,004 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 09:37:31,004 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 09:37:31,005 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 09:37:31,005 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 09:37:31,027 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-28 09:37:31,319 INFO L208 MainTranslator]: Completed translation [2021-10-28 09:37:31,320 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:37:31 WrapperNode [2021-10-28 09:37:31,320 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-28 09:37:31,321 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-28 09:37:31,321 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-28 09:37:31,322 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-28 09:37:31,329 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:37:31" (1/1) ... [2021-10-28 09:37:31,480 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:37:31" (1/1) ... [2021-10-28 09:37:31,632 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-28 09:37:31,634 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-28 09:37:31,634 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-28 09:37:31,635 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-28 09:37:31,643 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:37:31" (1/1) ... [2021-10-28 09:37:31,644 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:37:31" (1/1) ... [2021-10-28 09:37:31,675 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:37:31" (1/1) ... [2021-10-28 09:37:31,676 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:37:31" (1/1) ... [2021-10-28 09:37:31,755 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:37:31" (1/1) ... [2021-10-28 09:37:31,772 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:37:31" (1/1) ... [2021-10-28 09:37:31,785 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:37:31" (1/1) ... [2021-10-28 09:37:31,815 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-28 09:37:31,817 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-28 09:37:31,818 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-28 09:37:31,818 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-28 09:37:31,819 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:37:31" (1/1) ... [2021-10-28 09:37:31,828 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-28 09:37:31,839 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a74e492e-64fe-4878-9f27-d415726a3cf3/bin/uautomizer-UnR33cPsHg/z3 [2021-10-28 09:37:31,851 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a74e492e-64fe-4878-9f27-d415726a3cf3/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-28 09:37:31,879 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a74e492e-64fe-4878-9f27-d415726a3cf3/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-28 09:37:31,904 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2021-10-28 09:37:31,904 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-10-28 09:37:31,905 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-10-28 09:37:31,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-10-28 09:37:31,905 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-28 09:37:31,905 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-28 09:37:31,905 INFO L130 BoogieDeclarations]: Found specification of procedure __builtin_uaddl_overflow [2021-10-28 09:37:31,905 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-28 09:37:31,906 INFO L130 BoogieDeclarations]: Found specification of procedure __builtin_umull_overflow [2021-10-28 09:37:31,906 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-10-28 09:37:31,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-10-28 09:37:31,906 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-28 09:37:31,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-10-28 09:37:31,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-28 09:37:43,417 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-28 09:37:43,417 INFO L299 CfgBuilder]: Removed 190 assume(true) statements. [2021-10-28 09:37:43,422 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 09:37:43 BoogieIcfgContainer [2021-10-28 09:37:43,422 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-28 09:37:43,424 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-28 09:37:43,424 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-28 09:37:43,428 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-28 09:37:43,428 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.10 09:37:27" (1/3) ... [2021-10-28 09:37:43,430 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49a857df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.10 09:37:43, skipping insertion in model container [2021-10-28 09:37:43,431 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:37:31" (2/3) ... [2021-10-28 09:37:43,435 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49a857df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.10 09:37:43, skipping insertion in model container [2021-10-28 09:37:43,435 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 09:37:43" (3/3) ... [2021-10-28 09:37:43,437 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_hash_table_swap_harness.i [2021-10-28 09:37:43,443 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-28 09:37:43,444 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2021-10-28 09:37:43,489 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-28 09:37:43,495 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-10-28 09:37:43,496 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2021-10-28 09:37:43,516 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-10-28 09:37:43,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-10-28 09:37:43,523 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:37:43,524 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:37:43,525 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-10-28 09:37:43,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:37:43,530 INFO L85 PathProgramCache]: Analyzing trace with hash 67832654, now seen corresponding path program 1 times [2021-10-28 09:37:43,541 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:37:43,541 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847798874] [2021-10-28 09:37:43,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:37:43,543 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:37:43,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:37:44,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:37:44,235 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:37:44,236 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847798874] [2021-10-28 09:37:44,237 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847798874] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:37:44,237 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:37:44,237 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-28 09:37:44,241 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992992319] [2021-10-28 09:37:44,250 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-10-28 09:37:44,250 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:37:44,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-10-28 09:37:44,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-10-28 09:37:44,267 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-10-28 09:37:44,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:37:44,307 INFO L93 Difference]: Finished difference Result 323 states and 425 transitions. [2021-10-28 09:37:44,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-10-28 09:37:44,308 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-10-28 09:37:44,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:37:44,320 INFO L225 Difference]: With dead ends: 323 [2021-10-28 09:37:44,320 INFO L226 Difference]: Without dead ends: 158 [2021-10-28 09:37:44,324 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-10-28 09:37:44,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2021-10-28 09:37:44,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2021-10-28 09:37:44,365 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-10-28 09:37:44,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 190 transitions. [2021-10-28 09:37:44,371 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 190 transitions. Word has length 15 [2021-10-28 09:37:44,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:37:44,371 INFO L470 AbstractCegarLoop]: Abstraction has 158 states and 190 transitions. [2021-10-28 09:37:44,371 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-10-28 09:37:44,372 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 190 transitions. [2021-10-28 09:37:44,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-10-28 09:37:44,373 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:37:44,373 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:37:44,374 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-28 09:37:44,374 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-10-28 09:37:44,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:37:44,375 INFO L85 PathProgramCache]: Analyzing trace with hash -325194356, now seen corresponding path program 1 times [2021-10-28 09:37:44,375 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:37:44,376 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148437052] [2021-10-28 09:37:44,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:37:44,376 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:37:44,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:37:44,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:37:44,669 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:37:44,669 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148437052] [2021-10-28 09:37:44,670 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148437052] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:37:44,670 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:37:44,671 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 09:37:44,671 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457469704] [2021-10-28 09:37:44,672 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 09:37:44,672 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:37:44,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 09:37:44,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:37:44,675 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-10-28 09:37:44,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:37:44,776 INFO L93 Difference]: Finished difference Result 270 states and 323 transitions. [2021-10-28 09:37:44,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 09:37:44,782 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-10-28 09:37:44,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:37:44,784 INFO L225 Difference]: With dead ends: 270 [2021-10-28 09:37:44,784 INFO L226 Difference]: Without dead ends: 238 [2021-10-28 09:37:44,785 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:37:44,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2021-10-28 09:37:44,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 222. [2021-10-28 09:37:44,810 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-10-28 09:37:44,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 267 transitions. [2021-10-28 09:37:44,815 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 267 transitions. Word has length 15 [2021-10-28 09:37:44,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:37:44,815 INFO L470 AbstractCegarLoop]: Abstraction has 222 states and 267 transitions. [2021-10-28 09:37:44,815 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-10-28 09:37:44,816 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 267 transitions. [2021-10-28 09:37:44,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-10-28 09:37:44,816 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:37:44,816 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:37:44,816 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-28 09:37:44,817 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-10-28 09:37:44,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:37:44,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1994950714, now seen corresponding path program 1 times [2021-10-28 09:37:44,817 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:37:44,817 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917483302] [2021-10-28 09:37:44,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:37:44,818 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:37:44,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:37:45,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:37:45,111 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:37:45,112 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917483302] [2021-10-28 09:37:45,112 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917483302] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:37:45,112 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:37:45,112 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 09:37:45,113 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463619021] [2021-10-28 09:37:45,113 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 09:37:45,113 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:37:45,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 09:37:45,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:37:45,119 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-10-28 09:37:45,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:37:45,159 INFO L93 Difference]: Finished difference Result 262 states and 313 transitions. [2021-10-28 09:37:45,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 09:37:45,160 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-10-28 09:37:45,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:37:45,164 INFO L225 Difference]: With dead ends: 262 [2021-10-28 09:37:45,164 INFO L226 Difference]: Without dead ends: 241 [2021-10-28 09:37:45,166 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:37:45,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2021-10-28 09:37:45,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 237. [2021-10-28 09:37:45,198 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-10-28 09:37:45,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 285 transitions. [2021-10-28 09:37:45,200 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 285 transitions. Word has length 16 [2021-10-28 09:37:45,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:37:45,201 INFO L470 AbstractCegarLoop]: Abstraction has 237 states and 285 transitions. [2021-10-28 09:37:45,201 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-10-28 09:37:45,201 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 285 transitions. [2021-10-28 09:37:45,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-10-28 09:37:45,210 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:37:45,210 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:37:45,210 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-28 09:37:45,210 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-10-28 09:37:45,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:37:45,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1734286995, now seen corresponding path program 1 times [2021-10-28 09:37:45,212 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:37:45,212 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987044042] [2021-10-28 09:37:45,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:37:45,212 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:37:45,348 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-10-28 09:37:45,350 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1498596542] [2021-10-28 09:37:45,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:37:45,350 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-28 09:37:45,353 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a74e492e-64fe-4878-9f27-d415726a3cf3/bin/uautomizer-UnR33cPsHg/z3 [2021-10-28 09:37:45,359 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a74e492e-64fe-4878-9f27-d415726a3cf3/bin/uautomizer-UnR33cPsHg/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-28 09:37:45,386 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a74e492e-64fe-4878-9f27-d415726a3cf3/bin/uautomizer-UnR33cPsHg/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-10-28 09:37:46,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:37:46,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 2525 conjuncts, 7 conjunts are in the unsatisfiable core [2021-10-28 09:37:46,559 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-28 09:37:46,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:37:46,928 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:37:46,928 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987044042] [2021-10-28 09:37:46,929 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-10-28 09:37:46,929 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1498596542] [2021-10-28 09:37:46,929 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1498596542] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:37:46,929 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:37:46,930 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-28 09:37:46,930 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999521477] [2021-10-28 09:37:46,930 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-28 09:37:46,931 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:37:46,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-28 09:37:46,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-28 09:37:46,932 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-10-28 09:37:47,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:37:47,294 INFO L93 Difference]: Finished difference Result 627 states and 755 transitions. [2021-10-28 09:37:47,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-28 09:37:47,295 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-10-28 09:37:47,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:37:47,298 INFO L225 Difference]: With dead ends: 627 [2021-10-28 09:37:47,299 INFO L226 Difference]: Without dead ends: 434 [2021-10-28 09:37:47,300 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-28 09:37:47,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2021-10-28 09:37:47,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 255. [2021-10-28 09:37:47,316 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-10-28 09:37:47,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 303 transitions. [2021-10-28 09:37:47,318 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 303 transitions. Word has length 50 [2021-10-28 09:37:47,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:37:47,319 INFO L470 AbstractCegarLoop]: Abstraction has 255 states and 303 transitions. [2021-10-28 09:37:47,319 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-10-28 09:37:47,319 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 303 transitions. [2021-10-28 09:37:47,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-10-28 09:37:47,321 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:37:47,321 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:37:47,358 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a74e492e-64fe-4878-9f27-d415726a3cf3/bin/uautomizer-UnR33cPsHg/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-10-28 09:37:47,542 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a74e492e-64fe-4878-9f27-d415726a3cf3/bin/uautomizer-UnR33cPsHg/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-28 09:37:47,542 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-10-28 09:37:47,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:37:47,543 INFO L85 PathProgramCache]: Analyzing trace with hash -569476781, now seen corresponding path program 1 times [2021-10-28 09:37:47,543 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:37:47,543 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514762313] [2021-10-28 09:37:47,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:37:47,544 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:37:47,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:37:48,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:37:48,205 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:37:48,205 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514762313] [2021-10-28 09:37:48,206 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514762313] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:37:48,206 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:37:48,206 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-28 09:37:48,206 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053535432] [2021-10-28 09:37:48,207 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-28 09:37:48,207 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:37:48,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-28 09:37:48,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-10-28 09:37:48,208 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-10-28 09:37:53,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:37:53,586 INFO L93 Difference]: Finished difference Result 454 states and 538 transitions. [2021-10-28 09:37:53,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-28 09:37:53,587 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-10-28 09:37:53,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:37:53,589 INFO L225 Difference]: With dead ends: 454 [2021-10-28 09:37:53,590 INFO L226 Difference]: Without dead ends: 308 [2021-10-28 09:37:53,590 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2021-10-28 09:37:53,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2021-10-28 09:37:53,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 257. [2021-10-28 09:37:53,604 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-10-28 09:37:53,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 305 transitions. [2021-10-28 09:37:53,606 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 305 transitions. Word has length 54 [2021-10-28 09:37:53,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:37:53,606 INFO L470 AbstractCegarLoop]: Abstraction has 257 states and 305 transitions. [2021-10-28 09:37:53,607 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-10-28 09:37:53,607 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 305 transitions. [2021-10-28 09:37:53,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-10-28 09:37:53,608 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:37:53,609 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:37:53,609 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-28 09:37:53,609 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-10-28 09:37:53,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:37:53,610 INFO L85 PathProgramCache]: Analyzing trace with hash 132123093, now seen corresponding path program 1 times [2021-10-28 09:37:53,610 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:37:53,610 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731603453] [2021-10-28 09:37:53,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:37:53,611 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:37:53,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:37:53,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:37:53,952 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:37:53,952 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731603453] [2021-10-28 09:37:53,952 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731603453] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:37:53,952 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:37:53,952 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 09:37:53,953 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860712778] [2021-10-28 09:37:53,953 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 09:37:53,953 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:37:53,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 09:37:53,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-28 09:37:53,954 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-10-28 09:37:54,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:37:54,079 INFO L93 Difference]: Finished difference Result 406 states and 483 transitions. [2021-10-28 09:37:54,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-28 09:37:54,080 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-10-28 09:37:54,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:37:54,082 INFO L225 Difference]: With dead ends: 406 [2021-10-28 09:37:54,083 INFO L226 Difference]: Without dead ends: 255 [2021-10-28 09:37:54,083 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-28 09:37:54,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2021-10-28 09:37:54,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 255. [2021-10-28 09:37:54,096 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-10-28 09:37:54,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 300 transitions. [2021-10-28 09:37:54,098 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 300 transitions. Word has length 54 [2021-10-28 09:37:54,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:37:54,099 INFO L470 AbstractCegarLoop]: Abstraction has 255 states and 300 transitions. [2021-10-28 09:37:54,099 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-10-28 09:37:54,099 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 300 transitions. [2021-10-28 09:37:54,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-10-28 09:37:54,100 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:37:54,101 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:37:54,101 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-28 09:37:54,101 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-10-28 09:37:54,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:37:54,102 INFO L85 PathProgramCache]: Analyzing trace with hash 844082519, now seen corresponding path program 1 times [2021-10-28 09:37:54,102 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:37:54,102 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461920405] [2021-10-28 09:37:54,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:37:54,103 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:37:54,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:37:54,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:37:54,565 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:37:54,565 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461920405] [2021-10-28 09:37:54,566 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461920405] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:37:54,566 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:37:54,566 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-28 09:37:54,566 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895331362] [2021-10-28 09:37:54,566 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-28 09:37:54,567 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:37:54,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-28 09:37:54,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-10-28 09:37:54,567 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-10-28 09:37:59,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:37:59,676 INFO L93 Difference]: Finished difference Result 401 states and 469 transitions. [2021-10-28 09:37:59,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-28 09:37:59,678 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-10-28 09:37:59,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:37:59,680 INFO L225 Difference]: With dead ends: 401 [2021-10-28 09:37:59,680 INFO L226 Difference]: Without dead ends: 303 [2021-10-28 09:37:59,681 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2021-10-28 09:37:59,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2021-10-28 09:37:59,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 259. [2021-10-28 09:37:59,698 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-10-28 09:37:59,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 304 transitions. [2021-10-28 09:37:59,699 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 304 transitions. Word has length 55 [2021-10-28 09:37:59,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:37:59,700 INFO L470 AbstractCegarLoop]: Abstraction has 259 states and 304 transitions. [2021-10-28 09:37:59,700 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-10-28 09:37:59,700 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 304 transitions. [2021-10-28 09:37:59,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-10-28 09:37:59,701 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:37:59,702 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:37:59,702 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-28 09:37:59,702 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-10-28 09:37:59,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:37:59,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1545682393, now seen corresponding path program 1 times [2021-10-28 09:37:59,703 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:37:59,703 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868890694] [2021-10-28 09:37:59,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:37:59,704 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:37:59,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:38:00,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:38:00,048 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:38:00,049 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868890694] [2021-10-28 09:38:00,049 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868890694] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:38:00,049 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:38:00,049 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 09:38:00,049 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421413688] [2021-10-28 09:38:00,049 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 09:38:00,050 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:38:00,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 09:38:00,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-28 09:38:00,050 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-10-28 09:38:00,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:38:00,163 INFO L93 Difference]: Finished difference Result 373 states and 438 transitions. [2021-10-28 09:38:00,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-28 09:38:00,164 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-10-28 09:38:00,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:38:00,166 INFO L225 Difference]: With dead ends: 373 [2021-10-28 09:38:00,166 INFO L226 Difference]: Without dead ends: 255 [2021-10-28 09:38:00,167 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-28 09:38:00,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2021-10-28 09:38:00,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 255. [2021-10-28 09:38:00,182 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-10-28 09:38:00,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 294 transitions. [2021-10-28 09:38:00,184 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 294 transitions. Word has length 55 [2021-10-28 09:38:00,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:38:00,185 INFO L470 AbstractCegarLoop]: Abstraction has 255 states and 294 transitions. [2021-10-28 09:38:00,185 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-10-28 09:38:00,185 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 294 transitions. [2021-10-28 09:38:00,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-10-28 09:38:00,186 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:38:00,187 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:38:00,187 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-28 09:38:00,187 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-10-28 09:38:00,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:38:00,188 INFO L85 PathProgramCache]: Analyzing trace with hash 209502350, now seen corresponding path program 1 times [2021-10-28 09:38:00,188 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:38:00,188 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145588316] [2021-10-28 09:38:00,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:38:00,188 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:38:00,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:38:00,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:38:00,546 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:38:00,546 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145588316] [2021-10-28 09:38:00,546 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145588316] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:38:00,546 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:38:00,546 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-28 09:38:00,546 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578694777] [2021-10-28 09:38:00,547 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-28 09:38:00,547 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:38:00,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-28 09:38:00,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-28 09:38:00,547 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-10-28 09:38:05,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:38:05,542 INFO L93 Difference]: Finished difference Result 439 states and 506 transitions. [2021-10-28 09:38:05,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-28 09:38:05,543 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-10-28 09:38:05,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:38:05,545 INFO L225 Difference]: With dead ends: 439 [2021-10-28 09:38:05,546 INFO L226 Difference]: Without dead ends: 258 [2021-10-28 09:38:05,546 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-10-28 09:38:05,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2021-10-28 09:38:05,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 255. [2021-10-28 09:38:05,565 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-10-28 09:38:05,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 288 transitions. [2021-10-28 09:38:05,567 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 288 transitions. Word has length 56 [2021-10-28 09:38:05,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:38:05,567 INFO L470 AbstractCegarLoop]: Abstraction has 255 states and 288 transitions. [2021-10-28 09:38:05,568 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-10-28 09:38:05,568 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 288 transitions. [2021-10-28 09:38:05,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-10-28 09:38:05,569 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:38:05,569 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:38:05,569 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-28 09:38:05,570 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-10-28 09:38:05,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:38:05,570 INFO L85 PathProgramCache]: Analyzing trace with hash -693818886, now seen corresponding path program 1 times [2021-10-28 09:38:05,571 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:38:05,571 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303129984] [2021-10-28 09:38:05,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:38:05,571 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:38:06,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:38:08,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:38:08,468 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:38:08,468 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303129984] [2021-10-28 09:38:08,469 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303129984] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:38:08,469 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:38:08,469 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-10-28 09:38:08,469 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697096650] [2021-10-28 09:38:08,470 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-10-28 09:38:08,470 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:38:08,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-10-28 09:38:08,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2021-10-28 09:38:08,472 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-10-28 09:38:35,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:38:35,347 INFO L93 Difference]: Finished difference Result 336 states and 378 transitions. [2021-10-28 09:38:35,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-10-28 09:38:35,347 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-10-28 09:38:35,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:38:35,352 INFO L225 Difference]: With dead ends: 336 [2021-10-28 09:38:35,353 INFO L226 Difference]: Without dead ends: 327 [2021-10-28 09:38:35,354 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=218, Invalid=972, Unknown=0, NotChecked=0, Total=1190 [2021-10-28 09:38:35,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2021-10-28 09:38:35,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 275. [2021-10-28 09:38:35,379 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-10-28 09:38:35,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 312 transitions. [2021-10-28 09:38:35,381 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 312 transitions. Word has length 57 [2021-10-28 09:38:35,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:38:35,382 INFO L470 AbstractCegarLoop]: Abstraction has 275 states and 312 transitions. [2021-10-28 09:38:35,382 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-10-28 09:38:35,383 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 312 transitions. [2021-10-28 09:38:35,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-10-28 09:38:35,384 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:38:35,384 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:38:35,384 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-28 09:38:35,385 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-10-28 09:38:35,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:38:35,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1205998898, now seen corresponding path program 1 times [2021-10-28 09:38:35,385 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:38:35,386 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999576454] [2021-10-28 09:38:35,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:38:35,386 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:38:35,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:38:36,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:38:36,753 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:38:36,753 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999576454] [2021-10-28 09:38:36,754 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999576454] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:38:36,754 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:38:36,754 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-28 09:38:36,754 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708975090] [2021-10-28 09:38:36,755 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-28 09:38:36,755 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:38:36,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-28 09:38:36,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-10-28 09:38:36,756 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-10-28 09:38:47,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:38:47,549 INFO L93 Difference]: Finished difference Result 354 states and 396 transitions. [2021-10-28 09:38:47,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-10-28 09:38:47,550 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-10-28 09:38:47,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:38:47,553 INFO L225 Difference]: With dead ends: 354 [2021-10-28 09:38:47,553 INFO L226 Difference]: Without dead ends: 345 [2021-10-28 09:38:47,554 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=145, Invalid=455, Unknown=0, NotChecked=0, Total=600 [2021-10-28 09:38:47,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2021-10-28 09:38:47,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 323. [2021-10-28 09:38:47,582 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-10-28 09:38:47,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 370 transitions. [2021-10-28 09:38:47,584 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 370 transitions. Word has length 58 [2021-10-28 09:38:47,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:38:47,584 INFO L470 AbstractCegarLoop]: Abstraction has 323 states and 370 transitions. [2021-10-28 09:38:47,585 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-10-28 09:38:47,585 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 370 transitions. [2021-10-28 09:38:47,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-10-28 09:38:47,586 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:38:47,586 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:38:47,586 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-28 09:38:47,587 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-10-28 09:38:47,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:38:47,587 INFO L85 PathProgramCache]: Analyzing trace with hash 1380900098, now seen corresponding path program 1 times [2021-10-28 09:38:47,587 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:38:47,588 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067995315] [2021-10-28 09:38:47,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:38:47,588 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:38:48,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:38:49,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:38:49,200 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:38:49,200 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067995315] [2021-10-28 09:38:49,200 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067995315] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:38:49,200 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:38:49,200 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 09:38:49,201 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611800589] [2021-10-28 09:38:49,201 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 09:38:49,201 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:38:49,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 09:38:49,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 09:38:49,202 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-10-28 09:38:49,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:38:49,433 INFO L93 Difference]: Finished difference Result 610 states and 695 transitions. [2021-10-28 09:38:49,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-28 09:38:49,433 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-10-28 09:38:49,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:38:49,436 INFO L225 Difference]: With dead ends: 610 [2021-10-28 09:38:49,436 INFO L226 Difference]: Without dead ends: 323 [2021-10-28 09:38:49,436 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-28 09:38:49,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2021-10-28 09:38:49,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 314. [2021-10-28 09:38:49,457 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-10-28 09:38:49,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 346 transitions. [2021-10-28 09:38:49,459 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 346 transitions. Word has length 60 [2021-10-28 09:38:49,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:38:49,459 INFO L470 AbstractCegarLoop]: Abstraction has 314 states and 346 transitions. [2021-10-28 09:38:49,460 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-10-28 09:38:49,460 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 346 transitions. [2021-10-28 09:38:49,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-10-28 09:38:49,461 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:38:49,461 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:38:49,461 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-28 09:38:49,461 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-10-28 09:38:49,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:38:49,462 INFO L85 PathProgramCache]: Analyzing trace with hash 778166894, now seen corresponding path program 1 times [2021-10-28 09:38:49,462 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:38:49,462 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833056703] [2021-10-28 09:38:49,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:38:49,463 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:38:49,543 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-10-28 09:38:49,544 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [732481156] [2021-10-28 09:38:49,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:38:49,544 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-28 09:38:49,544 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a74e492e-64fe-4878-9f27-d415726a3cf3/bin/uautomizer-UnR33cPsHg/z3 [2021-10-28 09:38:49,546 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a74e492e-64fe-4878-9f27-d415726a3cf3/bin/uautomizer-UnR33cPsHg/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-28 09:38:49,564 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a74e492e-64fe-4878-9f27-d415726a3cf3/bin/uautomizer-UnR33cPsHg/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-10-28 09:38:50,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:38:50,555 INFO L263 TraceCheckSpWp]: Trace formula consists of 2717 conjuncts, 87 conjunts are in the unsatisfiable core [2021-10-28 09:38:50,566 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-28 09:38:52,069 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-10-28 09:38:52,097 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 29 [2021-10-28 09:38:52,112 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2021-10-28 09:38:52,486 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-10-28 09:38:52,630 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2021-10-28 09:38:53,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:38:53,413 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:38:53,413 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833056703] [2021-10-28 09:38:53,413 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-10-28 09:38:53,413 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [732481156] [2021-10-28 09:38:53,413 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [732481156] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:38:53,414 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:38:53,414 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-10-28 09:38:53,414 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703893030] [2021-10-28 09:38:53,415 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-10-28 09:38:53,415 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:38:53,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-10-28 09:38:53,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-10-28 09:38:53,416 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-10-28 09:39:21,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:39:21,351 INFO L93 Difference]: Finished difference Result 334 states and 366 transitions. [2021-10-28 09:39:21,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-28 09:39:21,352 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-10-28 09:39:21,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:39:21,354 INFO L225 Difference]: With dead ends: 334 [2021-10-28 09:39:21,354 INFO L226 Difference]: Without dead ends: 106 [2021-10-28 09:39:21,355 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=207, Invalid=495, Unknown=0, NotChecked=0, Total=702 [2021-10-28 09:39:21,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2021-10-28 09:39:21,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2021-10-28 09:39:21,365 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-10-28 09:39:21,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 113 transitions. [2021-10-28 09:39:21,366 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 113 transitions. Word has length 63 [2021-10-28 09:39:21,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:39:21,367 INFO L470 AbstractCegarLoop]: Abstraction has 106 states and 113 transitions. [2021-10-28 09:39:21,367 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-10-28 09:39:21,367 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 113 transitions. [2021-10-28 09:39:21,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-10-28 09:39:21,368 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:39:21,368 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:39:21,420 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a74e492e-64fe-4878-9f27-d415726a3cf3/bin/uautomizer-UnR33cPsHg/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-10-28 09:39:21,582 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a74e492e-64fe-4878-9f27-d415726a3cf3/bin/uautomizer-UnR33cPsHg/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-28 09:39:21,582 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-10-28 09:39:21,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:39:21,583 INFO L85 PathProgramCache]: Analyzing trace with hash -135931354, now seen corresponding path program 1 times [2021-10-28 09:39:21,583 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:39:21,583 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773296138] [2021-10-28 09:39:21,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:39:21,583 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:39:21,678 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-10-28 09:39:21,679 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [112665616] [2021-10-28 09:39:21,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:39:21,679 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-28 09:39:21,679 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a74e492e-64fe-4878-9f27-d415726a3cf3/bin/uautomizer-UnR33cPsHg/z3 [2021-10-28 09:39:21,682 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a74e492e-64fe-4878-9f27-d415726a3cf3/bin/uautomizer-UnR33cPsHg/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-28 09:39:21,702 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a74e492e-64fe-4878-9f27-d415726a3cf3/bin/uautomizer-UnR33cPsHg/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-10-28 09:39:22,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:39:22,820 INFO L263 TraceCheckSpWp]: Trace formula consists of 2719 conjuncts, 83 conjunts are in the unsatisfiable core [2021-10-28 09:39:22,830 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-28 09:39:24,352 INFO L354 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2021-10-28 09:39:24,353 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-10-28 09:39:24,370 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-10-28 09:39:24,378 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-10-28 09:39:24,818 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-10-28 09:39:25,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:39:25,546 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:39:25,547 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773296138] [2021-10-28 09:39:25,547 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-10-28 09:39:25,547 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [112665616] [2021-10-28 09:39:25,547 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [112665616] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:39:25,547 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:39:25,547 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-10-28 09:39:25,548 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776964845] [2021-10-28 09:39:25,548 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-10-28 09:39:25,548 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:39:25,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-10-28 09:39:25,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2021-10-28 09:39:25,549 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-10-28 09:39:43,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:39:43,483 INFO L93 Difference]: Finished difference Result 106 states and 113 transitions. [2021-10-28 09:39:43,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-28 09:39:43,483 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-10-28 09:39:43,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:39:43,483 INFO L225 Difference]: With dead ends: 106 [2021-10-28 09:39:43,483 INFO L226 Difference]: Without dead ends: 0 [2021-10-28 09:39:43,484 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=208, Invalid=494, Unknown=0, NotChecked=0, Total=702 [2021-10-28 09:39:43,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-10-28 09:39:43,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-10-28 09:39:43,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:39:43,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-10-28 09:39:43,485 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 64 [2021-10-28 09:39:43,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:39:43,485 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-28 09:39:43,485 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-10-28 09:39:43,485 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-10-28 09:39:43,485 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-10-28 09:39:43,488 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:39:43,488 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:39:43,489 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:39:43,489 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:39:43,542 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a74e492e-64fe-4878-9f27-d415726a3cf3/bin/uautomizer-UnR33cPsHg/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-10-28 09:39:43,702 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a74e492e-64fe-4878-9f27-d415726a3cf3/bin/uautomizer-UnR33cPsHg/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-10-28 09:39:43,704 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-10-28 09:39:43,708 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:39:43,715 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:39:43,726 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:39:43,746 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:39:43,747 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:39:43,756 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:39:43,757 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:39:43,760 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:39:43,763 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:39:43,766 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:39:43,775 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:39:43,778 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:39:43,784 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:39:43,796 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:39:43,796 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:39:43,798 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:39:43,801 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:39:43,804 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:39:43,805 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:39:43,809 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:39:43,811 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:39:43,811 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:39:43,813 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:39:43,814 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:39:43,815 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:39:43,815 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:39:43,816 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:39:43,816 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:39:43,824 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:39:43,826 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:39:43,826 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:39:43,827 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:39:43,828 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:39:43,831 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:39:43,831 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:39:43,832 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:39:43,834 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:39:43,842 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:39:43,844 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:39:43,845 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:39:43,846 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:39:43,849 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:39:43,850 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:39:43,854 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:39:43,855 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:39:43,859 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:39:43,861 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:39:43,863 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:39:43,869 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:39:43,871 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:39:43,877 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:39:43,878 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:39:43,879 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:39:43,884 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:39:43,884 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:39:43,885 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:39:43,890 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:39:50,441 INFO L853 garLoopResultBuilder]: At program point L10044(lines 9999 10046) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_hash_table_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-10-28 09:39:50,442 INFO L853 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-10-28 09:39:50,442 INFO L853 garLoopResultBuilder]: At program point L10044-2(lines 9999 10046) the Hoare annotation is: false [2021-10-28 09:39:50,442 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-10-28 09:39:50,442 INFO L853 garLoopResultBuilder]: At program point L10044-3(lines 9999 10046) the Hoare annotation is: false [2021-10-28 09:39:50,443 INFO L857 garLoopResultBuilder]: For program point L10144(lines 10114 10152) no Hoare annotation was computed. [2021-10-28 09:39:50,443 INFO L853 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-10-28 09:39:50,443 INFO L853 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-10-28 09:39:50,443 INFO L853 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-10-28 09:39:50,443 INFO L853 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-10-28 09:39:50,443 INFO L857 garLoopResultBuilder]: For program point L6809-1(lines 6809 6819) no Hoare annotation was computed. [2021-10-28 09:39:50,443 INFO L857 garLoopResultBuilder]: For program point L6809(lines 6809 6819) no Hoare annotation was computed. [2021-10-28 09:39:50,444 INFO L857 garLoopResultBuilder]: For program point L10114(lines 10114 10152) no Hoare annotation was computed. [2021-10-28 09:39:50,444 INFO L857 garLoopResultBuilder]: For program point L10148(lines 10148 10151) no Hoare annotation was computed. [2021-10-28 09:39:50,444 INFO L853 garLoopResultBuilder]: At program point L2617-1(lines 2613 2621) the Hoare annotation is: false [2021-10-28 09:39:50,444 INFO L853 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-10-28 09:39:50,444 INFO L853 garLoopResultBuilder]: At program point L2617-3(lines 2613 2621) the Hoare annotation is: false [2021-10-28 09:39:50,445 INFO L853 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-10-28 09:39:50,445 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-10-28 09:39:50,445 INFO L853 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-10-28 09:39:50,446 INFO L853 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-10-28 09:39:50,446 INFO L857 garLoopResultBuilder]: For program point L210(lines 210 212) no Hoare annotation was computed. [2021-10-28 09:39:50,446 INFO L857 garLoopResultBuilder]: For program point L210-1(lines 210 212) no Hoare annotation was computed. [2021-10-28 09:39:50,446 INFO L857 garLoopResultBuilder]: For program point L210-2(lines 210 212) no Hoare annotation was computed. [2021-10-28 09:39:50,446 INFO L857 garLoopResultBuilder]: For program point L210-3(lines 210 212) no Hoare annotation was computed. [2021-10-28 09:39:50,447 INFO L857 garLoopResultBuilder]: For program point L210-4(lines 210 212) no Hoare annotation was computed. [2021-10-28 09:39:50,447 INFO L857 garLoopResultBuilder]: For program point L210-5(lines 210 212) no Hoare annotation was computed. [2021-10-28 09:39:50,447 INFO L857 garLoopResultBuilder]: For program point L210-6(lines 210 212) no Hoare annotation was computed. [2021-10-28 09:39:50,447 INFO L857 garLoopResultBuilder]: For program point L210-7(lines 210 212) no Hoare annotation was computed. [2021-10-28 09:39:50,447 INFO L857 garLoopResultBuilder]: For program point L210-8(lines 210 212) no Hoare annotation was computed. [2021-10-28 09:39:50,448 INFO L857 garLoopResultBuilder]: For program point L210-9(lines 210 212) no Hoare annotation was computed. [2021-10-28 09:39:50,448 INFO L857 garLoopResultBuilder]: For program point L210-10(lines 210 212) no Hoare annotation was computed. [2021-10-28 09:39:50,448 INFO L857 garLoopResultBuilder]: For program point L210-11(lines 210 212) no Hoare annotation was computed. [2021-10-28 09:39:50,448 INFO L857 garLoopResultBuilder]: For program point L210-12(lines 210 212) no Hoare annotation was computed. [2021-10-28 09:39:50,448 INFO L857 garLoopResultBuilder]: For program point L210-13(lines 210 212) no Hoare annotation was computed. [2021-10-28 09:39:50,449 INFO L860 garLoopResultBuilder]: At program point L10153(line 10153) the Hoare annotation is: true [2021-10-28 09:39:50,449 INFO L857 garLoopResultBuilder]: For program point L210-14(lines 210 212) no Hoare annotation was computed. [2021-10-28 09:39:50,449 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-10-28 09:39:50,449 INFO L857 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2021-10-28 09:39:50,449 INFO L857 garLoopResultBuilder]: For program point L211-2(line 211) no Hoare annotation was computed. [2021-10-28 09:39:50,450 INFO L857 garLoopResultBuilder]: For program point L211-4(line 211) no Hoare annotation was computed. [2021-10-28 09:39:50,450 INFO L857 garLoopResultBuilder]: For program point L211-6(line 211) no Hoare annotation was computed. [2021-10-28 09:39:50,450 INFO L857 garLoopResultBuilder]: For program point L211-8(line 211) no Hoare annotation was computed. [2021-10-28 09:39:50,450 INFO L857 garLoopResultBuilder]: For program point L211-10(line 211) no Hoare annotation was computed. [2021-10-28 09:39:50,451 INFO L857 garLoopResultBuilder]: For program point L211-12(line 211) no Hoare annotation was computed. [2021-10-28 09:39:50,451 INFO L857 garLoopResultBuilder]: For program point L211-14(line 211) no Hoare annotation was computed. [2021-10-28 09:39:50,451 INFO L857 garLoopResultBuilder]: For program point L211-16(line 211) no Hoare annotation was computed. [2021-10-28 09:39:50,451 INFO L857 garLoopResultBuilder]: For program point L211-18(line 211) no Hoare annotation was computed. [2021-10-28 09:39:50,451 INFO L853 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-10-28 09:39:50,452 INFO L857 garLoopResultBuilder]: For program point L211-20(line 211) no Hoare annotation was computed. [2021-10-28 09:39:50,452 INFO L853 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-10-28 09:39:50,452 INFO L857 garLoopResultBuilder]: For program point L211-22(line 211) no Hoare annotation was computed. [2021-10-28 09:39:50,452 INFO L853 garLoopResultBuilder]: At program point L2590-1(lines 2586 2594) the Hoare annotation is: false [2021-10-28 09:39:50,453 INFO L857 garLoopResultBuilder]: For program point L211-24(line 211) no Hoare annotation was computed. [2021-10-28 09:39:50,453 INFO L853 garLoopResultBuilder]: At program point L2590-3(lines 2586 2594) the Hoare annotation is: false [2021-10-28 09:39:50,453 INFO L857 garLoopResultBuilder]: For program point L211-26(line 211) no Hoare annotation was computed. [2021-10-28 09:39:50,453 INFO L857 garLoopResultBuilder]: For program point L211-28(line 211) no Hoare annotation was computed. [2021-10-28 09:39:50,453 INFO L857 garLoopResultBuilder]: For program point L9990-2(line 9990) no Hoare annotation was computed. [2021-10-28 09:39:50,453 INFO L857 garLoopResultBuilder]: For program point L9990-3(line 9990) no Hoare annotation was computed. [2021-10-28 09:39:50,454 INFO L857 garLoopResultBuilder]: For program point L9990(line 9990) no Hoare annotation was computed. [2021-10-28 09:39:50,454 INFO L857 garLoopResultBuilder]: For program point L9990-9(line 9990) no Hoare annotation was computed. [2021-10-28 09:39:50,454 INFO L857 garLoopResultBuilder]: For program point L9990-10(line 9990) no Hoare annotation was computed. [2021-10-28 09:39:50,454 INFO L857 garLoopResultBuilder]: For program point L9990-12(line 9990) no Hoare annotation was computed. [2021-10-28 09:39:50,454 INFO L857 garLoopResultBuilder]: For program point L9990-5(line 9990) no Hoare annotation was computed. [2021-10-28 09:39:50,455 INFO L853 garLoopResultBuilder]: At program point L9990-6(lines 9988 9991) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_hash_table_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-10-28 09:39:50,455 INFO L857 garLoopResultBuilder]: For program point L9990-7(line 9990) no Hoare annotation was computed. [2021-10-28 09:39:50,455 INFO L857 garLoopResultBuilder]: For program point L9990-17(line 9990) no Hoare annotation was computed. [2021-10-28 09:39:50,455 INFO L857 garLoopResultBuilder]: For program point L9990-19(line 9990) no Hoare annotation was computed. [2021-10-28 09:39:50,456 INFO L853 garLoopResultBuilder]: At program point L9990-20(lines 9988 9991) the Hoare annotation is: false [2021-10-28 09:39:50,456 INFO L853 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-10-28 09:39:50,456 INFO L857 garLoopResultBuilder]: For program point L9990-14(line 9990) no Hoare annotation was computed. [2021-10-28 09:39:50,456 INFO L857 garLoopResultBuilder]: For program point L9990-16(line 9990) no Hoare annotation was computed. [2021-10-28 09:39:50,457 INFO L857 garLoopResultBuilder]: For program point L9990-26(line 9990) no Hoare annotation was computed. [2021-10-28 09:39:50,457 INFO L853 garLoopResultBuilder]: At program point L9990-27(lines 9988 9991) the Hoare annotation is: false [2021-10-28 09:39:50,457 INFO L857 garLoopResultBuilder]: For program point L9990-21(line 9990) no Hoare annotation was computed. [2021-10-28 09:39:50,457 INFO L857 garLoopResultBuilder]: For program point L9990-23(line 9990) no Hoare annotation was computed. [2021-10-28 09:39:50,457 INFO L857 garLoopResultBuilder]: For program point L9990-24(line 9990) no Hoare annotation was computed. [2021-10-28 09:39:50,458 INFO L853 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-10-28 09:39:50,458 INFO L853 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-10-28 09:39:50,458 INFO L853 garLoopResultBuilder]: At program point L1998-2(lines 1988 1999) the Hoare annotation is: false [2021-10-28 09:39:50,458 INFO L853 garLoopResultBuilder]: At program point L1998-3(lines 1988 1999) the Hoare annotation is: false [2021-10-28 09:39:50,458 INFO L853 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-10-28 09:39:50,459 INFO L853 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-10-28 09:39:50,459 INFO L853 garLoopResultBuilder]: At program point L1998-6(lines 1988 1999) the Hoare annotation is: false [2021-10-28 09:39:50,459 INFO L853 garLoopResultBuilder]: At program point L1998-7(lines 1988 1999) the Hoare annotation is: false [2021-10-28 09:39:50,459 INFO L853 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-10-28 09:39:50,460 INFO L853 garLoopResultBuilder]: At program point L250-1(lines 248 251) the Hoare annotation is: false [2021-10-28 09:39:50,460 INFO L857 garLoopResultBuilder]: For program point L7385-3(lines 7385 7387) no Hoare annotation was computed. [2021-10-28 09:39:50,460 INFO L857 garLoopResultBuilder]: For program point L7385-2(lines 7385 7387) no Hoare annotation was computed. [2021-10-28 09:39:50,460 INFO L853 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-10-28 09:39:50,461 INFO L857 garLoopResultBuilder]: For program point L7385-1(lines 7385 7387) no Hoare annotation was computed. [2021-10-28 09:39:50,461 INFO L853 garLoopResultBuilder]: At program point L250-3(lines 248 251) the Hoare annotation is: false [2021-10-28 09:39:50,461 INFO L857 garLoopResultBuilder]: For program point L7385(lines 7385 7387) no Hoare annotation was computed. [2021-10-28 09:39:50,461 INFO L857 garLoopResultBuilder]: For program point L7385-7(lines 7385 7387) no Hoare annotation was computed. [2021-10-28 09:39:50,461 INFO L857 garLoopResultBuilder]: For program point L7385-6(lines 7385 7387) no Hoare annotation was computed. [2021-10-28 09:39:50,462 INFO L857 garLoopResultBuilder]: For program point L7385-5(lines 7385 7387) no Hoare annotation was computed. [2021-10-28 09:39:50,462 INFO L857 garLoopResultBuilder]: For program point L7385-4(lines 7385 7387) no Hoare annotation was computed. [2021-10-28 09:39:50,462 INFO L857 garLoopResultBuilder]: For program point L10127(lines 10127 10133) no Hoare annotation was computed. [2021-10-28 09:39:50,462 INFO L857 garLoopResultBuilder]: For program point L10127-1(lines 10114 10152) no Hoare annotation was computed. [2021-10-28 09:39:50,462 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-10-28 09:39:50,462 INFO L853 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-10-28 09:39:50,463 INFO L853 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-10-28 09:39:50,463 INFO L853 garLoopResultBuilder]: At program point L2630-1(lines 2626 2631) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_hash_table_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-10-28 09:39:50,463 INFO L857 garLoopResultBuilder]: For program point L2498(lines 2498 2499) no Hoare annotation was computed. [2021-10-28 09:39:50,464 INFO L853 garLoopResultBuilder]: At program point L2630-4(lines 2626 2631) the Hoare annotation is: false [2021-10-28 09:39:50,464 INFO L853 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-10-28 09:39:50,464 INFO L857 garLoopResultBuilder]: For program point L2498-2(lines 2498 2499) no Hoare annotation was computed. [2021-10-28 09:39:50,464 INFO L857 garLoopResultBuilder]: For program point L2498-1(lines 2498 2499) no Hoare annotation was computed. [2021-10-28 09:39:50,464 INFO L853 garLoopResultBuilder]: At program point L2630-5(lines 2626 2631) the Hoare annotation is: false [2021-10-28 09:39:50,465 INFO L857 garLoopResultBuilder]: For program point L2498-3(lines 2498 2499) no Hoare annotation was computed. [2021-10-28 09:39:50,465 INFO L853 garLoopResultBuilder]: At program point L2501-1(lines 2497 2502) the Hoare annotation is: false [2021-10-28 09:39:50,465 INFO L853 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-10-28 09:39:50,465 INFO L853 garLoopResultBuilder]: At program point L2501-3(lines 2497 2502) the Hoare annotation is: false [2021-10-28 09:39:50,466 INFO L853 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-10-28 09:39:50,466 INFO L853 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-10-28 09:39:50,466 INFO L853 garLoopResultBuilder]: At program point L255-1(lines 253 256) the Hoare annotation is: false [2021-10-28 09:39:50,466 INFO L857 garLoopResultBuilder]: For program point L222(lines 222 224) no Hoare annotation was computed. [2021-10-28 09:39:50,466 INFO L853 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-10-28 09:39:50,467 INFO L857 garLoopResultBuilder]: For program point L222-1(lines 222 224) no Hoare annotation was computed. [2021-10-28 09:39:50,467 INFO L853 garLoopResultBuilder]: At program point L255-3(lines 253 256) the Hoare annotation is: false [2021-10-28 09:39:50,467 INFO L857 garLoopResultBuilder]: For program point L222-2(lines 222 224) no Hoare annotation was computed. [2021-10-28 09:39:50,467 INFO L857 garLoopResultBuilder]: For program point L222-3(lines 222 224) no Hoare annotation was computed. [2021-10-28 09:39:50,467 INFO L857 garLoopResultBuilder]: For program point L9273(lines 10144 10147) no Hoare annotation was computed. [2021-10-28 09:39:50,468 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-10-28 09:39:50,468 INFO L857 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2021-10-28 09:39:50,468 INFO L857 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2021-10-28 09:39:50,468 INFO L857 garLoopResultBuilder]: For program point L223-3(line 223) no Hoare annotation was computed. [2021-10-28 09:39:50,468 INFO L857 garLoopResultBuilder]: For program point L223-4(line 223) no Hoare annotation was computed. [2021-10-28 09:39:50,468 INFO L857 garLoopResultBuilder]: For program point L223-6(line 223) no Hoare annotation was computed. [2021-10-28 09:39:50,468 INFO L857 garLoopResultBuilder]: For program point L223-7(line 223) no Hoare annotation was computed. [2021-10-28 09:39:50,468 INFO L857 garLoopResultBuilder]: For program point L223-9(line 223) no Hoare annotation was computed. [2021-10-28 09:39:50,468 INFO L857 garLoopResultBuilder]: For program point L223-10(line 223) no Hoare annotation was computed. [2021-10-28 09:39:50,469 INFO L857 garLoopResultBuilder]: For program point L10001(lines 10001 10005) no Hoare annotation was computed. [2021-10-28 09:39:50,469 INFO L857 garLoopResultBuilder]: For program point L10001-1(lines 10001 10005) no Hoare annotation was computed. [2021-10-28 09:39:50,469 INFO L857 garLoopResultBuilder]: For program point L10001-2(lines 10001 10005) no Hoare annotation was computed. [2021-10-28 09:39:50,469 INFO L857 garLoopResultBuilder]: For program point L10001-3(lines 10001 10005) no Hoare annotation was computed. [2021-10-28 09:39:50,469 INFO L857 garLoopResultBuilder]: For program point L7195-1(lines 7195 7201) no Hoare annotation was computed. [2021-10-28 09:39:50,469 INFO L857 garLoopResultBuilder]: For program point L7195(lines 7195 7201) no Hoare annotation was computed. [2021-10-28 09:39:50,469 INFO L857 garLoopResultBuilder]: For program point L10135(lines 10135 10141) no Hoare annotation was computed. [2021-10-28 09:39:50,469 INFO L857 garLoopResultBuilder]: For program point L7196-2(lines 7196 7200) no Hoare annotation was computed. [2021-10-28 09:39:50,469 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-10-28 09:39:50,469 INFO L857 garLoopResultBuilder]: For program point L7196(lines 7196 7200) no Hoare annotation was computed. [2021-10-28 09:39:50,469 INFO L857 garLoopResultBuilder]: For program point L10104-3(lines 10104 10106) no Hoare annotation was computed. [2021-10-28 09:39:50,469 INFO L857 garLoopResultBuilder]: For program point L10104(lines 10104 10106) no Hoare annotation was computed. [2021-10-28 09:39:50,469 INFO L857 garLoopResultBuilder]: For program point L10104-1(lines 10104 10106) no Hoare annotation was computed. [2021-10-28 09:39:50,470 INFO L857 garLoopResultBuilder]: For program point L10104-2(lines 10104 10106) no Hoare annotation was computed. [2021-10-28 09:39:50,470 INFO L857 garLoopResultBuilder]: For program point L2542(lines 2542 2543) no Hoare annotation was computed. [2021-10-28 09:39:50,470 INFO L857 garLoopResultBuilder]: For program point L2542-2(lines 2542 2543) no Hoare annotation was computed. [2021-10-28 09:39:50,470 INFO L857 garLoopResultBuilder]: For program point L2542-1(lines 2542 2543) no Hoare annotation was computed. [2021-10-28 09:39:50,470 INFO L857 garLoopResultBuilder]: For program point L2542-3(lines 2542 2543) no Hoare annotation was computed. [2021-10-28 09:39:50,470 INFO L853 garLoopResultBuilder]: At program point L263(line 263) the Hoare annotation is: false [2021-10-28 09:39:50,470 INFO L853 garLoopResultBuilder]: At program point L263-1(line 263) the Hoare annotation is: false [2021-10-28 09:39:50,470 INFO L857 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-10-28 09:39:50,470 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-10-28 09:39:50,470 INFO L857 garLoopResultBuilder]: For program point L10108(lines 10108 10110) no Hoare annotation was computed. [2021-10-28 09:39:50,470 INFO L857 garLoopResultBuilder]: For program point L10108-1(lines 10108 10110) no Hoare annotation was computed. [2021-10-28 09:39:50,471 INFO L857 garLoopResultBuilder]: For program point L10108-2(lines 10108 10110) no Hoare annotation was computed. [2021-10-28 09:39:50,471 INFO L857 garLoopResultBuilder]: For program point L10108-3(lines 10108 10110) no Hoare annotation was computed. [2021-10-28 09:39:50,471 INFO L853 garLoopResultBuilder]: At program point L2545-1(lines 2541 2546) the Hoare annotation is: false [2021-10-28 09:39:50,471 INFO L853 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-10-28 09:39:50,471 INFO L853 garLoopResultBuilder]: At program point L2545-3(lines 2541 2546) the Hoare annotation is: false [2021-10-28 09:39:50,471 INFO L853 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-10-28 09:39:50,471 INFO L853 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-10-28 09:39:50,472 INFO L853 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-10-28 09:39:50,474 INFO L731 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:39:50,476 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-28 09:39:50,500 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-28 09:39:50,501 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-28 09:39:50,506 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-28 09:39:50,506 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-28 09:39:50,509 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-28 09:39:50,509 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-28 09:39:50,510 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-28 09:39:50,511 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-28 09:39:50,511 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-28 09:39:50,512 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-28 09:39:50,512 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-28 09:39:50,512 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-28 09:39:50,530 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-28 09:39:50,531 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-28 09:39:50,535 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-28 09:39:50,536 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-28 09:39:50,537 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-28 09:39:50,540 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-28 09:39:50,541 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-28 09:39:50,541 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-28 09:39:50,547 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-28 09:39:50,552 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-28 09:39:50,552 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-28 09:39:50,553 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-28 09:39:50,553 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-28 09:39:50,554 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-28 09:39:50,556 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-28 09:39:50,556 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-28 09:39:50,561 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-28 09:39:50,561 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-28 09:39:50,562 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-28 09:39:50,562 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-28 09:39:50,562 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-28 09:39:50,563 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-28 09:39:50,563 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-28 09:39:50,564 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-28 09:39:50,564 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-28 09:39:50,564 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-28 09:39:50,565 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-28 09:39:50,565 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-28 09:39:50,567 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-28 09:39:50,568 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-28 09:39:50,568 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-28 09:39:50,568 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-28 09:39:50,568 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-28 09:39:50,569 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-28 09:39:50,569 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-28 09:39:50,570 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-28 09:39:50,570 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-28 09:39:50,570 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-28 09:39:50,571 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-28 09:39:50,571 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-28 09:39:50,577 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-28 09:39:50,580 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-28 09:39:50,581 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-28 09:39:50,581 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-28 09:39:50,582 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-28 09:39:50,582 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-28 09:39:50,582 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-28 09:39:50,583 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-28 09:39:50,587 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.10 09:39:50 BoogieIcfgContainer [2021-10-28 09:39:50,588 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-28 09:39:50,588 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-28 09:39:50,588 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-28 09:39:50,589 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-28 09:39:50,589 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 09:37:43" (3/4) ... [2021-10-28 09:39:50,594 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-10-28 09:39:50,628 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 238 nodes and edges [2021-10-28 09:39:50,631 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 93 nodes and edges [2021-10-28 09:39:50,634 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 26 nodes and edges [2021-10-28 09:39:50,637 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2021-10-28 09:39:50,639 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2021-10-28 09:39:50,642 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2021-10-28 09:39:50,644 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-10-28 09:39:50,647 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-28 09:39:50,697 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-10-28 09:39:50,698 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-10-28 09:39:50,700 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-10-28 09:39:50,701 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-10-28 09:39:50,703 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-10-28 09:39:50,703 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-10-28 09:39:50,703 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-10-28 09:39:50,703 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-10-28 09:39:50,704 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-10-28 09:39:50,704 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-10-28 09:39:50,705 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-10-28 09:39:50,705 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-10-28 09:39:51,595 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a74e492e-64fe-4878-9f27-d415726a3cf3/bin/uautomizer-UnR33cPsHg/witness.graphml [2021-10-28 09:39:51,595 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-28 09:39:51,597 INFO L168 Benchmark]: Toolchain (without parser) took 144585.26 ms. Allocated memory was 115.3 MB in the beginning and 438.3 MB in the end (delta: 323.0 MB). Free memory was 75.2 MB in the beginning and 166.0 MB in the end (delta: -90.8 MB). Peak memory consumption was 314.8 MB. Max. memory is 16.1 GB. [2021-10-28 09:39:51,597 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 115.3 MB. Free memory is still 68.3 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-28 09:39:51,599 INFO L168 Benchmark]: CACSL2BoogieTranslator took 4308.53 ms. Allocated memory was 115.3 MB in the beginning and 245.4 MB in the end (delta: 130.0 MB). Free memory was 74.9 MB in the beginning and 128.3 MB in the end (delta: -53.5 MB). Peak memory consumption was 83.0 MB. Max. memory is 16.1 GB. [2021-10-28 09:39:51,599 INFO L168 Benchmark]: Boogie Procedure Inliner took 311.51 ms. Allocated memory is still 245.4 MB. Free memory was 128.3 MB in the beginning and 180.1 MB in the end (delta: -51.7 MB). Peak memory consumption was 11.2 MB. Max. memory is 16.1 GB. [2021-10-28 09:39:51,600 INFO L168 Benchmark]: Boogie Preprocessor took 182.36 ms. Allocated memory is still 245.4 MB. Free memory was 180.1 MB in the beginning and 170.6 MB in the end (delta: 9.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-10-28 09:39:51,602 INFO L168 Benchmark]: RCFGBuilder took 11604.75 ms. Allocated memory was 245.4 MB in the beginning and 304.1 MB in the end (delta: 58.7 MB). Free memory was 170.6 MB in the beginning and 175.3 MB in the end (delta: -4.7 MB). Peak memory consumption was 180.0 MB. Max. memory is 16.1 GB. [2021-10-28 09:39:51,603 INFO L168 Benchmark]: TraceAbstraction took 127163.70 ms. Allocated memory was 304.1 MB in the beginning and 438.3 MB in the end (delta: 134.2 MB). Free memory was 174.3 MB in the beginning and 170.2 MB in the end (delta: 4.1 MB). Peak memory consumption was 138.3 MB. Max. memory is 16.1 GB. [2021-10-28 09:39:51,603 INFO L168 Benchmark]: Witness Printer took 1006.65 ms. Allocated memory is still 438.3 MB. Free memory was 170.2 MB in the beginning and 166.0 MB in the end (delta: 4.2 MB). Peak memory consumption was 87.1 MB. Max. memory is 16.1 GB. [2021-10-28 09:39:51,606 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.28 ms. Allocated memory is still 115.3 MB. Free memory is still 68.3 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 4308.53 ms. Allocated memory was 115.3 MB in the beginning and 245.4 MB in the end (delta: 130.0 MB). Free memory was 74.9 MB in the beginning and 128.3 MB in the end (delta: -53.5 MB). Peak memory consumption was 83.0 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 311.51 ms. Allocated memory is still 245.4 MB. Free memory was 128.3 MB in the beginning and 180.1 MB in the end (delta: -51.7 MB). Peak memory consumption was 11.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 182.36 ms. Allocated memory is still 245.4 MB. Free memory was 180.1 MB in the beginning and 170.6 MB in the end (delta: 9.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * RCFGBuilder took 11604.75 ms. Allocated memory was 245.4 MB in the beginning and 304.1 MB in the end (delta: 58.7 MB). Free memory was 170.6 MB in the beginning and 175.3 MB in the end (delta: -4.7 MB). Peak memory consumption was 180.0 MB. Max. memory is 16.1 GB. * TraceAbstraction took 127163.70 ms. Allocated memory was 304.1 MB in the beginning and 438.3 MB in the end (delta: 134.2 MB). Free memory was 174.3 MB in the beginning and 170.2 MB in the end (delta: 4.1 MB). Peak memory consumption was 138.3 MB. Max. memory is 16.1 GB. * Witness Printer took 1006.65 ms. Allocated memory is still 438.3 MB. Free memory was 170.2 MB in the beginning and 166.0 MB in the end (delta: 4.2 MB). Peak memory consumption was 87.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.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.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 164 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 126.9s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 100.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 6.7s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 2491 SDtfs, 2622 SDslu, 7932 SDs, 0 SdLazy, 2637 SolverSat, 215 SolverUnsat, 38 SolverUnknown, 0 SolverNotchecked, 84.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 318 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 373 ImplicationChecksByTransitivity, 12.7s Time, 0.0s 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.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 14 MinimizatonAttempts, 380 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 57 LocationsWithAnnotation, 57 PreInvPairs, 96 NumberOfFragments, 2315 HoareAnnotationTreeSize, 57 FomulaSimplifications, 1320 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 57 FomulaSimplificationsInter, 307 FormulaSimplificationTreeSizeReductionInter, 6.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 5.8s SatisfiabilityAnalysisTime, 11.5s 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-10-28 09:39:51,631 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-28 09:39:51,632 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-28 09:39:51,632 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-28 09:39:51,632 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-28 09:39:51,633 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-28 09:39:51,633 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-28 09:39:51,634 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-28 09:39:51,635 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-28 09:39:51,635 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-28 09:39:51,635 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-28 09:39:51,636 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-28 09:39:51,636 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-10-28 09:39:51,639 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-28 09:39:51,640 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-28 09:39:51,640 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-28 09:39:51,640 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-28 09:39:51,641 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-28 09:39:51,641 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-28 09:39:51,644 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-28 09:39:51,645 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-10-28 09:39:51,648 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-28 09:39:51,648 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-28 09:39:51,648 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-28 09:39:51,648 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-28 09:39:51,649 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-28 09:39:51,649 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-28 09:39:51,650 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-28 09:39:51,650 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-10-28 09:39:51,656 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-28 09:39:51,656 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-28 09:39:51,656 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-28 09:39:51,656 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-28 09:39:51,657 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-28 09:39:51,657 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-28 09:39:51,658 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-28 09:39:51,658 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-28 09:39:51,658 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-28 09:39:51,658 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-28 09:39:51,659 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-28 09:39:51,659 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-10-28 09:39:51,662 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-28 09:39:51,662 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-28 09:39:51,663 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-28 09:39:51,663 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-28 09:39:51,663 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-28 09:39:51,663 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-28 09:39:51,664 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-28 09:39:51,664 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-28 09:39:51,665 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-28 09:39:51,665 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-28 09:39:51,665 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-28 09:39:51,665 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-10-28 09:39:51,671 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-28 09:39:51,672 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-28 09:39:51,672 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-28 09:39:51,672 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-28 09:39:51,673 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-28 09:39:51,673 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-28 09:39:51,673 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-28 09:39:51,674 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-10-28 09:39:51,902 WARN L435 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a74e492e-64fe-4878-9f27-d415726a3cf3/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2021-10-28 09:39:51,932 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a74e492e-64fe-4878-9f27-d415726a3cf3/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 Received shutdown request...