./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/aws-c-common/aws_hash_table_remove_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_41324c71-c160-4a14-9620-79c343763c74/bin/uautomizer-GMMbpWq8iD/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41324c71-c160-4a14-9620-79c343763c74/bin/uautomizer-GMMbpWq8iD/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41324c71-c160-4a14-9620-79c343763c74/bin/uautomizer-GMMbpWq8iD/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41324c71-c160-4a14-9620-79c343763c74/bin/uautomizer-GMMbpWq8iD/config/AutomizerReach.xml -i ../../sv-benchmarks/c/aws-c-common/aws_hash_table_remove_harness.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41324c71-c160-4a14-9620-79c343763c74/bin/uautomizer-GMMbpWq8iD/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41324c71-c160-4a14-9620-79c343763c74/bin/uautomizer-GMMbpWq8iD --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 97e90b5866c6e9df01c589395fdbbe46254bc553e4330f2a669b393b022bbd71 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 23:06:51,574 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-28 23:06:51,576 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-28 23:06:51,609 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-28 23:06:51,609 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-28 23:06:51,611 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-28 23:06:51,613 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-28 23:06:51,616 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-28 23:06:51,618 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-28 23:06:51,619 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-28 23:06:51,621 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-28 23:06:51,623 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-28 23:06:51,623 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-28 23:06:51,625 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-28 23:06:51,627 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-28 23:06:51,629 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-28 23:06:51,630 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-28 23:06:51,632 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-28 23:06:51,634 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-28 23:06:51,637 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-28 23:06:51,640 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-28 23:06:51,642 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-28 23:06:51,644 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-28 23:06:51,645 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-28 23:06:51,649 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-28 23:06:51,650 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-28 23:06:51,650 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-28 23:06:51,651 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-28 23:06:51,652 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-28 23:06:51,653 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-28 23:06:51,654 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-28 23:06:51,655 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-28 23:06:51,656 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-28 23:06:51,657 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-28 23:06:51,658 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-28 23:06:51,659 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-28 23:06:51,660 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-28 23:06:51,660 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-28 23:06:51,661 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-28 23:06:51,662 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-28 23:06:51,663 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-28 23:06:51,664 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41324c71-c160-4a14-9620-79c343763c74/bin/uautomizer-GMMbpWq8iD/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-10-28 23:06:51,691 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-28 23:06:51,692 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-28 23:06:51,692 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-28 23:06:51,693 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-28 23:06:51,694 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-28 23:06:51,695 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-28 23:06:51,695 INFO L138 SettingsManager]: * Use SBE=true [2021-10-28 23:06:51,696 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-28 23:06:51,696 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-28 23:06:51,696 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-28 23:06:51,696 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-28 23:06:51,697 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-28 23:06:51,697 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-28 23:06:51,697 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-28 23:06:51,697 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-28 23:06:51,698 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-28 23:06:51,698 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-28 23:06:51,698 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-28 23:06:51,698 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-28 23:06:51,699 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-28 23:06:51,699 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-28 23:06:51,699 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-28 23:06:51,699 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-28 23:06:51,700 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-28 23:06:51,700 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-28 23:06:51,700 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-10-28 23:06:51,700 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-10-28 23:06:51,701 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-28 23:06:51,701 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-28 23:06:51,701 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_41324c71-c160-4a14-9620-79c343763c74/bin/uautomizer-GMMbpWq8iD/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_41324c71-c160-4a14-9620-79c343763c74/bin/uautomizer-GMMbpWq8iD 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 -> 97e90b5866c6e9df01c589395fdbbe46254bc553e4330f2a669b393b022bbd71 [2021-10-28 23:06:51,949 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-28 23:06:51,993 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-28 23:06:51,996 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-28 23:06:51,997 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-28 23:06:51,999 INFO L275 PluginConnector]: CDTParser initialized [2021-10-28 23:06:52,000 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41324c71-c160-4a14-9620-79c343763c74/bin/uautomizer-GMMbpWq8iD/../../sv-benchmarks/c/aws-c-common/aws_hash_table_remove_harness.i [2021-10-28 23:06:52,098 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41324c71-c160-4a14-9620-79c343763c74/bin/uautomizer-GMMbpWq8iD/data/d992c2e68/819a21a15eaf4b02b82a788c5eb38135/FLAGa4130e6ec [2021-10-28 23:06:53,026 INFO L306 CDTParser]: Found 1 translation units. [2021-10-28 23:06:53,028 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41324c71-c160-4a14-9620-79c343763c74/sv-benchmarks/c/aws-c-common/aws_hash_table_remove_harness.i [2021-10-28 23:06:53,085 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41324c71-c160-4a14-9620-79c343763c74/bin/uautomizer-GMMbpWq8iD/data/d992c2e68/819a21a15eaf4b02b82a788c5eb38135/FLAGa4130e6ec [2021-10-28 23:06:53,454 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41324c71-c160-4a14-9620-79c343763c74/bin/uautomizer-GMMbpWq8iD/data/d992c2e68/819a21a15eaf4b02b82a788c5eb38135 [2021-10-28 23:06:53,456 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-28 23:06:53,457 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-28 23:06:53,474 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-28 23:06:53,475 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-28 23:06:53,478 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-28 23:06:53,480 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.10 11:06:53" (1/1) ... [2021-10-28 23:06:53,481 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fe427ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:06:53, skipping insertion in model container [2021-10-28 23:06:53,482 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.10 11:06:53" (1/1) ... [2021-10-28 23:06:53,490 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-28 23:06:53,650 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-28 23:06:53,964 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_41324c71-c160-4a14-9620-79c343763c74/sv-benchmarks/c/aws-c-common/aws_hash_table_remove_harness.i[4495,4508] [2021-10-28 23:06:53,972 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_41324c71-c160-4a14-9620-79c343763c74/sv-benchmarks/c/aws-c-common/aws_hash_table_remove_harness.i[4555,4568] [2021-10-28 23:06:53,998 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-10-28 23:06:54,004 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-10-28 23:06:55,201 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 23:06:55,206 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 23:06:55,207 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 23:06:55,208 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 23:06:55,210 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 23:06:55,232 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 23:06:55,244 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 23:06:55,246 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 23:06:55,247 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 23:06:55,249 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 23:06:55,253 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 23:06:55,254 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 23:06:55,255 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 23:06:55,802 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-10-28 23:06:55,808 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-10-28 23:06:55,810 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-10-28 23:06:55,816 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-10-28 23:06:55,817 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-10-28 23:06:55,819 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-10-28 23:06:55,820 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-10-28 23:06:55,821 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-10-28 23:06:55,826 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-10-28 23:06:55,826 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-10-28 23:06:56,098 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-10-28 23:06:56,436 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 23:06:56,437 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 23:06:56,459 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 23:06:56,460 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 23:06:56,466 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 23:06:56,466 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 23:06:56,481 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 23:06:56,482 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 23:06:56,494 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 23:06:56,494 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 23:06:56,497 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 23:06:56,498 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 23:06:56,498 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 23:06:56,560 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-28 23:06:56,615 INFO L203 MainTranslator]: Completed pre-run [2021-10-28 23:06:56,643 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_41324c71-c160-4a14-9620-79c343763c74/sv-benchmarks/c/aws-c-common/aws_hash_table_remove_harness.i[4495,4508] [2021-10-28 23:06:56,655 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_41324c71-c160-4a14-9620-79c343763c74/sv-benchmarks/c/aws-c-common/aws_hash_table_remove_harness.i[4555,4568] [2021-10-28 23:06:56,657 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-10-28 23:06:56,658 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-10-28 23:06:56,712 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 23:06:56,714 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 23:06:56,714 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 23:06:56,715 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 23:06:56,715 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 23:06:56,779 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 23:06:56,780 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 23:06:56,781 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 23:06:56,781 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 23:06:56,782 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 23:06:56,782 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 23:06:56,783 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 23:06:56,783 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 23:06:56,829 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-10-28 23:06:56,830 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-10-28 23:06:56,831 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-10-28 23:06:56,832 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-10-28 23:06:56,833 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-10-28 23:06:56,833 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-10-28 23:06:56,834 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-10-28 23:06:56,834 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-10-28 23:06:56,835 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-10-28 23:06:56,835 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-10-28 23:06:56,864 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-10-28 23:06:56,981 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 23:06:56,981 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 23:06:56,989 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 23:06:56,990 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 23:06:56,993 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 23:06:56,994 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 23:06:57,009 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 23:06:57,010 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 23:06:57,011 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 23:06:57,011 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 23:06:57,012 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 23:06:57,013 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 23:06:57,013 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 23:06:57,081 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-28 23:06:57,369 INFO L208 MainTranslator]: Completed translation [2021-10-28 23:06:57,369 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:06:57 WrapperNode [2021-10-28 23:06:57,370 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-28 23:06:57,371 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-28 23:06:57,371 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-28 23:06:57,371 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-28 23:06:57,378 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:06:57" (1/1) ... [2021-10-28 23:06:57,498 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:06:57" (1/1) ... [2021-10-28 23:06:57,655 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-28 23:06:57,657 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-28 23:06:57,657 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-28 23:06:57,658 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-28 23:06:57,666 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:06:57" (1/1) ... [2021-10-28 23:06:57,667 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:06:57" (1/1) ... [2021-10-28 23:06:57,693 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:06:57" (1/1) ... [2021-10-28 23:06:57,694 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:06:57" (1/1) ... [2021-10-28 23:06:57,799 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:06:57" (1/1) ... [2021-10-28 23:06:57,821 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:06:57" (1/1) ... [2021-10-28 23:06:57,840 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:06:57" (1/1) ... [2021-10-28 23:06:57,865 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-28 23:06:57,869 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-28 23:06:57,869 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-28 23:06:57,869 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-28 23:06:57,870 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:06:57" (1/1) ... [2021-10-28 23:06:57,879 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-28 23:06:57,891 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41324c71-c160-4a14-9620-79c343763c74/bin/uautomizer-GMMbpWq8iD/z3 [2021-10-28 23:06:57,904 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41324c71-c160-4a14-9620-79c343763c74/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-28 23:06:57,934 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41324c71-c160-4a14-9620-79c343763c74/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-28 23:06:57,952 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2021-10-28 23:06:57,952 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-10-28 23:06:57,953 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-10-28 23:06:57,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-10-28 23:06:57,953 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-28 23:06:57,953 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-28 23:06:57,953 INFO L130 BoogieDeclarations]: Found specification of procedure __builtin_uaddl_overflow [2021-10-28 23:06:57,953 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-28 23:06:57,954 INFO L130 BoogieDeclarations]: Found specification of procedure __builtin_umull_overflow [2021-10-28 23:06:57,954 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-10-28 23:06:57,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-10-28 23:06:57,954 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-28 23:06:57,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2021-10-28 23:06:57,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-10-28 23:06:57,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-28 23:07:10,116 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##298: assume !true; [2021-10-28 23:07:10,116 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##253: assume !true; [2021-10-28 23:07:10,116 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##283: assume !true; [2021-10-28 23:07:10,116 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##215: assume !true; [2021-10-28 23:07:10,117 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume !true; [2021-10-28 23:07:10,117 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##190: assume !true; [2021-10-28 23:07:10,117 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##137: assume !true; [2021-10-28 23:07:10,129 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-28 23:07:10,129 INFO L299 CfgBuilder]: Removed 328 assume(true) statements. [2021-10-28 23:07:10,132 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 11:07:10 BoogieIcfgContainer [2021-10-28 23:07:10,132 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-28 23:07:10,134 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-28 23:07:10,134 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-28 23:07:10,138 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-28 23:07:10,138 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.10 11:06:53" (1/3) ... [2021-10-28 23:07:10,139 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74b9b9a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.10 11:07:10, skipping insertion in model container [2021-10-28 23:07:10,139 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:06:57" (2/3) ... [2021-10-28 23:07:10,140 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74b9b9a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.10 11:07:10, skipping insertion in model container [2021-10-28 23:07:10,140 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 11:07:10" (3/3) ... [2021-10-28 23:07:10,142 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_hash_table_remove_harness.i [2021-10-28 23:07:10,148 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-28 23:07:10,148 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 21 error locations. [2021-10-28 23:07:10,200 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-28 23:07:10,206 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 23:07:10,206 INFO L340 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2021-10-28 23:07:10,229 INFO L276 IsEmpty]: Start isEmpty. Operand has 365 states, 343 states have (on average 1.4577259475218658) internal successors, (500), 364 states have internal predecessors, (500), 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 23:07:10,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-10-28 23:07:10,237 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:07:10,238 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:07:10,238 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 18 more)] === [2021-10-28 23:07:10,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:07:10,244 INFO L85 PathProgramCache]: Analyzing trace with hash -2037186818, now seen corresponding path program 1 times [2021-10-28 23:07:10,253 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:07:10,253 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354937362] [2021-10-28 23:07:10,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:07:10,255 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:07:10,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:07:11,035 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 23:07:11,036 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:07:11,036 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354937362] [2021-10-28 23:07:11,037 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354937362] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:07:11,037 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:07:11,037 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-28 23:07:11,039 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005015899] [2021-10-28 23:07:11,044 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-10-28 23:07:11,045 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:07:11,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-10-28 23:07:11,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-10-28 23:07:11,062 INFO L87 Difference]: Start difference. First operand has 365 states, 343 states have (on average 1.4577259475218658) internal successors, (500), 364 states have internal predecessors, (500), 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 37.0) internal successors, (74), 2 states have internal predecessors, (74), 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 23:07:11,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:07:11,111 INFO L93 Difference]: Finished difference Result 725 states and 994 transitions. [2021-10-28 23:07:11,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-10-28 23:07:11,113 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 37.0) internal successors, (74), 2 states have internal predecessors, (74), 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 74 [2021-10-28 23:07:11,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:07:11,126 INFO L225 Difference]: With dead ends: 725 [2021-10-28 23:07:11,127 INFO L226 Difference]: Without dead ends: 357 [2021-10-28 23:07:11,132 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 23:07:11,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2021-10-28 23:07:11,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 357. [2021-10-28 23:07:11,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 336 states have (on average 1.2648809523809523) internal successors, (425), 356 states have internal predecessors, (425), 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 23:07:11,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 425 transitions. [2021-10-28 23:07:11,189 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 425 transitions. Word has length 74 [2021-10-28 23:07:11,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:07:11,190 INFO L470 AbstractCegarLoop]: Abstraction has 357 states and 425 transitions. [2021-10-28 23:07:11,190 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 37.0) internal successors, (74), 2 states have internal predecessors, (74), 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 23:07:11,190 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 425 transitions. [2021-10-28 23:07:11,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-10-28 23:07:11,193 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:07:11,193 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:07:11,194 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-28 23:07:11,194 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 18 more)] === [2021-10-28 23:07:11,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:07:11,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1272180544, now seen corresponding path program 1 times [2021-10-28 23:07:11,195 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:07:11,196 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590249882] [2021-10-28 23:07:11,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:07:11,196 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:07:11,323 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-10-28 23:07:11,324 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1718070478] [2021-10-28 23:07:11,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:07:11,325 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-28 23:07:11,325 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41324c71-c160-4a14-9620-79c343763c74/bin/uautomizer-GMMbpWq8iD/z3 [2021-10-28 23:07:11,327 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41324c71-c160-4a14-9620-79c343763c74/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-28 23:07:11,353 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41324c71-c160-4a14-9620-79c343763c74/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-10-28 23:07:12,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:07:12,558 INFO L263 TraceCheckSpWp]: Trace formula consists of 2650 conjuncts, 7 conjunts are in the unsatisfiable core [2021-10-28 23:07:12,572 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-28 23:07:13,107 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 23:07:13,107 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:07:13,107 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590249882] [2021-10-28 23:07:13,108 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-10-28 23:07:13,108 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1718070478] [2021-10-28 23:07:13,108 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1718070478] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:07:13,108 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:07:13,108 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-28 23:07:13,109 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224811451] [2021-10-28 23:07:13,110 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-28 23:07:13,110 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:07:13,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-28 23:07:13,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-28 23:07:13,112 INFO L87 Difference]: Start difference. First operand 357 states and 425 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 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 23:07:13,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:07:13,300 INFO L93 Difference]: Finished difference Result 1037 states and 1236 transitions. [2021-10-28 23:07:13,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-28 23:07:13,301 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 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 74 [2021-10-28 23:07:13,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:07:13,306 INFO L225 Difference]: With dead ends: 1037 [2021-10-28 23:07:13,307 INFO L226 Difference]: Without dead ends: 702 [2021-10-28 23:07:13,309 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 70 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 23:07:13,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 702 states. [2021-10-28 23:07:13,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 702 to 360. [2021-10-28 23:07:13,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 339 states have (on average 1.2625368731563422) internal successors, (428), 359 states have internal predecessors, (428), 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 23:07:13,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 428 transitions. [2021-10-28 23:07:13,335 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 428 transitions. Word has length 74 [2021-10-28 23:07:13,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:07:13,336 INFO L470 AbstractCegarLoop]: Abstraction has 360 states and 428 transitions. [2021-10-28 23:07:13,336 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 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 23:07:13,336 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 428 transitions. [2021-10-28 23:07:13,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-10-28 23:07:13,339 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:07:13,340 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:07:13,385 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41324c71-c160-4a14-9620-79c343763c74/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-10-28 23:07:13,557 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41324c71-c160-4a14-9620-79c343763c74/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-28 23:07:13,557 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 18 more)] === [2021-10-28 23:07:13,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:07:13,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1002787932, now seen corresponding path program 1 times [2021-10-28 23:07:13,558 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:07:13,558 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563567216] [2021-10-28 23:07:13,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:07:13,559 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:07:13,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:07:14,277 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 23:07:14,277 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:07:14,277 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563567216] [2021-10-28 23:07:14,278 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563567216] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:07:14,278 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:07:14,278 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-28 23:07:14,278 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577803549] [2021-10-28 23:07:14,279 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-28 23:07:14,279 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:07:14,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-28 23:07:14,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-10-28 23:07:14,280 INFO L87 Difference]: Start difference. First operand 360 states and 428 transitions. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 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 23:07:20,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:07:20,121 INFO L93 Difference]: Finished difference Result 688 states and 819 transitions. [2021-10-28 23:07:20,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-28 23:07:20,123 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 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 76 [2021-10-28 23:07:20,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:07:20,125 INFO L225 Difference]: With dead ends: 688 [2021-10-28 23:07:20,125 INFO L226 Difference]: Without dead ends: 366 [2021-10-28 23:07:20,127 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2021-10-28 23:07:20,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2021-10-28 23:07:20,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 362. [2021-10-28 23:07:20,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 341 states have (on average 1.2609970674486803) internal successors, (430), 361 states have internal predecessors, (430), 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 23:07:20,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 430 transitions. [2021-10-28 23:07:20,148 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 430 transitions. Word has length 76 [2021-10-28 23:07:20,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:07:20,148 INFO L470 AbstractCegarLoop]: Abstraction has 362 states and 430 transitions. [2021-10-28 23:07:20,148 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 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 23:07:20,149 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 430 transitions. [2021-10-28 23:07:20,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-10-28 23:07:20,150 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:07:20,151 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:07:20,151 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-28 23:07:20,151 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 18 more)] === [2021-10-28 23:07:20,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:07:20,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1878806938, now seen corresponding path program 1 times [2021-10-28 23:07:20,152 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:07:20,153 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517278113] [2021-10-28 23:07:20,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:07:20,153 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:07:20,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:07:20,461 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 23:07:20,462 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:07:20,462 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517278113] [2021-10-28 23:07:20,462 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517278113] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:07:20,462 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:07:20,463 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 23:07:20,463 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196843779] [2021-10-28 23:07:20,463 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 23:07:20,463 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:07:20,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 23:07:20,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 23:07:20,465 INFO L87 Difference]: Start difference. First operand 362 states and 430 transitions. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 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 23:07:20,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:07:20,697 INFO L93 Difference]: Finished difference Result 687 states and 817 transitions. [2021-10-28 23:07:20,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-28 23:07:20,698 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 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 76 [2021-10-28 23:07:20,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:07:20,701 INFO L225 Difference]: With dead ends: 687 [2021-10-28 23:07:20,701 INFO L226 Difference]: Without dead ends: 360 [2021-10-28 23:07:20,702 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 23:07:20,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2021-10-28 23:07:20,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 360. [2021-10-28 23:07:20,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 339 states have (on average 1.247787610619469) internal successors, (423), 359 states have internal predecessors, (423), 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 23:07:20,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 423 transitions. [2021-10-28 23:07:20,720 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 423 transitions. Word has length 76 [2021-10-28 23:07:20,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:07:20,720 INFO L470 AbstractCegarLoop]: Abstraction has 360 states and 423 transitions. [2021-10-28 23:07:20,720 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 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 23:07:20,721 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 423 transitions. [2021-10-28 23:07:20,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-10-28 23:07:20,722 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:07:20,723 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:07:20,723 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-28 23:07:20,723 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 18 more)] === [2021-10-28 23:07:20,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:07:20,724 INFO L85 PathProgramCache]: Analyzing trace with hash -9036255, now seen corresponding path program 1 times [2021-10-28 23:07:20,724 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:07:20,725 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449156798] [2021-10-28 23:07:20,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:07:20,725 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:07:20,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:07:21,140 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 23:07:21,140 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:07:21,141 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449156798] [2021-10-28 23:07:21,141 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449156798] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:07:21,141 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:07:21,141 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-28 23:07:21,141 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108862095] [2021-10-28 23:07:21,142 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-28 23:07:21,142 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:07:21,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-28 23:07:21,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-28 23:07:21,143 INFO L87 Difference]: Start difference. First operand 360 states and 423 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 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 23:07:26,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:07:26,960 INFO L93 Difference]: Finished difference Result 933 states and 1092 transitions. [2021-10-28 23:07:26,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-28 23:07:26,961 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 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 78 [2021-10-28 23:07:26,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:07:26,964 INFO L225 Difference]: With dead ends: 933 [2021-10-28 23:07:26,964 INFO L226 Difference]: Without dead ends: 610 [2021-10-28 23:07:26,965 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 23:07:26,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2021-10-28 23:07:26,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 360. [2021-10-28 23:07:26,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 339 states have (on average 1.2300884955752212) internal successors, (417), 359 states have internal predecessors, (417), 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 23:07:26,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 417 transitions. [2021-10-28 23:07:26,988 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 417 transitions. Word has length 78 [2021-10-28 23:07:26,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:07:26,989 INFO L470 AbstractCegarLoop]: Abstraction has 360 states and 417 transitions. [2021-10-28 23:07:26,989 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 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 23:07:26,989 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 417 transitions. [2021-10-28 23:07:26,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-10-28 23:07:26,991 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:07:26,991 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:07:26,992 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-28 23:07:26,992 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 18 more)] === [2021-10-28 23:07:26,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:07:26,993 INFO L85 PathProgramCache]: Analyzing trace with hash -377399152, now seen corresponding path program 1 times [2021-10-28 23:07:26,993 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:07:26,993 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013458813] [2021-10-28 23:07:26,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:07:26,994 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:07:27,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:07:27,833 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 23:07:27,833 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:07:27,833 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013458813] [2021-10-28 23:07:27,834 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013458813] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:07:27,834 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:07:27,834 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 23:07:27,834 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534803960] [2021-10-28 23:07:27,835 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 23:07:27,835 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:07:27,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 23:07:27,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 23:07:27,836 INFO L87 Difference]: Start difference. First operand 360 states and 417 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 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 23:07:28,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:07:28,431 INFO L93 Difference]: Finished difference Result 761 states and 886 transitions. [2021-10-28 23:07:28,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-28 23:07:28,432 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 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 79 [2021-10-28 23:07:28,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:07:28,435 INFO L225 Difference]: With dead ends: 761 [2021-10-28 23:07:28,436 INFO L226 Difference]: Without dead ends: 483 [2021-10-28 23:07:28,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 23:07:28,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2021-10-28 23:07:28,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 360. [2021-10-28 23:07:28,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 339 states have (on average 1.2153392330383481) internal successors, (412), 359 states have internal predecessors, (412), 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 23:07:28,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 412 transitions. [2021-10-28 23:07:28,457 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 412 transitions. Word has length 79 [2021-10-28 23:07:28,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:07:28,460 INFO L470 AbstractCegarLoop]: Abstraction has 360 states and 412 transitions. [2021-10-28 23:07:28,460 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 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 23:07:28,460 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 412 transitions. [2021-10-28 23:07:28,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-10-28 23:07:28,473 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:07:28,474 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:07:28,474 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-28 23:07:28,475 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 18 more)] === [2021-10-28 23:07:28,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:07:28,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1543999980, now seen corresponding path program 1 times [2021-10-28 23:07:28,481 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:07:28,481 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987903093] [2021-10-28 23:07:28,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:07:28,481 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:07:28,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:07:29,413 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 23:07:29,413 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:07:29,414 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987903093] [2021-10-28 23:07:29,414 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987903093] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:07:29,414 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:07:29,414 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-28 23:07:29,414 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603163979] [2021-10-28 23:07:29,415 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-28 23:07:29,415 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:07:29,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-28 23:07:29,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-10-28 23:07:29,416 INFO L87 Difference]: Start difference. First operand 360 states and 412 transitions. Second operand has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 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 23:07:35,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:07:35,959 INFO L93 Difference]: Finished difference Result 996 states and 1146 transitions. [2021-10-28 23:07:35,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-28 23:07:35,960 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 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 80 [2021-10-28 23:07:35,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:07:35,966 INFO L225 Difference]: With dead ends: 996 [2021-10-28 23:07:35,966 INFO L226 Difference]: Without dead ends: 691 [2021-10-28 23:07:35,967 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2021-10-28 23:07:35,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2021-10-28 23:07:35,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 360. [2021-10-28 23:07:35,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 339 states have (on average 1.2123893805309736) internal successors, (411), 359 states have internal predecessors, (411), 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 23:07:35,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 411 transitions. [2021-10-28 23:07:35,997 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 411 transitions. Word has length 80 [2021-10-28 23:07:35,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:07:35,997 INFO L470 AbstractCegarLoop]: Abstraction has 360 states and 411 transitions. [2021-10-28 23:07:35,997 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 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 23:07:35,997 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 411 transitions. [2021-10-28 23:07:35,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-10-28 23:07:35,998 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:07:35,998 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:07:35,999 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-28 23:07:35,999 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 18 more)] === [2021-10-28 23:07:35,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:07:36,000 INFO L85 PathProgramCache]: Analyzing trace with hash -1149957487, now seen corresponding path program 1 times [2021-10-28 23:07:36,000 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:07:36,000 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364332735] [2021-10-28 23:07:36,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:07:36,000 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:07:36,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:07:36,845 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 23:07:36,845 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:07:36,845 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364332735] [2021-10-28 23:07:36,846 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364332735] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:07:36,846 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:07:36,846 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-28 23:07:36,846 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006179860] [2021-10-28 23:07:36,847 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-28 23:07:36,847 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:07:36,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-28 23:07:36,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-10-28 23:07:36,848 INFO L87 Difference]: Start difference. First operand 360 states and 411 transitions. Second operand has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 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 23:07:43,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:07:43,024 INFO L93 Difference]: Finished difference Result 894 states and 1021 transitions. [2021-10-28 23:07:43,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-28 23:07:43,025 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 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 83 [2021-10-28 23:07:43,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:07:43,029 INFO L225 Difference]: With dead ends: 894 [2021-10-28 23:07:43,029 INFO L226 Difference]: Without dead ends: 614 [2021-10-28 23:07:43,030 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2021-10-28 23:07:43,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2021-10-28 23:07:43,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 360. [2021-10-28 23:07:43,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 339 states have (on average 1.2094395280235988) internal successors, (410), 359 states have internal predecessors, (410), 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 23:07:43,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 410 transitions. [2021-10-28 23:07:43,055 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 410 transitions. Word has length 83 [2021-10-28 23:07:43,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:07:43,056 INFO L470 AbstractCegarLoop]: Abstraction has 360 states and 410 transitions. [2021-10-28 23:07:43,056 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 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 23:07:43,056 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 410 transitions. [2021-10-28 23:07:43,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-10-28 23:07:43,057 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:07:43,058 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:07:43,058 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-28 23:07:43,058 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 18 more)] === [2021-10-28 23:07:43,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:07:43,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1308976112, now seen corresponding path program 1 times [2021-10-28 23:07:43,059 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:07:43,059 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304880617] [2021-10-28 23:07:43,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:07:43,060 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:07:43,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:07:43,737 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 23:07:43,737 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:07:43,737 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304880617] [2021-10-28 23:07:43,737 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304880617] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:07:43,738 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:07:43,738 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 23:07:43,738 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017733553] [2021-10-28 23:07:43,738 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 23:07:43,739 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:07:43,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 23:07:43,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 23:07:43,740 INFO L87 Difference]: Start difference. First operand 360 states and 410 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 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 23:07:43,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:07:43,982 INFO L93 Difference]: Finished difference Result 360 states and 410 transitions. [2021-10-28 23:07:43,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 23:07:43,983 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 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 86 [2021-10-28 23:07:43,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:07:43,986 INFO L225 Difference]: With dead ends: 360 [2021-10-28 23:07:43,986 INFO L226 Difference]: Without dead ends: 358 [2021-10-28 23:07:43,987 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 23:07:43,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2021-10-28 23:07:44,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 358. [2021-10-28 23:07:44,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 338 states have (on average 1.2071005917159763) internal successors, (408), 357 states have internal predecessors, (408), 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 23:07:44,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 408 transitions. [2021-10-28 23:07:44,018 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 408 transitions. Word has length 86 [2021-10-28 23:07:44,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:07:44,019 INFO L470 AbstractCegarLoop]: Abstraction has 358 states and 408 transitions. [2021-10-28 23:07:44,021 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 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 23:07:44,021 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 408 transitions. [2021-10-28 23:07:44,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-10-28 23:07:44,022 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:07:44,023 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:07:44,023 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-28 23:07:44,026 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 18 more)] === [2021-10-28 23:07:44,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:07:44,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1181997534, now seen corresponding path program 1 times [2021-10-28 23:07:44,027 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:07:44,027 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651045485] [2021-10-28 23:07:44,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:07:44,027 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:07:44,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:07:44,708 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 23:07:44,709 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:07:44,709 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651045485] [2021-10-28 23:07:44,709 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651045485] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:07:44,709 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:07:44,709 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 23:07:44,709 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693991640] [2021-10-28 23:07:44,710 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 23:07:44,710 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:07:44,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 23:07:44,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 23:07:44,711 INFO L87 Difference]: Start difference. First operand 358 states and 408 transitions. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 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 23:07:45,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:07:45,249 INFO L93 Difference]: Finished difference Result 682 states and 793 transitions. [2021-10-28 23:07:45,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-28 23:07:45,252 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 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 93 [2021-10-28 23:07:45,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:07:45,256 INFO L225 Difference]: With dead ends: 682 [2021-10-28 23:07:45,256 INFO L226 Difference]: Without dead ends: 680 [2021-10-28 23:07:45,257 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 23:07:45,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2021-10-28 23:07:45,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 356. [2021-10-28 23:07:45,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 337 states have (on average 1.2047477744807122) internal successors, (406), 355 states have internal predecessors, (406), 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 23:07:45,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 406 transitions. [2021-10-28 23:07:45,292 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 406 transitions. Word has length 93 [2021-10-28 23:07:45,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:07:45,293 INFO L470 AbstractCegarLoop]: Abstraction has 356 states and 406 transitions. [2021-10-28 23:07:45,293 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 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 23:07:45,293 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 406 transitions. [2021-10-28 23:07:45,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-10-28 23:07:45,298 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:07:45,299 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:07:45,299 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-28 23:07:45,299 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 18 more)] === [2021-10-28 23:07:45,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:07:45,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1345920245, now seen corresponding path program 1 times [2021-10-28 23:07:45,300 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:07:45,300 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344682498] [2021-10-28 23:07:45,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:07:45,301 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:07:45,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:07:45,727 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 23:07:45,728 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:07:45,728 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344682498] [2021-10-28 23:07:45,728 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344682498] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:07:45,728 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:07:45,728 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-28 23:07:45,729 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276209284] [2021-10-28 23:07:45,729 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-28 23:07:45,729 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:07:45,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-28 23:07:45,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-28 23:07:45,730 INFO L87 Difference]: Start difference. First operand 356 states and 406 transitions. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 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 23:07:45,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:07:45,966 INFO L93 Difference]: Finished difference Result 890 states and 1021 transitions. [2021-10-28 23:07:45,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-28 23:07:45,966 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 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 99 [2021-10-28 23:07:45,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:07:45,970 INFO L225 Difference]: With dead ends: 890 [2021-10-28 23:07:45,971 INFO L226 Difference]: Without dead ends: 639 [2021-10-28 23:07:45,971 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-10-28 23:07:45,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2021-10-28 23:07:46,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 388. [2021-10-28 23:07:46,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 369 states have (on average 1.1924119241192412) internal successors, (440), 387 states have internal predecessors, (440), 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 23:07:46,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 440 transitions. [2021-10-28 23:07:46,006 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 440 transitions. Word has length 99 [2021-10-28 23:07:46,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:07:46,007 INFO L470 AbstractCegarLoop]: Abstraction has 388 states and 440 transitions. [2021-10-28 23:07:46,007 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 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 23:07:46,007 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 440 transitions. [2021-10-28 23:07:46,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-10-28 23:07:46,009 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:07:46,009 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:07:46,009 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-28 23:07:46,009 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 18 more)] === [2021-10-28 23:07:46,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:07:46,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1937929801, now seen corresponding path program 1 times [2021-10-28 23:07:46,010 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:07:46,010 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153225455] [2021-10-28 23:07:46,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:07:46,011 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:07:46,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:07:46,643 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 23:07:46,643 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:07:46,643 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153225455] [2021-10-28 23:07:46,643 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153225455] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:07:46,643 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:07:46,643 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-28 23:07:46,644 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438503262] [2021-10-28 23:07:46,644 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-28 23:07:46,644 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:07:46,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-28 23:07:46,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-10-28 23:07:46,645 INFO L87 Difference]: Start difference. First operand 388 states and 440 transitions. Second operand has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 7 states have internal predecessors, (99), 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 23:07:47,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:07:47,162 INFO L93 Difference]: Finished difference Result 994 states and 1144 transitions. [2021-10-28 23:07:47,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-28 23:07:47,163 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 7 states have internal predecessors, (99), 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 99 [2021-10-28 23:07:47,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:07:47,167 INFO L225 Difference]: With dead ends: 994 [2021-10-28 23:07:47,167 INFO L226 Difference]: Without dead ends: 755 [2021-10-28 23:07:47,168 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2021-10-28 23:07:47,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2021-10-28 23:07:47,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 402. [2021-10-28 23:07:47,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 383 states have (on average 1.195822454308094) internal successors, (458), 401 states have internal predecessors, (458), 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 23:07:47,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 458 transitions. [2021-10-28 23:07:47,213 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 458 transitions. Word has length 99 [2021-10-28 23:07:47,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:07:47,213 INFO L470 AbstractCegarLoop]: Abstraction has 402 states and 458 transitions. [2021-10-28 23:07:47,214 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 7 states have internal predecessors, (99), 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 23:07:47,214 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 458 transitions. [2021-10-28 23:07:47,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-10-28 23:07:47,215 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:07:47,215 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:07:47,215 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-28 23:07:47,216 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 18 more)] === [2021-10-28 23:07:47,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:07:47,217 INFO L85 PathProgramCache]: Analyzing trace with hash -36019472, now seen corresponding path program 1 times [2021-10-28 23:07:47,217 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:07:47,217 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940335040] [2021-10-28 23:07:47,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:07:47,218 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:07:47,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:07:47,536 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 23:07:47,536 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:07:47,536 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940335040] [2021-10-28 23:07:47,536 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940335040] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:07:47,536 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:07:47,536 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 23:07:47,537 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795404103] [2021-10-28 23:07:47,537 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 23:07:47,537 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:07:47,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 23:07:47,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 23:07:47,538 INFO L87 Difference]: Start difference. First operand 402 states and 458 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 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 23:07:47,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:07:47,587 INFO L93 Difference]: Finished difference Result 534 states and 609 transitions. [2021-10-28 23:07:47,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 23:07:47,587 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 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 100 [2021-10-28 23:07:47,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:07:47,590 INFO L225 Difference]: With dead ends: 534 [2021-10-28 23:07:47,590 INFO L226 Difference]: Without dead ends: 402 [2021-10-28 23:07:47,591 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 23:07:47,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2021-10-28 23:07:47,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 402. [2021-10-28 23:07:47,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 383 states have (on average 1.1906005221932114) internal successors, (456), 401 states have internal predecessors, (456), 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 23:07:47,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 456 transitions. [2021-10-28 23:07:47,628 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 456 transitions. Word has length 100 [2021-10-28 23:07:47,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:07:47,628 INFO L470 AbstractCegarLoop]: Abstraction has 402 states and 456 transitions. [2021-10-28 23:07:47,629 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 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 23:07:47,629 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 456 transitions. [2021-10-28 23:07:47,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-10-28 23:07:47,630 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:07:47,630 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:07:47,631 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-28 23:07:47,631 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 18 more)] === [2021-10-28 23:07:47,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:07:47,631 INFO L85 PathProgramCache]: Analyzing trace with hash 222145966, now seen corresponding path program 1 times [2021-10-28 23:07:47,632 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:07:47,632 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063171762] [2021-10-28 23:07:47,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:07:47,632 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:07:49,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:07:52,973 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 23:07:52,973 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:07:52,973 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063171762] [2021-10-28 23:07:52,973 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063171762] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:07:52,973 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:07:52,973 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2021-10-28 23:07:52,973 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409349432] [2021-10-28 23:07:52,974 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-10-28 23:07:52,974 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:07:52,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-10-28 23:07:52,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=578, Unknown=0, NotChecked=0, Total=650 [2021-10-28 23:07:52,976 INFO L87 Difference]: Start difference. First operand 402 states and 456 transitions. Second operand has 26 states, 26 states have (on average 3.8461538461538463) internal successors, (100), 26 states have internal predecessors, (100), 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 23:08:30,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:08:30,420 INFO L93 Difference]: Finished difference Result 858 states and 972 transitions. [2021-10-28 23:08:30,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2021-10-28 23:08:30,421 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.8461538461538463) internal successors, (100), 26 states have internal predecessors, (100), 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 100 [2021-10-28 23:08:30,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:08:30,426 INFO L225 Difference]: With dead ends: 858 [2021-10-28 23:08:30,427 INFO L226 Difference]: Without dead ends: 805 [2021-10-28 23:08:30,430 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1298 ImplicationChecksByTransitivity, 15.8s TimeCoverageRelationStatistics Valid=783, Invalid=4329, Unknown=0, NotChecked=0, Total=5112 [2021-10-28 23:08:30,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2021-10-28 23:08:30,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 468. [2021-10-28 23:08:30,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 449 states have (on average 1.2026726057906458) internal successors, (540), 467 states have internal predecessors, (540), 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 23:08:30,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 540 transitions. [2021-10-28 23:08:30,491 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 540 transitions. Word has length 100 [2021-10-28 23:08:30,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:08:30,492 INFO L470 AbstractCegarLoop]: Abstraction has 468 states and 540 transitions. [2021-10-28 23:08:30,492 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.8461538461538463) internal successors, (100), 26 states have internal predecessors, (100), 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 23:08:30,492 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 540 transitions. [2021-10-28 23:08:30,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-10-28 23:08:30,494 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:08:30,494 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:08:30,494 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-28 23:08:30,494 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 18 more)] === [2021-10-28 23:08:30,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:08:30,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1997153328, now seen corresponding path program 1 times [2021-10-28 23:08:30,495 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:08:30,495 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684757735] [2021-10-28 23:08:30,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:08:30,496 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:08:30,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:08:30,960 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 23:08:30,961 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:08:30,961 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684757735] [2021-10-28 23:08:30,961 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684757735] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:08:30,961 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:08:30,961 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-28 23:08:30,961 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500057058] [2021-10-28 23:08:30,962 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-28 23:08:30,962 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:08:30,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-28 23:08:30,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-28 23:08:30,963 INFO L87 Difference]: Start difference. First operand 468 states and 540 transitions. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 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 23:08:31,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:08:31,335 INFO L93 Difference]: Finished difference Result 537 states and 615 transitions. [2021-10-28 23:08:31,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-28 23:08:31,335 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 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 100 [2021-10-28 23:08:31,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:08:31,339 INFO L225 Difference]: With dead ends: 537 [2021-10-28 23:08:31,339 INFO L226 Difference]: Without dead ends: 468 [2021-10-28 23:08:31,342 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-10-28 23:08:31,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2021-10-28 23:08:31,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 468. [2021-10-28 23:08:31,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 449 states have (on average 1.1959910913140313) internal successors, (537), 467 states have internal predecessors, (537), 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 23:08:31,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 537 transitions. [2021-10-28 23:08:31,402 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 537 transitions. Word has length 100 [2021-10-28 23:08:31,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:08:31,403 INFO L470 AbstractCegarLoop]: Abstraction has 468 states and 537 transitions. [2021-10-28 23:08:31,403 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 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 23:08:31,403 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 537 transitions. [2021-10-28 23:08:31,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-10-28 23:08:31,405 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:08:31,405 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:08:31,405 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-28 23:08:31,405 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 18 more)] === [2021-10-28 23:08:31,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:08:31,406 INFO L85 PathProgramCache]: Analyzing trace with hash 472650346, now seen corresponding path program 1 times [2021-10-28 23:08:31,406 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:08:31,406 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770459324] [2021-10-28 23:08:31,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:08:31,407 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:08:34,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:08:37,431 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 23:08:37,431 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:08:37,431 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770459324] [2021-10-28 23:08:37,432 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770459324] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:08:37,432 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:08:37,432 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2021-10-28 23:08:37,432 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134908088] [2021-10-28 23:08:37,433 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-10-28 23:08:37,433 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:08:37,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-10-28 23:08:37,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=526, Unknown=0, NotChecked=0, Total=600 [2021-10-28 23:08:37,435 INFO L87 Difference]: Start difference. First operand 468 states and 537 transitions. Second operand has 25 states, 25 states have (on average 4.0) internal successors, (100), 25 states have internal predecessors, (100), 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 23:09:12,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:09:12,611 INFO L93 Difference]: Finished difference Result 751 states and 865 transitions. [2021-10-28 23:09:12,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-10-28 23:09:12,612 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 4.0) internal successors, (100), 25 states have internal predecessors, (100), 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 100 [2021-10-28 23:09:12,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:09:12,616 INFO L225 Difference]: With dead ends: 751 [2021-10-28 23:09:12,616 INFO L226 Difference]: Without dead ends: 698 [2021-10-28 23:09:12,618 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 551 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=373, Invalid=2177, Unknown=0, NotChecked=0, Total=2550 [2021-10-28 23:09:12,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2021-10-28 23:09:12,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 468. [2021-10-28 23:09:12,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 449 states have (on average 1.1959910913140313) internal successors, (537), 467 states have internal predecessors, (537), 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 23:09:12,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 537 transitions. [2021-10-28 23:09:12,715 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 537 transitions. Word has length 100 [2021-10-28 23:09:12,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:09:12,715 INFO L470 AbstractCegarLoop]: Abstraction has 468 states and 537 transitions. [2021-10-28 23:09:12,716 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 4.0) internal successors, (100), 25 states have internal predecessors, (100), 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 23:09:12,716 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 537 transitions. [2021-10-28 23:09:12,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-10-28 23:09:12,717 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:09:12,717 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:09:12,718 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-28 23:09:12,718 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 18 more)] === [2021-10-28 23:09:12,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:09:12,718 INFO L85 PathProgramCache]: Analyzing trace with hash -807213332, now seen corresponding path program 1 times [2021-10-28 23:09:12,719 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:09:12,719 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759535972] [2021-10-28 23:09:12,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:09:12,719 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:09:12,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:09:13,130 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 23:09:13,130 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:09:13,130 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759535972] [2021-10-28 23:09:13,130 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759535972] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:09:13,130 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:09:13,130 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 23:09:13,130 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479157258] [2021-10-28 23:09:13,131 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 23:09:13,131 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:09:13,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 23:09:13,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 23:09:13,132 INFO L87 Difference]: Start difference. First operand 468 states and 537 transitions. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 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 23:09:13,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:09:13,304 INFO L93 Difference]: Finished difference Result 890 states and 1016 transitions. [2021-10-28 23:09:13,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-28 23:09:13,305 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 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 100 [2021-10-28 23:09:13,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:09:13,309 INFO L225 Difference]: With dead ends: 890 [2021-10-28 23:09:13,309 INFO L226 Difference]: Without dead ends: 629 [2021-10-28 23:09:13,312 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 23:09:13,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2021-10-28 23:09:13,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 408. [2021-10-28 23:09:13,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 389 states have (on average 1.179948586118252) internal successors, (459), 407 states have internal predecessors, (459), 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 23:09:13,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 459 transitions. [2021-10-28 23:09:13,369 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 459 transitions. Word has length 100 [2021-10-28 23:09:13,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:09:13,370 INFO L470 AbstractCegarLoop]: Abstraction has 408 states and 459 transitions. [2021-10-28 23:09:13,370 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 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 23:09:13,370 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 459 transitions. [2021-10-28 23:09:13,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-10-28 23:09:13,371 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:09:13,372 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:09:13,372 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-10-28 23:09:13,372 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 18 more)] === [2021-10-28 23:09:13,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:09:13,373 INFO L85 PathProgramCache]: Analyzing trace with hash -804465422, now seen corresponding path program 1 times [2021-10-28 23:09:13,373 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:09:13,373 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889513296] [2021-10-28 23:09:13,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:09:13,373 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:09:13,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:09:13,831 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 23:09:13,831 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:09:13,831 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889513296] [2021-10-28 23:09:13,831 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889513296] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:09:13,831 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:09:13,831 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-28 23:09:13,831 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629207341] [2021-10-28 23:09:13,832 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-28 23:09:13,832 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:09:13,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-28 23:09:13,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-10-28 23:09:13,833 INFO L87 Difference]: Start difference. First operand 408 states and 459 transitions. Second operand has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 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 23:09:14,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:09:14,909 INFO L93 Difference]: Finished difference Result 970 states and 1094 transitions. [2021-10-28 23:09:14,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-28 23:09:14,910 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 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 101 [2021-10-28 23:09:14,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:09:14,915 INFO L225 Difference]: With dead ends: 970 [2021-10-28 23:09:14,915 INFO L226 Difference]: Without dead ends: 764 [2021-10-28 23:09:14,916 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-10-28 23:09:14,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2021-10-28 23:09:14,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 408. [2021-10-28 23:09:14,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 389 states have (on average 1.1748071979434447) internal successors, (457), 407 states have internal predecessors, (457), 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 23:09:14,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 457 transitions. [2021-10-28 23:09:14,977 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 457 transitions. Word has length 101 [2021-10-28 23:09:14,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:09:14,978 INFO L470 AbstractCegarLoop]: Abstraction has 408 states and 457 transitions. [2021-10-28 23:09:14,978 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 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 23:09:14,978 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 457 transitions. [2021-10-28 23:09:14,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2021-10-28 23:09:14,980 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:09:14,980 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:09:14,980 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-10-28 23:09:14,981 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 18 more)] === [2021-10-28 23:09:14,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:09:14,982 INFO L85 PathProgramCache]: Analyzing trace with hash 833160721, now seen corresponding path program 1 times [2021-10-28 23:09:14,982 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:09:14,982 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705854798] [2021-10-28 23:09:14,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:09:14,982 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:09:18,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:09:19,136 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 23:09:19,136 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:09:19,136 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705854798] [2021-10-28 23:09:19,136 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705854798] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:09:19,137 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:09:19,137 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 23:09:19,137 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311948537] [2021-10-28 23:09:19,137 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 23:09:19,137 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:09:19,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 23:09:19,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 23:09:19,138 INFO L87 Difference]: Start difference. First operand 408 states and 457 transitions. Second operand has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:09:19,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:09:19,462 INFO L93 Difference]: Finished difference Result 791 states and 885 transitions. [2021-10-28 23:09:19,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-28 23:09:19,463 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 102 [2021-10-28 23:09:19,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:09:19,465 INFO L225 Difference]: With dead ends: 791 [2021-10-28 23:09:19,465 INFO L226 Difference]: Without dead ends: 408 [2021-10-28 23:09:19,466 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 23:09:19,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2021-10-28 23:09:19,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 405. [2021-10-28 23:09:19,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 386 states have (on average 1.1709844559585492) internal successors, (452), 404 states have internal predecessors, (452), 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 23:09:19,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 452 transitions. [2021-10-28 23:09:19,524 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 452 transitions. Word has length 102 [2021-10-28 23:09:19,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:09:19,524 INFO L470 AbstractCegarLoop]: Abstraction has 405 states and 452 transitions. [2021-10-28 23:09:19,524 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:09:19,524 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 452 transitions. [2021-10-28 23:09:19,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-10-28 23:09:19,526 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:09:19,526 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:09:19,526 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-10-28 23:09:19,526 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 18 more)] === [2021-10-28 23:09:19,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:09:19,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1635368156, now seen corresponding path program 1 times [2021-10-28 23:09:19,533 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:09:19,533 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747153836] [2021-10-28 23:09:19,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:09:19,533 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:09:19,610 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-10-28 23:09:19,611 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [742723780] [2021-10-28 23:09:19,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:09:19,611 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-28 23:09:19,611 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41324c71-c160-4a14-9620-79c343763c74/bin/uautomizer-GMMbpWq8iD/z3 [2021-10-28 23:09:19,613 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41324c71-c160-4a14-9620-79c343763c74/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-28 23:09:19,630 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41324c71-c160-4a14-9620-79c343763c74/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-10-28 23:17:45,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:17:46,122 INFO L263 TraceCheckSpWp]: Trace formula consists of 3082 conjuncts, 194 conjunts are in the unsatisfiable core [2021-10-28 23:17:46,147 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-28 23:17:47,515 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-10-28 23:17:48,631 INFO L354 Elim1Store]: treesize reduction 15, result has 42.3 percent of original size [2021-10-28 23:17:48,632 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2021-10-28 23:17:50,079 INFO L354 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2021-10-28 23:17:50,080 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 50 [2021-10-28 23:17:50,096 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 52 [2021-10-28 23:17:50,165 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 23:17:50,712 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 23:17:50,892 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 60 treesize of output 28 [2021-10-28 23:17:51,979 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 23:17:51,979 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:17:51,979 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747153836] [2021-10-28 23:17:51,979 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-10-28 23:17:51,980 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [742723780] [2021-10-28 23:17:51,980 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [742723780] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:17:51,980 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:17:51,980 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2021-10-28 23:17:51,980 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931462313] [2021-10-28 23:17:51,981 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-10-28 23:17:51,981 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:17:51,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-10-28 23:17:51,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2021-10-28 23:17:51,983 INFO L87 Difference]: Start difference. First operand 405 states and 452 transitions. Second operand has 24 states, 24 states have (on average 4.375) internal successors, (105), 24 states have internal predecessors, (105), 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 23:18:33,023 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= c_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 0)))) (and (= |c_ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.offset| 0) (<= c_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 4) (= |c_ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.offset| c_ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (= |c_ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.offset| 0) .cse0 (<= c_ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 4) (or (and .cse0 (= |c_ULTIMATE.start_aws_is_power_of_two_#res| 1)) (= |c_ULTIMATE.start_aws_is_power_of_two_#res| 0)) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base|) (exists ((|ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base| Int)) (let ((.cse1 (select (select |c_#memory_int| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base|) 0))) (and (= (* 24 c_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0) (+ 29629528 .cse1)) (<= (mod .cse1 18446744073709551616) 36028797018963967)))) (exists ((|ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base| Int)) (let ((.cse2 (select (select |c_#memory_int| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base|) 0))) (and (= (* 24 c_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0) (+ 29629528 .cse2)) (let ((.cse3 (mod .cse2 18446744073709551616))) (or (and (= c_ULTIMATE.start_assume_abort_if_not_~cond 1) (<= .cse3 36028797018963967)) (and (= c_ULTIMATE.start_assume_abort_if_not_~cond 0) (< 36028797018963967 .cse3))))))) (= |c_ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base| c_ULTIMATE.start_ensure_allocated_hash_table_~map.base) (= (+ (select (select |c_#memory_int| |c_ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base|) |c_ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.offset|) 29629528) (* 24 c_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0)))) is different from false [2021-10-28 23:18:41,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:18:41,493 INFO L93 Difference]: Finished difference Result 910 states and 1019 transitions. [2021-10-28 23:18:41,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-10-28 23:18:41,494 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 4.375) internal successors, (105), 24 states have internal predecessors, (105), 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 105 [2021-10-28 23:18:41,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:18:41,497 INFO L225 Difference]: With dead ends: 910 [2021-10-28 23:18:41,497 INFO L226 Difference]: Without dead ends: 524 [2021-10-28 23:18:41,500 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=310, Invalid=1585, Unknown=1, NotChecked=84, Total=1980 [2021-10-28 23:18:41,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2021-10-28 23:18:41,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 410. [2021-10-28 23:18:41,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 391 states have (on average 1.1687979539641944) internal successors, (457), 409 states have internal predecessors, (457), 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 23:18:41,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 457 transitions. [2021-10-28 23:18:41,568 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 457 transitions. Word has length 105 [2021-10-28 23:18:41,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:18:41,568 INFO L470 AbstractCegarLoop]: Abstraction has 410 states and 457 transitions. [2021-10-28 23:18:41,568 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 4.375) internal successors, (105), 24 states have internal predecessors, (105), 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 23:18:41,569 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 457 transitions. [2021-10-28 23:18:41,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-10-28 23:18:41,570 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:18:41,570 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:18:41,794 WARN L435 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41324c71-c160-4a14-9620-79c343763c74/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forcibly destroying the process [2021-10-28 23:18:41,819 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41324c71-c160-4a14-9620-79c343763c74/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-10-28 23:18:41,819 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41324c71-c160-4a14-9620-79c343763c74/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-28 23:18:41,819 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 18 more)] === [2021-10-28 23:18:41,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:18:41,820 INFO L85 PathProgramCache]: Analyzing trace with hash 32214024, now seen corresponding path program 1 times [2021-10-28 23:18:41,820 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:18:41,820 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888977748] [2021-10-28 23:18:41,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:18:41,820 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:18:42,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:18:42,358 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 23:18:42,358 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:18:42,358 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888977748] [2021-10-28 23:18:42,358 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888977748] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:18:42,359 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:18:42,359 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-28 23:18:42,359 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581351569] [2021-10-28 23:18:42,359 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-28 23:18:42,360 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:18:42,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-28 23:18:42,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-28 23:18:42,361 INFO L87 Difference]: Start difference. First operand 410 states and 457 transitions. Second operand has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 6 states have internal predecessors, (107), 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 23:18:42,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:18:42,572 INFO L93 Difference]: Finished difference Result 798 states and 890 transitions. [2021-10-28 23:18:42,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-28 23:18:42,573 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 6 states have internal predecessors, (107), 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 107 [2021-10-28 23:18:42,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:18:42,575 INFO L225 Difference]: With dead ends: 798 [2021-10-28 23:18:42,575 INFO L226 Difference]: Without dead ends: 403 [2021-10-28 23:18:42,575 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-10-28 23:18:42,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2021-10-28 23:18:42,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 403. [2021-10-28 23:18:42,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 384 states have (on average 1.1666666666666667) internal successors, (448), 402 states have internal predecessors, (448), 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 23:18:42,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 448 transitions. [2021-10-28 23:18:42,643 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 448 transitions. Word has length 107 [2021-10-28 23:18:42,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:18:42,644 INFO L470 AbstractCegarLoop]: Abstraction has 403 states and 448 transitions. [2021-10-28 23:18:42,644 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 6 states have internal predecessors, (107), 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 23:18:42,644 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 448 transitions. [2021-10-28 23:18:42,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-10-28 23:18:42,645 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:18:42,645 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:18:42,646 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-10-28 23:18:42,646 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 18 more)] === [2021-10-28 23:18:42,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:18:42,647 INFO L85 PathProgramCache]: Analyzing trace with hash -1035013888, now seen corresponding path program 1 times [2021-10-28 23:18:42,647 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:18:42,647 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437227458] [2021-10-28 23:18:42,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:18:42,647 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:18:42,728 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-10-28 23:18:42,729 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1806040250] [2021-10-28 23:18:42,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:18:42,729 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-28 23:18:42,729 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41324c71-c160-4a14-9620-79c343763c74/bin/uautomizer-GMMbpWq8iD/z3 [2021-10-28 23:18:42,731 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41324c71-c160-4a14-9620-79c343763c74/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-28 23:18:42,752 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41324c71-c160-4a14-9620-79c343763c74/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-10-28 23:18:43,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:18:43,869 INFO L263 TraceCheckSpWp]: Trace formula consists of 3091 conjuncts, 5 conjunts are in the unsatisfiable core [2021-10-28 23:18:43,875 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-28 23:18:44,315 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 23:18:44,316 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:18:44,316 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437227458] [2021-10-28 23:18:44,316 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-10-28 23:18:44,316 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1806040250] [2021-10-28 23:18:44,317 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1806040250] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:18:44,317 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:18:44,317 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-28 23:18:44,317 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684062687] [2021-10-28 23:18:44,318 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-28 23:18:44,318 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:18:44,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-28 23:18:44,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-28 23:18:44,319 INFO L87 Difference]: Start difference. First operand 403 states and 448 transitions. Second operand has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 6 states have internal predecessors, (107), 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 23:18:44,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:18:44,438 INFO L93 Difference]: Finished difference Result 403 states and 448 transitions. [2021-10-28 23:18:44,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-28 23:18:44,439 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 6 states have internal predecessors, (107), 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 107 [2021-10-28 23:18:44,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:18:44,439 INFO L225 Difference]: With dead ends: 403 [2021-10-28 23:18:44,439 INFO L226 Difference]: Without dead ends: 0 [2021-10-28 23:18:44,440 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-10-28 23:18:44,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-10-28 23:18:44,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-10-28 23:18:44,441 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 23:18:44,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-10-28 23:18:44,441 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 107 [2021-10-28 23:18:44,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:18:44,441 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-28 23:18:44,441 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 6 states have internal predecessors, (107), 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 23:18:44,441 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-10-28 23:18:44,442 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-10-28 23:18:44,444 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:18:44,445 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:18:44,445 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:18:44,445 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:18:44,445 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:18:44,446 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:18:44,446 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:18:44,446 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:18:44,446 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:18:44,447 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:18:44,447 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:18:44,447 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:18:44,447 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:18:44,447 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:18:44,448 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:18:44,448 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:18:44,448 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:18:44,448 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:18:44,449 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:18:44,449 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:18:44,449 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:18:44,483 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41324c71-c160-4a14-9620-79c343763c74/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-10-28 23:18:44,654 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41324c71-c160-4a14-9620-79c343763c74/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2021-10-28 23:18:44,656 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-10-28 23:18:44,660 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:18:44,678 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:18:44,683 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:18:44,684 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:18:44,685 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:18:44,685 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:18:44,686 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:18:44,687 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:18:44,687 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:18:44,688 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:18:44,688 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:18:44,689 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:18:44,690 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:18:44,705 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:18:44,706 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:18:44,707 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:18:44,708 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:18:44,708 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:18:44,713 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:18:44,718 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:18:44,718 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:18:44,719 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:18:44,720 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:18:44,720 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:18:44,721 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:18:44,722 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:18:44,723 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:18:44,724 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:18:44,724 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:18:44,725 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:18:44,725 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:18:44,726 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:18:44,727 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:18:44,727 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:18:44,728 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:18:44,730 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:18:44,731 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:18:44,731 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:18:44,732 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:18:44,735 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:18:44,736 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:18:44,737 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:18:44,738 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:18:44,738 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:18:44,739 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:18:44,740 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:18:44,741 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:18:44,742 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:18:44,743 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:18:44,744 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:18:44,744 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:18:44,745 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:18:44,746 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:18:44,746 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:18:44,747 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:18:44,760 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:18:44,761 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:18:44,771 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:18:44,771 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:18:44,773 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:18:44,774 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:18:44,775 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:18:44,775 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:18:44,777 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:18:44,779 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:18:44,780 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:18:44,782 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:18:44,783 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:18:44,784 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:18:44,787 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:18:44,794 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:18:44,799 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:18:44,800 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:18:44,802 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:18:44,803 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:18:44,803 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:18:44,805 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:18:44,811 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:18:44,813 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:18:44,814 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:18:44,815 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:18:44,815 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:18:44,816 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:18:44,816 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:18:44,817 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:18:44,817 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:18:44,818 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:18:44,820 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:18:44,824 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:18:44,825 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:18:44,826 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:18:44,837 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:18:44,839 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:18:44,841 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:18:44,841 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:18:44,842 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:18:44,842 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:18:44,843 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:18:44,844 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:18:44,844 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:18:44,845 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:18:44,845 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:18:51,650 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-10-28 23:18:51,651 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-10-28 23:18:51,651 INFO L857 garLoopResultBuilder]: For program point L9682(lines 9682 9684) no Hoare annotation was computed. [2021-10-28 23:18:51,651 INFO L857 garLoopResultBuilder]: For program point L9682-2(lines 9682 9684) no Hoare annotation was computed. [2021-10-28 23:18:51,651 INFO L853 garLoopResultBuilder]: At program point L9154-5(line 9154) the Hoare annotation is: false [2021-10-28 23:18:51,651 INFO L853 garLoopResultBuilder]: At program point L9154-2(line 9154) the Hoare annotation is: false [2021-10-28 23:18:51,651 INFO L853 garLoopResultBuilder]: At program point L6843(lines 6837 6844) the Hoare annotation is: false [2021-10-28 23:18:51,651 INFO L853 garLoopResultBuilder]: At program point L238(line 238) the Hoare annotation is: false [2021-10-28 23:18:51,652 INFO L853 garLoopResultBuilder]: At program point L238-1(line 238) the Hoare annotation is: false [2021-10-28 23:18:51,652 INFO L853 garLoopResultBuilder]: At program point L238-2(line 238) the Hoare annotation is: false [2021-10-28 23:18:51,652 INFO L853 garLoopResultBuilder]: At program point L238-3(line 238) the Hoare annotation is: false [2021-10-28 23:18:51,652 INFO L853 garLoopResultBuilder]: At program point L7373(lines 7369 7374) the Hoare annotation is: false [2021-10-28 23:18:51,652 INFO L853 garLoopResultBuilder]: At program point L238-4(line 238) the Hoare annotation is: false [2021-10-28 23:18:51,652 INFO L853 garLoopResultBuilder]: At program point L9157(lines 9157 9161) the Hoare annotation is: false [2021-10-28 23:18:51,653 INFO L853 garLoopResultBuilder]: At program point L238-5(line 238) the Hoare annotation is: false [2021-10-28 23:18:51,653 INFO L853 garLoopResultBuilder]: At program point L238-6(line 238) the Hoare annotation is: false [2021-10-28 23:18:51,653 INFO L853 garLoopResultBuilder]: At program point L2617(lines 2613 2621) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.offset| 0)) (.cse1 (= (select (store |#valid| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base| 0) |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base|) 1)) (.cse2 (or (= |ULTIMATE.start_aws_is_power_of_two_#res| 1) (= |ULTIMATE.start_aws_is_power_of_two_#res| 0))) (.cse3 (<= ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 4)) (.cse4 (= ULTIMATE.start_aws_mul_u64_checked_~b 24)) (.cse5 (= |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.offset| ULTIMATE.start_aws_mul_u64_checked_~r.offset)) (.cse6 (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset)) (.cse7 (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.offset| 0)) (.cse8 (not (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base| 0))) (.cse9 (not (= ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 0))) (.cse10 (<= ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 4)) (.cse11 (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base|)) (.cse12 (or (= ULTIMATE.start_assume_abort_if_not_~cond 1) (= ULTIMATE.start_assume_abort_if_not_~cond 0))) (.cse13 (= ULTIMATE.start_hash_table_state_required_bytes_~required_bytes.offset |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.offset|)) (.cse14 (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base)) (.cse15 (= ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 ULTIMATE.start_aws_mul_u64_checked_~a)) (.cse16 (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base| ULTIMATE.start_hash_table_state_required_bytes_~required_bytes.base)) (.cse17 (not (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base|))) (.cse18 (= ULTIMATE.start_aws_mul_u64_checked_~r.base |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base|)) (.cse19 (= |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.offset| 0))) (or (and .cse0 .cse1 .cse2 (<= (+ |ULTIMATE.start_aws_add_u64_checked_#res| 1) 0) .cse3 .cse4 .cse5 (<= (+ |ULTIMATE.start_aws_add_size_checked_#res| 1) 0) .cse6 .cse7 .cse8 (<= (+ |ULTIMATE.start_aws_raise_error_#res| 1) 0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (= (+ (select (select |#memory_int| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base|) |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.offset|) 29629528) (* 24 ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0)) .cse15 .cse16 .cse17 .cse18 .cse19))) [2021-10-28 23:18:51,653 INFO L853 garLoopResultBuilder]: At program point L239(line 239) the Hoare annotation is: false [2021-10-28 23:18:51,654 INFO L853 garLoopResultBuilder]: At program point L239-1(line 239) the Hoare annotation is: false [2021-10-28 23:18:51,654 INFO L853 garLoopResultBuilder]: At program point L239-2(line 239) the Hoare annotation is: false [2021-10-28 23:18:51,654 INFO L853 garLoopResultBuilder]: At program point L239-3(line 239) the Hoare annotation is: false [2021-10-28 23:18:51,654 INFO L853 garLoopResultBuilder]: At program point L239-4(line 239) the Hoare annotation is: false [2021-10-28 23:18:51,654 INFO L853 garLoopResultBuilder]: At program point L239-5(line 239) the Hoare annotation is: false [2021-10-28 23:18:51,654 INFO L853 garLoopResultBuilder]: At program point L9621(lines 9621 9659) the Hoare annotation is: false [2021-10-28 23:18:51,655 INFO L857 garLoopResultBuilder]: For program point L9160-3(line 9160) no Hoare annotation was computed. [2021-10-28 23:18:51,655 INFO L857 garLoopResultBuilder]: For program point L10019(lines 10019 10023) no Hoare annotation was computed. [2021-10-28 23:18:51,655 INFO L853 garLoopResultBuilder]: At program point L9160-5(line 9160) the Hoare annotation is: false [2021-10-28 23:18:51,655 INFO L857 garLoopResultBuilder]: For program point L10019-1(lines 10019 10023) no Hoare annotation was computed. [2021-10-28 23:18:51,655 INFO L857 garLoopResultBuilder]: For program point L9160-1(line 9160) no Hoare annotation was computed. [2021-10-28 23:18:51,655 INFO L857 garLoopResultBuilder]: For program point L10019-6(lines 10019 10023) no Hoare annotation was computed. [2021-10-28 23:18:51,656 INFO L857 garLoopResultBuilder]: For program point L10019-7(lines 10019 10023) no Hoare annotation was computed. [2021-10-28 23:18:51,656 INFO L857 garLoopResultBuilder]: For program point L10019-8(lines 10019 10023) no Hoare annotation was computed. [2021-10-28 23:18:51,656 INFO L857 garLoopResultBuilder]: For program point L10019-9(lines 10019 10023) no Hoare annotation was computed. [2021-10-28 23:18:51,656 INFO L857 garLoopResultBuilder]: For program point L10019-2(lines 10019 10023) no Hoare annotation was computed. [2021-10-28 23:18:51,656 INFO L857 garLoopResultBuilder]: For program point L10019-3(lines 10019 10023) no Hoare annotation was computed. [2021-10-28 23:18:51,656 INFO L857 garLoopResultBuilder]: For program point L10019-4(lines 10019 10023) no Hoare annotation was computed. [2021-10-28 23:18:51,657 INFO L857 garLoopResultBuilder]: For program point L10019-5(lines 10019 10023) no Hoare annotation was computed. [2021-10-28 23:18:51,657 INFO L857 garLoopResultBuilder]: For program point L10019-14(lines 10019 10023) no Hoare annotation was computed. [2021-10-28 23:18:51,657 INFO L857 garLoopResultBuilder]: For program point L10019-10(lines 10019 10023) no Hoare annotation was computed. [2021-10-28 23:18:51,657 INFO L857 garLoopResultBuilder]: For program point L10019-11(lines 10019 10023) no Hoare annotation was computed. [2021-10-28 23:18:51,657 INFO L857 garLoopResultBuilder]: For program point L10019-12(lines 10019 10023) no Hoare annotation was computed. [2021-10-28 23:18:51,658 INFO L857 garLoopResultBuilder]: For program point L10019-13(lines 10019 10023) no Hoare annotation was computed. [2021-10-28 23:18:51,658 INFO L857 garLoopResultBuilder]: For program point L9690(lines 9690 9693) no Hoare annotation was computed. [2021-10-28 23:18:51,658 INFO L857 garLoopResultBuilder]: For program point L9690-1(lines 9690 9693) no Hoare annotation was computed. [2021-10-28 23:18:51,658 INFO L857 garLoopResultBuilder]: For program point L9624(line 9624) no Hoare annotation was computed. [2021-10-28 23:18:51,658 INFO L857 garLoopResultBuilder]: For program point L9624-2(line 9624) no Hoare annotation was computed. [2021-10-28 23:18:51,658 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-10-28 23:18:51,659 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-10-28 23:18:51,659 INFO L853 garLoopResultBuilder]: At program point L9692-2(line 9692) the Hoare annotation is: false [2021-10-28 23:18:51,659 INFO L853 garLoopResultBuilder]: At program point L6852-1(line 6852) the Hoare annotation is: false [2021-10-28 23:18:51,659 INFO L853 garLoopResultBuilder]: At program point L6852(line 6852) the Hoare annotation is: false [2021-10-28 23:18:51,659 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-10-28 23:18:51,660 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-10-28 23:18:51,660 INFO L853 garLoopResultBuilder]: At program point L9100(lines 9100 9116) the Hoare annotation is: false [2021-10-28 23:18:51,660 INFO L853 garLoopResultBuilder]: At program point L9365-2(lines 9365 9399) the Hoare annotation is: false [2021-10-28 23:18:51,660 INFO L857 garLoopResultBuilder]: For program point L9365-3(lines 9365 9399) no Hoare annotation was computed. [2021-10-28 23:18:51,660 INFO L857 garLoopResultBuilder]: For program point L9697(lines 9697 9706) no Hoare annotation was computed. [2021-10-28 23:18:51,661 INFO L853 garLoopResultBuilder]: At program point L250(lines 248 251) the Hoare annotation is: (and (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.offset| 0) (or (= |ULTIMATE.start___CPROVER_overflow_plus_#res| 1) (= |ULTIMATE.start___CPROVER_overflow_plus_#res| 0)) (= (select (store |#valid| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base| 0) |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base|) 1) (or (= |ULTIMATE.start_aws_is_power_of_two_#res| 1) (= |ULTIMATE.start_aws_is_power_of_two_#res| 0)) (= (* 24 ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0) (select (select |#memory_int| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base|) |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.offset|)) (<= ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 4) (= ULTIMATE.start_aws_mul_u64_checked_~b 24) (= |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.offset| ULTIMATE.start_aws_mul_u64_checked_~r.offset) (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.offset| 0) (not (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base| 0)) (not (= ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 0)) (<= ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 4) (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base|) (= ULTIMATE.start_aws_add_u64_checked_~r.offset |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.offset|) (or (= ULTIMATE.start_assume_abort_if_not_~cond 1) (= ULTIMATE.start_assume_abort_if_not_~cond 0)) (exists ((|ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base| Int)) (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base|) 0))) (and (= .cse0 (* 24 ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0)) (= .cse0 ULTIMATE.start_aws_add_u64_checked_~a)))) (= (+ 29629528 ULTIMATE.start_aws_add_u64_checked_~b) 0) (= ULTIMATE.start_hash_table_state_required_bytes_~required_bytes.offset |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.offset|) (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base) (= ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 ULTIMATE.start_aws_mul_u64_checked_~a) (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base| ULTIMATE.start_hash_table_state_required_bytes_~required_bytes.base) (not (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base|)) (= ULTIMATE.start_aws_mul_u64_checked_~r.base |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base|) (= ULTIMATE.start_aws_add_u64_checked_~r.base |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base|) (= |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.offset| 0)) [2021-10-28 23:18:51,661 INFO L857 garLoopResultBuilder]: For program point L7385-1(lines 7385 7387) no Hoare annotation was computed. [2021-10-28 23:18:51,661 INFO L857 garLoopResultBuilder]: For program point L7385(lines 7385 7387) no Hoare annotation was computed. [2021-10-28 23:18:51,661 INFO L853 garLoopResultBuilder]: At program point L2630(lines 2626 2631) the Hoare annotation is: (and (<= ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 4) (= (select |#valid| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base|) 1) (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.offset| 0) (not (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base| 0)) (<= ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 4) (or (and (not (= ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 0)) (= |ULTIMATE.start_aws_is_power_of_two_#res| 1)) (= |ULTIMATE.start_aws_is_power_of_two_#res| 0)) (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base|) (or (= ULTIMATE.start_assume_abort_if_not_~cond 1) (= ULTIMATE.start_assume_abort_if_not_~cond 0)) (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base)) [2021-10-28 23:18:51,661 INFO L853 garLoopResultBuilder]: At program point L2630-2(lines 2626 2631) the Hoare annotation is: false [2021-10-28 23:18:51,662 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_remove_harness_~#map~0.base|) |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.offset|))) (let ((.cse1 (select (select |#memory_int| .cse0) 40))) (and |ULTIMATE.start_aws_hash_table_is_valid_#t~short1477| |ULTIMATE.start_aws_hash_table_is_valid_#t~short1480| (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base|) (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base| ULTIMATE.start_aws_hash_table_is_valid_~map.base) (= ULTIMATE.start_aws_hash_table_is_valid_~map.offset |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.offset|) (= (select |#valid| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base|) 1) (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (= .cse0 ULTIMATE.start_hash_table_state_is_valid_~map.base) (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.offset| 0) (not (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base| 0)) (<= .cse1 4) (= ULTIMATE.start_hash_table_state_is_valid_~map.offset 0) (= ULTIMATE.start_hash_table_state_is_valid_~size_at_least_two~0 0) (<= (mod (+ 18446744073679922088 (* .cse1 24)) 18446744073709551616) 36028797018963967) (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base) (not (= ULTIMATE.start_hash_table_state_is_valid_~map.base 0)) (< (+ .cse0 1) |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base|) |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.offset|) 0)))) [2021-10-28 23:18:51,662 INFO L857 garLoopResultBuilder]: For program point L2498(lines 2498 2499) no Hoare annotation was computed. [2021-10-28 23:18:51,662 INFO L853 garLoopResultBuilder]: At program point L2630-4(lines 2626 2631) the Hoare annotation is: false [2021-10-28 23:18:51,662 INFO L853 garLoopResultBuilder]: At program point L2630-3(lines 2626 2631) the Hoare annotation is: false [2021-10-28 23:18:51,662 INFO L853 garLoopResultBuilder]: At program point L2630-6(lines 2626 2631) the Hoare annotation is: false [2021-10-28 23:18:51,663 INFO L853 garLoopResultBuilder]: At program point L2630-5(lines 2626 2631) the Hoare annotation is: false [2021-10-28 23:18:51,663 INFO L853 garLoopResultBuilder]: At program point L2630-8(lines 2626 2631) the Hoare annotation is: false [2021-10-28 23:18:51,663 INFO L853 garLoopResultBuilder]: At program point L2630-7(lines 2626 2631) the Hoare annotation is: false [2021-10-28 23:18:51,663 INFO L853 garLoopResultBuilder]: At program point L2630-10(lines 2626 2631) the Hoare annotation is: false [2021-10-28 23:18:51,663 INFO L853 garLoopResultBuilder]: At program point L2630-9(lines 2626 2631) the Hoare annotation is: false [2021-10-28 23:18:51,663 INFO L853 garLoopResultBuilder]: At program point L2630-12(lines 2626 2631) the Hoare annotation is: false [2021-10-28 23:18:51,664 INFO L853 garLoopResultBuilder]: At program point L2630-11(lines 2626 2631) the Hoare annotation is: false [2021-10-28 23:18:51,664 INFO L853 garLoopResultBuilder]: At program point L2630-14(lines 2626 2631) the Hoare annotation is: false [2021-10-28 23:18:51,664 INFO L853 garLoopResultBuilder]: At program point L2630-13(lines 2626 2631) the Hoare annotation is: false [2021-10-28 23:18:51,664 INFO L853 garLoopResultBuilder]: At program point L2630-15(lines 2626 2631) the Hoare annotation is: false [2021-10-28 23:18:51,664 INFO L857 garLoopResultBuilder]: For program point L9700(lines 9700 9702) no Hoare annotation was computed. [2021-10-28 23:18:51,664 INFO L857 garLoopResultBuilder]: For program point L9700-2(lines 9700 9702) no Hoare annotation was computed. [2021-10-28 23:18:51,665 INFO L853 garLoopResultBuilder]: At program point L9635-2(lines 9635 9654) the Hoare annotation is: false [2021-10-28 23:18:51,665 INFO L853 garLoopResultBuilder]: At program point L2501(lines 2497 2502) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.offset| 0)) (.cse1 (= (select (store |#valid| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base| 0) |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base|) 1)) (.cse2 (or (= |ULTIMATE.start_aws_is_power_of_two_#res| 1) (= |ULTIMATE.start_aws_is_power_of_two_#res| 0))) (.cse3 (<= ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 4)) (.cse4 (= ULTIMATE.start_aws_mul_u64_checked_~b 24)) (.cse5 (= |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.offset| ULTIMATE.start_aws_mul_u64_checked_~r.offset)) (.cse6 (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset)) (.cse7 (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.offset| 0)) (.cse8 (not (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base| 0))) (.cse9 (not (= ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 0))) (.cse10 (<= ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 4)) (.cse11 (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base|)) (.cse12 (or (= ULTIMATE.start_assume_abort_if_not_~cond 1) (= ULTIMATE.start_assume_abort_if_not_~cond 0))) (.cse13 (= ULTIMATE.start_hash_table_state_required_bytes_~required_bytes.offset |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.offset|)) (.cse14 (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base)) (.cse15 (= ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 ULTIMATE.start_aws_mul_u64_checked_~a)) (.cse16 (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base| ULTIMATE.start_hash_table_state_required_bytes_~required_bytes.base)) (.cse17 (not (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base|))) (.cse18 (= ULTIMATE.start_aws_mul_u64_checked_~r.base |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base|)) (.cse19 (= |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.offset| 0))) (or (and (<= (+ |ULTIMATE.start_aws_mul_u64_checked_#res| 1) 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= (+ |ULTIMATE.start_aws_raise_error_#res| 1) 0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse2 (= (* 24 ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0) (select (select |#memory_int| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base|) |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.offset|)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19))) [2021-10-28 23:18:51,665 INFO L857 garLoopResultBuilder]: For program point L9372(lines 9372 9375) no Hoare annotation was computed. [2021-10-28 23:18:51,665 INFO L853 garLoopResultBuilder]: At program point L255(lines 253 256) the Hoare annotation is: (and (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.offset| 0) (= (select (store |#valid| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base| 0) |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base|) 1) (or (= |ULTIMATE.start_aws_is_power_of_two_#res| 1) (= |ULTIMATE.start_aws_is_power_of_two_#res| 0)) (<= ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 4) (= ULTIMATE.start_aws_mul_u64_checked_~b 24) (= |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.offset| ULTIMATE.start_aws_mul_u64_checked_~r.offset) (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.offset| 0) (not (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base| 0)) (not (= ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 0)) (<= ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 4) (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base|) (or (= ULTIMATE.start_assume_abort_if_not_~cond 1) (= ULTIMATE.start_assume_abort_if_not_~cond 0)) (= ULTIMATE.start_hash_table_state_required_bytes_~required_bytes.offset |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.offset|) (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base) (= ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 ULTIMATE.start_aws_mul_u64_checked_~a) (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base| ULTIMATE.start_hash_table_state_required_bytes_~required_bytes.base) (not (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base|)) (= ULTIMATE.start_aws_mul_u64_checked_~r.base |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base|) (= |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.offset| 0)) [2021-10-28 23:18:51,665 INFO L857 garLoopResultBuilder]: For program point L10165-1(lines 10165 10169) no Hoare annotation was computed. [2021-10-28 23:18:51,666 INFO L857 garLoopResultBuilder]: For program point L9703-2(lines 9697 9706) no Hoare annotation was computed. [2021-10-28 23:18:51,666 INFO L857 garLoopResultBuilder]: For program point L9703(lines 9703 9705) no Hoare annotation was computed. [2021-10-28 23:18:51,666 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-10-28 23:18:51,666 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-10-28 23:18:51,666 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-10-28 23:18:51,667 INFO L857 garLoopResultBuilder]: For program point L10167-1(lines 10167 10168) no Hoare annotation was computed. [2021-10-28 23:18:51,667 INFO L857 garLoopResultBuilder]: For program point L9639(lines 9639 9641) no Hoare annotation was computed. [2021-10-28 23:18:51,667 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-10-28 23:18:51,667 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-10-28 23:18:51,667 INFO L857 garLoopResultBuilder]: For program point L9112(lines 9112 9114) no Hoare annotation was computed. [2021-10-28 23:18:51,667 INFO L857 garLoopResultBuilder]: For program point L9377(line 9377) no Hoare annotation was computed. [2021-10-28 23:18:51,668 INFO L857 garLoopResultBuilder]: For program point L9377-2(lines 9377 9380) no Hoare annotation was computed. [2021-10-28 23:18:51,668 INFO L853 garLoopResultBuilder]: At program point L261(line 261) the Hoare annotation is: false [2021-10-28 23:18:51,668 INFO L853 garLoopResultBuilder]: At program point L261-1(line 261) the Hoare annotation is: false [2021-10-28 23:18:51,668 INFO L857 garLoopResultBuilder]: For program point L10171(lines 10171 10185) no Hoare annotation was computed. [2021-10-28 23:18:51,668 INFO L857 garLoopResultBuilder]: For program point L10171-1(lines 10171 10185) no Hoare annotation was computed. [2021-10-28 23:18:51,668 INFO L853 garLoopResultBuilder]: At program point L9709-2(line 9709) the Hoare annotation is: false [2021-10-28 23:18:51,668 INFO L857 garLoopResultBuilder]: For program point L9709-3(line 9709) no Hoare annotation was computed. [2021-10-28 23:18:51,669 INFO L853 garLoopResultBuilder]: At program point L262(line 262) the Hoare annotation is: false [2021-10-28 23:18:51,669 INFO L853 garLoopResultBuilder]: At program point L262-1(line 262) the Hoare annotation is: false [2021-10-28 23:18:51,669 INFO L857 garLoopResultBuilder]: For program point L10172(lines 10172 10178) no Hoare annotation was computed. [2021-10-28 23:18:51,669 INFO L857 garLoopResultBuilder]: For program point L9115-1(lines 9100 9116) no Hoare annotation was computed. [2021-10-28 23:18:51,669 INFO L857 garLoopResultBuilder]: For program point L10172-2(lines 10172 10178) no Hoare annotation was computed. [2021-10-28 23:18:51,669 INFO L857 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-10-28 23:18:51,670 INFO L853 garLoopResultBuilder]: At program point L-1-1(line -1) the Hoare annotation is: false [2021-10-28 23:18:51,670 INFO L857 garLoopResultBuilder]: For program point L-1-2(line -1) no Hoare annotation was computed. [2021-10-28 23:18:51,670 INFO L857 garLoopResultBuilder]: For program point L-1-4(line -1) no Hoare annotation was computed. [2021-10-28 23:18:51,670 INFO L853 garLoopResultBuilder]: At program point L-1-5(line -1) the Hoare annotation is: false [2021-10-28 23:18:51,670 INFO L857 garLoopResultBuilder]: For program point L-1-6(line -1) no Hoare annotation was computed. [2021-10-28 23:18:51,670 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-10-28 23:18:51,670 INFO L857 garLoopResultBuilder]: For program point L-1-8(line -1) no Hoare annotation was computed. [2021-10-28 23:18:51,671 INFO L853 garLoopResultBuilder]: At program point L-1-9(line -1) the Hoare annotation is: false [2021-10-28 23:18:51,671 INFO L857 garLoopResultBuilder]: For program point L10175-2(line 10175) no Hoare annotation was computed. [2021-10-28 23:18:51,671 INFO L857 garLoopResultBuilder]: For program point L10175(line 10175) no Hoare annotation was computed. [2021-10-28 23:18:51,671 INFO L857 garLoopResultBuilder]: For program point L9647(lines 9647 9649) no Hoare annotation was computed. [2021-10-28 23:18:51,671 INFO L853 garLoopResultBuilder]: At program point L266(line 266) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base|) 1) (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.offset| 0) (not (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base| 0)) (<= ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 4) (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base|) (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base)) [2021-10-28 23:18:51,671 INFO L853 garLoopResultBuilder]: At program point L266-1(line 266) the Hoare annotation is: false [2021-10-28 23:18:51,672 INFO L853 garLoopResultBuilder]: At program point L7402(lines 7399 7403) the Hoare annotation is: false [2021-10-28 23:18:51,672 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-10-28 23:18:51,672 INFO L857 garLoopResultBuilder]: For program point L6809(lines 6809 6819) no Hoare annotation was computed. [2021-10-28 23:18:51,672 INFO L857 garLoopResultBuilder]: For program point L10180(line 10180) no Hoare annotation was computed. [2021-10-28 23:18:51,672 INFO L857 garLoopResultBuilder]: For program point L10180-2(lines 10180 10182) no Hoare annotation was computed. [2021-10-28 23:18:51,672 INFO L853 garLoopResultBuilder]: At program point L7406(lines 7405 7407) the Hoare annotation is: false [2021-10-28 23:18:51,673 INFO L857 garLoopResultBuilder]: For program point L9388(lines 9388 9396) no Hoare annotation was computed. [2021-10-28 23:18:51,673 INFO L857 garLoopResultBuilder]: For program point L7341-3(lines 7341 7343) no Hoare annotation was computed. [2021-10-28 23:18:51,673 INFO L857 garLoopResultBuilder]: For program point L7341-2(lines 7341 7343) no Hoare annotation was computed. [2021-10-28 23:18:51,673 INFO L857 garLoopResultBuilder]: For program point L7341(lines 7341 7343) no Hoare annotation was computed. [2021-10-28 23:18:51,673 INFO L857 garLoopResultBuilder]: For program point L9125(lines 9125 9129) no Hoare annotation was computed. [2021-10-28 23:18:51,673 INFO L857 garLoopResultBuilder]: For program point L9125-1(lines 9125 9129) no Hoare annotation was computed. [2021-10-28 23:18:51,674 INFO L857 garLoopResultBuilder]: For program point L7341-6(lines 7341 7343) no Hoare annotation was computed. [2021-10-28 23:18:51,674 INFO L857 garLoopResultBuilder]: For program point L7341-5(lines 7341 7343) no Hoare annotation was computed. [2021-10-28 23:18:51,674 INFO L857 garLoopResultBuilder]: For program point L7341-8(lines 7341 7343) no Hoare annotation was computed. [2021-10-28 23:18:51,674 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-10-28 23:18:51,674 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-10-28 23:18:51,675 INFO L853 garLoopResultBuilder]: At program point L6947(lines 6943 6948) the Hoare annotation is: (and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base|) (= |ULTIMATE.start_bounded_malloc_#res.offset| 0) (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (<= ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 4) (= (select |#valid| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base|) 1) (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.offset| 0) (not (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base| 0)) (< (+ |ULTIMATE.start_bounded_malloc_#res.base| 1) |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base|) (exists ((|ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base| Int)) (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base|) 0))) (and (= (* 24 ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0) (+ 29629528 .cse0)) (<= (mod .cse0 18446744073709551616) 36028797018963967)))) (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base) (not (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base|))) [2021-10-28 23:18:51,675 INFO L853 garLoopResultBuilder]: At program point L7344-2(lines 7331 7345) the Hoare annotation is: false [2021-10-28 23:18:51,675 INFO L853 garLoopResultBuilder]: At program point L7344-1(lines 7331 7345) the Hoare annotation is: false [2021-10-28 23:18:51,675 INFO L853 garLoopResultBuilder]: At program point L7344(lines 7331 7345) the Hoare annotation is: false [2021-10-28 23:18:51,675 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-10-28 23:18:51,675 INFO L857 garLoopResultBuilder]: For program point L9657(line 9657) no Hoare annotation was computed. [2021-10-28 23:18:51,676 INFO L857 garLoopResultBuilder]: For program point L9657-1(lines 9621 9659) no Hoare annotation was computed. [2021-10-28 23:18:51,676 INFO L857 garLoopResultBuilder]: For program point L210(lines 210 212) no Hoare annotation was computed. [2021-10-28 23:18:51,676 INFO L857 garLoopResultBuilder]: For program point L210-1(lines 210 212) no Hoare annotation was computed. [2021-10-28 23:18:51,676 INFO L857 garLoopResultBuilder]: For program point L210-2(lines 210 212) no Hoare annotation was computed. [2021-10-28 23:18:51,676 INFO L857 garLoopResultBuilder]: For program point L210-3(lines 210 212) no Hoare annotation was computed. [2021-10-28 23:18:51,676 INFO L857 garLoopResultBuilder]: For program point L210-4(lines 210 212) no Hoare annotation was computed. [2021-10-28 23:18:51,677 INFO L857 garLoopResultBuilder]: For program point L210-5(lines 210 212) no Hoare annotation was computed. [2021-10-28 23:18:51,677 INFO L857 garLoopResultBuilder]: For program point L210-6(lines 210 212) no Hoare annotation was computed. [2021-10-28 23:18:51,677 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-10-28 23:18:51,677 INFO L857 garLoopResultBuilder]: For program point L210-7(lines 210 212) no Hoare annotation was computed. [2021-10-28 23:18:51,677 INFO L857 garLoopResultBuilder]: For program point L210-8(lines 210 212) no Hoare annotation was computed. [2021-10-28 23:18:51,677 INFO L857 garLoopResultBuilder]: For program point L210-9(lines 210 212) no Hoare annotation was computed. [2021-10-28 23:18:51,677 INFO L857 garLoopResultBuilder]: For program point L210-10(lines 10165 10166) no Hoare annotation was computed. [2021-10-28 23:18:51,678 INFO L857 garLoopResultBuilder]: For program point L210-11(lines 210 212) no Hoare annotation was computed. [2021-10-28 23:18:51,678 INFO L857 garLoopResultBuilder]: For program point L210-12(lines 210 212) no Hoare annotation was computed. [2021-10-28 23:18:51,678 INFO L857 garLoopResultBuilder]: For program point L210-13(lines 210 212) no Hoare annotation was computed. [2021-10-28 23:18:51,678 INFO L857 garLoopResultBuilder]: For program point L210-14(lines 210 212) no Hoare annotation was computed. [2021-10-28 23:18:51,678 INFO L857 garLoopResultBuilder]: For program point L210-15(lines 210 212) no Hoare annotation was computed. [2021-10-28 23:18:51,678 INFO L857 garLoopResultBuilder]: For program point L210-16(lines 210 212) no Hoare annotation was computed. [2021-10-28 23:18:51,679 INFO L857 garLoopResultBuilder]: For program point L210-17(lines 210 212) no Hoare annotation was computed. [2021-10-28 23:18:51,679 INFO L857 garLoopResultBuilder]: For program point L210-18(lines 210 212) no Hoare annotation was computed. [2021-10-28 23:18:51,679 INFO L857 garLoopResultBuilder]: For program point L210-19(lines 210 212) no Hoare annotation was computed. [2021-10-28 23:18:51,679 INFO L857 garLoopResultBuilder]: For program point L210-20(lines 210 212) no Hoare annotation was computed. [2021-10-28 23:18:51,679 INFO L857 garLoopResultBuilder]: For program point L9658(line 9658) no Hoare annotation was computed. [2021-10-28 23:18:51,679 INFO L857 garLoopResultBuilder]: For program point L210-21(lines 210 212) no Hoare annotation was computed. [2021-10-28 23:18:51,679 INFO L857 garLoopResultBuilder]: For program point L210-22(lines 210 212) no Hoare annotation was computed. [2021-10-28 23:18:51,680 INFO L857 garLoopResultBuilder]: For program point L210-23(lines 210 212) no Hoare annotation was computed. [2021-10-28 23:18:51,680 INFO L857 garLoopResultBuilder]: For program point L210-24(lines 210 212) no Hoare annotation was computed. [2021-10-28 23:18:51,680 INFO L857 garLoopResultBuilder]: For program point L210-25(lines 210 212) no Hoare annotation was computed. [2021-10-28 23:18:51,680 INFO L857 garLoopResultBuilder]: For program point L210-26(lines 210 212) no Hoare annotation was computed. [2021-10-28 23:18:51,680 INFO L857 garLoopResultBuilder]: For program point L210-27(lines 210 212) no Hoare annotation was computed. [2021-10-28 23:18:51,680 INFO L857 garLoopResultBuilder]: For program point L210-28(lines 210 212) no Hoare annotation was computed. [2021-10-28 23:18:51,680 INFO L857 garLoopResultBuilder]: For program point L210-29(lines 210 212) no Hoare annotation was computed. [2021-10-28 23:18:51,681 INFO L857 garLoopResultBuilder]: For program point L9658-2(line 9658) no Hoare annotation was computed. [2021-10-28 23:18:51,681 INFO L857 garLoopResultBuilder]: For program point L210-30(lines 210 212) no Hoare annotation was computed. [2021-10-28 23:18:51,681 INFO L857 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2021-10-28 23:18:51,681 INFO L857 garLoopResultBuilder]: For program point L9658-4(lines 9621 9659) no Hoare annotation was computed. [2021-10-28 23:18:51,681 INFO L857 garLoopResultBuilder]: For program point L211-2(line 211) no Hoare annotation was computed. [2021-10-28 23:18:51,681 INFO L857 garLoopResultBuilder]: For program point L211-4(line 211) no Hoare annotation was computed. [2021-10-28 23:18:51,682 INFO L860 garLoopResultBuilder]: At program point L10187(line 10187) the Hoare annotation is: true [2021-10-28 23:18:51,682 INFO L857 garLoopResultBuilder]: For program point L211-6(line 211) no Hoare annotation was computed. [2021-10-28 23:18:51,682 INFO L857 garLoopResultBuilder]: For program point L211-8(line 211) no Hoare annotation was computed. [2021-10-28 23:18:51,682 INFO L857 garLoopResultBuilder]: For program point L211-10(line 211) no Hoare annotation was computed. [2021-10-28 23:18:51,682 INFO L857 garLoopResultBuilder]: For program point L211-12(line 211) no Hoare annotation was computed. [2021-10-28 23:18:51,682 INFO L857 garLoopResultBuilder]: For program point L211-14(line 211) no Hoare annotation was computed. [2021-10-28 23:18:51,682 INFO L857 garLoopResultBuilder]: For program point L211-16(line 211) no Hoare annotation was computed. [2021-10-28 23:18:51,683 INFO L857 garLoopResultBuilder]: For program point L211-18(line 211) no Hoare annotation was computed. [2021-10-28 23:18:51,683 INFO L853 garLoopResultBuilder]: At program point L2590(lines 2586 2594) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.offset| 0)) (.cse1 (= (select (store |#valid| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base| 0) |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base|) 1)) (.cse2 (or (= |ULTIMATE.start_aws_is_power_of_two_#res| 1) (= |ULTIMATE.start_aws_is_power_of_two_#res| 0))) (.cse3 (<= ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 4)) (.cse4 (= ULTIMATE.start_aws_mul_u64_checked_~b 24)) (.cse5 (= |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.offset| ULTIMATE.start_aws_mul_u64_checked_~r.offset)) (.cse6 (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset)) (.cse7 (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.offset| 0)) (.cse8 (not (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base| 0))) (.cse9 (not (= ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 0))) (.cse10 (<= ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 4)) (.cse11 (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base|)) (.cse12 (or (= ULTIMATE.start_assume_abort_if_not_~cond 1) (= ULTIMATE.start_assume_abort_if_not_~cond 0))) (.cse13 (= ULTIMATE.start_hash_table_state_required_bytes_~required_bytes.offset |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.offset|)) (.cse14 (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base)) (.cse15 (= ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 ULTIMATE.start_aws_mul_u64_checked_~a)) (.cse16 (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base| ULTIMATE.start_hash_table_state_required_bytes_~required_bytes.base)) (.cse17 (not (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base|))) (.cse18 (= ULTIMATE.start_aws_mul_u64_checked_~r.base |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base|)) (.cse19 (= |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.offset| 0))) (or (and (<= (+ |ULTIMATE.start_aws_mul_u64_checked_#res| 1) 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= (+ |ULTIMATE.start_aws_raise_error_#res| 1) 0) .cse9 .cse10 (<= (+ |ULTIMATE.start_aws_mul_size_checked_#res| 1) 0) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse2 (= (* 24 ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0) (select (select |#memory_int| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base|) |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.offset|)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19))) [2021-10-28 23:18:51,683 INFO L857 garLoopResultBuilder]: For program point L211-20(line 211) no Hoare annotation was computed. [2021-10-28 23:18:51,683 INFO L857 garLoopResultBuilder]: For program point L211-22(line 211) no Hoare annotation was computed. [2021-10-28 23:18:51,683 INFO L857 garLoopResultBuilder]: For program point L211-24(line 211) no Hoare annotation was computed. [2021-10-28 23:18:51,684 INFO L857 garLoopResultBuilder]: For program point L211-26(line 211) no Hoare annotation was computed. [2021-10-28 23:18:51,684 INFO L857 garLoopResultBuilder]: For program point L211-28(line 211) no Hoare annotation was computed. [2021-10-28 23:18:51,684 INFO L857 garLoopResultBuilder]: For program point L211-30(line 211) no Hoare annotation was computed. [2021-10-28 23:18:51,684 INFO L857 garLoopResultBuilder]: For program point L211-32(line 211) no Hoare annotation was computed. [2021-10-28 23:18:51,684 INFO L857 garLoopResultBuilder]: For program point L211-34(line 211) no Hoare annotation was computed. [2021-10-28 23:18:51,684 INFO L857 garLoopResultBuilder]: For program point L9131(lines 9131 9139) no Hoare annotation was computed. [2021-10-28 23:18:51,684 INFO L857 garLoopResultBuilder]: For program point L211-36(line 211) no Hoare annotation was computed. [2021-10-28 23:18:51,685 INFO L857 garLoopResultBuilder]: For program point L10122(lines 10122 10124) no Hoare annotation was computed. [2021-10-28 23:18:51,685 INFO L857 garLoopResultBuilder]: For program point L9131-1(lines 9131 9139) no Hoare annotation was computed. [2021-10-28 23:18:51,685 INFO L857 garLoopResultBuilder]: For program point L9329(lines 9329 9335) no Hoare annotation was computed. [2021-10-28 23:18:51,685 INFO L857 garLoopResultBuilder]: For program point L211-38(line 211) no Hoare annotation was computed. [2021-10-28 23:18:51,685 INFO L857 garLoopResultBuilder]: For program point L211-40(line 211) no Hoare annotation was computed. [2021-10-28 23:18:51,685 INFO L857 garLoopResultBuilder]: For program point L211-42(line 211) no Hoare annotation was computed. [2021-10-28 23:18:51,686 INFO L853 garLoopResultBuilder]: At program point L6951(lines 6950 6952) the Hoare annotation is: false [2021-10-28 23:18:51,686 INFO L857 garLoopResultBuilder]: For program point L211-44(line 211) no Hoare annotation was computed. [2021-10-28 23:18:51,686 INFO L857 garLoopResultBuilder]: For program point L211-46(line 211) no Hoare annotation was computed. [2021-10-28 23:18:51,686 INFO L857 garLoopResultBuilder]: For program point L211-48(line 211) no Hoare annotation was computed. [2021-10-28 23:18:51,686 INFO L857 garLoopResultBuilder]: For program point L211-50(line 211) no Hoare annotation was computed. [2021-10-28 23:18:51,686 INFO L857 garLoopResultBuilder]: For program point L211-52(line 211) no Hoare annotation was computed. [2021-10-28 23:18:51,686 INFO L857 garLoopResultBuilder]: For program point L211-54(line 211) no Hoare annotation was computed. [2021-10-28 23:18:51,687 INFO L857 garLoopResultBuilder]: For program point L211-56(line 211) no Hoare annotation was computed. [2021-10-28 23:18:51,687 INFO L857 garLoopResultBuilder]: For program point L211-58(line 211) no Hoare annotation was computed. [2021-10-28 23:18:51,687 INFO L857 garLoopResultBuilder]: For program point L211-60(line 211) no Hoare annotation was computed. [2021-10-28 23:18:51,687 INFO L857 garLoopResultBuilder]: For program point L9330(lines 9330 9332) no Hoare annotation was computed. [2021-10-28 23:18:51,687 INFO L857 garLoopResultBuilder]: For program point L9330-2(lines 9330 9332) no Hoare annotation was computed. [2021-10-28 23:18:51,687 INFO L853 garLoopResultBuilder]: At program point L9661(lines 9661 9710) the Hoare annotation is: false [2021-10-28 23:18:51,688 INFO L853 garLoopResultBuilder]: At program point L1998(lines 1988 1999) the Hoare annotation is: (and (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.offset| 0) (= (select (store |#valid| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base| 0) |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base|) 1) (or (= |ULTIMATE.start_aws_is_power_of_two_#res| 1) (= |ULTIMATE.start_aws_is_power_of_two_#res| 0)) (<= ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 4) (= ULTIMATE.start_aws_mul_u64_checked_~b 24) (= |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.offset| ULTIMATE.start_aws_mul_u64_checked_~r.offset) (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.offset| 0) (not (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base| 0)) (<= (+ |ULTIMATE.start_aws_raise_error_#res| 1) 0) (not (= ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 0)) (<= ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 4) (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base|) (or (= ULTIMATE.start_assume_abort_if_not_~cond 1) (= ULTIMATE.start_assume_abort_if_not_~cond 0)) (= ULTIMATE.start_hash_table_state_required_bytes_~required_bytes.offset |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.offset|) (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base) (= ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 ULTIMATE.start_aws_mul_u64_checked_~a) (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base| ULTIMATE.start_hash_table_state_required_bytes_~required_bytes.base) (not (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base|)) (= ULTIMATE.start_aws_mul_u64_checked_~r.base |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base|) (= |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.offset| 0)) [2021-10-28 23:18:51,688 INFO L853 garLoopResultBuilder]: At program point L1998-1(lines 1988 1999) the Hoare annotation is: (and (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.offset| 0) (= (select (store |#valid| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base| 0) |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base|) 1) (or (= |ULTIMATE.start_aws_is_power_of_two_#res| 1) (= |ULTIMATE.start_aws_is_power_of_two_#res| 0)) (<= ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 4) (= ULTIMATE.start_aws_mul_u64_checked_~b 24) (= |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.offset| ULTIMATE.start_aws_mul_u64_checked_~r.offset) (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.offset| 0) (not (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base| 0)) (<= (+ |ULTIMATE.start_aws_raise_error_#res| 1) 0) (not (= ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 0)) (<= ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 4) (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base|) (or (= ULTIMATE.start_assume_abort_if_not_~cond 1) (= ULTIMATE.start_assume_abort_if_not_~cond 0)) (= ULTIMATE.start_hash_table_state_required_bytes_~required_bytes.offset |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.offset|) (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base) (= ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 ULTIMATE.start_aws_mul_u64_checked_~a) (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base| ULTIMATE.start_hash_table_state_required_bytes_~required_bytes.base) (not (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base|)) (= ULTIMATE.start_aws_mul_u64_checked_~r.base |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base|) (= |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.offset| 0)) [2021-10-28 23:18:51,688 INFO L857 garLoopResultBuilder]: For program point L10126(lines 10126 10128) no Hoare annotation was computed. [2021-10-28 23:18:51,688 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-10-28 23:18:51,688 INFO L853 garLoopResultBuilder]: At program point L7287-1(lines 7280 7288) the Hoare annotation is: false [2021-10-28 23:18:51,689 INFO L853 garLoopResultBuilder]: At program point L7287(lines 7280 7288) the Hoare annotation is: false [2021-10-28 23:18:51,689 INFO L853 garLoopResultBuilder]: At program point L10062-1(lines 10017 10064) the Hoare annotation is: false [2021-10-28 23:18:51,689 INFO L853 garLoopResultBuilder]: At program point L10062-2(lines 10017 10064) the Hoare annotation is: false [2021-10-28 23:18:51,689 INFO L853 garLoopResultBuilder]: At program point L10062-3(lines 10017 10064) the Hoare annotation is: (and (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (not (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base| 0)) (= |ULTIMATE.start_hash_table_state_is_valid_#res| 0) (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base)) [2021-10-28 23:18:51,689 INFO L853 garLoopResultBuilder]: At program point L10062-4(lines 10017 10064) the Hoare annotation is: (and (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (not (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base| 0)) (= |ULTIMATE.start_hash_table_state_is_valid_#res| 0) (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base)) [2021-10-28 23:18:51,690 INFO L853 garLoopResultBuilder]: At program point L10062(lines 10017 10064) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base|) |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.offset|))) (let ((.cse1 (select (select |#memory_int| .cse0) 40))) (and |ULTIMATE.start_aws_hash_table_is_valid_#t~short1477| |ULTIMATE.start_aws_hash_table_is_valid_#t~short1480| (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base|) (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base| ULTIMATE.start_aws_hash_table_is_valid_~map.base) (= ULTIMATE.start_aws_hash_table_is_valid_~map.offset |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.offset|) (= (select |#valid| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base|) 1) (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (= .cse0 ULTIMATE.start_hash_table_state_is_valid_~map.base) (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.offset| 0) (not (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base| 0)) (<= .cse1 4) (= ULTIMATE.start_hash_table_state_is_valid_~map.offset 0) (= |ULTIMATE.start_hash_table_state_is_valid_#res| 0) (= ULTIMATE.start_hash_table_state_is_valid_~size_at_least_two~0 0) (<= (mod (+ 18446744073679922088 (* .cse1 24)) 18446744073709551616) 36028797018963967) (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base) (not (= ULTIMATE.start_hash_table_state_is_valid_~map.base 0)) (< (+ .cse0 1) |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base|) |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.offset|) 0)))) [2021-10-28 23:18:51,690 INFO L853 garLoopResultBuilder]: At program point L10062-9(lines 10017 10064) the Hoare annotation is: (and (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (not (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base| 0)) (= |ULTIMATE.start_hash_table_state_is_valid_#res| 0) (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base)) [2021-10-28 23:18:51,690 INFO L853 garLoopResultBuilder]: At program point L10062-10(lines 10017 10064) the Hoare annotation is: (and (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (not (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base| 0)) (= |ULTIMATE.start_hash_table_state_is_valid_#res| 0) (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base)) [2021-10-28 23:18:51,690 INFO L853 garLoopResultBuilder]: At program point L10062-11(lines 10017 10064) the Hoare annotation is: false [2021-10-28 23:18:51,690 INFO L853 garLoopResultBuilder]: At program point L10062-12(lines 10017 10064) the Hoare annotation is: false [2021-10-28 23:18:51,691 INFO L853 garLoopResultBuilder]: At program point L10062-5(lines 10017 10064) the Hoare annotation is: false [2021-10-28 23:18:51,691 INFO L853 garLoopResultBuilder]: At program point L10062-6(lines 10017 10064) the Hoare annotation is: (and (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (not (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base| 0)) (= |ULTIMATE.start_hash_table_state_is_valid_#res| 0) (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base)) [2021-10-28 23:18:51,691 INFO L853 garLoopResultBuilder]: At program point L10062-7(lines 10017 10064) the Hoare annotation is: false [2021-10-28 23:18:51,691 INFO L853 garLoopResultBuilder]: At program point L10062-8(lines 10017 10064) the Hoare annotation is: false [2021-10-28 23:18:51,691 INFO L857 garLoopResultBuilder]: For program point L9402(lines 9402 9404) no Hoare annotation was computed. [2021-10-28 23:18:51,691 INFO L853 garLoopResultBuilder]: At program point L10062-13(lines 10017 10064) the Hoare annotation is: false [2021-10-28 23:18:51,691 INFO L853 garLoopResultBuilder]: At program point L10062-14(lines 10017 10064) the Hoare annotation is: false [2021-10-28 23:18:51,692 INFO L857 garLoopResultBuilder]: For program point L9402-2(lines 9402 9404) no Hoare annotation was computed. [2021-10-28 23:18:51,692 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-10-28 23:18:51,692 INFO L853 garLoopResultBuilder]: At program point L10130(lines 10119 10131) the Hoare annotation is: (let ((.cse0 (= (select |#valid| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base|) 1)) (.cse1 (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset)) (.cse2 (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.offset| 0)) (.cse3 (not (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base| 0))) (.cse4 (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base)) (.cse5 (not (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base|)))) (or (and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base|) .cse0 (<= (+ |ULTIMATE.start_hash_table_state_required_bytes_#res| 1) 0) .cse1 .cse2 .cse3 .cse4 .cse5) (and (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.offset| 0) (or (= |ULTIMATE.start_aws_is_power_of_two_#res| 1) (= |ULTIMATE.start_aws_is_power_of_two_#res| 0)) (<= ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 4) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 0)) (<= ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 4) (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base|) (or (= ULTIMATE.start_assume_abort_if_not_~cond 1) (= ULTIMATE.start_assume_abort_if_not_~cond 0)) .cse4 (= (+ (select (select |#memory_int| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base|) |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.offset|) 29629528) (* 24 ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0)) .cse5))) [2021-10-28 23:18:51,692 INFO L857 garLoopResultBuilder]: For program point L9337(line 9337) no Hoare annotation was computed. [2021-10-28 23:18:51,692 INFO L857 garLoopResultBuilder]: For program point L9337-2(lines 9337 9343) no Hoare annotation was computed. [2021-10-28 23:18:51,693 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-10-28 23:18:51,693 INFO L857 garLoopResultBuilder]: For program point L9338(lines 9338 9340) no Hoare annotation was computed. [2021-10-28 23:18:51,693 INFO L853 garLoopResultBuilder]: At program point L7356-1(lines 7348 7357) the Hoare annotation is: false [2021-10-28 23:18:51,693 INFO L853 garLoopResultBuilder]: At program point L7356(lines 7348 7357) the Hoare annotation is: false [2021-10-28 23:18:51,693 INFO L857 garLoopResultBuilder]: For program point L9338-2(lines 9338 9340) no Hoare annotation was computed. [2021-10-28 23:18:51,693 INFO L857 garLoopResultBuilder]: For program point L222(lines 222 224) no Hoare annotation was computed. [2021-10-28 23:18:51,694 INFO L857 garLoopResultBuilder]: For program point L222-1(lines 222 224) no Hoare annotation was computed. [2021-10-28 23:18:51,694 INFO L857 garLoopResultBuilder]: For program point L222-2(lines 222 224) no Hoare annotation was computed. [2021-10-28 23:18:51,694 INFO L857 garLoopResultBuilder]: For program point L222-3(lines 222 224) no Hoare annotation was computed. [2021-10-28 23:18:51,694 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-10-28 23:18:51,694 INFO L857 garLoopResultBuilder]: For program point L222-4(lines 222 224) no Hoare annotation was computed. [2021-10-28 23:18:51,694 INFO L857 garLoopResultBuilder]: For program point L222-5(lines 222 224) no Hoare annotation was computed. [2021-10-28 23:18:51,695 INFO L853 garLoopResultBuilder]: At program point L9141(lines 9121 9142) the Hoare annotation is: false [2021-10-28 23:18:51,695 INFO L857 garLoopResultBuilder]: For program point L222-6(lines 222 224) no Hoare annotation was computed. [2021-10-28 23:18:51,695 INFO L853 garLoopResultBuilder]: At program point L9141-1(lines 9121 9142) the Hoare annotation is: false [2021-10-28 23:18:51,695 INFO L857 garLoopResultBuilder]: For program point L10132(lines 10132 10186) no Hoare annotation was computed. [2021-10-28 23:18:51,695 INFO L857 garLoopResultBuilder]: For program point L222-7(lines 222 224) no Hoare annotation was computed. [2021-10-28 23:18:51,695 INFO L857 garLoopResultBuilder]: For program point L222-8(lines 222 224) no Hoare annotation was computed. [2021-10-28 23:18:51,695 INFO L857 garLoopResultBuilder]: For program point L222-9(lines 222 224) no Hoare annotation was computed. [2021-10-28 23:18:51,696 INFO L857 garLoopResultBuilder]: For program point L222-10(lines 222 224) no Hoare annotation was computed. [2021-10-28 23:18:51,696 INFO L857 garLoopResultBuilder]: For program point L222-11(lines 222 224) no Hoare annotation was computed. [2021-10-28 23:18:51,696 INFO L857 garLoopResultBuilder]: For program point L222-12(lines 222 224) no Hoare annotation was computed. [2021-10-28 23:18:51,696 INFO L857 garLoopResultBuilder]: For program point L222-13(lines 222 224) no Hoare annotation was computed. [2021-10-28 23:18:51,696 INFO L857 garLoopResultBuilder]: For program point L222-14(lines 222 224) no Hoare annotation was computed. [2021-10-28 23:18:51,696 INFO L857 garLoopResultBuilder]: For program point L222-15(lines 222 224) no Hoare annotation was computed. [2021-10-28 23:18:51,697 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-10-28 23:18:51,697 INFO L857 garLoopResultBuilder]: For program point L222-16(lines 222 224) no Hoare annotation was computed. [2021-10-28 23:18:51,697 INFO L857 garLoopResultBuilder]: For program point L222-17(lines 222 224) no Hoare annotation was computed. [2021-10-28 23:18:51,697 INFO L857 garLoopResultBuilder]: For program point L222-18(lines 222 224) no Hoare annotation was computed. [2021-10-28 23:18:51,697 INFO L857 garLoopResultBuilder]: For program point L222-19(lines 222 224) no Hoare annotation was computed. [2021-10-28 23:18:51,697 INFO L857 garLoopResultBuilder]: For program point L222-20(lines 222 224) no Hoare annotation was computed. [2021-10-28 23:18:51,697 INFO L857 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2021-10-28 23:18:51,698 INFO L857 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2021-10-28 23:18:51,698 INFO L857 garLoopResultBuilder]: For program point L223-3(line 223) no Hoare annotation was computed. [2021-10-28 23:18:51,698 INFO L857 garLoopResultBuilder]: For program point L223-4(line 223) no Hoare annotation was computed. [2021-10-28 23:18:51,698 INFO L853 garLoopResultBuilder]: At program point L9406(lines 9348 9407) the Hoare annotation is: false [2021-10-28 23:18:51,698 INFO L857 garLoopResultBuilder]: For program point L223-6(line 223) no Hoare annotation was computed. [2021-10-28 23:18:51,698 INFO L857 garLoopResultBuilder]: For program point L223-7(line 223) no Hoare annotation was computed. [2021-10-28 23:18:51,699 INFO L857 garLoopResultBuilder]: For program point L223-9(line 223) no Hoare annotation was computed. [2021-10-28 23:18:51,699 INFO L857 garLoopResultBuilder]: For program point L223-10(line 223) no Hoare annotation was computed. [2021-10-28 23:18:51,699 INFO L857 garLoopResultBuilder]: For program point L223-12(line 223) no Hoare annotation was computed. [2021-10-28 23:18:51,699 INFO L857 garLoopResultBuilder]: For program point L223-13(line 223) no Hoare annotation was computed. [2021-10-28 23:18:51,699 INFO L857 garLoopResultBuilder]: For program point L223-15(line 223) no Hoare annotation was computed. [2021-10-28 23:18:51,699 INFO L857 garLoopResultBuilder]: For program point L223-16(line 223) no Hoare annotation was computed. [2021-10-28 23:18:51,699 INFO L857 garLoopResultBuilder]: For program point L223-18(line 223) no Hoare annotation was computed. [2021-10-28 23:18:51,700 INFO L857 garLoopResultBuilder]: For program point L223-19(line 223) no Hoare annotation was computed. [2021-10-28 23:18:51,700 INFO L857 garLoopResultBuilder]: For program point L223-21(line 223) no Hoare annotation was computed. [2021-10-28 23:18:51,700 INFO L857 garLoopResultBuilder]: For program point L223-22(line 223) no Hoare annotation was computed. [2021-10-28 23:18:51,700 INFO L857 garLoopResultBuilder]: For program point L223-24(line 223) no Hoare annotation was computed. [2021-10-28 23:18:51,700 INFO L857 garLoopResultBuilder]: For program point L223-25(line 223) no Hoare annotation was computed. [2021-10-28 23:18:51,700 INFO L857 garLoopResultBuilder]: For program point L223-27(line 223) no Hoare annotation was computed. [2021-10-28 23:18:51,700 INFO L857 garLoopResultBuilder]: For program point L223-28(line 223) no Hoare annotation was computed. [2021-10-28 23:18:51,701 INFO L857 garLoopResultBuilder]: For program point L223-30(line 223) no Hoare annotation was computed. [2021-10-28 23:18:51,701 INFO L857 garLoopResultBuilder]: For program point L223-31(line 223) no Hoare annotation was computed. [2021-10-28 23:18:51,701 INFO L857 garLoopResultBuilder]: For program point L223-33(line 223) no Hoare annotation was computed. [2021-10-28 23:18:51,701 INFO L857 garLoopResultBuilder]: For program point L223-34(line 223) no Hoare annotation was computed. [2021-10-28 23:18:51,701 INFO L857 garLoopResultBuilder]: For program point L223-36(line 223) no Hoare annotation was computed. [2021-10-28 23:18:51,701 INFO L857 garLoopResultBuilder]: For program point L223-37(line 223) no Hoare annotation was computed. [2021-10-28 23:18:51,701 INFO L857 garLoopResultBuilder]: For program point L223-39(line 223) no Hoare annotation was computed. [2021-10-28 23:18:51,702 INFO L857 garLoopResultBuilder]: For program point L223-40(line 223) no Hoare annotation was computed. [2021-10-28 23:18:51,702 INFO L857 garLoopResultBuilder]: For program point L223-42(line 223) no Hoare annotation was computed. [2021-10-28 23:18:51,702 INFO L857 garLoopResultBuilder]: For program point L223-43(line 223) no Hoare annotation was computed. [2021-10-28 23:18:51,702 INFO L857 garLoopResultBuilder]: For program point L223-45(line 223) no Hoare annotation was computed. [2021-10-28 23:18:51,702 INFO L857 garLoopResultBuilder]: For program point L223-46(line 223) no Hoare annotation was computed. [2021-10-28 23:18:51,702 INFO L857 garLoopResultBuilder]: For program point L223-48(line 223) no Hoare annotation was computed. [2021-10-28 23:18:51,702 INFO L857 garLoopResultBuilder]: For program point L223-49(line 223) no Hoare annotation was computed. [2021-10-28 23:18:51,703 INFO L857 garLoopResultBuilder]: For program point L223-51(line 223) no Hoare annotation was computed. [2021-10-28 23:18:51,703 INFO L857 garLoopResultBuilder]: For program point L223-52(line 223) no Hoare annotation was computed. [2021-10-28 23:18:51,703 INFO L857 garLoopResultBuilder]: For program point L223-54(line 223) no Hoare annotation was computed. [2021-10-28 23:18:51,703 INFO L857 garLoopResultBuilder]: For program point L223-55(line 223) no Hoare annotation was computed. [2021-10-28 23:18:51,703 INFO L857 garLoopResultBuilder]: For program point L223-57(line 223) no Hoare annotation was computed. [2021-10-28 23:18:51,703 INFO L857 garLoopResultBuilder]: For program point L223-58(line 223) no Hoare annotation was computed. [2021-10-28 23:18:51,703 INFO L857 garLoopResultBuilder]: For program point L223-60(line 223) no Hoare annotation was computed. [2021-10-28 23:18:51,704 INFO L857 garLoopResultBuilder]: For program point L223-61(line 223) no Hoare annotation was computed. [2021-10-28 23:18:51,704 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-10-28 23:18:51,704 INFO L857 garLoopResultBuilder]: For program point L10136(lines 10136 10138) no Hoare annotation was computed. [2021-10-28 23:18:51,704 INFO L857 garLoopResultBuilder]: For program point L10136-2(lines 10136 10138) no Hoare annotation was computed. [2021-10-28 23:18:51,704 INFO L853 garLoopResultBuilder]: At program point L6833(lines 6831 6834) the Hoare annotation is: false [2021-10-28 23:18:51,704 INFO L853 garLoopResultBuilder]: At program point L9147(lines 9147 9155) the Hoare annotation is: false [2021-10-28 23:18:51,705 INFO L853 garLoopResultBuilder]: At program point L9147-1(lines 9147 9155) the Hoare annotation is: false [2021-10-28 23:18:51,705 INFO L853 garLoopResultBuilder]: At program point L9345(lines 9321 9346) the Hoare annotation is: false [2021-10-28 23:18:51,705 INFO L857 garLoopResultBuilder]: For program point L10139(lines 10139 10141) no Hoare annotation was computed. [2021-10-28 23:18:51,705 INFO L857 garLoopResultBuilder]: For program point L10139-2(lines 10139 10141) no Hoare annotation was computed. [2021-10-28 23:18:51,705 INFO L857 garLoopResultBuilder]: For program point L2542(lines 2542 2543) no Hoare annotation was computed. [2021-10-28 23:18:51,705 INFO L857 garLoopResultBuilder]: For program point L10008-3(line 10008) no Hoare annotation was computed. [2021-10-28 23:18:51,705 INFO L857 garLoopResultBuilder]: For program point L10008-5(line 10008) no Hoare annotation was computed. [2021-10-28 23:18:51,706 INFO L853 garLoopResultBuilder]: At program point L10008-6(lines 10006 10009) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base|) |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.offset|))) (let ((.cse1 (select (select |#memory_int| .cse0) 40))) (and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base|) (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base| ULTIMATE.start_aws_hash_table_is_valid_~map.base) (= ULTIMATE.start_aws_hash_table_is_valid_~map.offset |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.offset|) (= (select |#valid| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base|) 1) (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (= .cse0 ULTIMATE.start_hash_table_state_is_valid_~map.base) (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.offset| 0) (not (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base| 0)) (= |ULTIMATE.start_aws_hash_table_is_valid_#res| 0) (<= .cse1 4) (= ULTIMATE.start_hash_table_state_is_valid_~map.offset 0) (= |ULTIMATE.start_hash_table_state_is_valid_#res| 0) (= ULTIMATE.start_hash_table_state_is_valid_~size_at_least_two~0 0) (<= (mod (+ 18446744073679922088 (* .cse1 24)) 18446744073709551616) 36028797018963967) (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base) (not (= ULTIMATE.start_hash_table_state_is_valid_~map.base 0)) (< (+ .cse0 1) |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base|) |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.offset|) 0)))) [2021-10-28 23:18:51,706 INFO L857 garLoopResultBuilder]: For program point L10008(line 10008) no Hoare annotation was computed. [2021-10-28 23:18:51,706 INFO L857 garLoopResultBuilder]: For program point L10008-2(line 10008) no Hoare annotation was computed. [2021-10-28 23:18:51,706 INFO L857 garLoopResultBuilder]: For program point L10008-12(line 10008) no Hoare annotation was computed. [2021-10-28 23:18:51,706 INFO L853 garLoopResultBuilder]: At program point L10008-13(lines 10006 10009) the Hoare annotation is: (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base|) |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.offset|) 0) (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (or (not (= ULTIMATE.start_hash_table_state_is_valid_~map.offset 0)) (not (= ULTIMATE.start_hash_table_state_is_valid_~map.base 0))) (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base| ULTIMATE.start_aws_hash_table_is_valid_~map.base) (= ULTIMATE.start_aws_hash_table_is_valid_~map.offset |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.offset|) (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (not (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base| 0)) (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base|) |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.offset|) 0)) [2021-10-28 23:18:51,707 INFO L857 garLoopResultBuilder]: For program point L10008-14(line 10008) no Hoare annotation was computed. [2021-10-28 23:18:51,707 INFO L857 garLoopResultBuilder]: For program point L10008-7(line 10008) no Hoare annotation was computed. [2021-10-28 23:18:51,707 INFO L857 garLoopResultBuilder]: For program point L10008-9(line 10008) no Hoare annotation was computed. [2021-10-28 23:18:51,707 INFO L857 garLoopResultBuilder]: For program point L10008-10(line 10008) no Hoare annotation was computed. [2021-10-28 23:18:51,707 INFO L857 garLoopResultBuilder]: For program point L10008-19(line 10008) no Hoare annotation was computed. [2021-10-28 23:18:51,707 INFO L853 garLoopResultBuilder]: At program point L10008-20(lines 10006 10009) the Hoare annotation is: (and (= (select (select |#memory_$Pointer$.offset| ULTIMATE.start_aws_hash_table_remove_~map.base) ULTIMATE.start_aws_hash_table_remove_~map.offset) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base|) |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.offset|) 0) (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (or (not (= ULTIMATE.start_hash_table_state_is_valid_~map.offset 0)) (not (= ULTIMATE.start_hash_table_state_is_valid_~map.base 0))) (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base| ULTIMATE.start_aws_hash_table_is_valid_~map.base) (= ULTIMATE.start_aws_hash_table_is_valid_~map.offset |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.offset|) (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_hash_table_remove_~map.base) ULTIMATE.start_aws_hash_table_remove_~map.offset) 0) (not (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base| 0)) (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base|) |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.offset|) 0)) [2021-10-28 23:18:51,708 INFO L857 garLoopResultBuilder]: For program point L10008-21(line 10008) no Hoare annotation was computed. [2021-10-28 23:18:51,708 INFO L857 garLoopResultBuilder]: For program point L10008-16(line 10008) no Hoare annotation was computed. [2021-10-28 23:18:51,708 INFO L857 garLoopResultBuilder]: For program point L10008-17(line 10008) no Hoare annotation was computed. [2021-10-28 23:18:51,708 INFO L853 garLoopResultBuilder]: At program point L10008-27(lines 10006 10009) the Hoare annotation is: false [2021-10-28 23:18:51,708 INFO L857 garLoopResultBuilder]: For program point L10008-28(line 10008) no Hoare annotation was computed. [2021-10-28 23:18:51,708 INFO L857 garLoopResultBuilder]: For program point L10008-30(line 10008) no Hoare annotation was computed. [2021-10-28 23:18:51,708 INFO L857 garLoopResultBuilder]: For program point L10008-23(line 10008) no Hoare annotation was computed. [2021-10-28 23:18:51,709 INFO L857 garLoopResultBuilder]: For program point L10008-24(line 10008) no Hoare annotation was computed. [2021-10-28 23:18:51,709 INFO L857 garLoopResultBuilder]: For program point L10008-26(line 10008) no Hoare annotation was computed. [2021-10-28 23:18:51,709 INFO L857 garLoopResultBuilder]: For program point L10008-35(line 10008) no Hoare annotation was computed. [2021-10-28 23:18:51,709 INFO L857 garLoopResultBuilder]: For program point L10008-37(line 10008) no Hoare annotation was computed. [2021-10-28 23:18:51,709 INFO L857 garLoopResultBuilder]: For program point L10008-38(line 10008) no Hoare annotation was computed. [2021-10-28 23:18:51,709 INFO L857 garLoopResultBuilder]: For program point L10008-31(line 10008) no Hoare annotation was computed. [2021-10-28 23:18:51,709 INFO L857 garLoopResultBuilder]: For program point L10008-33(line 10008) no Hoare annotation was computed. [2021-10-28 23:18:51,710 INFO L853 garLoopResultBuilder]: At program point L10008-34(lines 10006 10009) the Hoare annotation is: false [2021-10-28 23:18:51,710 INFO L857 garLoopResultBuilder]: For program point L10008-40(line 10008) no Hoare annotation was computed. [2021-10-28 23:18:51,710 INFO L853 garLoopResultBuilder]: At program point L10008-41(lines 10006 10009) the Hoare annotation is: false [2021-10-28 23:18:51,710 INFO L857 garLoopResultBuilder]: For program point L9085(lines 9104 9109) no Hoare annotation was computed. [2021-10-28 23:18:51,710 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-10-28 23:18:51,711 INFO L853 garLoopResultBuilder]: At program point L2545(lines 2541 2546) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.offset| 0)) (.cse1 (= (select (store |#valid| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base| 0) |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base|) 1)) (.cse2 (or (= |ULTIMATE.start_aws_is_power_of_two_#res| 1) (= |ULTIMATE.start_aws_is_power_of_two_#res| 0))) (.cse3 (<= ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 4)) (.cse4 (= ULTIMATE.start_aws_mul_u64_checked_~b 24)) (.cse5 (= |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.offset| ULTIMATE.start_aws_mul_u64_checked_~r.offset)) (.cse6 (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset)) (.cse7 (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.offset| 0)) (.cse8 (not (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base| 0))) (.cse9 (not (= ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 0))) (.cse10 (<= ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 4)) (.cse11 (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base|)) (.cse12 (or (= ULTIMATE.start_assume_abort_if_not_~cond 1) (= ULTIMATE.start_assume_abort_if_not_~cond 0))) (.cse13 (= ULTIMATE.start_hash_table_state_required_bytes_~required_bytes.offset |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.offset|)) (.cse14 (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base)) (.cse15 (= ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 ULTIMATE.start_aws_mul_u64_checked_~a)) (.cse16 (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base| ULTIMATE.start_hash_table_state_required_bytes_~required_bytes.base)) (.cse17 (not (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base|))) (.cse18 (= ULTIMATE.start_aws_mul_u64_checked_~r.base |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base|)) (.cse19 (= |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.offset| 0))) (or (and .cse0 .cse1 .cse2 (<= (+ |ULTIMATE.start_aws_add_u64_checked_#res| 1) 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= (+ |ULTIMATE.start_aws_raise_error_#res| 1) 0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (= (+ (select (select |#memory_int| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base|) |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.offset|) 29629528) (* 24 ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0)) .cse15 .cse16 .cse17 .cse18 .cse19))) [2021-10-28 23:18:51,714 INFO L731 BasicCegarLoop]: Path program histogram: [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 23:18:51,716 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-28 23:18:51,742 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-28 23:18:51,743 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-28 23:18:51,744 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-28 23:18:51,744 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-28 23:18:51,744 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-28 23:18:51,746 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-28 23:18:51,746 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-28 23:18:51,746 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-28 23:18:51,747 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-28 23:18:51,747 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-28 23:18:51,751 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-28 23:18:51,752 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-28 23:18:51,752 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-28 23:18:51,753 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-28 23:18:51,765 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-28 23:18:51,765 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-28 23:18:51,766 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-28 23:18:51,766 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-28 23:18:51,766 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-28 23:18:51,767 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-28 23:18:51,768 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-28 23:18:51,768 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-28 23:18:51,768 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-28 23:18:51,768 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-28 23:18:51,770 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base,QUANTIFIED] [2021-10-28 23:18:51,771 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base,QUANTIFIED] [2021-10-28 23:18:51,772 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base,QUANTIFIED] [2021-10-28 23:18:51,772 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base,QUANTIFIED] [2021-10-28 23:18:51,775 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-28 23:18:51,775 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-28 23:18:51,775 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-28 23:18:51,776 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-28 23:18:51,776 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-28 23:18:51,777 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-28 23:18:51,777 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-28 23:18:51,777 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-28 23:18:51,778 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-28 23:18:51,778 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-28 23:18:51,780 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-28 23:18:51,780 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-28 23:18:51,780 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-28 23:18:51,780 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-28 23:18:51,781 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-28 23:18:51,781 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-28 23:18:51,782 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-28 23:18:51,782 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-28 23:18:51,786 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base,QUANTIFIED] [2021-10-28 23:18:51,786 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base,QUANTIFIED] [2021-10-28 23:18:51,787 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base,QUANTIFIED] [2021-10-28 23:18:51,788 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base,QUANTIFIED] [2021-10-28 23:18:51,789 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.10 11:18:51 BoogieIcfgContainer [2021-10-28 23:18:51,789 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-28 23:18:51,790 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-28 23:18:51,790 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-28 23:18:51,790 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-28 23:18:51,791 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 11:07:10" (3/4) ... [2021-10-28 23:18:51,794 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-10-28 23:18:51,830 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 298 nodes and edges [2021-10-28 23:18:51,835 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 101 nodes and edges [2021-10-28 23:18:51,840 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 35 nodes and edges [2021-10-28 23:18:51,844 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2021-10-28 23:18:51,849 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2021-10-28 23:18:51,853 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2021-10-28 23:18:51,858 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-10-28 23:18:51,863 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-28 23:18:51,895 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((num_entries <= 4 && \valid[map] == 1) && map == map) && map == 0) && !(map == 0)) && max_table_entries <= 4) && ((!(num_entries == 0) && \result == 1) || \result == 0)) && unknown-#StackHeapBarrier-unknown < map) && (cond == 1 || cond == 0)) && map == map [2021-10-28 23:18:51,895 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((required_bytes == 0 && \valid[elemsize := 0][map] == 1) && (\result == 1 || \result == 0)) && num_entries <= 4) && b == 24) && elemsize == r) && map == map) && map == 0) && !(map == 0)) && !(num_entries == 0)) && max_table_entries <= 4) && unknown-#StackHeapBarrier-unknown < map) && (cond == 1 || cond == 0)) && required_bytes == required_bytes) && map == map) && num_entries == a) && required_bytes == required_bytes) && !(map == required_bytes)) && r == elemsize) && elemsize == 0 [2021-10-28 23:18:51,896 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((\result + 1 <= 0 && required_bytes == 0) && \valid[elemsize := 0][map] == 1) && (\result == 1 || \result == 0)) && num_entries <= 4) && b == 24) && elemsize == r) && map == map) && map == 0) && !(map == 0)) && \result + 1 <= 0) && !(num_entries == 0)) && max_table_entries <= 4) && unknown-#StackHeapBarrier-unknown < map) && (cond == 1 || cond == 0)) && required_bytes == required_bytes) && map == map) && num_entries == a) && required_bytes == required_bytes) && !(map == required_bytes)) && r == elemsize) && elemsize == 0) || ((((((((((((((((((((required_bytes == 0 && \valid[elemsize := 0][map] == 1) && (\result == 1 || \result == 0)) && 24 * num_entries == unknown-#memory_int-unknown[elemsize][elemsize]) && num_entries <= 4) && b == 24) && elemsize == r) && map == map) && map == 0) && !(map == 0)) && !(num_entries == 0)) && max_table_entries <= 4) && unknown-#StackHeapBarrier-unknown < map) && (cond == 1 || cond == 0)) && required_bytes == required_bytes) && map == map) && num_entries == a) && required_bytes == required_bytes) && !(map == required_bytes)) && r == elemsize) && elemsize == 0) [2021-10-28 23:18:51,896 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((\result + 1 <= 0 && required_bytes == 0) && \valid[elemsize := 0][map] == 1) && (\result == 1 || \result == 0)) && num_entries <= 4) && b == 24) && elemsize == r) && map == map) && map == 0) && !(map == 0)) && \result + 1 <= 0) && !(num_entries == 0)) && max_table_entries <= 4) && \result + 1 <= 0) && unknown-#StackHeapBarrier-unknown < map) && (cond == 1 || cond == 0)) && required_bytes == required_bytes) && map == map) && num_entries == a) && required_bytes == required_bytes) && !(map == required_bytes)) && r == elemsize) && elemsize == 0) || ((((((((((((((((((((required_bytes == 0 && \valid[elemsize := 0][map] == 1) && (\result == 1 || \result == 0)) && 24 * num_entries == unknown-#memory_int-unknown[elemsize][elemsize]) && num_entries <= 4) && b == 24) && elemsize == r) && map == map) && map == 0) && !(map == 0)) && !(num_entries == 0)) && max_table_entries <= 4) && unknown-#StackHeapBarrier-unknown < map) && (cond == 1 || cond == 0)) && required_bytes == required_bytes) && map == map) && num_entries == a) && required_bytes == required_bytes) && !(map == required_bytes)) && r == elemsize) && elemsize == 0) [2021-10-28 23:18:51,896 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((required_bytes == 0 && \valid[elemsize := 0][map] == 1) && (\result == 1 || \result == 0)) && num_entries <= 4) && b == 24) && elemsize == r) && map == map) && map == 0) && !(map == 0)) && \result + 1 <= 0) && !(num_entries == 0)) && max_table_entries <= 4) && unknown-#StackHeapBarrier-unknown < map) && (cond == 1 || cond == 0)) && required_bytes == required_bytes) && map == map) && num_entries == a) && required_bytes == required_bytes) && !(map == required_bytes)) && r == elemsize) && elemsize == 0 [2021-10-28 23:18:51,896 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((unknown-#StackHeapBarrier-unknown + 1 <= map && \valid[map] == 1) && \result + 1 <= 0) && map == map) && map == 0) && !(map == 0)) && map == map) && !(map == required_bytes)) || (((((((((((((required_bytes == 0 && (\result == 1 || \result == 0)) && num_entries <= 4) && \valid[map] == 1) && map == map) && map == 0) && !(map == 0)) && !(num_entries == 0)) && max_table_entries <= 4) && unknown-#StackHeapBarrier-unknown < map) && (cond == 1 || cond == 0)) && map == map) && unknown-#memory_int-unknown[required_bytes][required_bytes] + 29629528 == 24 * num_entries) && !(map == required_bytes)) [2021-10-28 23:18:51,897 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((required_bytes == 0 && (\result == 1 || \result == 0)) && \valid[elemsize := 0][map] == 1) && (\result == 1 || \result == 0)) && 24 * num_entries == unknown-#memory_int-unknown[elemsize][elemsize]) && num_entries <= 4) && b == 24) && elemsize == r) && map == map) && map == 0) && !(map == 0)) && !(num_entries == 0)) && max_table_entries <= 4) && unknown-#StackHeapBarrier-unknown < map) && r == required_bytes) && (cond == 1 || cond == 0)) && (\exists ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base : int :: unknown-#memory_int-unknown[ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base][0] == 24 * num_entries && unknown-#memory_int-unknown[ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base][0] == a)) && 29629528 + b == 0) && required_bytes == required_bytes) && map == map) && num_entries == a) && required_bytes == required_bytes) && !(map == required_bytes)) && r == elemsize) && r == required_bytes) && elemsize == 0 [2021-10-28 23:18:51,897 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((unknown-#StackHeapBarrier-unknown + 1 <= map && \result == 0) && !(\result == 0)) && num_entries <= 4) && \valid[map] == 1) && map == map) && map == 0) && !(map == 0)) && \result + 1 < map) && (\exists ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base : int :: 24 * num_entries == 29629528 + unknown-#memory_int-unknown[ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base][0] && unknown-#memory_int-unknown[ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base][0] % 18446744073709551616 <= 36028797018963967)) && map == map) && !(map == required_bytes) [2021-10-28 23:18:51,897 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((required_bytes == 0 && \valid[elemsize := 0][map] == 1) && (\result == 1 || \result == 0)) && \result + 1 <= 0) && num_entries <= 4) && b == 24) && elemsize == r) && map == map) && map == 0) && !(map == 0)) && \result + 1 <= 0) && !(num_entries == 0)) && max_table_entries <= 4) && unknown-#StackHeapBarrier-unknown < map) && (cond == 1 || cond == 0)) && required_bytes == required_bytes) && map == map) && num_entries == a) && required_bytes == required_bytes) && !(map == required_bytes)) && r == elemsize) && elemsize == 0) || ((((((((((((((((((((required_bytes == 0 && \valid[elemsize := 0][map] == 1) && (\result == 1 || \result == 0)) && num_entries <= 4) && b == 24) && elemsize == r) && map == map) && map == 0) && !(map == 0)) && !(num_entries == 0)) && max_table_entries <= 4) && unknown-#StackHeapBarrier-unknown < map) && (cond == 1 || cond == 0)) && required_bytes == required_bytes) && map == map) && unknown-#memory_int-unknown[required_bytes][required_bytes] + 29629528 == 24 * num_entries) && num_entries == a) && required_bytes == required_bytes) && !(map == required_bytes)) && r == elemsize) && elemsize == 0) [2021-10-28 23:18:51,898 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((required_bytes == 0 && \valid[elemsize := 0][map] == 1) && (\result == 1 || \result == 0)) && \result + 1 <= 0) && num_entries <= 4) && b == 24) && elemsize == r) && \result + 1 <= 0) && map == map) && map == 0) && !(map == 0)) && \result + 1 <= 0) && !(num_entries == 0)) && max_table_entries <= 4) && unknown-#StackHeapBarrier-unknown < map) && (cond == 1 || cond == 0)) && required_bytes == required_bytes) && map == map) && num_entries == a) && required_bytes == required_bytes) && !(map == required_bytes)) && r == elemsize) && elemsize == 0) || ((((((((((((((((((((required_bytes == 0 && \valid[elemsize := 0][map] == 1) && (\result == 1 || \result == 0)) && num_entries <= 4) && b == 24) && elemsize == r) && map == map) && map == 0) && !(map == 0)) && !(num_entries == 0)) && max_table_entries <= 4) && unknown-#StackHeapBarrier-unknown < map) && (cond == 1 || cond == 0)) && required_bytes == required_bytes) && map == map) && unknown-#memory_int-unknown[required_bytes][required_bytes] + 29629528 == 24 * num_entries) && num_entries == a) && required_bytes == required_bytes) && !(map == required_bytes)) && r == elemsize) && elemsize == 0) [2021-10-28 23:18:51,898 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((required_bytes == 0 && \valid[elemsize := 0][map] == 1) && (\result == 1 || \result == 0)) && num_entries <= 4) && b == 24) && elemsize == r) && map == map) && map == 0) && !(map == 0)) && \result + 1 <= 0) && !(num_entries == 0)) && max_table_entries <= 4) && unknown-#StackHeapBarrier-unknown < map) && (cond == 1 || cond == 0)) && required_bytes == required_bytes) && map == map) && num_entries == a) && required_bytes == required_bytes) && !(map == required_bytes)) && r == elemsize) && elemsize == 0 [2021-10-28 23:18:51,899 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((aux-map && map->p_impl-aux && aux-map && map->p_impl && hash_table_state_is_valid(map->p_impl)-aux) && unknown-#StackHeapBarrier-unknown + 1 <= map) && !(\result == 0)) && map == map) && map == map) && \valid[map] == 1) && map == map) && #memory_$Pointer$[map][map] == map) && map == 0) && !(map == 0)) && unknown-#memory_int-unknown[#memory_$Pointer$[map][map]][40] <= 4) && map == 0) && \result == 0) && size_at_least_two == 0) && (18446744073679922088 + unknown-#memory_int-unknown[#memory_$Pointer$[map][map]][40] * 24) % 18446744073709551616 <= 36028797018963967) && map == map) && !(map == 0)) && #memory_$Pointer$[map][map] + 1 < map) && #memory_$Pointer$[map][map] == 0 [2021-10-28 23:18:51,899 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((unknown-#StackHeapBarrier-unknown + 1 <= map && !(\result == 0)) && map == map) && map == map) && \valid[map] == 1) && map == map) && #memory_$Pointer$[map][map] == map) && map == 0) && !(map == 0)) && \result == 0) && unknown-#memory_int-unknown[#memory_$Pointer$[map][map]][40] <= 4) && map == 0) && \result == 0) && size_at_least_two == 0) && (18446744073679922088 + unknown-#memory_int-unknown[#memory_$Pointer$[map][map]][40] * 24) % 18446744073709551616 <= 36028797018963967) && map == map) && !(map == 0)) && #memory_$Pointer$[map][map] + 1 < map) && #memory_$Pointer$[map][map] == 0 [2021-10-28 23:18:51,899 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((aux-map && map->p_impl-aux && aux-map && map->p_impl && hash_table_state_is_valid(map->p_impl)-aux) && unknown-#StackHeapBarrier-unknown + 1 <= map) && !(\result == 0)) && map == map) && map == map) && \valid[map] == 1) && map == map) && #memory_$Pointer$[map][map] == map) && map == 0) && !(map == 0)) && unknown-#memory_int-unknown[#memory_$Pointer$[map][map]][40] <= 4) && map == 0) && size_at_least_two == 0) && (18446744073679922088 + unknown-#memory_int-unknown[#memory_$Pointer$[map][map]][40] * 24) % 18446744073709551616 <= 36028797018963967) && map == map) && !(map == 0)) && #memory_$Pointer$[map][map] + 1 < map) && #memory_$Pointer$[map][map] == 0 [2021-10-28 23:18:51,901 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((#memory_$Pointer$[map][map] == 0 && !(\result == 0)) && (!(map == 0) || !(map == 0))) && map == map) && map == map) && map == map) && !(map == 0)) && map == map) && #memory_$Pointer$[map][map] == 0 [2021-10-28 23:18:51,902 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((#memory_$Pointer$[map][map] == 0 && #memory_$Pointer$[map][map] == 0) && !(\result == 0)) && (!(map == 0) || !(map == 0))) && map == map) && map == map) && map == map) && #memory_$Pointer$[map][map] == 0) && !(map == 0)) && map == map) && #memory_$Pointer$[map][map] == 0 [2021-10-28 23:18:51,903 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((!(\result == 0) && map == map) && !(map == 0)) && \result == 0) && map == map [2021-10-28 23:18:51,904 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((!(\result == 0) && map == map) && !(map == 0)) && \result == 0) && map == map [2021-10-28 23:18:51,905 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((!(\result == 0) && map == map) && !(map == 0)) && \result == 0) && map == map [2021-10-28 23:18:51,906 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((!(\result == 0) && map == map) && !(map == 0)) && \result == 0) && map == map [2021-10-28 23:18:51,908 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((!(\result == 0) && map == map) && !(map == 0)) && \result == 0) && map == map [2021-10-28 23:18:52,949 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41324c71-c160-4a14-9620-79c343763c74/bin/uautomizer-GMMbpWq8iD/witness.graphml [2021-10-28 23:18:52,949 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-28 23:18:52,950 INFO L168 Benchmark]: Toolchain (without parser) took 719492.39 ms. Allocated memory was 92.3 MB in the beginning and 488.6 MB in the end (delta: 396.4 MB). Free memory was 66.7 MB in the beginning and 209.5 MB in the end (delta: -142.9 MB). Peak memory consumption was 373.3 MB. Max. memory is 16.1 GB. [2021-10-28 23:18:52,950 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 92.3 MB. Free memory was 62.5 MB in the beginning and 62.5 MB in the end (delta: 31.5 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-28 23:18:52,951 INFO L168 Benchmark]: CACSL2BoogieTranslator took 3895.61 ms. Allocated memory was 92.3 MB in the beginning and 192.9 MB in the end (delta: 100.7 MB). Free memory was 66.4 MB in the beginning and 95.2 MB in the end (delta: -28.9 MB). Peak memory consumption was 75.6 MB. Max. memory is 16.1 GB. [2021-10-28 23:18:52,951 INFO L168 Benchmark]: Boogie Procedure Inliner took 284.75 ms. Allocated memory is still 192.9 MB. Free memory was 95.2 MB in the beginning and 126.1 MB in the end (delta: -30.9 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-10-28 23:18:52,951 INFO L168 Benchmark]: Boogie Preprocessor took 210.88 ms. Allocated memory is still 192.9 MB. Free memory was 126.1 MB in the beginning and 110.4 MB in the end (delta: 15.7 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. [2021-10-28 23:18:52,952 INFO L168 Benchmark]: RCFGBuilder took 12263.67 ms. Allocated memory was 192.9 MB in the beginning and 360.7 MB in the end (delta: 167.8 MB). Free memory was 110.4 MB in the beginning and 247.4 MB in the end (delta: -137.0 MB). Peak memory consumption was 207.1 MB. Max. memory is 16.1 GB. [2021-10-28 23:18:52,952 INFO L168 Benchmark]: TraceAbstraction took 701655.37 ms. Allocated memory was 360.7 MB in the beginning and 488.6 MB in the end (delta: 127.9 MB). Free memory was 246.4 MB in the beginning and 145.1 MB in the end (delta: 101.3 MB). Peak memory consumption was 230.3 MB. Max. memory is 16.1 GB. [2021-10-28 23:18:52,952 INFO L168 Benchmark]: Witness Printer took 1159.16 ms. Allocated memory is still 488.6 MB. Free memory was 145.1 MB in the beginning and 209.5 MB in the end (delta: -64.5 MB). Peak memory consumption was 56.1 MB. Max. memory is 16.1 GB. [2021-10-28 23:18:52,954 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 92.3 MB. Free memory was 62.5 MB in the beginning and 62.5 MB in the end (delta: 31.5 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 3895.61 ms. Allocated memory was 92.3 MB in the beginning and 192.9 MB in the end (delta: 100.7 MB). Free memory was 66.4 MB in the beginning and 95.2 MB in the end (delta: -28.9 MB). Peak memory consumption was 75.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 284.75 ms. Allocated memory is still 192.9 MB. Free memory was 95.2 MB in the beginning and 126.1 MB in the end (delta: -30.9 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 210.88 ms. Allocated memory is still 192.9 MB. Free memory was 126.1 MB in the beginning and 110.4 MB in the end (delta: 15.7 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. * RCFGBuilder took 12263.67 ms. Allocated memory was 192.9 MB in the beginning and 360.7 MB in the end (delta: 167.8 MB). Free memory was 110.4 MB in the beginning and 247.4 MB in the end (delta: -137.0 MB). Peak memory consumption was 207.1 MB. Max. memory is 16.1 GB. * TraceAbstraction took 701655.37 ms. Allocated memory was 360.7 MB in the beginning and 488.6 MB in the end (delta: 127.9 MB). Free memory was 246.4 MB in the beginning and 145.1 MB in the end (delta: 101.3 MB). Peak memory consumption was 230.3 MB. Max. memory is 16.1 GB. * Witness Printer took 1159.16 ms. Allocated memory is still 488.6 MB. Free memory was 145.1 MB in the beginning and 209.5 MB in the end (delta: -64.5 MB). Peak memory consumption was 56.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$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.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$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 365 locations, 21 error locations. Started 1 CEGAR loops. OverallTime: 701.5s, OverallIterations: 22, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 151.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 6.9s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 10420 SDtfs, 17880 SDslu, 35615 SDs, 0 SdLazy, 8086 SolverSat, 542 SolverUnsat, 42 SolverUnknown, 0 SolverNotchecked, 109.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 576 GetRequests, 301 SyntacticMatches, 2 SemanticMatches, 273 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2262 ImplicationChecksByTransitivity, 38.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=468occurred in iteration=14, InterpolantAutomatonStates: 232, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 22 MinimizatonAttempts, 3493 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 102 LocationsWithAnnotation, 102 PreInvPairs, 130 NumberOfFragments, 1878 HoareAnnotationTreeSize, 102 FomulaSimplifications, 629 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 102 FomulaSimplificationsInter, 589 FormulaSimplificationTreeSizeReductionInter, 6.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.9s SsaConstructionTime, 520.2s SatisfiabilityAnalysisTime, 18.5s InterpolantComputationTime, 2019 NumberOfCodeBlocks, 2019 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1997 ConstructedInterpolants, 5 QuantifiedInterpolants, 8593 SizeOfPredicates, 107 NumberOfNonLiveVariables, 8823 ConjunctsInSsa, 206 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 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 21 specifications checked. All of them hold - InvariantResult [Line: 2613]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((required_bytes == 0 && \valid[elemsize := 0][map] == 1) && (\result == 1 || \result == 0)) && \result + 1 <= 0) && num_entries <= 4) && b == 24) && elemsize == r) && \result + 1 <= 0) && map == map) && map == 0) && !(map == 0)) && \result + 1 <= 0) && !(num_entries == 0)) && max_table_entries <= 4) && unknown-#StackHeapBarrier-unknown < map) && (cond == 1 || cond == 0)) && required_bytes == required_bytes) && map == map) && num_entries == a) && required_bytes == required_bytes) && !(map == required_bytes)) && r == elemsize) && elemsize == 0) || ((((((((((((((((((((required_bytes == 0 && \valid[elemsize := 0][map] == 1) && (\result == 1 || \result == 0)) && num_entries <= 4) && b == 24) && elemsize == r) && map == map) && map == 0) && !(map == 0)) && !(num_entries == 0)) && max_table_entries <= 4) && unknown-#StackHeapBarrier-unknown < map) && (cond == 1 || cond == 0)) && required_bytes == required_bytes) && map == map) && unknown-#memory_int-unknown[required_bytes][required_bytes] + 29629528 == 24 * num_entries) && num_entries == a) && required_bytes == required_bytes) && !(map == required_bytes)) && r == elemsize) && elemsize == 0) - InvariantResult [Line: 10187]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7331]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 10006]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 7369]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 10017]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 7280]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 10017]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 238]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 10006]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 266]: Loop Invariant Derived loop invariant: (((((\valid[map] == 1 && map == map) && map == 0) && !(map == 0)) && max_table_entries <= 4) && unknown-#StackHeapBarrier-unknown < map) && map == map - InvariantResult [Line: 1988]: Loop Invariant Derived loop invariant: (((((((((((((((((((required_bytes == 0 && \valid[elemsize := 0][map] == 1) && (\result == 1 || \result == 0)) && num_entries <= 4) && b == 24) && elemsize == r) && map == map) && map == 0) && !(map == 0)) && \result + 1 <= 0) && !(num_entries == 0)) && max_table_entries <= 4) && unknown-#StackHeapBarrier-unknown < map) && (cond == 1 || cond == 0)) && required_bytes == required_bytes) && map == map) && num_entries == a) && required_bytes == required_bytes) && !(map == required_bytes)) && r == elemsize) && elemsize == 0 - InvariantResult [Line: 10017]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 239]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 238]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 253]: Loop Invariant Derived loop invariant: ((((((((((((((((((required_bytes == 0 && \valid[elemsize := 0][map] == 1) && (\result == 1 || \result == 0)) && num_entries <= 4) && b == 24) && elemsize == r) && map == map) && map == 0) && !(map == 0)) && !(num_entries == 0)) && max_table_entries <= 4) && unknown-#StackHeapBarrier-unknown < map) && (cond == 1 || cond == 0)) && required_bytes == required_bytes) && map == map) && num_entries == a) && required_bytes == required_bytes) && !(map == required_bytes)) && r == elemsize) && elemsize == 0 - InvariantResult [Line: 10006]: Loop Invariant [2021-10-28 23:18:52,966 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-28 23:18:52,966 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-28 23:18:52,966 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-28 23:18:52,966 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-28 23:18:52,967 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-28 23:18:52,967 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-28 23:18:52,967 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-28 23:18:52,968 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-28 23:18:52,968 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-28 23:18:52,968 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((((((((((((unknown-#StackHeapBarrier-unknown + 1 <= map && !(\result == 0)) && map == map) && map == map) && \valid[map] == 1) && map == map) && #memory_$Pointer$[map][map] == map) && map == 0) && !(map == 0)) && \result == 0) && unknown-#memory_int-unknown[#memory_$Pointer$[map][map]][40] <= 4) && map == 0) && \result == 0) && size_at_least_two == 0) && (18446744073679922088 + unknown-#memory_int-unknown[#memory_$Pointer$[map][map]][40] * 24) % 18446744073709551616 <= 36028797018963967) && map == map) && !(map == 0)) && #memory_$Pointer$[map][map] + 1 < map) && #memory_$Pointer$[map][map] == 0 - InvariantResult [Line: 9709]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 239]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 9621]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 10006]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 238]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 262]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 239]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 7348]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 266]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2626]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 238]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 9365]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 9147]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2626]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 239]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 238]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 9147]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 9100]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 9692]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 10119]: Loop Invariant Derived loop invariant: (((((((unknown-#StackHeapBarrier-unknown + 1 <= map && \valid[map] == 1) && \result + 1 <= 0) && map == map) && map == 0) && !(map == 0)) && map == map) && !(map == required_bytes)) || (((((((((((((required_bytes == 0 && (\result == 1 || \result == 0)) && num_entries <= 4) && \valid[map] == 1) && map == map) && map == 0) && !(map == 0)) && !(num_entries == 0)) && max_table_entries <= 4) && unknown-#StackHeapBarrier-unknown < map) && (cond == 1 || cond == 0)) && map == map) && unknown-#memory_int-unknown[required_bytes][required_bytes] + 29629528 == 24 * num_entries) && !(map == required_bytes)) - InvariantResult [Line: 2626]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2626]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 239]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 10017]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 7280]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 238]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 7399]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 10006]: Loop Invariant [2021-10-28 23:18:52,970 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-28 23:18:52,971 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-28 23:18:52,971 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-28 23:18:52,971 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((#memory_$Pointer$[map][map] == 0 && !(\result == 0)) && (!(map == 0) || !(map == 0))) && map == map) && map == map) && map == map) && !(map == 0)) && map == map) && #memory_$Pointer$[map][map] == 0 - InvariantResult [Line: 9348]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 262]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 9121]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2626]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 7331]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 9635]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2541]: Loop Invariant Derived loop invariant: (((((((((((((((((((((required_bytes == 0 && \valid[elemsize := 0][map] == 1) && (\result == 1 || \result == 0)) && \result + 1 <= 0) && num_entries <= 4) && b == 24) && elemsize == r) && map == map) && map == 0) && !(map == 0)) && \result + 1 <= 0) && !(num_entries == 0)) && max_table_entries <= 4) && unknown-#StackHeapBarrier-unknown < map) && (cond == 1 || cond == 0)) && required_bytes == required_bytes) && map == map) && num_entries == a) && required_bytes == required_bytes) && !(map == required_bytes)) && r == elemsize) && elemsize == 0) || ((((((((((((((((((((required_bytes == 0 && \valid[elemsize := 0][map] == 1) && (\result == 1 || \result == 0)) && num_entries <= 4) && b == 24) && elemsize == r) && map == map) && map == 0) && !(map == 0)) && !(num_entries == 0)) && max_table_entries <= 4) && unknown-#StackHeapBarrier-unknown < map) && (cond == 1 || cond == 0)) && required_bytes == required_bytes) && map == map) && unknown-#memory_int-unknown[required_bytes][required_bytes] + 29629528 == 24 * num_entries) && num_entries == a) && required_bytes == required_bytes) && !(map == required_bytes)) && r == elemsize) && elemsize == 0) - InvariantResult [Line: 6852]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 7348]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2497]: Loop Invariant Derived loop invariant: (((((((((((((((((((((\result + 1 <= 0 && required_bytes == 0) && \valid[elemsize := 0][map] == 1) && (\result == 1 || \result == 0)) && num_entries <= 4) && b == 24) && elemsize == r) && map == map) && map == 0) && !(map == 0)) && \result + 1 <= 0) && !(num_entries == 0)) && max_table_entries <= 4) && unknown-#StackHeapBarrier-unknown < map) && (cond == 1 || cond == 0)) && required_bytes == required_bytes) && map == map) && num_entries == a) && required_bytes == required_bytes) && !(map == required_bytes)) && r == elemsize) && elemsize == 0) || ((((((((((((((((((((required_bytes == 0 && \valid[elemsize := 0][map] == 1) && (\result == 1 || \result == 0)) && 24 * num_entries == unknown-#memory_int-unknown[elemsize][elemsize]) && num_entries <= 4) && b == 24) && elemsize == r) && map == map) && map == 0) && !(map == 0)) && !(num_entries == 0)) && max_table_entries <= 4) && unknown-#StackHeapBarrier-unknown < map) && (cond == 1 || cond == 0)) && required_bytes == required_bytes) && map == map) && num_entries == a) && required_bytes == required_bytes) && !(map == required_bytes)) && r == elemsize) && elemsize == 0) - InvariantResult [Line: 9154]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 9160]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 10017]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2626]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2626]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 261]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 10017]: Loop Invariant Derived loop invariant: (((!(\result == 0) && map == map) && !(map == 0)) && \result == 0) && map == map - InvariantResult [Line: 6837]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 10017]: Loop Invariant Derived loop invariant: (((!(\result == 0) && map == map) && !(map == 0)) && \result == 0) && map == map - InvariantResult [Line: 9321]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 9661]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1988]: Loop Invariant Derived loop invariant: (((((((((((((((((((required_bytes == 0 && \valid[elemsize := 0][map] == 1) && (\result == 1 || \result == 0)) && num_entries <= 4) && b == 24) && elemsize == r) && map == map) && map == 0) && !(map == 0)) && \result + 1 <= 0) && !(num_entries == 0)) && max_table_entries <= 4) && unknown-#StackHeapBarrier-unknown < map) && (cond == 1 || cond == 0)) && required_bytes == required_bytes) && map == map) && num_entries == a) && required_bytes == required_bytes) && !(map == required_bytes)) && r == elemsize) && elemsize == 0 - InvariantResult [Line: 2626]: Loop Invariant [2021-10-28 23:18:53,004 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-28 23:18:53,004 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-28 23:18:53,005 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-28 23:18:53,005 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-28 23:18:53,005 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-28 23:18:53,006 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-28 23:18:53,007 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-28 23:18:53,007 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-28 23:18:53,008 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-28 23:18:53,008 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((((((((((((aux-map && map->p_impl-aux && aux-map && map->p_impl && hash_table_state_is_valid(map->p_impl)-aux) && unknown-#StackHeapBarrier-unknown + 1 <= map) && !(\result == 0)) && map == map) && map == map) && \valid[map] == 1) && map == map) && #memory_$Pointer$[map][map] == map) && map == 0) && !(map == 0)) && unknown-#memory_int-unknown[#memory_$Pointer$[map][map]][40] <= 4) && map == 0) && size_at_least_two == 0) && (18446744073679922088 + unknown-#memory_int-unknown[#memory_$Pointer$[map][map]][40] * 24) % 18446744073709551616 <= 36028797018963967) && map == map) && !(map == 0)) && #memory_$Pointer$[map][map] + 1 < map) && #memory_$Pointer$[map][map] == 0 - InvariantResult [Line: 248]: Loop Invariant [2021-10-28 23:18:53,009 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base,QUANTIFIED] [2021-10-28 23:18:53,009 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base,QUANTIFIED] [2021-10-28 23:18:53,010 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base,QUANTIFIED] [2021-10-28 23:18:53,011 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((((required_bytes == 0 && (\result == 1 || \result == 0)) && \valid[elemsize := 0][map] == 1) && (\result == 1 || \result == 0)) && 24 * num_entries == unknown-#memory_int-unknown[elemsize][elemsize]) && num_entries <= 4) && b == 24) && elemsize == r) && map == map) && map == 0) && !(map == 0)) && !(num_entries == 0)) && max_table_entries <= 4) && unknown-#StackHeapBarrier-unknown < map) && r == required_bytes) && (cond == 1 || cond == 0)) && (\exists ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base : int :: unknown-#memory_int-unknown[ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base][0] == 24 * num_entries && unknown-#memory_int-unknown[ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base][0] == a)) && 29629528 + b == 0) && required_bytes == required_bytes) && map == map) && num_entries == a) && required_bytes == required_bytes) && !(map == required_bytes)) && r == elemsize) && r == required_bytes) && elemsize == 0 - InvariantResult [Line: 10017]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2626]: Loop Invariant Derived loop invariant: ((((((((num_entries <= 4 && \valid[map] == 1) && map == map) && map == 0) && !(map == 0)) && max_table_entries <= 4) && ((!(num_entries == 0) && \result == 1) || \result == 0)) && unknown-#StackHeapBarrier-unknown < map) && (cond == 1 || cond == 0)) && map == map - InvariantResult [Line: 238]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 6852]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 10017]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 10017]: Loop Invariant [2021-10-28 23:18:53,013 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-28 23:18:53,016 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-28 23:18:53,017 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-28 23:18:53,017 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-28 23:18:53,018 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-28 23:18:53,018 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-28 23:18:53,019 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-28 23:18:53,019 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-28 23:18:53,020 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-28 23:18:53,020 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: ((((((((((((((((((aux-map && map->p_impl-aux && aux-map && map->p_impl && hash_table_state_is_valid(map->p_impl)-aux) && unknown-#StackHeapBarrier-unknown + 1 <= map) && !(\result == 0)) && map == map) && map == map) && \valid[map] == 1) && map == map) && #memory_$Pointer$[map][map] == map) && map == 0) && !(map == 0)) && unknown-#memory_int-unknown[#memory_$Pointer$[map][map]][40] <= 4) && map == 0) && \result == 0) && size_at_least_two == 0) && (18446744073679922088 + unknown-#memory_int-unknown[#memory_$Pointer$[map][map]][40] * 24) % 18446744073709551616 <= 36028797018963967) && map == map) && !(map == 0)) && #memory_$Pointer$[map][map] + 1 < map) && #memory_$Pointer$[map][map] == 0 - InvariantResult [Line: 10017]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 10017]: Loop Invariant Derived loop invariant: (((!(\result == 0) && map == map) && !(map == 0)) && \result == 0) && map == map - InvariantResult [Line: 2626]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2626]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 9154]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 6950]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2626]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2626]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 9121]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2626]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 10006]: Loop Invariant [2021-10-28 23:18:53,023 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-28 23:18:53,023 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-28 23:18:53,023 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-28 23:18:53,023 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-28 23:18:53,024 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-28 23:18:53,025 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-28 23:18:53,025 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-28 23:18:53,025 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((((#memory_$Pointer$[map][map] == 0 && #memory_$Pointer$[map][map] == 0) && !(\result == 0)) && (!(map == 0) || !(map == 0))) && map == map) && map == map) && map == map) && #memory_$Pointer$[map][map] == 0) && !(map == 0)) && map == map) && #memory_$Pointer$[map][map] == 0 - InvariantResult [Line: 10017]: Loop Invariant Derived loop invariant: (((!(\result == 0) && map == map) && !(map == 0)) && \result == 0) && map == map - InvariantResult [Line: 9157]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2586]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((\result + 1 <= 0 && required_bytes == 0) && \valid[elemsize := 0][map] == 1) && (\result == 1 || \result == 0)) && num_entries <= 4) && b == 24) && elemsize == r) && map == map) && map == 0) && !(map == 0)) && \result + 1 <= 0) && !(num_entries == 0)) && max_table_entries <= 4) && \result + 1 <= 0) && unknown-#StackHeapBarrier-unknown < map) && (cond == 1 || cond == 0)) && required_bytes == required_bytes) && map == map) && num_entries == a) && required_bytes == required_bytes) && !(map == required_bytes)) && r == elemsize) && elemsize == 0) || ((((((((((((((((((((required_bytes == 0 && \valid[elemsize := 0][map] == 1) && (\result == 1 || \result == 0)) && 24 * num_entries == unknown-#memory_int-unknown[elemsize][elemsize]) && num_entries <= 4) && b == 24) && elemsize == r) && map == map) && map == 0) && !(map == 0)) && !(num_entries == 0)) && max_table_entries <= 4) && unknown-#StackHeapBarrier-unknown < map) && (cond == 1 || cond == 0)) && required_bytes == required_bytes) && map == map) && num_entries == a) && required_bytes == required_bytes) && !(map == required_bytes)) && r == elemsize) && elemsize == 0) - InvariantResult [Line: 6943]: Loop Invariant [2021-10-28 23:18:53,034 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base,QUANTIFIED] [2021-10-28 23:18:53,034 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base,QUANTIFIED] [2021-10-28 23:18:53,035 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base,QUANTIFIED] [2021-10-28 23:18:53,035 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base,QUANTIFIED] Derived loop invariant: ((((((((((unknown-#StackHeapBarrier-unknown + 1 <= map && \result == 0) && !(\result == 0)) && num_entries <= 4) && \valid[map] == 1) && map == map) && map == 0) && !(map == 0)) && \result + 1 < map) && (\exists ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base : int :: 24 * num_entries == 29629528 + unknown-#memory_int-unknown[ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base][0] && unknown-#memory_int-unknown[ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base][0] % 18446744073709551616 <= 36028797018963967)) && map == map) && !(map == required_bytes) - InvariantResult [Line: 10017]: Loop Invariant Derived loop invariant: (((!(\result == 0) && map == map) && !(map == 0)) && \result == 0) && map == map - InvariantResult [Line: 2626]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 7405]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 10017]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 6831]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 239]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2626]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 7331]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 261]: Loop Invariant Derived loop invariant: 0 RESULT: Ultimate proved your program to be correct! [2021-10-28 23:18:53,244 WARN L435 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41324c71-c160-4a14-9620-79c343763c74/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2021-10-28 23:18:53,273 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41324c71-c160-4a14-9620-79c343763c74/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 Received shutdown request...