./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/aws-c-common/aws_hash_table_create_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb76e2f-1ba5-4fda-92f9-12f4945b22ff/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb76e2f-1ba5-4fda-92f9-12f4945b22ff/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb76e2f-1ba5-4fda-92f9-12f4945b22ff/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb76e2f-1ba5-4fda-92f9-12f4945b22ff/bin/uautomizer-ZsLfNo2U6R/config/AutomizerReach.xml -i ../../sv-benchmarks/c/aws-c-common/aws_hash_table_create_harness.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb76e2f-1ba5-4fda-92f9-12f4945b22ff/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb76e2f-1ba5-4fda-92f9-12f4945b22ff/bin/uautomizer-ZsLfNo2U6R --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 a871e941a14cf19147765419aa3746af2f9add859ed1f61f31f704f97208fdb0 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-25 17:43:09,299 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 17:43:09,302 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 17:43:09,343 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 17:43:09,344 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 17:43:09,345 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 17:43:09,347 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 17:43:09,349 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 17:43:09,357 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 17:43:09,363 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 17:43:09,364 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 17:43:09,365 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 17:43:09,365 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 17:43:09,367 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 17:43:09,368 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 17:43:09,369 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 17:43:09,370 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 17:43:09,371 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 17:43:09,373 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 17:43:09,380 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 17:43:09,385 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 17:43:09,390 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 17:43:09,392 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 17:43:09,394 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 17:43:09,408 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 17:43:09,409 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 17:43:09,409 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 17:43:09,410 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 17:43:09,411 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 17:43:09,413 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 17:43:09,414 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 17:43:09,415 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 17:43:09,417 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 17:43:09,418 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 17:43:09,420 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 17:43:09,420 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 17:43:09,421 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 17:43:09,421 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 17:43:09,422 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 17:43:09,424 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 17:43:09,424 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 17:43:09,427 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb76e2f-1ba5-4fda-92f9-12f4945b22ff/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-11-25 17:43:09,474 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 17:43:09,475 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 17:43:09,476 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 17:43:09,476 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 17:43:09,477 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 17:43:09,478 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 17:43:09,479 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 17:43:09,479 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 17:43:09,479 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 17:43:09,480 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 17:43:09,481 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 17:43:09,481 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 17:43:09,482 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 17:43:09,482 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 17:43:09,482 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 17:43:09,483 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 17:43:09,483 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 17:43:09,483 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 17:43:09,484 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 17:43:09,484 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 17:43:09,485 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 17:43:09,485 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:43:09,485 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 17:43:09,486 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 17:43:09,486 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 17:43:09,486 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 17:43:09,487 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 17:43:09,487 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 17:43:09,488 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 17:43:09,488 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 17:43:09,489 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 17:43:09,489 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_adb76e2f-1ba5-4fda-92f9-12f4945b22ff/bin/uautomizer-ZsLfNo2U6R/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_adb76e2f-1ba5-4fda-92f9-12f4945b22ff/bin/uautomizer-ZsLfNo2U6R 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 -> a871e941a14cf19147765419aa3746af2f9add859ed1f61f31f704f97208fdb0 [2022-11-25 17:43:09,858 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 17:43:09,894 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 17:43:09,897 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 17:43:09,899 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 17:43:09,901 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 17:43:09,903 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb76e2f-1ba5-4fda-92f9-12f4945b22ff/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/aws-c-common/aws_hash_table_create_harness.i [2022-11-25 17:43:13,117 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 17:43:13,800 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 17:43:13,801 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb76e2f-1ba5-4fda-92f9-12f4945b22ff/sv-benchmarks/c/aws-c-common/aws_hash_table_create_harness.i [2022-11-25 17:43:13,855 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb76e2f-1ba5-4fda-92f9-12f4945b22ff/bin/uautomizer-ZsLfNo2U6R/data/fb4b1db43/bccd6e9440c9474d8e7755f3e6bd8236/FLAG31ac301fe [2022-11-25 17:43:13,875 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb76e2f-1ba5-4fda-92f9-12f4945b22ff/bin/uautomizer-ZsLfNo2U6R/data/fb4b1db43/bccd6e9440c9474d8e7755f3e6bd8236 [2022-11-25 17:43:13,878 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 17:43:13,880 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 17:43:13,884 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 17:43:13,884 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 17:43:13,888 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 17:43:13,889 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:43:13" (1/1) ... [2022-11-25 17:43:13,890 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@230a9a59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:43:13, skipping insertion in model container [2022-11-25 17:43:13,890 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:43:13" (1/1) ... [2022-11-25 17:43:13,898 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 17:43:14,052 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 17:43:14,422 WARN L237 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_adb76e2f-1ba5-4fda-92f9-12f4945b22ff/sv-benchmarks/c/aws-c-common/aws_hash_table_create_harness.i[4495,4508] [2022-11-25 17:43:14,432 WARN L237 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_adb76e2f-1ba5-4fda-92f9-12f4945b22ff/sv-benchmarks/c/aws-c-common/aws_hash_table_create_harness.i[4555,4568] [2022-11-25 17:43:15,559 WARN L623 FunctionHandler]: Unknown extern function my_memset [2022-11-25 17:43:15,591 WARN L623 FunctionHandler]: Unknown extern function my_memset [2022-11-25 17:43:15,616 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:43:15,617 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:43:15,617 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:43:15,618 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:43:15,619 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:43:15,625 WARN L623 FunctionHandler]: Unknown extern function my_memset [2022-11-25 17:43:15,632 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:43:15,633 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:43:15,635 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:43:15,636 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:43:15,638 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:43:15,639 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:43:15,639 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:43:15,640 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:43:15,746 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-11-25 17:43:15,747 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-11-25 17:43:15,748 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-11-25 17:43:15,753 WARN L623 FunctionHandler]: Unknown extern function ntohl [2022-11-25 17:43:15,755 WARN L623 FunctionHandler]: Unknown extern function htons [2022-11-25 17:43:15,755 WARN L623 FunctionHandler]: Unknown extern function ntohs [2022-11-25 17:43:15,925 WARN L623 FunctionHandler]: Unknown extern function my_memset [2022-11-25 17:43:16,142 WARN L623 FunctionHandler]: Unknown extern function my_abort [2022-11-25 17:43:16,144 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-11-25 17:43:16,145 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-11-25 17:43:16,146 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-11-25 17:43:16,147 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-11-25 17:43:16,149 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-11-25 17:43:16,150 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-11-25 17:43:16,151 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-11-25 17:43:16,152 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-11-25 17:43:16,153 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-11-25 17:43:16,153 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-11-25 17:43:16,383 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-11-25 17:43:16,435 WARN L623 FunctionHandler]: Unknown extern function my_memset [2022-11-25 17:43:16,459 WARN L623 FunctionHandler]: Unknown extern function fprintf [2022-11-25 17:43:16,800 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:43:16,801 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:43:16,823 WARN L623 FunctionHandler]: Unknown extern function my_memset [2022-11-25 17:43:16,832 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:43:16,835 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:43:16,844 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:43:16,844 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:43:16,866 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:43:16,870 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:43:16,872 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:43:16,872 WARN L623 FunctionHandler]: Unknown extern function my_memset [2022-11-25 17:43:16,872 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:43:16,873 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:43:16,877 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:43:16,878 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:43:16,899 WARN L623 FunctionHandler]: Unknown extern function my_memset [2022-11-25 17:43:16,911 WARN L623 FunctionHandler]: Unknown extern function my_memset [2022-11-25 17:43:16,939 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:43:16,985 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 17:43:17,015 WARN L237 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_adb76e2f-1ba5-4fda-92f9-12f4945b22ff/sv-benchmarks/c/aws-c-common/aws_hash_table_create_harness.i[4495,4508] [2022-11-25 17:43:17,016 WARN L237 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_adb76e2f-1ba5-4fda-92f9-12f4945b22ff/sv-benchmarks/c/aws-c-common/aws_hash_table_create_harness.i[4555,4568] [2022-11-25 17:43:17,058 WARN L623 FunctionHandler]: Unknown extern function my_memset [2022-11-25 17:43:17,066 WARN L623 FunctionHandler]: Unknown extern function my_memset [2022-11-25 17:43:17,075 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:43:17,075 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:43:17,076 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:43:17,077 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:43:17,077 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:43:17,081 WARN L623 FunctionHandler]: Unknown extern function my_memset [2022-11-25 17:43:17,087 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:43:17,087 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:43:17,088 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:43:17,089 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:43:17,090 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:43:17,091 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:43:17,092 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:43:17,093 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:43:17,100 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-11-25 17:43:17,101 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-11-25 17:43:17,102 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-11-25 17:43:17,106 WARN L623 FunctionHandler]: Unknown extern function ntohl [2022-11-25 17:43:17,108 WARN L623 FunctionHandler]: Unknown extern function htons [2022-11-25 17:43:17,108 WARN L623 FunctionHandler]: Unknown extern function ntohs [2022-11-25 17:43:17,111 WARN L623 FunctionHandler]: Unknown extern function my_memset [2022-11-25 17:43:17,134 WARN L623 FunctionHandler]: Unknown extern function my_abort [2022-11-25 17:43:17,135 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-11-25 17:43:17,136 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-11-25 17:43:17,137 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-11-25 17:43:17,140 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-11-25 17:43:17,141 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-11-25 17:43:17,142 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-11-25 17:43:17,143 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-11-25 17:43:17,188 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-11-25 17:43:17,188 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-11-25 17:43:17,188 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-11-25 17:43:17,225 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-11-25 17:43:17,238 WARN L623 FunctionHandler]: Unknown extern function my_memset [2022-11-25 17:43:17,252 WARN L623 FunctionHandler]: Unknown extern function fprintf [2022-11-25 17:43:17,354 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:43:17,355 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:43:17,363 WARN L623 FunctionHandler]: Unknown extern function my_memset [2022-11-25 17:43:17,365 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:43:17,366 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:43:17,372 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:43:17,372 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:43:17,390 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:43:17,391 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:43:17,392 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:43:17,392 WARN L623 FunctionHandler]: Unknown extern function my_memset [2022-11-25 17:43:17,393 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:43:17,393 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:43:17,394 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:43:17,394 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:43:17,403 WARN L623 FunctionHandler]: Unknown extern function my_memset [2022-11-25 17:43:17,410 WARN L623 FunctionHandler]: Unknown extern function my_memset [2022-11-25 17:43:17,426 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:43:17,820 INFO L208 MainTranslator]: Completed translation [2022-11-25 17:43:17,820 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:43:17 WrapperNode [2022-11-25 17:43:17,821 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 17:43:17,822 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 17:43:17,822 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 17:43:17,822 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 17:43:17,831 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:43:17" (1/1) ... [2022-11-25 17:43:17,936 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:43:17" (1/1) ... [2022-11-25 17:43:18,082 INFO L138 Inliner]: procedures = 775, calls = 2488, calls flagged for inlining = 67, calls inlined = 21, statements flattened = 1285 [2022-11-25 17:43:18,083 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 17:43:18,084 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 17:43:18,084 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 17:43:18,084 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 17:43:18,095 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:43:17" (1/1) ... [2022-11-25 17:43:18,095 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:43:17" (1/1) ... [2022-11-25 17:43:18,109 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:43:17" (1/1) ... [2022-11-25 17:43:18,109 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:43:17" (1/1) ... [2022-11-25 17:43:18,156 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:43:17" (1/1) ... [2022-11-25 17:43:18,163 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:43:17" (1/1) ... [2022-11-25 17:43:18,173 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:43:17" (1/1) ... [2022-11-25 17:43:18,197 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:43:17" (1/1) ... [2022-11-25 17:43:18,214 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 17:43:18,221 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 17:43:18,221 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 17:43:18,221 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 17:43:18,222 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:43:17" (1/1) ... [2022-11-25 17:43:18,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:43:18,242 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb76e2f-1ba5-4fda-92f9-12f4945b22ff/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:43:18,258 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb76e2f-1ba5-4fda-92f9-12f4945b22ff/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 17:43:18,289 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb76e2f-1ba5-4fda-92f9-12f4945b22ff/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 17:43:18,310 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-11-25 17:43:18,310 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2022-11-25 17:43:18,310 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2022-11-25 17:43:18,310 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-25 17:43:18,310 INFO L130 BoogieDeclarations]: Found specification of procedure aws_raise_error [2022-11-25 17:43:18,310 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_raise_error [2022-11-25 17:43:18,311 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-25 17:43:18,312 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-25 17:43:18,314 INFO L130 BoogieDeclarations]: Found specification of procedure aws_hash_table_create [2022-11-25 17:43:18,315 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_hash_table_create [2022-11-25 17:43:18,315 INFO L130 BoogieDeclarations]: Found specification of procedure hash_table_state_is_valid [2022-11-25 17:43:18,315 INFO L138 BoogieDeclarations]: Found implementation of procedure hash_table_state_is_valid [2022-11-25 17:43:18,315 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-25 17:43:18,315 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 17:43:18,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-25 17:43:18,316 INFO L130 BoogieDeclarations]: Found specification of procedure s_emplace_item [2022-11-25 17:43:18,316 INFO L138 BoogieDeclarations]: Found implementation of procedure s_emplace_item [2022-11-25 17:43:18,321 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 17:43:18,322 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 17:43:18,322 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2022-11-25 17:43:18,322 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2022-11-25 17:43:18,322 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mul_size_checked [2022-11-25 17:43:18,322 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mul_size_checked [2022-11-25 17:43:18,322 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mem_release [2022-11-25 17:43:18,322 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mem_release [2022-11-25 17:43:18,323 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 17:43:18,323 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_plus [2022-11-25 17:43:18,323 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_plus [2022-11-25 17:43:18,323 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-25 17:43:18,323 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2022-11-25 17:43:18,324 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2022-11-25 17:43:18,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 17:43:18,324 INFO L130 BoogieDeclarations]: Found specification of procedure s_hash_for [2022-11-25 17:43:18,324 INFO L138 BoogieDeclarations]: Found implementation of procedure s_hash_for [2022-11-25 17:43:18,324 INFO L130 BoogieDeclarations]: Found specification of procedure aws_is_power_of_two [2022-11-25 17:43:18,325 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_is_power_of_two [2022-11-25 17:43:18,325 INFO L130 BoogieDeclarations]: Found specification of procedure s_update_template_size [2022-11-25 17:43:18,325 INFO L138 BoogieDeclarations]: Found implementation of procedure s_update_template_size [2022-11-25 17:43:18,325 INFO L130 BoogieDeclarations]: Found specification of procedure s_hash_keys_eq [2022-11-25 17:43:18,325 INFO L138 BoogieDeclarations]: Found implementation of procedure s_hash_keys_eq [2022-11-25 17:43:18,325 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_uninterpreted_equals [2022-11-25 17:43:18,325 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_uninterpreted_equals [2022-11-25 17:43:18,325 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 17:43:18,325 INFO L130 BoogieDeclarations]: Found specification of procedure aws_allocator_is_valid [2022-11-25 17:43:18,326 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_allocator_is_valid [2022-11-25 17:43:18,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2022-11-25 17:43:18,326 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_calloc [2022-11-25 17:43:18,326 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_calloc [2022-11-25 17:43:18,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-11-25 17:43:18,327 INFO L130 BoogieDeclarations]: Found specification of procedure hash_table_state_required_bytes [2022-11-25 17:43:18,327 INFO L138 BoogieDeclarations]: Found implementation of procedure hash_table_state_required_bytes [2022-11-25 17:43:18,327 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_uninterpreted_hasher [2022-11-25 17:43:18,327 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_uninterpreted_hasher [2022-11-25 17:43:18,327 INFO L130 BoogieDeclarations]: Found specification of procedure s_safe_eq_check [2022-11-25 17:43:18,327 INFO L138 BoogieDeclarations]: Found implementation of procedure s_safe_eq_check [2022-11-25 17:43:18,328 INFO L130 BoogieDeclarations]: Found specification of procedure s_find_entry [2022-11-25 17:43:18,328 INFO L138 BoogieDeclarations]: Found implementation of procedure s_find_entry [2022-11-25 17:43:18,328 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-25 17:43:18,328 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-25 17:43:18,328 INFO L130 BoogieDeclarations]: Found specification of procedure aws_hash_table_is_valid [2022-11-25 17:43:18,328 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_hash_table_is_valid [2022-11-25 17:43:18,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-25 17:43:18,329 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2022-11-25 17:43:18,329 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2022-11-25 17:43:18,329 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_mult [2022-11-25 17:43:18,329 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_mult [2022-11-25 17:43:18,329 INFO L130 BoogieDeclarations]: Found specification of procedure aws_add_size_checked [2022-11-25 17:43:18,329 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_add_size_checked [2022-11-25 17:43:18,330 INFO L130 BoogieDeclarations]: Found specification of procedure s_alloc_state [2022-11-25 17:43:18,330 INFO L138 BoogieDeclarations]: Found implementation of procedure s_alloc_state [2022-11-25 17:43:18,330 INFO L130 BoogieDeclarations]: Found specification of procedure uninterpreted_equals [2022-11-25 17:43:18,330 INFO L138 BoogieDeclarations]: Found implementation of procedure uninterpreted_equals [2022-11-25 17:43:18,330 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2022-11-25 17:43:18,330 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2022-11-25 17:43:18,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 17:43:18,968 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 17:43:18,971 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 17:43:19,347 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##5: assume !true; [2022-11-25 17:43:19,382 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume !true; [2022-11-25 17:43:20,204 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##7: assume !true; [2022-11-25 17:43:20,205 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##29: assume !true; [2022-11-25 17:43:20,841 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 17:43:20,851 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 17:43:20,851 INFO L300 CfgBuilder]: Removed 11 assume(true) statements. [2022-11-25 17:43:20,854 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:43:20 BoogieIcfgContainer [2022-11-25 17:43:20,854 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 17:43:20,857 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 17:43:20,857 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 17:43:20,861 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 17:43:20,861 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 05:43:13" (1/3) ... [2022-11-25 17:43:20,862 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a51f5e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:43:20, skipping insertion in model container [2022-11-25 17:43:20,862 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:43:17" (2/3) ... [2022-11-25 17:43:20,862 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a51f5e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:43:20, skipping insertion in model container [2022-11-25 17:43:20,863 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:43:20" (3/3) ... [2022-11-25 17:43:20,864 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_hash_table_create_harness.i [2022-11-25 17:43:20,886 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 17:43:20,887 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-25 17:43:20,978 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 17:43:20,986 INFO L357 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6c4e177, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 17:43:20,986 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-25 17:43:20,994 INFO L276 IsEmpty]: Start isEmpty. Operand has 347 states, 233 states have (on average 1.2660944206008584) internal successors, (295), 230 states have internal predecessors, (295), 86 states have call successors, (86), 30 states have call predecessors, (86), 30 states have return successors, (86), 86 states have call predecessors, (86), 86 states have call successors, (86) [2022-11-25 17:43:21,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-11-25 17:43:21,010 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:43:21,011 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:43:21,012 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:43:21,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:43:21,019 INFO L85 PathProgramCache]: Analyzing trace with hash 2042396882, now seen corresponding path program 1 times [2022-11-25 17:43:21,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:43:21,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351657745] [2022-11-25 17:43:21,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:43:21,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:43:21,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:43:21,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:43:21,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351657745] [2022-11-25 17:43:21,587 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2022-11-25 17:43:21,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [507576071] [2022-11-25 17:43:21,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:43:21,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:43:21,588 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb76e2f-1ba5-4fda-92f9-12f4945b22ff/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:43:21,592 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb76e2f-1ba5-4fda-92f9-12f4945b22ff/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:43:21,631 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb76e2f-1ba5-4fda-92f9-12f4945b22ff/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-25 17:43:22,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:43:22,371 INFO L263 TraceCheckSpWp]: Trace formula consists of 2471 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-25 17:43:22,380 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:43:22,439 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2022-11-25 17:43:22,440 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:43:22,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [507576071] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:43:22,441 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:43:22,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 17:43:22,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752616609] [2022-11-25 17:43:22,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:43:22,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-25 17:43:22,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:43:22,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-25 17:43:22,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 17:43:22,513 INFO L87 Difference]: Start difference. First operand has 347 states, 233 states have (on average 1.2660944206008584) internal successors, (295), 230 states have internal predecessors, (295), 86 states have call successors, (86), 30 states have call predecessors, (86), 30 states have return successors, (86), 86 states have call predecessors, (86), 86 states have call successors, (86) Second operand has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-11-25 17:43:22,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:43:22,608 INFO L93 Difference]: Finished difference Result 688 states and 975 transitions. [2022-11-25 17:43:22,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 17:43:22,610 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 122 [2022-11-25 17:43:22,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:43:22,637 INFO L225 Difference]: With dead ends: 688 [2022-11-25 17:43:22,637 INFO L226 Difference]: Without dead ends: 339 [2022-11-25 17:43:22,647 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 17:43:22,656 INFO L413 NwaCegarLoop]: 456 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 17:43:22,657 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 456 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:43:22,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2022-11-25 17:43:22,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 339. [2022-11-25 17:43:22,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 222 states have (on average 1.2477477477477477) internal successors, (277), 224 states have internal predecessors, (277), 86 states have call successors, (86), 30 states have call predecessors, (86), 30 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2022-11-25 17:43:22,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 447 transitions. [2022-11-25 17:43:22,775 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 447 transitions. Word has length 122 [2022-11-25 17:43:22,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:43:22,777 INFO L495 AbstractCegarLoop]: Abstraction has 339 states and 447 transitions. [2022-11-25 17:43:22,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-11-25 17:43:22,778 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 447 transitions. [2022-11-25 17:43:22,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-11-25 17:43:22,788 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:43:22,789 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:43:22,810 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb76e2f-1ba5-4fda-92f9-12f4945b22ff/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-25 17:43:23,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb76e2f-1ba5-4fda-92f9-12f4945b22ff/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:43:23,004 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:43:23,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:43:23,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1202487832, now seen corresponding path program 1 times [2022-11-25 17:43:23,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:43:23,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15060534] [2022-11-25 17:43:23,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:43:23,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:43:23,129 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 17:43:23,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [827667750] [2022-11-25 17:43:23,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:43:23,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:43:23,130 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb76e2f-1ba5-4fda-92f9-12f4945b22ff/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:43:23,131 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb76e2f-1ba5-4fda-92f9-12f4945b22ff/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:43:23,150 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb76e2f-1ba5-4fda-92f9-12f4945b22ff/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-25 17:43:23,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:43:23,966 INFO L263 TraceCheckSpWp]: Trace formula consists of 2471 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-25 17:43:23,975 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:43:24,055 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2022-11-25 17:43:24,055 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:43:24,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:43:24,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15060534] [2022-11-25 17:43:24,056 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 17:43:24,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [827667750] [2022-11-25 17:43:24,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [827667750] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:43:24,057 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:43:24,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 17:43:24,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344777667] [2022-11-25 17:43:24,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:43:24,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:43:24,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:43:24,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:43:24,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:43:24,060 INFO L87 Difference]: Start difference. First operand 339 states and 447 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (19), 3 states have call predecessors, (19), 2 states have call successors, (19) [2022-11-25 17:43:24,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:43:24,146 INFO L93 Difference]: Finished difference Result 674 states and 893 transitions. [2022-11-25 17:43:24,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:43:24,147 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (19), 3 states have call predecessors, (19), 2 states have call successors, (19) Word has length 122 [2022-11-25 17:43:24,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:43:24,151 INFO L225 Difference]: With dead ends: 674 [2022-11-25 17:43:24,151 INFO L226 Difference]: Without dead ends: 344 [2022-11-25 17:43:24,153 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-25 17:43:24,154 INFO L413 NwaCegarLoop]: 444 mSDtfsCounter, 2 mSDsluCounter, 1324 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1768 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 17:43:24,154 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1768 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:43:24,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2022-11-25 17:43:24,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 344. [2022-11-25 17:43:24,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 226 states have (on average 1.2433628318584071) internal successors, (281), 228 states have internal predecessors, (281), 86 states have call successors, (86), 30 states have call predecessors, (86), 31 states have return successors, (88), 85 states have call predecessors, (88), 84 states have call successors, (88) [2022-11-25 17:43:24,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 455 transitions. [2022-11-25 17:43:24,175 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 455 transitions. Word has length 122 [2022-11-25 17:43:24,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:43:24,176 INFO L495 AbstractCegarLoop]: Abstraction has 344 states and 455 transitions. [2022-11-25 17:43:24,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (19), 3 states have call predecessors, (19), 2 states have call successors, (19) [2022-11-25 17:43:24,176 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 455 transitions. [2022-11-25 17:43:24,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-11-25 17:43:24,178 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:43:24,178 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:43:24,194 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb76e2f-1ba5-4fda-92f9-12f4945b22ff/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-25 17:43:24,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb76e2f-1ba5-4fda-92f9-12f4945b22ff/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:43:24,389 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:43:24,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:43:24,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1407527950, now seen corresponding path program 1 times [2022-11-25 17:43:24,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:43:24,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39307074] [2022-11-25 17:43:24,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:43:24,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:43:24,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:43:25,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:43:25,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:43:25,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-25 17:43:25,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:43:25,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 17:43:25,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:43:25,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 17:43:25,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:43:25,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-25 17:43:25,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:43:25,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:43:25,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:43:25,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:43:25,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:43:25,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 17:43:25,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:43:25,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-25 17:43:25,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:43:25,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-25 17:43:25,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:43:25,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:43:25,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:43:25,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-25 17:43:25,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:43:25,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-11-25 17:43:25,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:43:25,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-11-25 17:43:25,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:43:25,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-25 17:43:25,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:43:25,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-25 17:43:25,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:43:25,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-25 17:43:25,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:43:25,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-11-25 17:43:25,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:43:25,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-11-25 17:43:25,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:43:25,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-11-25 17:43:25,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:43:25,775 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2022-11-25 17:43:25,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:43:25,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39307074] [2022-11-25 17:43:25,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39307074] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:43:25,776 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:43:25,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-25 17:43:25,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941258299] [2022-11-25 17:43:25,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:43:25,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 17:43:25,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:43:25,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 17:43:25,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-25 17:43:25,781 INFO L87 Difference]: Start difference. First operand 344 states and 455 transitions. Second operand has 8 states, 8 states have (on average 7.375) internal successors, (59), 5 states have internal predecessors, (59), 3 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2022-11-25 17:43:28,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:43:28,152 INFO L93 Difference]: Finished difference Result 754 states and 1012 transitions. [2022-11-25 17:43:28,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 17:43:28,153 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 5 states have internal predecessors, (59), 3 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 128 [2022-11-25 17:43:28,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:43:28,157 INFO L225 Difference]: With dead ends: 754 [2022-11-25 17:43:28,157 INFO L226 Difference]: Without dead ends: 424 [2022-11-25 17:43:28,159 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2022-11-25 17:43:28,160 INFO L413 NwaCegarLoop]: 251 mSDtfsCounter, 436 mSDsluCounter, 623 mSDsCounter, 0 mSdLazyCounter, 1032 mSolverCounterSat, 207 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 498 SdHoareTripleChecker+Valid, 874 SdHoareTripleChecker+Invalid, 1239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 207 IncrementalHoareTripleChecker+Valid, 1032 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-11-25 17:43:28,160 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [498 Valid, 874 Invalid, 1239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [207 Valid, 1032 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-11-25 17:43:28,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2022-11-25 17:43:28,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 344. [2022-11-25 17:43:28,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 226 states have (on average 1.238938053097345) internal successors, (280), 228 states have internal predecessors, (280), 86 states have call successors, (86), 30 states have call predecessors, (86), 31 states have return successors, (88), 85 states have call predecessors, (88), 84 states have call successors, (88) [2022-11-25 17:43:28,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 454 transitions. [2022-11-25 17:43:28,191 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 454 transitions. Word has length 128 [2022-11-25 17:43:28,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:43:28,192 INFO L495 AbstractCegarLoop]: Abstraction has 344 states and 454 transitions. [2022-11-25 17:43:28,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 5 states have internal predecessors, (59), 3 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2022-11-25 17:43:28,193 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 454 transitions. [2022-11-25 17:43:28,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-11-25 17:43:28,194 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:43:28,195 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:43:28,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 17:43:28,195 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:43:28,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:43:28,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1824924556, now seen corresponding path program 1 times [2022-11-25 17:43:28,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:43:28,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620124769] [2022-11-25 17:43:28,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:43:28,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:43:28,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:43:29,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:43:29,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:43:29,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-25 17:43:29,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:43:29,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 17:43:29,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:43:29,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 17:43:29,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:43:29,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-25 17:43:29,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:43:29,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:43:29,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:43:29,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:43:29,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:43:29,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 17:43:29,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:43:29,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-25 17:43:29,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:43:29,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-25 17:43:29,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:43:29,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:43:29,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:43:29,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-25 17:43:30,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:43:30,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-11-25 17:43:30,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:43:30,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-11-25 17:43:30,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:43:30,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-25 17:43:30,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:43:30,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-25 17:43:30,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:43:30,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-25 17:43:30,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:43:30,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-11-25 17:43:30,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:43:30,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-11-25 17:43:30,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:43:30,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-11-25 17:43:30,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:43:30,268 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2022-11-25 17:43:30,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:43:30,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620124769] [2022-11-25 17:43:30,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620124769] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:43:30,269 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:43:30,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-25 17:43:30,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147120475] [2022-11-25 17:43:30,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:43:30,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-25 17:43:30,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:43:30,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-25 17:43:30,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2022-11-25 17:43:30,272 INFO L87 Difference]: Start difference. First operand 344 states and 454 transitions. Second operand has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 9 states have internal predecessors, (59), 4 states have call successors, (23), 5 states have call predecessors, (23), 3 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) [2022-11-25 17:43:35,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:43:35,971 INFO L93 Difference]: Finished difference Result 750 states and 1004 transitions. [2022-11-25 17:43:35,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-25 17:43:35,972 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 9 states have internal predecessors, (59), 4 states have call successors, (23), 5 states have call predecessors, (23), 3 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) Word has length 128 [2022-11-25 17:43:35,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:43:35,975 INFO L225 Difference]: With dead ends: 750 [2022-11-25 17:43:35,975 INFO L226 Difference]: Without dead ends: 427 [2022-11-25 17:43:35,978 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2022-11-25 17:43:35,979 INFO L413 NwaCegarLoop]: 245 mSDtfsCounter, 441 mSDsluCounter, 1620 mSDsCounter, 0 mSdLazyCounter, 2683 mSolverCounterSat, 207 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 500 SdHoareTripleChecker+Valid, 1865 SdHoareTripleChecker+Invalid, 2890 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 207 IncrementalHoareTripleChecker+Valid, 2683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2022-11-25 17:43:35,980 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [500 Valid, 1865 Invalid, 2890 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [207 Valid, 2683 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2022-11-25 17:43:35,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2022-11-25 17:43:36,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 347. [2022-11-25 17:43:36,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 228 states have (on average 1.236842105263158) internal successors, (282), 231 states have internal predecessors, (282), 86 states have call successors, (86), 30 states have call predecessors, (86), 32 states have return successors, (89), 85 states have call predecessors, (89), 84 states have call successors, (89) [2022-11-25 17:43:36,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 457 transitions. [2022-11-25 17:43:36,008 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 457 transitions. Word has length 128 [2022-11-25 17:43:36,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:43:36,009 INFO L495 AbstractCegarLoop]: Abstraction has 347 states and 457 transitions. [2022-11-25 17:43:36,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 9 states have internal predecessors, (59), 4 states have call successors, (23), 5 states have call predecessors, (23), 3 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) [2022-11-25 17:43:36,009 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 457 transitions. [2022-11-25 17:43:36,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-11-25 17:43:36,011 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:43:36,011 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:43:36,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 17:43:36,012 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:43:36,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:43:36,012 INFO L85 PathProgramCache]: Analyzing trace with hash -510465640, now seen corresponding path program 1 times [2022-11-25 17:43:36,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:43:36,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485738018] [2022-11-25 17:43:36,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:43:36,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:43:36,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:43:36,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:43:36,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:43:36,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-25 17:43:36,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:43:36,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 17:43:36,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:43:36,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 17:43:36,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:43:37,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-25 17:43:37,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:43:37,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:43:37,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:43:37,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:43:37,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:43:37,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 17:43:37,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:43:37,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-25 17:43:37,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:43:37,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-25 17:43:37,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:43:37,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:43:37,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:43:37,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-25 17:43:37,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:43:37,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-25 17:43:37,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:43:37,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-11-25 17:43:37,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:43:37,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-25 17:43:37,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:43:37,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-25 17:43:37,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:43:37,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-11-25 17:43:37,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:43:37,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-11-25 17:43:37,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:43:37,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-11-25 17:43:37,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:43:37,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-11-25 17:43:37,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:43:37,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-11-25 17:43:37,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:43:37,468 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-11-25 17:43:37,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:43:37,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485738018] [2022-11-25 17:43:37,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485738018] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:43:37,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1235918498] [2022-11-25 17:43:37,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:43:37,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:43:37,472 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb76e2f-1ba5-4fda-92f9-12f4945b22ff/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:43:37,478 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb76e2f-1ba5-4fda-92f9-12f4945b22ff/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:43:37,501 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb76e2f-1ba5-4fda-92f9-12f4945b22ff/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-25 17:43:38,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:43:38,244 INFO L263 TraceCheckSpWp]: Trace formula consists of 2504 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-25 17:43:38,251 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:43:40,549 WARN L859 $PredicateComparison]: unable to prove that (or (exists ((aws_hash_table_is_valid_~map.base Int) (aws_hash_table_is_valid_~map.offset Int)) (not (= 0 (select (select |c_#memory_$Pointer$.offset| aws_hash_table_is_valid_~map.base) aws_hash_table_is_valid_~map.offset)))) (exists ((aws_hash_table_is_valid_~map.base Int) (aws_hash_table_is_valid_~map.offset Int)) (not (= (select (select |c_#memory_$Pointer$.base| aws_hash_table_is_valid_~map.base) aws_hash_table_is_valid_~map.offset) 0)))) is different from true [2022-11-25 17:43:48,644 WARN L233 SmtUtils]: Spent 6.03s on a formula simplification that was a NOOP. DAG size: 23 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 17:43:56,738 WARN L233 SmtUtils]: Spent 6.02s on a formula simplification that was a NOOP. DAG size: 21 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 17:43:56,792 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-11-25 17:43:56,792 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:43:56,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1235918498] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:43:56,793 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 17:43:56,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 16 [2022-11-25 17:43:56,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185257000] [2022-11-25 17:43:56,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:43:56,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 17:43:56,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:43:56,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 17:43:56,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=175, Unknown=3, NotChecked=26, Total=240 [2022-11-25 17:43:56,795 INFO L87 Difference]: Start difference. First operand 347 states and 457 transitions. Second operand has 8 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 3 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (21), 2 states have call predecessors, (21), 3 states have call successors, (21) [2022-11-25 17:43:58,218 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:44:04,637 WARN L233 SmtUtils]: Spent 6.04s on a formula simplification that was a NOOP. DAG size: 25 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 17:44:06,887 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:44:09,553 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 17:44:10,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:44:10,887 INFO L93 Difference]: Finished difference Result 681 states and 896 transitions. [2022-11-25 17:44:10,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 17:44:10,895 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 3 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (21), 2 states have call predecessors, (21), 3 states have call successors, (21) Word has length 134 [2022-11-25 17:44:10,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:44:10,898 INFO L225 Difference]: With dead ends: 681 [2022-11-25 17:44:10,898 INFO L226 Difference]: Without dead ends: 353 [2022-11-25 17:44:10,899 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 24.6s TimeCoverageRelationStatistics Valid=64, Invalid=279, Unknown=3, NotChecked=34, Total=380 [2022-11-25 17:44:10,900 INFO L413 NwaCegarLoop]: 440 mSDtfsCounter, 12 mSDsluCounter, 1934 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 2374 SdHoareTripleChecker+Invalid, 761 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 458 IncrementalHoareTripleChecker+Unchecked, 7.8s IncrementalHoareTripleChecker+Time [2022-11-25 17:44:10,901 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 2374 Invalid, 761 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 299 Invalid, 1 Unknown, 458 Unchecked, 7.8s Time] [2022-11-25 17:44:10,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2022-11-25 17:44:10,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 353. [2022-11-25 17:44:10,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 232 states have (on average 1.2327586206896552) internal successors, (286), 235 states have internal predecessors, (286), 87 states have call successors, (87), 31 states have call predecessors, (87), 33 states have return successors, (90), 86 states have call predecessors, (90), 85 states have call successors, (90) [2022-11-25 17:44:10,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 463 transitions. [2022-11-25 17:44:10,928 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 463 transitions. Word has length 134 [2022-11-25 17:44:10,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:44:10,928 INFO L495 AbstractCegarLoop]: Abstraction has 353 states and 463 transitions. [2022-11-25 17:44:10,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 3 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (21), 2 states have call predecessors, (21), 3 states have call successors, (21) [2022-11-25 17:44:10,929 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 463 transitions. [2022-11-25 17:44:10,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-11-25 17:44:10,931 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:44:10,931 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:44:10,947 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb76e2f-1ba5-4fda-92f9-12f4945b22ff/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-25 17:44:11,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb76e2f-1ba5-4fda-92f9-12f4945b22ff/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:44:11,132 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:44:11,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:44:11,133 INFO L85 PathProgramCache]: Analyzing trace with hash 928186415, now seen corresponding path program 1 times [2022-11-25 17:44:11,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:44:11,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678421206] [2022-11-25 17:44:11,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:44:11,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:44:11,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:11,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:44:11,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:11,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-25 17:44:11,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:11,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 17:44:11,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:11,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 17:44:11,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:11,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-25 17:44:11,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:11,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:44:11,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:11,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:44:11,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:11,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 17:44:11,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:11,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-25 17:44:11,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:11,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-25 17:44:11,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:11,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:44:11,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:12,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-25 17:44:12,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:12,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-25 17:44:12,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:12,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:44:12,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:12,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-25 17:44:12,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:12,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-25 17:44:12,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:12,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-25 17:44:12,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:12,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-11-25 17:44:12,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:12,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-11-25 17:44:12,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:12,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-11-25 17:44:12,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:12,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-11-25 17:44:12,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:12,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-11-25 17:44:12,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:12,244 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2022-11-25 17:44:12,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:44:12,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678421206] [2022-11-25 17:44:12,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678421206] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:44:12,245 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:44:12,245 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-25 17:44:12,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121507973] [2022-11-25 17:44:12,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:44:12,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 17:44:12,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:44:12,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 17:44:12,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-25 17:44:12,248 INFO L87 Difference]: Start difference. First operand 353 states and 463 transitions. Second operand has 9 states, 8 states have (on average 8.25) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (25), 5 states have call predecessors, (25), 3 states have return successors, (22), 3 states have call predecessors, (22), 2 states have call successors, (22) [2022-11-25 17:44:16,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:44:16,501 INFO L93 Difference]: Finished difference Result 745 states and 997 transitions. [2022-11-25 17:44:16,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-25 17:44:16,501 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.25) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (25), 5 states have call predecessors, (25), 3 states have return successors, (22), 3 states have call predecessors, (22), 2 states have call successors, (22) Word has length 139 [2022-11-25 17:44:16,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:44:16,507 INFO L225 Difference]: With dead ends: 745 [2022-11-25 17:44:16,507 INFO L226 Difference]: Without dead ends: 435 [2022-11-25 17:44:16,509 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-11-25 17:44:16,510 INFO L413 NwaCegarLoop]: 246 mSDtfsCounter, 287 mSDsluCounter, 1178 mSDsCounter, 0 mSdLazyCounter, 1784 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 1424 SdHoareTripleChecker+Invalid, 1863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 1784 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-11-25 17:44:16,510 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 1424 Invalid, 1863 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 1784 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2022-11-25 17:44:16,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2022-11-25 17:44:16,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 355. [2022-11-25 17:44:16,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 233 states have (on average 1.2317596566523605) internal successors, (287), 237 states have internal predecessors, (287), 87 states have call successors, (87), 31 states have call predecessors, (87), 34 states have return successors, (95), 86 states have call predecessors, (95), 85 states have call successors, (95) [2022-11-25 17:44:16,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 469 transitions. [2022-11-25 17:44:16,542 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 469 transitions. Word has length 139 [2022-11-25 17:44:16,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:44:16,542 INFO L495 AbstractCegarLoop]: Abstraction has 355 states and 469 transitions. [2022-11-25 17:44:16,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.25) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (25), 5 states have call predecessors, (25), 3 states have return successors, (22), 3 states have call predecessors, (22), 2 states have call successors, (22) [2022-11-25 17:44:16,543 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 469 transitions. [2022-11-25 17:44:16,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-11-25 17:44:16,545 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:44:16,545 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:44:16,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 17:44:16,546 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:44:16,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:44:16,546 INFO L85 PathProgramCache]: Analyzing trace with hash 1333532262, now seen corresponding path program 1 times [2022-11-25 17:44:16,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:44:16,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471159946] [2022-11-25 17:44:16,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:44:16,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:44:16,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:18,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:44:18,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:18,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-25 17:44:18,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:18,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 17:44:18,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:18,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 17:44:18,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:18,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-25 17:44:18,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:18,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:44:18,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:18,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:44:18,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:18,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 17:44:18,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:18,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-25 17:44:18,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:18,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-25 17:44:18,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:18,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:44:18,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:18,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-25 17:44:18,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:18,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-25 17:44:18,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:18,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:44:18,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:18,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-25 17:44:18,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:18,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-25 17:44:18,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:18,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-25 17:44:18,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:18,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-11-25 17:44:18,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:18,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-11-25 17:44:18,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:18,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-11-25 17:44:18,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:18,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-11-25 17:44:18,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:18,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:44:18,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:18,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-11-25 17:44:18,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:18,522 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2022-11-25 17:44:18,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:44:18,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471159946] [2022-11-25 17:44:18,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471159946] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:44:18,523 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:44:18,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-25 17:44:18,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859152038] [2022-11-25 17:44:18,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:44:18,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 17:44:18,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:44:18,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 17:44:18,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-25 17:44:18,526 INFO L87 Difference]: Start difference. First operand 355 states and 469 transitions. Second operand has 8 states, 7 states have (on average 8.714285714285714) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (25), 5 states have call predecessors, (25), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2022-11-25 17:44:22,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:44:22,362 INFO L93 Difference]: Finished difference Result 443 states and 597 transitions. [2022-11-25 17:44:22,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 17:44:22,363 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.714285714285714) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (25), 5 states have call predecessors, (25), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 144 [2022-11-25 17:44:22,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:44:22,366 INFO L225 Difference]: With dead ends: 443 [2022-11-25 17:44:22,366 INFO L226 Difference]: Without dead ends: 441 [2022-11-25 17:44:22,367 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2022-11-25 17:44:22,367 INFO L413 NwaCegarLoop]: 262 mSDtfsCounter, 419 mSDsluCounter, 958 mSDsCounter, 0 mSdLazyCounter, 1397 mSolverCounterSat, 204 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 464 SdHoareTripleChecker+Valid, 1220 SdHoareTripleChecker+Invalid, 1601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 204 IncrementalHoareTripleChecker+Valid, 1397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-11-25 17:44:22,368 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [464 Valid, 1220 Invalid, 1601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [204 Valid, 1397 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2022-11-25 17:44:22,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2022-11-25 17:44:22,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 359. [2022-11-25 17:44:22,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 236 states have (on average 1.228813559322034) internal successors, (290), 240 states have internal predecessors, (290), 87 states have call successors, (87), 32 states have call predecessors, (87), 35 states have return successors, (95), 86 states have call predecessors, (95), 85 states have call successors, (95) [2022-11-25 17:44:22,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 472 transitions. [2022-11-25 17:44:22,416 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 472 transitions. Word has length 144 [2022-11-25 17:44:22,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:44:22,417 INFO L495 AbstractCegarLoop]: Abstraction has 359 states and 472 transitions. [2022-11-25 17:44:22,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.714285714285714) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (25), 5 states have call predecessors, (25), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2022-11-25 17:44:22,418 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 472 transitions. [2022-11-25 17:44:22,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-11-25 17:44:22,420 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:44:22,420 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:44:22,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 17:44:22,421 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:44:22,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:44:22,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1152708077, now seen corresponding path program 1 times [2022-11-25 17:44:22,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:44:22,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102093805] [2022-11-25 17:44:22,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:44:22,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:44:22,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:23,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:44:23,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:23,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-25 17:44:23,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:23,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 17:44:23,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:23,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 17:44:23,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:23,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-25 17:44:23,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:23,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:44:23,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:23,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:44:23,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:23,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 17:44:23,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:23,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-25 17:44:23,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:23,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-25 17:44:23,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:23,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:44:23,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:23,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-25 17:44:23,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:23,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-25 17:44:23,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:23,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:44:23,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:23,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-25 17:44:23,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:23,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-25 17:44:23,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:23,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-25 17:44:23,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:23,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-11-25 17:44:23,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:23,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-11-25 17:44:23,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:23,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-11-25 17:44:23,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:23,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-11-25 17:44:23,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:23,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:44:23,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:23,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-11-25 17:44:23,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:23,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-11-25 17:44:23,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:23,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-11-25 17:44:23,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:23,847 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2022-11-25 17:44:23,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:44:23,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102093805] [2022-11-25 17:44:23,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102093805] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:44:23,848 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:44:23,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-25 17:44:23,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683079392] [2022-11-25 17:44:23,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:44:23,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 17:44:23,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:44:23,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 17:44:23,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-25 17:44:23,852 INFO L87 Difference]: Start difference. First operand 359 states and 472 transitions. Second operand has 8 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (27), 5 states have call predecessors, (27), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2022-11-25 17:44:26,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:44:26,796 INFO L93 Difference]: Finished difference Result 449 states and 603 transitions. [2022-11-25 17:44:26,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 17:44:26,797 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (27), 5 states have call predecessors, (27), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 157 [2022-11-25 17:44:26,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:44:26,801 INFO L225 Difference]: With dead ends: 449 [2022-11-25 17:44:26,801 INFO L226 Difference]: Without dead ends: 447 [2022-11-25 17:44:26,802 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2022-11-25 17:44:26,803 INFO L413 NwaCegarLoop]: 258 mSDtfsCounter, 528 mSDsluCounter, 898 mSDsCounter, 0 mSdLazyCounter, 1312 mSolverCounterSat, 324 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 576 SdHoareTripleChecker+Valid, 1156 SdHoareTripleChecker+Invalid, 1636 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 324 IncrementalHoareTripleChecker+Valid, 1312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-11-25 17:44:26,803 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [576 Valid, 1156 Invalid, 1636 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [324 Valid, 1312 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-11-25 17:44:26,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2022-11-25 17:44:26,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 364. [2022-11-25 17:44:26,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 239 states have (on average 1.2259414225941423) internal successors, (293), 244 states have internal predecessors, (293), 88 states have call successors, (88), 33 states have call predecessors, (88), 36 states have return successors, (96), 86 states have call predecessors, (96), 86 states have call successors, (96) [2022-11-25 17:44:26,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 477 transitions. [2022-11-25 17:44:26,836 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 477 transitions. Word has length 157 [2022-11-25 17:44:26,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:44:26,837 INFO L495 AbstractCegarLoop]: Abstraction has 364 states and 477 transitions. [2022-11-25 17:44:26,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (27), 5 states have call predecessors, (27), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2022-11-25 17:44:26,838 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 477 transitions. [2022-11-25 17:44:26,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-11-25 17:44:26,840 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:44:26,840 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:44:26,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 17:44:26,841 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:44:26,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:44:26,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1154555119, now seen corresponding path program 1 times [2022-11-25 17:44:26,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:44:26,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826000291] [2022-11-25 17:44:26,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:44:26,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:44:27,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:27,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:44:27,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:27,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-25 17:44:27,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:27,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 17:44:27,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:27,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 17:44:27,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:27,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-25 17:44:27,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:27,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:44:27,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:27,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:44:27,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:27,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 17:44:27,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:27,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-25 17:44:27,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:27,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-25 17:44:28,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:28,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:44:28,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:28,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-25 17:44:28,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:28,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-25 17:44:28,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:28,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:44:28,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:28,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-25 17:44:28,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:28,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-25 17:44:28,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:28,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-25 17:44:28,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:28,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-11-25 17:44:28,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:28,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-11-25 17:44:28,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:28,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-11-25 17:44:28,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:28,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-11-25 17:44:28,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:28,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:44:28,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:28,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-11-25 17:44:28,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:28,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-11-25 17:44:28,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:28,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-11-25 17:44:28,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:28,196 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2022-11-25 17:44:28,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:44:28,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826000291] [2022-11-25 17:44:28,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826000291] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:44:28,197 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:44:28,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-25 17:44:28,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293120025] [2022-11-25 17:44:28,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:44:28,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 17:44:28,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:44:28,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 17:44:28,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-25 17:44:28,200 INFO L87 Difference]: Start difference. First operand 364 states and 477 transitions. Second operand has 8 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (27), 5 states have call predecessors, (27), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2022-11-25 17:44:31,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:44:31,309 INFO L93 Difference]: Finished difference Result 452 states and 605 transitions. [2022-11-25 17:44:31,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 17:44:31,310 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (27), 5 states have call predecessors, (27), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 157 [2022-11-25 17:44:31,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:44:31,313 INFO L225 Difference]: With dead ends: 452 [2022-11-25 17:44:31,314 INFO L226 Difference]: Without dead ends: 450 [2022-11-25 17:44:31,314 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2022-11-25 17:44:31,315 INFO L413 NwaCegarLoop]: 258 mSDtfsCounter, 405 mSDsluCounter, 898 mSDsCounter, 0 mSdLazyCounter, 1308 mSolverCounterSat, 204 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 452 SdHoareTripleChecker+Valid, 1156 SdHoareTripleChecker+Invalid, 1512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 204 IncrementalHoareTripleChecker+Valid, 1308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-11-25 17:44:31,315 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [452 Valid, 1156 Invalid, 1512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [204 Valid, 1308 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-11-25 17:44:31,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2022-11-25 17:44:31,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 363. [2022-11-25 17:44:31,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 239 states have (on average 1.2259414225941423) internal successors, (293), 243 states have internal predecessors, (293), 87 states have call successors, (87), 33 states have call predecessors, (87), 36 states have return successors, (95), 86 states have call predecessors, (95), 85 states have call successors, (95) [2022-11-25 17:44:31,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 475 transitions. [2022-11-25 17:44:31,346 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 475 transitions. Word has length 157 [2022-11-25 17:44:31,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:44:31,347 INFO L495 AbstractCegarLoop]: Abstraction has 363 states and 475 transitions. [2022-11-25 17:44:31,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (27), 5 states have call predecessors, (27), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2022-11-25 17:44:31,347 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 475 transitions. [2022-11-25 17:44:31,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2022-11-25 17:44:31,350 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:44:31,350 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:44:31,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 17:44:31,351 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:44:31,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:44:31,351 INFO L85 PathProgramCache]: Analyzing trace with hash -3860359, now seen corresponding path program 1 times [2022-11-25 17:44:31,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:44:31,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765965794] [2022-11-25 17:44:31,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:44:31,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:44:31,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:32,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:44:32,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:32,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-25 17:44:32,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:32,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 17:44:32,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:32,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 17:44:32,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:32,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-25 17:44:32,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:32,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:44:32,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:32,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:44:32,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:33,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 17:44:33,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:33,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-25 17:44:33,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:33,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-25 17:44:33,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:33,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:44:33,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:33,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-25 17:44:33,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:33,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-25 17:44:33,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:33,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:44:33,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:33,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-25 17:44:33,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:33,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-25 17:44:33,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:33,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-25 17:44:33,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:33,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-11-25 17:44:33,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:33,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-11-25 17:44:33,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:33,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-11-25 17:44:33,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:33,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-11-25 17:44:33,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:33,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:44:33,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:33,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:44:33,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:33,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-25 17:44:33,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:33,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-11-25 17:44:33,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:33,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-11-25 17:44:33,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:33,388 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2022-11-25 17:44:33,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:44:33,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765965794] [2022-11-25 17:44:33,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765965794] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:44:33,389 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:44:33,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-25 17:44:33,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973703055] [2022-11-25 17:44:33,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:44:33,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-25 17:44:33,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:44:33,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-25 17:44:33,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2022-11-25 17:44:33,392 INFO L87 Difference]: Start difference. First operand 363 states and 475 transitions. Second operand has 14 states, 14 states have (on average 5.357142857142857) internal successors, (75), 8 states have internal predecessors, (75), 6 states have call successors, (31), 8 states have call predecessors, (31), 2 states have return successors, (25), 4 states have call predecessors, (25), 3 states have call successors, (25) [2022-11-25 17:44:38,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:44:38,448 INFO L93 Difference]: Finished difference Result 843 states and 1149 transitions. [2022-11-25 17:44:38,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-25 17:44:38,449 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.357142857142857) internal successors, (75), 8 states have internal predecessors, (75), 6 states have call successors, (31), 8 states have call predecessors, (31), 2 states have return successors, (25), 4 states have call predecessors, (25), 3 states have call successors, (25) Word has length 172 [2022-11-25 17:44:38,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:44:38,453 INFO L225 Difference]: With dead ends: 843 [2022-11-25 17:44:38,454 INFO L226 Difference]: Without dead ends: 554 [2022-11-25 17:44:38,455 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=116, Invalid=534, Unknown=0, NotChecked=0, Total=650 [2022-11-25 17:44:38,456 INFO L413 NwaCegarLoop]: 294 mSDtfsCounter, 628 mSDsluCounter, 2596 mSDsCounter, 0 mSdLazyCounter, 3411 mSolverCounterSat, 268 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 680 SdHoareTripleChecker+Valid, 2890 SdHoareTripleChecker+Invalid, 3679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 268 IncrementalHoareTripleChecker+Valid, 3411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-11-25 17:44:38,457 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [680 Valid, 2890 Invalid, 3679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [268 Valid, 3411 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2022-11-25 17:44:38,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2022-11-25 17:44:38,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 407. [2022-11-25 17:44:38,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 271 states have (on average 1.2435424354243543) internal successors, (337), 276 states have internal predecessors, (337), 95 states have call successors, (95), 36 states have call predecessors, (95), 40 states have return successors, (106), 94 states have call predecessors, (106), 93 states have call successors, (106) [2022-11-25 17:44:38,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 538 transitions. [2022-11-25 17:44:38,490 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 538 transitions. Word has length 172 [2022-11-25 17:44:38,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:44:38,490 INFO L495 AbstractCegarLoop]: Abstraction has 407 states and 538 transitions. [2022-11-25 17:44:38,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.357142857142857) internal successors, (75), 8 states have internal predecessors, (75), 6 states have call successors, (31), 8 states have call predecessors, (31), 2 states have return successors, (25), 4 states have call predecessors, (25), 3 states have call successors, (25) [2022-11-25 17:44:38,491 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 538 transitions. [2022-11-25 17:44:38,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-11-25 17:44:38,493 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:44:38,494 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:44:38,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-25 17:44:38,494 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:44:38,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:44:38,495 INFO L85 PathProgramCache]: Analyzing trace with hash -1792726195, now seen corresponding path program 1 times [2022-11-25 17:44:38,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:44:38,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37581406] [2022-11-25 17:44:38,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:44:38,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:44:38,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:39,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:44:39,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:39,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-25 17:44:39,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:39,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 17:44:39,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:39,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 17:44:39,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:39,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-25 17:44:39,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:39,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:44:39,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:39,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:44:39,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:39,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 17:44:39,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:39,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-25 17:44:39,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:39,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-25 17:44:39,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:39,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:44:39,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:39,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-25 17:44:39,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:39,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-25 17:44:39,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:39,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:44:39,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:39,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-25 17:44:39,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:39,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-25 17:44:39,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:39,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-25 17:44:39,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:39,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-11-25 17:44:39,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:39,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-11-25 17:44:39,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:39,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-11-25 17:44:39,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:39,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-11-25 17:44:39,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:39,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:44:39,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:39,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:44:39,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:39,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:44:39,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:39,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-25 17:44:39,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:39,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-25 17:44:39,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:39,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-11-25 17:44:39,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:39,595 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2022-11-25 17:44:39,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:44:39,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37581406] [2022-11-25 17:44:39,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37581406] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:44:39,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:44:39,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-25 17:44:39,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732837440] [2022-11-25 17:44:39,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:44:39,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 17:44:39,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:44:39,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 17:44:39,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-11-25 17:44:39,599 INFO L87 Difference]: Start difference. First operand 407 states and 538 transitions. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 5 states have internal predecessors, (76), 3 states have call successors, (27), 6 states have call predecessors, (27), 3 states have return successors, (26), 2 states have call predecessors, (26), 3 states have call successors, (26) [2022-11-25 17:44:46,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:44:46,306 INFO L93 Difference]: Finished difference Result 758 states and 1015 transitions. [2022-11-25 17:44:46,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-25 17:44:46,307 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 5 states have internal predecessors, (76), 3 states have call successors, (27), 6 states have call predecessors, (27), 3 states have return successors, (26), 2 states have call predecessors, (26), 3 states have call successors, (26) Word has length 170 [2022-11-25 17:44:46,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:44:46,310 INFO L225 Difference]: With dead ends: 758 [2022-11-25 17:44:46,310 INFO L226 Difference]: Without dead ends: 511 [2022-11-25 17:44:46,311 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2022-11-25 17:44:46,312 INFO L413 NwaCegarLoop]: 279 mSDtfsCounter, 536 mSDsluCounter, 1038 mSDsCounter, 0 mSdLazyCounter, 1559 mSolverCounterSat, 241 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 594 SdHoareTripleChecker+Valid, 1317 SdHoareTripleChecker+Invalid, 1800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 241 IncrementalHoareTripleChecker+Valid, 1559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2022-11-25 17:44:46,312 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [594 Valid, 1317 Invalid, 1800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [241 Valid, 1559 Invalid, 0 Unknown, 0 Unchecked, 6.5s Time] [2022-11-25 17:44:46,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2022-11-25 17:44:46,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 407. [2022-11-25 17:44:46,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 271 states have (on average 1.2287822878228782) internal successors, (333), 276 states have internal predecessors, (333), 95 states have call successors, (95), 36 states have call predecessors, (95), 40 states have return successors, (106), 94 states have call predecessors, (106), 93 states have call successors, (106) [2022-11-25 17:44:46,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 534 transitions. [2022-11-25 17:44:46,345 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 534 transitions. Word has length 170 [2022-11-25 17:44:46,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:44:46,345 INFO L495 AbstractCegarLoop]: Abstraction has 407 states and 534 transitions. [2022-11-25 17:44:46,346 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 5 states have internal predecessors, (76), 3 states have call successors, (27), 6 states have call predecessors, (27), 3 states have return successors, (26), 2 states have call predecessors, (26), 3 states have call successors, (26) [2022-11-25 17:44:46,346 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 534 transitions. [2022-11-25 17:44:46,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-11-25 17:44:46,348 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:44:46,349 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:44:46,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-25 17:44:46,349 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:44:46,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:44:46,350 INFO L85 PathProgramCache]: Analyzing trace with hash 12712139, now seen corresponding path program 1 times [2022-11-25 17:44:46,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:44:46,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790505375] [2022-11-25 17:44:46,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:44:46,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:44:46,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:47,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:44:47,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:47,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-25 17:44:47,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:47,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 17:44:47,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:47,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 17:44:47,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:47,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-25 17:44:47,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:47,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:44:47,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:47,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:44:47,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:47,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 17:44:47,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:47,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-25 17:44:47,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:47,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-25 17:44:47,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:47,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:44:47,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:47,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-25 17:44:47,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:47,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-25 17:44:47,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:47,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:44:47,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:47,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-25 17:44:47,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:47,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-25 17:44:47,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:47,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-25 17:44:47,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:47,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-11-25 17:44:47,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:47,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-11-25 17:44:47,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:47,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-11-25 17:44:47,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:47,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-11-25 17:44:47,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:47,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:44:47,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:47,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:44:47,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:47,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:44:47,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:47,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-25 17:44:47,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:47,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-25 17:44:47,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:47,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-11-25 17:44:47,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:47,547 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2022-11-25 17:44:47,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:44:47,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790505375] [2022-11-25 17:44:47,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790505375] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:44:47,548 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:44:47,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-25 17:44:47,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362359290] [2022-11-25 17:44:47,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:44:47,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 17:44:47,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:44:47,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 17:44:47,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-11-25 17:44:47,552 INFO L87 Difference]: Start difference. First operand 407 states and 534 transitions. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (27), 6 states have call predecessors, (27), 3 states have return successors, (26), 3 states have call predecessors, (26), 2 states have call successors, (26) [2022-11-25 17:44:54,795 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 17:44:55,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:44:55,190 INFO L93 Difference]: Finished difference Result 647 states and 887 transitions. [2022-11-25 17:44:55,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-25 17:44:55,191 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (27), 6 states have call predecessors, (27), 3 states have return successors, (26), 3 states have call predecessors, (26), 2 states have call successors, (26) Word has length 170 [2022-11-25 17:44:55,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:44:55,196 INFO L225 Difference]: With dead ends: 647 [2022-11-25 17:44:55,196 INFO L226 Difference]: Without dead ends: 576 [2022-11-25 17:44:55,197 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2022-11-25 17:44:55,198 INFO L413 NwaCegarLoop]: 317 mSDtfsCounter, 741 mSDsluCounter, 1202 mSDsCounter, 0 mSdLazyCounter, 1673 mSolverCounterSat, 500 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 804 SdHoareTripleChecker+Valid, 1519 SdHoareTripleChecker+Invalid, 2173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 500 IncrementalHoareTripleChecker+Valid, 1673 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2022-11-25 17:44:55,198 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [804 Valid, 1519 Invalid, 2173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [500 Valid, 1673 Invalid, 0 Unknown, 0 Unchecked, 7.4s Time] [2022-11-25 17:44:55,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2022-11-25 17:44:55,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 413. [2022-11-25 17:44:55,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 275 states have (on average 1.2254545454545454) internal successors, (337), 281 states have internal predecessors, (337), 95 states have call successors, (95), 36 states have call predecessors, (95), 42 states have return successors, (108), 95 states have call predecessors, (108), 93 states have call successors, (108) [2022-11-25 17:44:55,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 540 transitions. [2022-11-25 17:44:55,246 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 540 transitions. Word has length 170 [2022-11-25 17:44:55,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:44:55,247 INFO L495 AbstractCegarLoop]: Abstraction has 413 states and 540 transitions. [2022-11-25 17:44:55,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (27), 6 states have call predecessors, (27), 3 states have return successors, (26), 3 states have call predecessors, (26), 2 states have call successors, (26) [2022-11-25 17:44:55,247 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 540 transitions. [2022-11-25 17:44:55,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2022-11-25 17:44:55,251 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:44:55,251 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:44:55,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-25 17:44:55,251 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:44:55,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:44:55,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1506166486, now seen corresponding path program 1 times [2022-11-25 17:44:55,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:44:55,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945653743] [2022-11-25 17:44:55,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:44:55,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:44:55,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:56,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:44:56,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:56,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-25 17:44:56,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:56,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 17:44:56,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:56,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 17:44:56,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:56,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-25 17:44:56,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:56,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:44:56,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:56,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:44:56,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:56,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 17:44:56,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:56,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-25 17:44:56,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:56,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-25 17:44:56,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:56,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:44:56,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:56,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-25 17:44:56,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:56,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-25 17:44:56,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:56,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:44:56,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:56,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-25 17:44:56,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:56,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-25 17:44:56,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:56,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-25 17:44:56,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:56,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-11-25 17:44:56,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:56,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-11-25 17:44:56,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:56,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-11-25 17:44:56,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:56,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-11-25 17:44:56,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:57,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:44:57,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:57,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:44:57,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:57,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-25 17:44:57,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:57,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-11-25 17:44:57,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:57,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-11-25 17:44:57,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:57,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-11-25 17:44:57,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:57,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-11-25 17:44:57,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:57,691 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2022-11-25 17:44:57,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:44:57,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945653743] [2022-11-25 17:44:57,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945653743] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:44:57,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [92250764] [2022-11-25 17:44:57,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:44:57,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:44:57,693 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb76e2f-1ba5-4fda-92f9-12f4945b22ff/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:44:57,694 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb76e2f-1ba5-4fda-92f9-12f4945b22ff/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:44:57,714 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb76e2f-1ba5-4fda-92f9-12f4945b22ff/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-25 17:44:58,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:44:58,591 INFO L263 TraceCheckSpWp]: Trace formula consists of 2769 conjuncts, 49 conjunts are in the unsatisfiable core [2022-11-25 17:44:58,598 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:44:58,632 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 3 [2022-11-25 17:44:58,635 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 3 [2022-11-25 17:44:58,860 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 56 proven. 2 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2022-11-25 17:44:58,860 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:44:59,558 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 201 trivial. 0 not checked. [2022-11-25 17:44:59,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [92250764] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:44:59,558 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:44:59,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 13] total 19 [2022-11-25 17:44:59,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187119107] [2022-11-25 17:44:59,562 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:44:59,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-25 17:44:59,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:44:59,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-25 17:44:59,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2022-11-25 17:44:59,565 INFO L87 Difference]: Start difference. First operand 413 states and 540 transitions. Second operand has 19 states, 16 states have (on average 6.3125) internal successors, (101), 14 states have internal predecessors, (101), 10 states have call successors, (42), 7 states have call predecessors, (42), 5 states have return successors, (33), 6 states have call predecessors, (33), 8 states have call successors, (33) [2022-11-25 17:45:05,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:45:05,274 INFO L93 Difference]: Finished difference Result 847 states and 1135 transitions. [2022-11-25 17:45:05,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-25 17:45:05,275 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 6.3125) internal successors, (101), 14 states have internal predecessors, (101), 10 states have call successors, (42), 7 states have call predecessors, (42), 5 states have return successors, (33), 6 states have call predecessors, (33), 8 states have call successors, (33) Word has length 176 [2022-11-25 17:45:05,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:45:05,278 INFO L225 Difference]: With dead ends: 847 [2022-11-25 17:45:05,278 INFO L226 Difference]: Without dead ends: 527 [2022-11-25 17:45:05,280 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 432 GetRequests, 397 SyntacticMatches, 4 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=151, Invalid=905, Unknown=0, NotChecked=0, Total=1056 [2022-11-25 17:45:05,280 INFO L413 NwaCegarLoop]: 256 mSDtfsCounter, 662 mSDsluCounter, 2606 mSDsCounter, 0 mSdLazyCounter, 3773 mSolverCounterSat, 428 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 712 SdHoareTripleChecker+Valid, 2862 SdHoareTripleChecker+Invalid, 4201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 428 IncrementalHoareTripleChecker+Valid, 3773 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2022-11-25 17:45:05,281 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [712 Valid, 2862 Invalid, 4201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [428 Valid, 3773 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2022-11-25 17:45:05,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2022-11-25 17:45:05,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 431. [2022-11-25 17:45:05,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 284 states have (on average 1.2183098591549295) internal successors, (346), 289 states have internal predecessors, (346), 103 states have call successors, (103), 38 states have call predecessors, (103), 43 states have return successors, (114), 103 states have call predecessors, (114), 101 states have call successors, (114) [2022-11-25 17:45:05,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 563 transitions. [2022-11-25 17:45:05,317 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 563 transitions. Word has length 176 [2022-11-25 17:45:05,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:45:05,318 INFO L495 AbstractCegarLoop]: Abstraction has 431 states and 563 transitions. [2022-11-25 17:45:05,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 6.3125) internal successors, (101), 14 states have internal predecessors, (101), 10 states have call successors, (42), 7 states have call predecessors, (42), 5 states have return successors, (33), 6 states have call predecessors, (33), 8 states have call successors, (33) [2022-11-25 17:45:05,318 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 563 transitions. [2022-11-25 17:45:05,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2022-11-25 17:45:05,321 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:45:05,321 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:45:05,333 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb76e2f-1ba5-4fda-92f9-12f4945b22ff/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-11-25 17:45:05,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb76e2f-1ba5-4fda-92f9-12f4945b22ff/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-25 17:45:05,533 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:45:05,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:45:05,534 INFO L85 PathProgramCache]: Analyzing trace with hash -204776121, now seen corresponding path program 1 times [2022-11-25 17:45:05,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:45:05,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152850818] [2022-11-25 17:45:05,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:45:05,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:45:05,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:45:07,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:45:07,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:45:07,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-25 17:45:07,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:45:07,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 17:45:07,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:45:07,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 17:45:07,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:45:07,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-25 17:45:07,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:45:07,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:45:07,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:45:07,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:45:07,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:45:07,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 17:45:07,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:45:07,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-25 17:45:07,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:45:07,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-25 17:45:07,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:45:07,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:45:07,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:45:07,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-25 17:45:07,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:45:07,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-25 17:45:07,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:45:07,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:45:07,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:45:07,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-25 17:45:07,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:45:07,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-25 17:45:07,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:45:07,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-25 17:45:07,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:45:07,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-11-25 17:45:07,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:45:07,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-11-25 17:45:07,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:45:07,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-11-25 17:45:07,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:45:07,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-11-25 17:45:07,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:45:07,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:45:07,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:45:07,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:45:07,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:45:07,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-25 17:45:07,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:45:07,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-11-25 17:45:07,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:45:07,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-11-25 17:45:07,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:45:07,724 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2022-11-25 17:45:07,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:45:07,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152850818] [2022-11-25 17:45:07,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152850818] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:45:07,725 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:45:07,725 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-11-25 17:45:07,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790201232] [2022-11-25 17:45:07,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:45:07,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-25 17:45:07,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:45:07,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-25 17:45:07,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2022-11-25 17:45:07,728 INFO L87 Difference]: Start difference. First operand 431 states and 563 transitions. Second operand has 15 states, 15 states have (on average 5.266666666666667) internal successors, (79), 9 states have internal predecessors, (79), 6 states have call successors, (31), 8 states have call predecessors, (31), 2 states have return successors, (25), 4 states have call predecessors, (25), 3 states have call successors, (25) [2022-11-25 17:45:13,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:45:13,619 INFO L93 Difference]: Finished difference Result 891 states and 1209 transitions. [2022-11-25 17:45:13,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-25 17:45:13,619 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.266666666666667) internal successors, (79), 9 states have internal predecessors, (79), 6 states have call successors, (31), 8 states have call predecessors, (31), 2 states have return successors, (25), 4 states have call predecessors, (25), 3 states have call successors, (25) Word has length 176 [2022-11-25 17:45:13,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:45:13,624 INFO L225 Difference]: With dead ends: 891 [2022-11-25 17:45:13,625 INFO L226 Difference]: Without dead ends: 599 [2022-11-25 17:45:13,626 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=140, Invalid=672, Unknown=0, NotChecked=0, Total=812 [2022-11-25 17:45:13,628 INFO L413 NwaCegarLoop]: 315 mSDtfsCounter, 480 mSDsluCounter, 3108 mSDsCounter, 0 mSdLazyCounter, 3785 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 532 SdHoareTripleChecker+Valid, 3423 SdHoareTripleChecker+Invalid, 3925 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 3785 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2022-11-25 17:45:13,628 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [532 Valid, 3423 Invalid, 3925 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 3785 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2022-11-25 17:45:13,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2022-11-25 17:45:13,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 452. [2022-11-25 17:45:13,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 295 states have (on average 1.2135593220338983) internal successors, (358), 300 states have internal predecessors, (358), 111 states have call successors, (111), 40 states have call predecessors, (111), 45 states have return successors, (124), 111 states have call predecessors, (124), 109 states have call successors, (124) [2022-11-25 17:45:13,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 593 transitions. [2022-11-25 17:45:13,669 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 593 transitions. Word has length 176 [2022-11-25 17:45:13,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:45:13,670 INFO L495 AbstractCegarLoop]: Abstraction has 452 states and 593 transitions. [2022-11-25 17:45:13,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.266666666666667) internal successors, (79), 9 states have internal predecessors, (79), 6 states have call successors, (31), 8 states have call predecessors, (31), 2 states have return successors, (25), 4 states have call predecessors, (25), 3 states have call successors, (25) [2022-11-25 17:45:13,671 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 593 transitions. [2022-11-25 17:45:13,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2022-11-25 17:45:13,673 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:45:13,673 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:45:13,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-25 17:45:13,674 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:45:13,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:45:13,674 INFO L85 PathProgramCache]: Analyzing trace with hash -200637153, now seen corresponding path program 1 times [2022-11-25 17:45:13,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:45:13,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058396553] [2022-11-25 17:45:13,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:45:13,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:45:13,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:45:13,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:45:13,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:45:13,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-25 17:45:13,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:45:13,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 17:45:13,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:45:13,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 17:45:13,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:45:13,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-25 17:45:13,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:45:13,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:45:13,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:45:13,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:45:13,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:45:13,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 17:45:13,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:45:13,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-25 17:45:13,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:45:14,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-25 17:45:14,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:45:14,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:45:14,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:45:14,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-25 17:45:14,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:45:14,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-25 17:45:14,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:45:14,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:45:14,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:45:14,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-25 17:45:14,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:45:14,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-25 17:45:14,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:45:14,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-25 17:45:14,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:45:14,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-11-25 17:45:14,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:45:14,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-11-25 17:45:14,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:45:14,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-11-25 17:45:14,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:45:14,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-11-25 17:45:14,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:45:14,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:45:14,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:45:14,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:45:14,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:45:14,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:45:14,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:45:14,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-25 17:45:14,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:45:14,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-25 17:45:14,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:45:14,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-11-25 17:45:14,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:45:14,276 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2022-11-25 17:45:14,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:45:14,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058396553] [2022-11-25 17:45:14,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058396553] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:45:14,277 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:45:14,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-25 17:45:14,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940779321] [2022-11-25 17:45:14,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:45:14,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 17:45:14,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:45:14,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 17:45:14,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-25 17:45:14,280 INFO L87 Difference]: Start difference. First operand 452 states and 593 transitions. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (27), 6 states have call predecessors, (27), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2022-11-25 17:45:18,978 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 17:45:20,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:45:20,568 INFO L93 Difference]: Finished difference Result 805 states and 1074 transitions. [2022-11-25 17:45:20,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 17:45:20,569 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (27), 6 states have call predecessors, (27), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 172 [2022-11-25 17:45:20,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:45:20,572 INFO L225 Difference]: With dead ends: 805 [2022-11-25 17:45:20,572 INFO L226 Difference]: Without dead ends: 558 [2022-11-25 17:45:20,573 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-11-25 17:45:20,574 INFO L413 NwaCegarLoop]: 282 mSDtfsCounter, 452 mSDsluCounter, 600 mSDsCounter, 0 mSdLazyCounter, 955 mSolverCounterSat, 222 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 505 SdHoareTripleChecker+Valid, 882 SdHoareTripleChecker+Invalid, 1177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 222 IncrementalHoareTripleChecker+Valid, 955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2022-11-25 17:45:20,574 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [505 Valid, 882 Invalid, 1177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [222 Valid, 955 Invalid, 0 Unknown, 0 Unchecked, 6.1s Time] [2022-11-25 17:45:20,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2022-11-25 17:45:20,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 454. [2022-11-25 17:45:20,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 454 states, 297 states have (on average 1.2121212121212122) internal successors, (360), 302 states have internal predecessors, (360), 111 states have call successors, (111), 40 states have call predecessors, (111), 45 states have return successors, (124), 111 states have call predecessors, (124), 109 states have call successors, (124) [2022-11-25 17:45:20,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 595 transitions. [2022-11-25 17:45:20,621 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 595 transitions. Word has length 172 [2022-11-25 17:45:20,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:45:20,622 INFO L495 AbstractCegarLoop]: Abstraction has 454 states and 595 transitions. [2022-11-25 17:45:20,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (27), 6 states have call predecessors, (27), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2022-11-25 17:45:20,622 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 595 transitions. [2022-11-25 17:45:20,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2022-11-25 17:45:20,625 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:45:20,626 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 4, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:45:20,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-25 17:45:20,626 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:45:20,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:45:20,627 INFO L85 PathProgramCache]: Analyzing trace with hash 155220128, now seen corresponding path program 1 times [2022-11-25 17:45:20,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:45:20,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658038102] [2022-11-25 17:45:20,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:45:20,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:45:21,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:45:22,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:45:22,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:45:22,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-25 17:45:22,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:45:22,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 17:45:22,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:45:22,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 17:45:22,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:45:22,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-25 17:45:22,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:45:22,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:45:22,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:45:22,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:45:22,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:45:22,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 17:45:22,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:45:22,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-25 17:45:22,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:45:22,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-25 17:45:22,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:45:22,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:45:22,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:45:22,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-25 17:45:22,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:45:22,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-25 17:45:22,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:45:22,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:45:22,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:45:22,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-25 17:45:22,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:45:22,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-25 17:45:22,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:45:22,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-25 17:45:22,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:45:22,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-11-25 17:45:22,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:45:22,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-11-25 17:45:22,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:45:22,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-11-25 17:45:22,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:45:22,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-11-25 17:45:22,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:45:22,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:45:22,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:45:22,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:45:22,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:45:22,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-25 17:45:22,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:45:22,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-11-25 17:45:22,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:45:22,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:45:22,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:45:22,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-11-25 17:45:22,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:45:22,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-11-25 17:45:22,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:45:22,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-11-25 17:45:23,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:45:23,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:45:23,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:45:23,024 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2022-11-25 17:45:23,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:45:23,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658038102] [2022-11-25 17:45:23,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658038102] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:45:23,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1724846810] [2022-11-25 17:45:23,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:45:23,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:45:23,026 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb76e2f-1ba5-4fda-92f9-12f4945b22ff/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:45:23,045 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb76e2f-1ba5-4fda-92f9-12f4945b22ff/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:45:23,046 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb76e2f-1ba5-4fda-92f9-12f4945b22ff/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-25 17:45:23,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:45:23,933 INFO L263 TraceCheckSpWp]: Trace formula consists of 2829 conjuncts, 67 conjunts are in the unsatisfiable core [2022-11-25 17:45:23,942 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:45:24,147 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-11-25 17:45:24,147 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:45:24,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1724846810] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:45:24,147 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 17:45:24,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 12 [2022-11-25 17:45:24,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228698115] [2022-11-25 17:45:24,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:45:24,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 17:45:24,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:45:24,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 17:45:24,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-11-25 17:45:24,150 INFO L87 Difference]: Start difference. First operand 454 states and 595 transitions. Second operand has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 4 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (27), 4 states have call predecessors, (27), 4 states have call successors, (27) [2022-11-25 17:45:24,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:45:24,589 INFO L93 Difference]: Finished difference Result 901 states and 1179 transitions. [2022-11-25 17:45:24,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 17:45:24,590 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), 4 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (27), 4 states have call predecessors, (27), 4 states have call successors, (27) Word has length 186 [2022-11-25 17:45:24,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:45:24,593 INFO L225 Difference]: With dead ends: 901 [2022-11-25 17:45:24,593 INFO L226 Difference]: Without dead ends: 456 [2022-11-25 17:45:24,595 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-11-25 17:45:24,596 INFO L413 NwaCegarLoop]: 414 mSDtfsCounter, 25 mSDsluCounter, 1958 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 2372 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 17:45:24,596 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 2372 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 17:45:24,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2022-11-25 17:45:24,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 456. [2022-11-25 17:45:24,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 456 states, 298 states have (on average 1.2114093959731544) internal successors, (361), 304 states have internal predecessors, (361), 111 states have call successors, (111), 40 states have call predecessors, (111), 46 states have return successors, (125), 111 states have call predecessors, (125), 109 states have call successors, (125) [2022-11-25 17:45:24,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 597 transitions. [2022-11-25 17:45:24,640 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 597 transitions. Word has length 186 [2022-11-25 17:45:24,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:45:24,641 INFO L495 AbstractCegarLoop]: Abstraction has 456 states and 597 transitions. [2022-11-25 17:45:24,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 4 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (27), 4 states have call predecessors, (27), 4 states have call successors, (27) [2022-11-25 17:45:24,642 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 597 transitions. [2022-11-25 17:45:24,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2022-11-25 17:45:24,644 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:45:24,644 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 4, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:45:24,662 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb76e2f-1ba5-4fda-92f9-12f4945b22ff/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-25 17:45:24,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb76e2f-1ba5-4fda-92f9-12f4945b22ff/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-25 17:45:24,857 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:45:24,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:45:24,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1848729671, now seen corresponding path program 1 times [2022-11-25 17:45:24,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:45:24,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5383890] [2022-11-25 17:45:24,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:45:24,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:45:24,956 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 17:45:24,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [858836513] [2022-11-25 17:45:24,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:45:24,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:45:24,957 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb76e2f-1ba5-4fda-92f9-12f4945b22ff/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:45:24,958 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb76e2f-1ba5-4fda-92f9-12f4945b22ff/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:45:24,991 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb76e2f-1ba5-4fda-92f9-12f4945b22ff/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-25 17:53:46,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:53:46,418 INFO L263 TraceCheckSpWp]: Trace formula consists of 2934 conjuncts, 402 conjunts are in the unsatisfiable core [2022-11-25 17:53:46,445 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:53:46,473 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-11-25 17:53:46,964 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-25 17:53:46,965 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-25 17:53:47,030 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-25 17:53:47,251 INFO L350 Elim1Store]: Elim1 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 [2022-11-25 17:53:47,460 INFO L350 Elim1Store]: Elim1 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 17 treesize of output 9 [2022-11-25 17:53:47,724 INFO L350 Elim1Store]: Elim1 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 [2022-11-25 17:53:48,204 INFO L321 Elim1Store]: treesize reduction 112, result has 28.7 percent of original size [2022-11-25 17:53:48,204 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 142 treesize of output 166 [2022-11-25 17:53:50,629 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-25 17:53:51,913 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 17:53:51,929 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 119 proven. 15 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2022-11-25 17:53:51,929 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:53:54,068 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3099 (Array Int Int)) (v_ArrVal_3100 (Array Int Int)) (v_ArrVal_3101 (Array Int Int))) (not (<= 2 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base| v_ArrVal_3101) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base| v_ArrVal_3100) |c_ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base|) |c_ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.offset|)) (+ 40 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base| v_ArrVal_3099) |c_ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base|) |c_ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.offset|))) 18446744073709551616)))) is different from false [2022-11-25 17:53:54,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:53:54,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5383890] [2022-11-25 17:53:54,079 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 17:53:54,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [858836513] [2022-11-25 17:53:54,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [858836513] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:53:54,079 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-11-25 17:53:54,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2022-11-25 17:53:54,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158935678] [2022-11-25 17:53:54,080 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-11-25 17:53:54,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-11-25 17:53:54,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:53:54,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-25 17:53:54,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=2098, Unknown=4, NotChecked=92, Total=2352 [2022-11-25 17:53:54,082 INFO L87 Difference]: Start difference. First operand 456 states and 597 transitions. Second operand has 34 states, 27 states have (on average 3.4444444444444446) internal successors, (93), 25 states have internal predecessors, (93), 11 states have call successors, (32), 6 states have call predecessors, (32), 10 states have return successors, (28), 10 states have call predecessors, (28), 11 states have call successors, (28) [2022-11-25 17:53:56,235 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:53:59,001 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:54:01,223 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:54:31,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:54:31,812 INFO L93 Difference]: Finished difference Result 991 states and 1275 transitions. [2022-11-25 17:54:31,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-25 17:54:31,812 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 27 states have (on average 3.4444444444444446) internal successors, (93), 25 states have internal predecessors, (93), 11 states have call successors, (32), 6 states have call predecessors, (32), 10 states have return successors, (28), 10 states have call predecessors, (28), 11 states have call successors, (28) Word has length 192 [2022-11-25 17:54:31,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:54:31,815 INFO L225 Difference]: With dead ends: 991 [2022-11-25 17:54:31,815 INFO L226 Difference]: Without dead ends: 535 [2022-11-25 17:54:31,818 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 217 SyntacticMatches, 5 SemanticMatches, 76 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1498 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=431, Invalid=5421, Unknown=4, NotChecked=150, Total=6006 [2022-11-25 17:54:31,819 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 480 mSDsluCounter, 2472 mSDsCounter, 0 mSdLazyCounter, 8021 mSolverCounterSat, 357 mSolverCounterUnsat, 16 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 32.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 494 SdHoareTripleChecker+Valid, 2669 SdHoareTripleChecker+Invalid, 8394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 357 IncrementalHoareTripleChecker+Valid, 8021 IncrementalHoareTripleChecker+Invalid, 16 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 33.8s IncrementalHoareTripleChecker+Time [2022-11-25 17:54:31,820 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [494 Valid, 2669 Invalid, 8394 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [357 Valid, 8021 Invalid, 16 Unknown, 0 Unchecked, 33.8s Time] [2022-11-25 17:54:31,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2022-11-25 17:54:31,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 520. [2022-11-25 17:54:31,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 520 states, 340 states have (on average 1.1970588235294117) internal successors, (407), 347 states have internal predecessors, (407), 122 states have call successors, (122), 50 states have call predecessors, (122), 57 states have return successors, (139), 122 states have call predecessors, (139), 120 states have call successors, (139) [2022-11-25 17:54:31,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 668 transitions. [2022-11-25 17:54:31,871 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 668 transitions. Word has length 192 [2022-11-25 17:54:31,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:54:31,871 INFO L495 AbstractCegarLoop]: Abstraction has 520 states and 668 transitions. [2022-11-25 17:54:31,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 27 states have (on average 3.4444444444444446) internal successors, (93), 25 states have internal predecessors, (93), 11 states have call successors, (32), 6 states have call predecessors, (32), 10 states have return successors, (28), 10 states have call predecessors, (28), 11 states have call successors, (28) [2022-11-25 17:54:31,872 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 668 transitions. [2022-11-25 17:54:31,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2022-11-25 17:54:31,874 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:54:31,874 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 4, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:54:31,958 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb76e2f-1ba5-4fda-92f9-12f4945b22ff/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-25 17:54:32,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb76e2f-1ba5-4fda-92f9-12f4945b22ff/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-25 17:54:32,095 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:54:32,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:54:32,095 INFO L85 PathProgramCache]: Analyzing trace with hash -708998723, now seen corresponding path program 1 times [2022-11-25 17:54:32,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:54:32,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323634830] [2022-11-25 17:54:32,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:54:32,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:54:32,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:54:32,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:54:32,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:54:32,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-25 17:54:32,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:54:32,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 17:54:32,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:54:32,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 17:54:32,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:54:32,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-25 17:54:32,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:54:32,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:54:32,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:54:32,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:54:32,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:54:32,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 17:54:32,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:54:32,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-25 17:54:32,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:54:32,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:54:32,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:54:32,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-25 17:54:32,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:54:32,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-25 17:54:32,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:54:32,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:54:32,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:54:32,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-25 17:54:32,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:54:32,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-25 17:54:32,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:54:32,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:54:32,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:54:33,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-11-25 17:54:33,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:54:33,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-11-25 17:54:33,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:54:33,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-25 17:54:33,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:54:33,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-11-25 17:54:33,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:54:33,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-11-25 17:54:33,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:54:33,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-11-25 17:54:33,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:54:33,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-11-25 17:54:33,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:54:33,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:54:33,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:54:33,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:54:33,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:54:33,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-25 17:54:33,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:54:33,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-11-25 17:54:33,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:54:33,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:54:33,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:54:33,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-11-25 17:54:33,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:54:33,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2022-11-25 17:54:33,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:54:33,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2022-11-25 17:54:33,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:54:33,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:54:33,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:54:33,187 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 249 trivial. 0 not checked. [2022-11-25 17:54:33,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:54:33,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323634830] [2022-11-25 17:54:33,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323634830] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:54:33,190 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:54:33,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-25 17:54:33,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011919599] [2022-11-25 17:54:33,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:54:33,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-25 17:54:33,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:54:33,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-25 17:54:33,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-11-25 17:54:33,194 INFO L87 Difference]: Start difference. First operand 520 states and 668 transitions. Second operand has 10 states, 10 states have (on average 8.1) internal successors, (81), 6 states have internal predecessors, (81), 2 states have call successors, (33), 5 states have call predecessors, (33), 4 states have return successors, (29), 4 states have call predecessors, (29), 2 states have call successors, (29) [2022-11-25 17:54:35,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:54:35,847 INFO L93 Difference]: Finished difference Result 1102 states and 1435 transitions. [2022-11-25 17:54:35,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 17:54:35,847 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.1) internal successors, (81), 6 states have internal predecessors, (81), 2 states have call successors, (33), 5 states have call predecessors, (33), 4 states have return successors, (29), 4 states have call predecessors, (29), 2 states have call successors, (29) Word has length 198 [2022-11-25 17:54:35,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:54:35,851 INFO L225 Difference]: With dead ends: 1102 [2022-11-25 17:54:35,851 INFO L226 Difference]: Without dead ends: 591 [2022-11-25 17:54:35,853 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-11-25 17:54:35,854 INFO L413 NwaCegarLoop]: 264 mSDtfsCounter, 395 mSDsluCounter, 1371 mSDsCounter, 0 mSdLazyCounter, 1874 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 1635 SdHoareTripleChecker+Invalid, 2072 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 1874 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-11-25 17:54:35,854 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [443 Valid, 1635 Invalid, 2072 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 1874 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-11-25 17:54:35,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2022-11-25 17:54:35,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 519. [2022-11-25 17:54:35,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 519 states, 340 states have (on average 1.1941176470588235) internal successors, (406), 346 states have internal predecessors, (406), 121 states have call successors, (121), 50 states have call predecessors, (121), 57 states have return successors, (137), 122 states have call predecessors, (137), 119 states have call successors, (137) [2022-11-25 17:54:35,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 664 transitions. [2022-11-25 17:54:35,909 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 664 transitions. Word has length 198 [2022-11-25 17:54:35,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:54:35,910 INFO L495 AbstractCegarLoop]: Abstraction has 519 states and 664 transitions. [2022-11-25 17:54:35,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.1) internal successors, (81), 6 states have internal predecessors, (81), 2 states have call successors, (33), 5 states have call predecessors, (33), 4 states have return successors, (29), 4 states have call predecessors, (29), 2 states have call successors, (29) [2022-11-25 17:54:35,910 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 664 transitions. [2022-11-25 17:54:35,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2022-11-25 17:54:35,912 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:54:35,912 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 4, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:54:35,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-25 17:54:35,913 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:54:35,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:54:35,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1605235821, now seen corresponding path program 1 times [2022-11-25 17:54:35,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:54:35,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046376560] [2022-11-25 17:54:35,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:54:35,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:54:35,987 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 17:54:35,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [827573688] [2022-11-25 17:54:35,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:54:35,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:54:35,988 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb76e2f-1ba5-4fda-92f9-12f4945b22ff/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:54:35,991 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb76e2f-1ba5-4fda-92f9-12f4945b22ff/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:54:36,002 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb76e2f-1ba5-4fda-92f9-12f4945b22ff/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-25 17:54:36,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:54:36,950 INFO L263 TraceCheckSpWp]: Trace formula consists of 2938 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 17:54:36,957 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:54:37,012 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2022-11-25 17:54:37,012 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:54:37,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:54:37,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046376560] [2022-11-25 17:54:37,013 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 17:54:37,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [827573688] [2022-11-25 17:54:37,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [827573688] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:54:37,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:54:37,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-25 17:54:37,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485622411] [2022-11-25 17:54:37,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:54:37,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 17:54:37,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:54:37,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 17:54:37,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-25 17:54:37,015 INFO L87 Difference]: Start difference. First operand 519 states and 664 transitions. Second operand has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 6 states have internal predecessors, (88), 2 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (29), 4 states have call predecessors, (29), 2 states have call successors, (29) [2022-11-25 17:54:37,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:54:37,066 INFO L93 Difference]: Finished difference Result 574 states and 720 transitions. [2022-11-25 17:54:37,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 17:54:37,067 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 6 states have internal predecessors, (88), 2 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (29), 4 states have call predecessors, (29), 2 states have call successors, (29) Word has length 198 [2022-11-25 17:54:37,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:54:37,068 INFO L225 Difference]: With dead ends: 574 [2022-11-25 17:54:37,068 INFO L226 Difference]: Without dead ends: 0 [2022-11-25 17:54:37,069 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-25 17:54:37,070 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 2 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 17:54:37,070 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 343 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:54:37,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-25 17:54:37,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-25 17:54:37,071 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) [2022-11-25 17:54:37,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-25 17:54:37,072 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 198 [2022-11-25 17:54:37,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:54:37,072 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-25 17:54:37,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 6 states have internal predecessors, (88), 2 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (29), 4 states have call predecessors, (29), 2 states have call successors, (29) [2022-11-25 17:54:37,073 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-25 17:54:37,073 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-25 17:54:37,075 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-25 17:54:37,094 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb76e2f-1ba5-4fda-92f9-12f4945b22ff/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-25 17:54:37,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb76e2f-1ba5-4fda-92f9-12f4945b22ff/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:54:37,290 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-25 17:54:39,664 INFO L902 garLoopResultBuilder]: At program point L7342(line 7342) the Hoare annotation is: true [2022-11-25 17:54:39,664 INFO L899 garLoopResultBuilder]: For program point uninterpreted_equalsFINAL(lines 7331 7345) no Hoare annotation was computed. [2022-11-25 17:54:39,664 INFO L899 garLoopResultBuilder]: For program point L7339-1(line 7339) no Hoare annotation was computed. [2022-11-25 17:54:39,664 INFO L902 garLoopResultBuilder]: At program point L7339(line 7339) the Hoare annotation is: true [2022-11-25 17:54:39,664 INFO L899 garLoopResultBuilder]: For program point L7342-3(line 7342) no Hoare annotation was computed. [2022-11-25 17:54:39,664 INFO L899 garLoopResultBuilder]: For program point L7341-2(lines 7341 7343) no Hoare annotation was computed. [2022-11-25 17:54:39,664 INFO L902 garLoopResultBuilder]: At program point L7342-2(line 7342) the Hoare annotation is: true [2022-11-25 17:54:39,664 INFO L899 garLoopResultBuilder]: For program point L7341(lines 7341 7343) no Hoare annotation was computed. [2022-11-25 17:54:39,664 INFO L902 garLoopResultBuilder]: At program point L7342-1(line 7342) the Hoare annotation is: true [2022-11-25 17:54:39,665 INFO L899 garLoopResultBuilder]: For program point uninterpreted_equalsEXIT(lines 7331 7345) no Hoare annotation was computed. [2022-11-25 17:54:39,665 INFO L899 garLoopResultBuilder]: For program point L7335-1(line 7335) no Hoare annotation was computed. [2022-11-25 17:54:39,665 INFO L902 garLoopResultBuilder]: At program point L7335(line 7335) the Hoare annotation is: true [2022-11-25 17:54:39,665 INFO L902 garLoopResultBuilder]: At program point L7337-1(line 7337) the Hoare annotation is: true [2022-11-25 17:54:39,665 INFO L902 garLoopResultBuilder]: At program point uninterpreted_equalsENTRY(lines 7331 7345) the Hoare annotation is: true [2022-11-25 17:54:39,665 INFO L902 garLoopResultBuilder]: At program point L7337(line 7337) the Hoare annotation is: true [2022-11-25 17:54:39,665 INFO L899 garLoopResultBuilder]: For program point L6944-1(lines 6944 6946) no Hoare annotation was computed. [2022-11-25 17:54:39,666 INFO L895 garLoopResultBuilder]: At program point L6944(lines 6944 6946) the Hoare annotation is: (or (forall ((|v_ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base_BEFORE_CALL_2| Int) (|aux_mod_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_4_104| Int) (|aux_div_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_4_104| Int) (|v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_12| Int)) (or (not (<= 0 |aux_mod_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_4_104|)) (not (= (select (select |#memory_int| |v_ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base_BEFORE_CALL_2|) 0) (+ 442721857768999609256 (* |aux_mod_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_4_104| 24) (* |aux_div_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_4_104| 442721857769029238784)))) (not (< |#StackHeapBarrier| |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_12|)) (not (= (select |old(#valid)| |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_12|) 1)) (not (<= |aux_mod_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_4_104| 4)) (= |v_ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base_BEFORE_CALL_2| |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_12|))) (and (= |bounded_malloc_#in~size| bounded_malloc_~size) (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) [2022-11-25 17:54:39,666 INFO L895 garLoopResultBuilder]: At program point bounded_mallocENTRY(lines 6943 6948) the Hoare annotation is: (or (forall ((|v_ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base_BEFORE_CALL_2| Int) (|aux_mod_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_4_104| Int) (|aux_div_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_4_104| Int) (|v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_12| Int)) (or (not (<= 0 |aux_mod_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_4_104|)) (not (= (select (select |#memory_int| |v_ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base_BEFORE_CALL_2|) 0) (+ 442721857768999609256 (* |aux_mod_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_4_104| 24) (* |aux_div_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_4_104| 442721857769029238784)))) (not (< |#StackHeapBarrier| |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_12|)) (not (= (select |old(#valid)| |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_12|) 1)) (not (<= |aux_mod_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_4_104| 4)) (= |v_ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base_BEFORE_CALL_2| |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_12|))) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) [2022-11-25 17:54:39,666 INFO L899 garLoopResultBuilder]: For program point bounded_mallocFINAL(lines 6943 6948) no Hoare annotation was computed. [2022-11-25 17:54:39,666 INFO L899 garLoopResultBuilder]: For program point bounded_mallocEXIT(lines 6943 6948) no Hoare annotation was computed. [2022-11-25 17:54:39,666 INFO L902 garLoopResultBuilder]: At program point __CPROVER_uninterpreted_equalsENTRY(line 239) the Hoare annotation is: true [2022-11-25 17:54:39,667 INFO L899 garLoopResultBuilder]: For program point __CPROVER_uninterpreted_equalsFINAL(line 239) no Hoare annotation was computed. [2022-11-25 17:54:39,667 INFO L899 garLoopResultBuilder]: For program point __CPROVER_uninterpreted_equalsEXIT(line 239) no Hoare annotation was computed. [2022-11-25 17:54:39,667 INFO L899 garLoopResultBuilder]: For program point __CPROVER_uninterpreted_hasherEXIT(line 238) no Hoare annotation was computed. [2022-11-25 17:54:39,667 INFO L902 garLoopResultBuilder]: At program point __CPROVER_uninterpreted_hasherENTRY(line 238) the Hoare annotation is: true [2022-11-25 17:54:39,667 INFO L899 garLoopResultBuilder]: For program point __CPROVER_uninterpreted_hasherFINAL(line 238) no Hoare annotation was computed. [2022-11-25 17:54:39,667 INFO L899 garLoopResultBuilder]: For program point L10008-3(line 10008) no Hoare annotation was computed. [2022-11-25 17:54:39,668 INFO L902 garLoopResultBuilder]: At program point L10008-4(line 10008) the Hoare annotation is: true [2022-11-25 17:54:39,668 INFO L899 garLoopResultBuilder]: For program point L10008-5(line 10008) no Hoare annotation was computed. [2022-11-25 17:54:39,668 INFO L902 garLoopResultBuilder]: At program point aws_hash_table_is_validENTRY(lines 10006 10009) the Hoare annotation is: true [2022-11-25 17:54:39,668 INFO L899 garLoopResultBuilder]: For program point L10008(line 10008) no Hoare annotation was computed. [2022-11-25 17:54:39,668 INFO L899 garLoopResultBuilder]: For program point L10008-2(line 10008) no Hoare annotation was computed. [2022-11-25 17:54:39,668 INFO L899 garLoopResultBuilder]: For program point L10008-7(line 10008) no Hoare annotation was computed. [2022-11-25 17:54:39,668 INFO L899 garLoopResultBuilder]: For program point aws_hash_table_is_validEXIT(lines 10006 10009) no Hoare annotation was computed. [2022-11-25 17:54:39,669 INFO L899 garLoopResultBuilder]: For program point aws_hash_table_is_validFINAL(lines 10006 10009) no Hoare annotation was computed. [2022-11-25 17:54:39,669 INFO L899 garLoopResultBuilder]: For program point nondet_boolFINAL(line 261) no Hoare annotation was computed. [2022-11-25 17:54:39,669 INFO L899 garLoopResultBuilder]: For program point nondet_boolEXIT(line 261) no Hoare annotation was computed. [2022-11-25 17:54:39,669 INFO L902 garLoopResultBuilder]: At program point nondet_boolENTRY(line 261) the Hoare annotation is: true [2022-11-25 17:54:39,669 INFO L899 garLoopResultBuilder]: For program point L7130(lines 7130 7134) no Hoare annotation was computed. [2022-11-25 17:54:39,669 INFO L899 garLoopResultBuilder]: For program point aws_mem_releaseEXIT(lines 7122 7135) no Hoare annotation was computed. [2022-11-25 17:54:39,669 INFO L902 garLoopResultBuilder]: At program point L7126(lines 7126 7128) the Hoare annotation is: true [2022-11-25 17:54:39,670 INFO L902 garLoopResultBuilder]: At program point aws_mem_releaseENTRY(lines 7122 7135) the Hoare annotation is: true [2022-11-25 17:54:39,670 INFO L899 garLoopResultBuilder]: For program point L7130-2(lines 7122 7135) no Hoare annotation was computed. [2022-11-25 17:54:39,670 INFO L899 garLoopResultBuilder]: For program point L7123-1(lines 7123 7125) no Hoare annotation was computed. [2022-11-25 17:54:39,670 INFO L902 garLoopResultBuilder]: At program point L7123(lines 7123 7125) the Hoare annotation is: true [2022-11-25 17:54:39,670 INFO L899 garLoopResultBuilder]: For program point L7126-1(lines 7126 7128) no Hoare annotation was computed. [2022-11-25 17:54:39,671 INFO L895 garLoopResultBuilder]: At program point hash_table_state_required_bytesENTRY(lines 10119 10131) the Hoare annotation is: (or (forall ((|v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7|)) (not (= (select |old(#valid)| |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7|) 1)))) (and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= |old(#valid)| |#valid|))) [2022-11-25 17:54:39,671 INFO L899 garLoopResultBuilder]: For program point hash_table_state_required_bytesEXIT(lines 10119 10131) no Hoare annotation was computed. [2022-11-25 17:54:39,671 INFO L899 garLoopResultBuilder]: For program point L10126-1(line 10126) no Hoare annotation was computed. [2022-11-25 17:54:39,671 INFO L899 garLoopResultBuilder]: For program point L10126-2(lines 10126 10128) no Hoare annotation was computed. [2022-11-25 17:54:39,671 INFO L895 garLoopResultBuilder]: At program point L10122(line 10122) the Hoare annotation is: (or (forall ((|v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7|)) (not (= (select |old(#valid)| |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7|) 1)))) (and (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= hash_table_state_required_bytes_~required_bytes.offset |hash_table_state_required_bytes_#in~required_bytes.offset|) (= (select |old(#valid)| |hash_table_state_required_bytes_~#elemsize~0.base|) 0) (= hash_table_state_required_bytes_~size |hash_table_state_required_bytes_#in~size|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= hash_table_state_required_bytes_~required_bytes.base |hash_table_state_required_bytes_#in~required_bytes.base|) (= |hash_table_state_required_bytes_~#elemsize~0.offset| 0) (exists ((v_ArrVal_3048 Int)) (= (store |old(#valid)| |hash_table_state_required_bytes_~#elemsize~0.base| v_ArrVal_3048) |#valid|)))) [2022-11-25 17:54:39,672 INFO L895 garLoopResultBuilder]: At program point L10126(line 10126) the Hoare annotation is: (or (forall ((|v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7|)) (not (= (select |old(#valid)| |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7|) 1)))) (let ((.cse0 (* |hash_table_state_required_bytes_#in~size| 24))) (and (= .cse0 |hash_table_state_required_bytes_#t~mem1320|) (= hash_table_state_required_bytes_~required_bytes.offset |hash_table_state_required_bytes_#in~required_bytes.offset|) (= (select |old(#valid)| |hash_table_state_required_bytes_~#elemsize~0.base|) 0) (= hash_table_state_required_bytes_~size |hash_table_state_required_bytes_#in~size|) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= hash_table_state_required_bytes_~required_bytes.base |hash_table_state_required_bytes_#in~required_bytes.base|) (= |hash_table_state_required_bytes_~#elemsize~0.offset| 0) (exists ((v_ArrVal_3048 Int)) (= (store |old(#valid)| |hash_table_state_required_bytes_~#elemsize~0.base| v_ArrVal_3048) |#valid|)) (= (select (select |#memory_int| |hash_table_state_required_bytes_~#elemsize~0.base|) |hash_table_state_required_bytes_~#elemsize~0.offset|) .cse0)))) [2022-11-25 17:54:39,672 INFO L899 garLoopResultBuilder]: For program point hash_table_state_required_bytesFINAL(lines 10119 10131) no Hoare annotation was computed. [2022-11-25 17:54:39,672 INFO L899 garLoopResultBuilder]: For program point L10122-1(line 10122) no Hoare annotation was computed. [2022-11-25 17:54:39,672 INFO L899 garLoopResultBuilder]: For program point L10122-2(lines 10122 10124) no Hoare annotation was computed. [2022-11-25 17:54:39,672 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-25 17:54:39,672 INFO L902 garLoopResultBuilder]: At program point L6940(lines 6934 6941) the Hoare annotation is: true [2022-11-25 17:54:39,673 INFO L902 garLoopResultBuilder]: At program point L6936-2(line 6936) the Hoare annotation is: true [2022-11-25 17:54:39,673 INFO L899 garLoopResultBuilder]: For program point L6936-1(line 6936) no Hoare annotation was computed. [2022-11-25 17:54:39,673 INFO L902 garLoopResultBuilder]: At program point L6936(line 6936) the Hoare annotation is: true [2022-11-25 17:54:39,673 INFO L899 garLoopResultBuilder]: For program point L6937-1(lines 6937 6939) no Hoare annotation was computed. [2022-11-25 17:54:39,673 INFO L902 garLoopResultBuilder]: At program point L6937(lines 6937 6939) the Hoare annotation is: true [2022-11-25 17:54:39,673 INFO L899 garLoopResultBuilder]: For program point L6936-3(line 6936) no Hoare annotation was computed. [2022-11-25 17:54:39,673 INFO L899 garLoopResultBuilder]: For program point can_fail_callocEXIT(lines 6954 6958) no Hoare annotation was computed. [2022-11-25 17:54:39,674 INFO L899 garLoopResultBuilder]: For program point L6955-1(lines 6955 6957) no Hoare annotation was computed. [2022-11-25 17:54:39,674 INFO L902 garLoopResultBuilder]: At program point can_fail_callocENTRY(lines 6954 6958) the Hoare annotation is: true [2022-11-25 17:54:39,674 INFO L902 garLoopResultBuilder]: At program point L6955(line 6955) the Hoare annotation is: true [2022-11-25 17:54:39,674 INFO L899 garLoopResultBuilder]: For program point can_fail_callocFINAL(lines 6954 6958) no Hoare annotation was computed. [2022-11-25 17:54:39,674 INFO L899 garLoopResultBuilder]: For program point L6955-3(lines 6955 6957) no Hoare annotation was computed. [2022-11-25 17:54:39,674 INFO L902 garLoopResultBuilder]: At program point L2657(lines 2637 2658) the Hoare annotation is: true [2022-11-25 17:54:39,675 INFO L899 garLoopResultBuilder]: For program point L9210(lines 9210 9212) no Hoare annotation was computed. [2022-11-25 17:54:39,675 INFO L899 garLoopResultBuilder]: For program point L9202(lines 9202 9204) no Hoare annotation was computed. [2022-11-25 17:54:39,675 INFO L899 garLoopResultBuilder]: For program point L9210-2(lines 9210 9212) no Hoare annotation was computed. [2022-11-25 17:54:39,675 INFO L899 garLoopResultBuilder]: For program point L2643-1(line 2643) no Hoare annotation was computed. [2022-11-25 17:54:39,675 INFO L902 garLoopResultBuilder]: At program point L2643(line 2643) the Hoare annotation is: true [2022-11-25 17:54:39,675 INFO L899 garLoopResultBuilder]: For program point L9196(lines 9196 9198) no Hoare annotation was computed. [2022-11-25 17:54:39,675 INFO L899 garLoopResultBuilder]: For program point L9196-2(lines 9196 9198) no Hoare annotation was computed. [2022-11-25 17:54:39,676 INFO L899 garLoopResultBuilder]: For program point L2642(lines 2642 2644) no Hoare annotation was computed. [2022-11-25 17:54:39,676 INFO L899 garLoopResultBuilder]: For program point L2638(lines 2638 2641) no Hoare annotation was computed. [2022-11-25 17:54:39,676 INFO L899 garLoopResultBuilder]: For program point s_update_template_sizeEXIT(lines 9193 9218) no Hoare annotation was computed. [2022-11-25 17:54:39,676 INFO L902 garLoopResultBuilder]: At program point s_update_template_sizeENTRY(lines 9193 9218) the Hoare annotation is: true [2022-11-25 17:54:39,676 INFO L899 garLoopResultBuilder]: For program point s_update_template_sizeFINAL(lines 9193 9218) no Hoare annotation was computed. [2022-11-25 17:54:39,676 INFO L899 garLoopResultBuilder]: For program point aws_allocator_is_validFINAL(lines 6984 6987) no Hoare annotation was computed. [2022-11-25 17:54:39,676 INFO L902 garLoopResultBuilder]: At program point L6986(line 6986) the Hoare annotation is: true [2022-11-25 17:54:39,677 INFO L902 garLoopResultBuilder]: At program point aws_allocator_is_validENTRY(lines 6984 6987) the Hoare annotation is: true [2022-11-25 17:54:39,677 INFO L899 garLoopResultBuilder]: For program point L6986-1(line 6986) no Hoare annotation was computed. [2022-11-25 17:54:39,677 INFO L899 garLoopResultBuilder]: For program point aws_allocator_is_validEXIT(lines 6984 6987) no Hoare annotation was computed. [2022-11-25 17:54:39,677 INFO L902 garLoopResultBuilder]: At program point L9150-1(line 9150) the Hoare annotation is: true [2022-11-25 17:54:39,677 INFO L902 garLoopResultBuilder]: At program point s_hash_keys_eqENTRY(lines 9147 9155) the Hoare annotation is: true [2022-11-25 17:54:39,677 INFO L899 garLoopResultBuilder]: For program point L9150-2(line 9150) no Hoare annotation was computed. [2022-11-25 17:54:39,678 INFO L899 garLoopResultBuilder]: For program point s_hash_keys_eqEXIT(lines 9147 9155) no Hoare annotation was computed. [2022-11-25 17:54:39,678 INFO L902 garLoopResultBuilder]: At program point L9153(line 9153) the Hoare annotation is: true [2022-11-25 17:54:39,678 INFO L902 garLoopResultBuilder]: At program point L9154-1(line 9154) the Hoare annotation is: true [2022-11-25 17:54:39,678 INFO L899 garLoopResultBuilder]: For program point L9153-1(line 9153) no Hoare annotation was computed. [2022-11-25 17:54:39,678 INFO L899 garLoopResultBuilder]: For program point L9154-2(line 9154) no Hoare annotation was computed. [2022-11-25 17:54:39,678 INFO L902 garLoopResultBuilder]: At program point L9154-3(line 9154) the Hoare annotation is: true [2022-11-25 17:54:39,678 INFO L902 garLoopResultBuilder]: At program point L9150(line 9150) the Hoare annotation is: true [2022-11-25 17:54:39,679 INFO L899 garLoopResultBuilder]: For program point L9154-4(lines 9147 9155) no Hoare annotation was computed. [2022-11-25 17:54:39,679 INFO L899 garLoopResultBuilder]: For program point aws_mul_size_checkedEXIT(lines 2586 2594) no Hoare annotation was computed. [2022-11-25 17:54:39,679 INFO L899 garLoopResultBuilder]: For program point L2498-1(lines 2498 2499) no Hoare annotation was computed. [2022-11-25 17:54:39,679 INFO L899 garLoopResultBuilder]: For program point aws_mul_size_checkedFINAL(lines 2586 2594) no Hoare annotation was computed. [2022-11-25 17:54:39,679 INFO L895 garLoopResultBuilder]: At program point aws_mul_size_checkedENTRY(lines 2586 2594) the Hoare annotation is: (or (forall ((|v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7|)) (not (= (select |old(#valid)| |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7|) 1)))) (and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= |old(#valid)| |#valid|))) [2022-11-25 17:54:39,680 INFO L895 garLoopResultBuilder]: At program point L2501(lines 2497 2502) the Hoare annotation is: (let ((.cse0 (exists ((v_ArrVal_3049 Int) (|v___CPROVER_overflow_mult_~#c~1.base_78| Int)) (and (= (store |old(#valid)| |v___CPROVER_overflow_mult_~#c~1.base_78| v_ArrVal_3049) |#valid|) (= (select |old(#valid)| |v___CPROVER_overflow_mult_~#c~1.base_78|) 0)))) (.cse1 (= |aws_mul_size_checked_aws_mul_u64_checked_~r#1.base| |aws_mul_size_checked_#in~r#1.base|)) (.cse2 (= |aws_mul_size_checked_#in~a#1| |aws_mul_size_checked_aws_mul_u64_checked_~a#1|)) (.cse3 (= |aws_mul_size_checked_#in~b#1| |aws_mul_size_checked_aws_mul_u64_checked_~b#1|)) (.cse4 (= |old(#valid)| |#valid|)) (.cse5 (= |aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset| |aws_mul_size_checked_#in~r#1.offset|))) (or (forall ((|v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7|)) (not (= (select |old(#valid)| |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7|) 1)))) (and (= (* |aws_mul_size_checked_#in~b#1| |aws_mul_size_checked_#in~a#1|) (select (select |#memory_int| |aws_mul_size_checked_#in~r#1.base|) |aws_mul_size_checked_#in~r#1.offset|)) .cse0 .cse1 (= ~tl_last_error~0 |old(~tl_last_error~0)|) .cse2 .cse3 (= |aws_mul_size_checked_aws_mul_u64_checked_#res#1| 0) .cse4 .cse5) (and (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) .cse0 (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) .cse1 .cse2 (<= (+ |aws_mul_size_checked_aws_mul_u64_checked_#res#1| 1) 0) .cse3 .cse4 .cse5))) [2022-11-25 17:54:39,680 INFO L895 garLoopResultBuilder]: At program point L2498(line 2498) the Hoare annotation is: (or (forall ((|v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7|)) (not (= (select |old(#valid)| |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7|) 1)))) (and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |aws_mul_size_checked_aws_mul_u64_checked_~r#1.base| |aws_mul_size_checked_#in~r#1.base|) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= |aws_mul_size_checked_#in~a#1| |aws_mul_size_checked_aws_mul_u64_checked_~a#1|) (= |aws_mul_size_checked_#in~b#1| |aws_mul_size_checked_aws_mul_u64_checked_~b#1|) (= |old(#valid)| |#valid|) (= |aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset| |aws_mul_size_checked_#in~r#1.offset|))) [2022-11-25 17:54:39,680 INFO L899 garLoopResultBuilder]: For program point L2499-1(line 2499) no Hoare annotation was computed. [2022-11-25 17:54:39,681 INFO L895 garLoopResultBuilder]: At program point L2499(line 2499) the Hoare annotation is: (or (forall ((|v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7|)) (not (= (select |old(#valid)| |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7|) 1)))) (and (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (exists ((v_ArrVal_3049 Int) (|v___CPROVER_overflow_mult_~#c~1.base_78| Int)) (and (= (store |old(#valid)| |v___CPROVER_overflow_mult_~#c~1.base_78| v_ArrVal_3049) |#valid|) (= (select |old(#valid)| |v___CPROVER_overflow_mult_~#c~1.base_78|) 0))) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |aws_mul_size_checked_aws_mul_u64_checked_~r#1.base| |aws_mul_size_checked_#in~r#1.base|) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= |aws_mul_size_checked_#in~a#1| |aws_mul_size_checked_aws_mul_u64_checked_~a#1|) (= |aws_mul_size_checked_#in~b#1| |aws_mul_size_checked_aws_mul_u64_checked_~b#1|) (= |old(#valid)| |#valid|) (= |aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset| |aws_mul_size_checked_#in~r#1.offset|))) [2022-11-25 17:54:39,681 INFO L899 garLoopResultBuilder]: For program point nondet_uint64_tEXIT(line 266) no Hoare annotation was computed. [2022-11-25 17:54:39,681 INFO L902 garLoopResultBuilder]: At program point nondet_uint64_tENTRY(line 266) the Hoare annotation is: true [2022-11-25 17:54:39,681 INFO L899 garLoopResultBuilder]: For program point nondet_uint64_tFINAL(line 266) no Hoare annotation was computed. [2022-11-25 17:54:39,681 INFO L899 garLoopResultBuilder]: For program point L9115(line 9115) no Hoare annotation was computed. [2022-11-25 17:54:39,681 INFO L902 garLoopResultBuilder]: At program point L9115-1(lines 9100 9116) the Hoare annotation is: true [2022-11-25 17:54:39,682 INFO L899 garLoopResultBuilder]: For program point L9115-2(lines 9100 9116) no Hoare annotation was computed. [2022-11-25 17:54:39,682 INFO L902 garLoopResultBuilder]: At program point L9101(line 9101) the Hoare annotation is: true [2022-11-25 17:54:39,682 INFO L902 garLoopResultBuilder]: At program point L9101-1(line 9101) the Hoare annotation is: true [2022-11-25 17:54:39,682 INFO L899 garLoopResultBuilder]: For program point L9101-2(line 9101) no Hoare annotation was computed. [2022-11-25 17:54:39,682 INFO L902 garLoopResultBuilder]: At program point L7373-1(lines 7369 7374) the Hoare annotation is: true [2022-11-25 17:54:39,682 INFO L899 garLoopResultBuilder]: For program point L7373(line 7373) no Hoare annotation was computed. [2022-11-25 17:54:39,682 INFO L899 garLoopResultBuilder]: For program point L9085(lines 9085 9093) no Hoare annotation was computed. [2022-11-25 17:54:39,683 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-11-25 17:54:39,683 INFO L899 garLoopResultBuilder]: For program point L9112(lines 9112 9114) no Hoare annotation was computed. [2022-11-25 17:54:39,683 INFO L902 garLoopResultBuilder]: At program point s_hash_forENTRY(lines 9100 9116) the Hoare annotation is: true [2022-11-25 17:54:39,683 INFO L902 garLoopResultBuilder]: At program point L7370(lines 7370 7372) the Hoare annotation is: true [2022-11-25 17:54:39,683 INFO L899 garLoopResultBuilder]: For program point L9104(lines 9104 9109) no Hoare annotation was computed. [2022-11-25 17:54:39,683 INFO L899 garLoopResultBuilder]: For program point s_hash_forEXIT(lines 9100 9116) no Hoare annotation was computed. [2022-11-25 17:54:39,683 INFO L902 garLoopResultBuilder]: At program point L7370-1(lines 7370 7372) the Hoare annotation is: true [2022-11-25 17:54:39,684 INFO L895 garLoopResultBuilder]: At program point __CPROVER_overflow_plusENTRY(lines 248 251) the Hoare annotation is: (or (forall ((|v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7|)) (not (= (select |old(#valid)| |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7|) 1)))) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) [2022-11-25 17:54:39,684 INFO L899 garLoopResultBuilder]: For program point __CPROVER_overflow_plusFINAL(lines 248 251) no Hoare annotation was computed. [2022-11-25 17:54:39,684 INFO L899 garLoopResultBuilder]: For program point __CPROVER_overflow_plusEXIT(lines 248 251) no Hoare annotation was computed. [2022-11-25 17:54:39,684 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-25 17:54:39,684 INFO L899 garLoopResultBuilder]: For program point L-1-2(line -1) no Hoare annotation was computed. [2022-11-25 17:54:39,684 INFO L902 garLoopResultBuilder]: At program point L7356-1(lines 7348 7357) the Hoare annotation is: true [2022-11-25 17:54:39,685 INFO L899 garLoopResultBuilder]: For program point L7356(line 7356) no Hoare annotation was computed. [2022-11-25 17:54:39,685 INFO L902 garLoopResultBuilder]: At program point L7350(lines 7350 7352) the Hoare annotation is: true [2022-11-25 17:54:39,685 INFO L902 garLoopResultBuilder]: At program point L7287(lines 7280 7288) the Hoare annotation is: true [2022-11-25 17:54:39,685 INFO L902 garLoopResultBuilder]: At program point L7353(lines 7353 7355) the Hoare annotation is: true [2022-11-25 17:54:39,685 INFO L899 garLoopResultBuilder]: For program point ##fun~$Pointer$~X~$Pointer$~TO~intFINAL(line -1) no Hoare annotation was computed. [2022-11-25 17:54:39,685 INFO L899 garLoopResultBuilder]: For program point L7284(lines 7284 7286) no Hoare annotation was computed. [2022-11-25 17:54:39,685 INFO L902 garLoopResultBuilder]: At program point L7350-1(lines 7350 7352) the Hoare annotation is: true [2022-11-25 17:54:39,686 INFO L902 garLoopResultBuilder]: At program point L7281-1(lines 7281 7283) the Hoare annotation is: true [2022-11-25 17:54:39,686 INFO L902 garLoopResultBuilder]: At program point L7281(lines 7281 7283) the Hoare annotation is: true [2022-11-25 17:54:39,686 INFO L899 garLoopResultBuilder]: For program point ##fun~$Pointer$~X~$Pointer$~TO~intEXIT(line -1) no Hoare annotation was computed. [2022-11-25 17:54:39,686 INFO L902 garLoopResultBuilder]: At program point L262(line 262) the Hoare annotation is: true [2022-11-25 17:54:39,686 INFO L902 garLoopResultBuilder]: At program point ##fun~$Pointer$~X~$Pointer$~TO~intENTRY(line -1) the Hoare annotation is: true [2022-11-25 17:54:39,686 INFO L899 garLoopResultBuilder]: For program point aws_hash_table_createEXIT(lines 9516 9580) no Hoare annotation was computed. [2022-11-25 17:54:39,687 INFO L899 garLoopResultBuilder]: For program point L9533(lines 9533 9539) no Hoare annotation was computed. [2022-11-25 17:54:39,687 INFO L899 garLoopResultBuilder]: For program point L9504(lines 9504 9507) no Hoare annotation was computed. [2022-11-25 17:54:39,687 INFO L899 garLoopResultBuilder]: For program point L9546(lines 9546 9561) no Hoare annotation was computed. [2022-11-25 17:54:39,687 INFO L902 garLoopResultBuilder]: At program point L9571(line 9571) the Hoare annotation is: true [2022-11-25 17:54:39,687 INFO L899 garLoopResultBuilder]: For program point L9571-1(line 9571) no Hoare annotation was computed. [2022-11-25 17:54:39,687 INFO L902 garLoopResultBuilder]: At program point L9513(lines 9484 9514) the Hoare annotation is: true [2022-11-25 17:54:39,687 INFO L899 garLoopResultBuilder]: For program point L9546-2(lines 9546 9561) no Hoare annotation was computed. [2022-11-25 17:54:39,688 INFO L899 garLoopResultBuilder]: For program point L9534-2(lines 9534 9536) no Hoare annotation was computed. [2022-11-25 17:54:39,688 INFO L899 garLoopResultBuilder]: For program point L9534(lines 9534 9536) no Hoare annotation was computed. [2022-11-25 17:54:39,688 INFO L902 garLoopResultBuilder]: At program point L9493(line 9493) the Hoare annotation is: true [2022-11-25 17:54:39,688 INFO L899 garLoopResultBuilder]: For program point L9493-1(line 9493) no Hoare annotation was computed. [2022-11-25 17:54:39,688 INFO L899 garLoopResultBuilder]: For program point L9493-2(lines 9493 9495) no Hoare annotation was computed. [2022-11-25 17:54:39,688 INFO L902 garLoopResultBuilder]: At program point L9497(line 9497) the Hoare annotation is: true [2022-11-25 17:54:39,688 INFO L899 garLoopResultBuilder]: For program point L9497-1(line 9497) no Hoare annotation was computed. [2022-11-25 17:54:39,689 INFO L902 garLoopResultBuilder]: At program point L9489(line 9489) the Hoare annotation is: true [2022-11-25 17:54:39,689 INFO L899 garLoopResultBuilder]: For program point L9489-1(line 9489) no Hoare annotation was computed. [2022-11-25 17:54:39,689 INFO L899 garLoopResultBuilder]: For program point L9489-2(lines 9489 9491) no Hoare annotation was computed. [2022-11-25 17:54:39,689 INFO L899 garLoopResultBuilder]: For program point L9543-2(lines 9543 9545) no Hoare annotation was computed. [2022-11-25 17:54:39,689 INFO L902 garLoopResultBuilder]: At program point L9506(line 9506) the Hoare annotation is: true [2022-11-25 17:54:39,689 INFO L902 garLoopResultBuilder]: At program point L9543(line 9543) the Hoare annotation is: true [2022-11-25 17:54:39,689 INFO L899 garLoopResultBuilder]: For program point L9543-1(line 9543) no Hoare annotation was computed. [2022-11-25 17:54:39,690 INFO L899 garLoopResultBuilder]: For program point L9502-1(lines 9502 9508) no Hoare annotation was computed. [2022-11-25 17:54:39,690 INFO L899 garLoopResultBuilder]: For program point L9531(line 9531) no Hoare annotation was computed. [2022-11-25 17:54:39,690 INFO L899 garLoopResultBuilder]: For program point L9502-3(lines 9502 9508) no Hoare annotation was computed. [2022-11-25 17:54:39,690 INFO L899 garLoopResultBuilder]: For program point L9498(lines 9498 9500) no Hoare annotation was computed. [2022-11-25 17:54:39,690 INFO L902 garLoopResultBuilder]: At program point L9502-4(lines 9502 9508) the Hoare annotation is: true [2022-11-25 17:54:39,690 INFO L899 garLoopResultBuilder]: For program point L9506-1(line 9506) no Hoare annotation was computed. [2022-11-25 17:54:39,690 INFO L902 garLoopResultBuilder]: At program point aws_hash_table_createENTRY(lines 9516 9580) the Hoare annotation is: true [2022-11-25 17:54:39,691 INFO L899 garLoopResultBuilder]: For program point aws_hash_table_createFINAL(lines 9516 9580) no Hoare annotation was computed. [2022-11-25 17:54:39,691 INFO L902 garLoopResultBuilder]: At program point L9527-2(lines 9527 9529) the Hoare annotation is: true [2022-11-25 17:54:39,691 INFO L902 garLoopResultBuilder]: At program point L9523(line 9523) the Hoare annotation is: true [2022-11-25 17:54:39,691 INFO L899 garLoopResultBuilder]: For program point L9523-1(line 9523) no Hoare annotation was computed. [2022-11-25 17:54:39,691 INFO L899 garLoopResultBuilder]: For program point L9502-5(lines 9502 9508) no Hoare annotation was computed. [2022-11-25 17:54:39,691 INFO L899 garLoopResultBuilder]: For program point L9527(lines 9527 9529) no Hoare annotation was computed. [2022-11-25 17:54:39,692 INFO L899 garLoopResultBuilder]: For program point L9548(lines 9548 9551) no Hoare annotation was computed. [2022-11-25 17:54:39,692 INFO L899 garLoopResultBuilder]: For program point L9573(lines 9573 9575) no Hoare annotation was computed. [2022-11-25 17:54:39,692 INFO L899 garLoopResultBuilder]: For program point L9573-2(lines 9573 9575) no Hoare annotation was computed. [2022-11-25 17:54:39,692 INFO L902 garLoopResultBuilder]: At program point L9511(line 9511) the Hoare annotation is: true [2022-11-25 17:54:39,692 INFO L899 garLoopResultBuilder]: For program point L9511-1(line 9511) no Hoare annotation was computed. [2022-11-25 17:54:39,692 INFO L902 garLoopResultBuilder]: At program point hash_table_state_is_validENTRY(lines 10017 10064) the Hoare annotation is: true [2022-11-25 17:54:39,693 INFO L902 garLoopResultBuilder]: At program point L10045(line 10045) the Hoare annotation is: true [2022-11-25 17:54:39,693 INFO L899 garLoopResultBuilder]: For program point L10045-1(line 10045) no Hoare annotation was computed. [2022-11-25 17:54:39,693 INFO L899 garLoopResultBuilder]: For program point hash_table_state_is_validEXIT(lines 10017 10064) no Hoare annotation was computed. [2022-11-25 17:54:39,693 INFO L899 garLoopResultBuilder]: For program point hash_table_state_is_validFINAL(lines 10017 10064) no Hoare annotation was computed. [2022-11-25 17:54:39,693 INFO L899 garLoopResultBuilder]: For program point L10019(lines 10019 10023) no Hoare annotation was computed. [2022-11-25 17:54:39,693 INFO L899 garLoopResultBuilder]: For program point L9131(lines 9131 9139) no Hoare annotation was computed. [2022-11-25 17:54:39,693 INFO L902 garLoopResultBuilder]: At program point s_safe_eq_checkENTRY(lines 9121 9142) the Hoare annotation is: true [2022-11-25 17:54:39,694 INFO L899 garLoopResultBuilder]: For program point L9125(lines 9125 9129) no Hoare annotation was computed. [2022-11-25 17:54:39,694 INFO L902 garLoopResultBuilder]: At program point L9141(line 9141) the Hoare annotation is: true [2022-11-25 17:54:39,694 INFO L899 garLoopResultBuilder]: For program point L9141-1(line 9141) no Hoare annotation was computed. [2022-11-25 17:54:39,694 INFO L899 garLoopResultBuilder]: For program point s_safe_eq_checkFINAL(lines 9121 9142) no Hoare annotation was computed. [2022-11-25 17:54:39,694 INFO L899 garLoopResultBuilder]: For program point s_safe_eq_checkEXIT(lines 9121 9142) no Hoare annotation was computed. [2022-11-25 17:54:39,694 INFO L902 garLoopResultBuilder]: At program point L9173(line 9173) the Hoare annotation is: true [2022-11-25 17:54:39,695 INFO L899 garLoopResultBuilder]: For program point L9173-1(line 9173) no Hoare annotation was computed. [2022-11-25 17:54:39,695 INFO L899 garLoopResultBuilder]: For program point L9173-2(lines 9173 9177) no Hoare annotation was computed. [2022-11-25 17:54:39,695 INFO L902 garLoopResultBuilder]: At program point s_alloc_stateENTRY(lines 9171 9190) the Hoare annotation is: true [2022-11-25 17:54:39,695 INFO L902 garLoopResultBuilder]: At program point L7018(line 7018) the Hoare annotation is: true [2022-11-25 17:54:39,695 INFO L902 garLoopResultBuilder]: At program point L7020(lines 7001 7021) the Hoare annotation is: true [2022-11-25 17:54:39,695 INFO L899 garLoopResultBuilder]: For program point L7016-1(line 7016) no Hoare annotation was computed. [2022-11-25 17:54:39,695 INFO L902 garLoopResultBuilder]: At program point L7016(line 7016) the Hoare annotation is: true [2022-11-25 17:54:39,696 INFO L899 garLoopResultBuilder]: For program point L7018-1(line 7018) no Hoare annotation was computed. [2022-11-25 17:54:39,696 INFO L902 garLoopResultBuilder]: At program point L7010(line 7010) the Hoare annotation is: true [2022-11-25 17:54:39,696 INFO L899 garLoopResultBuilder]: For program point L7010-2(lines 7010 7014) no Hoare annotation was computed. [2022-11-25 17:54:39,696 INFO L899 garLoopResultBuilder]: For program point s_alloc_stateEXIT(lines 9171 9190) no Hoare annotation was computed. [2022-11-25 17:54:39,696 INFO L899 garLoopResultBuilder]: For program point L7010-1(line 7010) no Hoare annotation was computed. [2022-11-25 17:54:39,696 INFO L902 garLoopResultBuilder]: At program point L7002(line 7002) the Hoare annotation is: true [2022-11-25 17:54:39,697 INFO L899 garLoopResultBuilder]: For program point L7004-1(line 7004) no Hoare annotation was computed. [2022-11-25 17:54:39,697 INFO L902 garLoopResultBuilder]: At program point L7004(line 7004) the Hoare annotation is: true [2022-11-25 17:54:39,697 INFO L899 garLoopResultBuilder]: For program point L9182(lines 9182 9186) no Hoare annotation was computed. [2022-11-25 17:54:39,697 INFO L899 garLoopResultBuilder]: For program point L7002-2(line 7002) no Hoare annotation was computed. [2022-11-25 17:54:39,697 INFO L902 garLoopResultBuilder]: At program point L7002-1(line 7002) the Hoare annotation is: true [2022-11-25 17:54:39,697 INFO L899 garLoopResultBuilder]: For program point L7017-2(lines 7017 7019) no Hoare annotation was computed. [2022-11-25 17:54:39,697 INFO L899 garLoopResultBuilder]: For program point L7017(lines 7017 7019) no Hoare annotation was computed. [2022-11-25 17:54:39,698 INFO L899 garLoopResultBuilder]: For program point s_alloc_stateFINAL(lines 9171 9190) no Hoare annotation was computed. [2022-11-25 17:54:39,698 INFO L902 garLoopResultBuilder]: At program point L9437-1(line 9437) the Hoare annotation is: true [2022-11-25 17:54:39,698 INFO L899 garLoopResultBuilder]: For program point L9437-2(line 9437) no Hoare annotation was computed. [2022-11-25 17:54:39,698 INFO L902 garLoopResultBuilder]: At program point L9437-3(lines 9437 9439) the Hoare annotation is: true [2022-11-25 17:54:39,698 INFO L902 garLoopResultBuilder]: At program point L9478-5(lines 9433 9482) the Hoare annotation is: true [2022-11-25 17:54:39,698 INFO L899 garLoopResultBuilder]: For program point L9478-6(lines 9478 9481) no Hoare annotation was computed. [2022-11-25 17:54:39,699 INFO L902 garLoopResultBuilder]: At program point L9462-2(lines 9448 9476) the Hoare annotation is: true [2022-11-25 17:54:39,699 INFO L899 garLoopResultBuilder]: For program point L9462(lines 9462 9475) no Hoare annotation was computed. [2022-11-25 17:54:39,699 INFO L902 garLoopResultBuilder]: At program point s_emplace_itemENTRY(lines 9430 9482) the Hoare annotation is: true [2022-11-25 17:54:39,699 INFO L899 garLoopResultBuilder]: For program point s_emplace_itemFINAL(lines 9430 9482) no Hoare annotation was computed. [2022-11-25 17:54:39,699 INFO L902 garLoopResultBuilder]: At program point L9434(line 9434) the Hoare annotation is: true [2022-11-25 17:54:39,699 INFO L902 garLoopResultBuilder]: At program point L9434-1(line 9434) the Hoare annotation is: true [2022-11-25 17:54:39,699 INFO L899 garLoopResultBuilder]: For program point L9434-2(line 9434) no Hoare annotation was computed. [2022-11-25 17:54:39,700 INFO L899 garLoopResultBuilder]: For program point L9464(lines 9464 9466) no Hoare annotation was computed. [2022-11-25 17:54:39,700 INFO L899 garLoopResultBuilder]: For program point L9464-2(lines 9464 9466) no Hoare annotation was computed. [2022-11-25 17:54:39,700 INFO L899 garLoopResultBuilder]: For program point s_emplace_itemEXIT(lines 9430 9482) no Hoare annotation was computed. [2022-11-25 17:54:39,700 INFO L899 garLoopResultBuilder]: For program point L9448-1(lines 9448 9476) no Hoare annotation was computed. [2022-11-25 17:54:39,700 INFO L899 garLoopResultBuilder]: For program point L9436(lines 9436 9440) no Hoare annotation was computed. [2022-11-25 17:54:39,700 INFO L899 garLoopResultBuilder]: For program point L9436-1(lines 9436 9440) no Hoare annotation was computed. [2022-11-25 17:54:39,700 INFO L899 garLoopResultBuilder]: For program point L9478-1(line 9478) no Hoare annotation was computed. [2022-11-25 17:54:39,701 INFO L902 garLoopResultBuilder]: At program point L9478-3(line 9478) the Hoare annotation is: true [2022-11-25 17:54:39,701 INFO L899 garLoopResultBuilder]: For program point L9478-4(line 9478) no Hoare annotation was computed. [2022-11-25 17:54:39,703 INFO L899 garLoopResultBuilder]: For program point L9478(line 9478) no Hoare annotation was computed. [2022-11-25 17:54:39,704 INFO L899 garLoopResultBuilder]: For program point L9338(lines 9338 9340) no Hoare annotation was computed. [2022-11-25 17:54:39,704 INFO L899 garLoopResultBuilder]: For program point L9330(lines 9330 9332) no Hoare annotation was computed. [2022-11-25 17:54:39,704 INFO L899 garLoopResultBuilder]: For program point L9338-2(lines 9338 9340) no Hoare annotation was computed. [2022-11-25 17:54:39,704 INFO L899 garLoopResultBuilder]: For program point L9388(lines 9388 9396) no Hoare annotation was computed. [2022-11-25 17:54:39,704 INFO L899 garLoopResultBuilder]: For program point L9330-2(lines 9330 9332) no Hoare annotation was computed. [2022-11-25 17:54:39,704 INFO L899 garLoopResultBuilder]: For program point L9372(lines 9372 9375) no Hoare annotation was computed. [2022-11-25 17:54:39,704 INFO L899 garLoopResultBuilder]: For program point s_find_entryFINAL(lines 9321 9346) no Hoare annotation was computed. [2022-11-25 17:54:39,705 INFO L899 garLoopResultBuilder]: For program point s_find_entryEXIT(lines 9321 9346) no Hoare annotation was computed. [2022-11-25 17:54:39,705 INFO L902 garLoopResultBuilder]: At program point s_find_entryENTRY(lines 9321 9346) the Hoare annotation is: true [2022-11-25 17:54:39,705 INFO L899 garLoopResultBuilder]: For program point L9377-4(lines 9377 9380) no Hoare annotation was computed. [2022-11-25 17:54:39,705 INFO L899 garLoopResultBuilder]: For program point L9402(lines 9402 9404) no Hoare annotation was computed. [2022-11-25 17:54:39,705 INFO L899 garLoopResultBuilder]: For program point L9377(line 9377) no Hoare annotation was computed. [2022-11-25 17:54:39,705 INFO L902 garLoopResultBuilder]: At program point L9377-1(line 9377) the Hoare annotation is: true [2022-11-25 17:54:39,705 INFO L899 garLoopResultBuilder]: For program point L9377-2(line 9377) no Hoare annotation was computed. [2022-11-25 17:54:39,705 INFO L902 garLoopResultBuilder]: At program point L9406(lines 9348 9407) the Hoare annotation is: true [2022-11-25 17:54:39,705 INFO L902 garLoopResultBuilder]: At program point L9365-2(lines 9365 9399) the Hoare annotation is: true [2022-11-25 17:54:39,705 INFO L899 garLoopResultBuilder]: For program point L9365-3(lines 9365 9399) no Hoare annotation was computed. [2022-11-25 17:54:39,705 INFO L899 garLoopResultBuilder]: For program point L9402-2(lines 9402 9404) no Hoare annotation was computed. [2022-11-25 17:54:39,706 INFO L899 garLoopResultBuilder]: For program point L9337-4(lines 9337 9343) no Hoare annotation was computed. [2022-11-25 17:54:39,706 INFO L899 garLoopResultBuilder]: For program point L9337(line 9337) no Hoare annotation was computed. [2022-11-25 17:54:39,706 INFO L902 garLoopResultBuilder]: At program point L9337-1(line 9337) the Hoare annotation is: true [2022-11-25 17:54:39,706 INFO L899 garLoopResultBuilder]: For program point L9337-2(line 9337) no Hoare annotation was computed. [2022-11-25 17:54:39,706 INFO L899 garLoopResultBuilder]: For program point L9329(lines 9329 9335) no Hoare annotation was computed. [2022-11-25 17:54:39,706 INFO L899 garLoopResultBuilder]: For program point L211-2(lines 210 212) no Hoare annotation was computed. [2022-11-25 17:54:39,706 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 210 212) the Hoare annotation is: true [2022-11-25 17:54:39,706 INFO L899 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2022-11-25 17:54:39,706 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 210 212) no Hoare annotation was computed. [2022-11-25 17:54:39,706 INFO L895 garLoopResultBuilder]: At program point aws_raise_errorENTRY(lines 1988 1999) the Hoare annotation is: (or (forall ((|v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7|)) (not (= (select |#valid| |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7|) 1)))) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (forall ((v_ArrVal_3049 Int) (|v___CPROVER_overflow_mult_~#c~1.base_78| Int)) (let ((.cse0 (select |#valid| |v___CPROVER_overflow_mult_~#c~1.base_78|))) (or (not (= .cse0 0)) (not (= .cse0 v_ArrVal_3049)))))) [2022-11-25 17:54:39,706 INFO L899 garLoopResultBuilder]: For program point aws_raise_errorFINAL(lines 1988 1999) no Hoare annotation was computed. [2022-11-25 17:54:39,707 INFO L899 garLoopResultBuilder]: For program point L7385(lines 7385 7387) no Hoare annotation was computed. [2022-11-25 17:54:39,707 INFO L899 garLoopResultBuilder]: For program point aws_raise_errorEXIT(lines 1988 1999) no Hoare annotation was computed. [2022-11-25 17:54:39,707 INFO L899 garLoopResultBuilder]: For program point can_fail_allocatorFINAL(lines 6950 6952) no Hoare annotation was computed. [2022-11-25 17:54:39,707 INFO L899 garLoopResultBuilder]: For program point can_fail_allocatorEXIT(lines 6950 6952) no Hoare annotation was computed. [2022-11-25 17:54:39,707 INFO L902 garLoopResultBuilder]: At program point can_fail_allocatorENTRY(lines 6950 6952) the Hoare annotation is: true [2022-11-25 17:54:39,707 INFO L895 garLoopResultBuilder]: At program point __CPROVER_overflow_multENTRY(lines 253 256) the Hoare annotation is: (or (forall ((|v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7|)) (not (= (select |old(#valid)| |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7|) 1)))) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) [2022-11-25 17:54:39,707 INFO L899 garLoopResultBuilder]: For program point __CPROVER_overflow_multEXIT(lines 253 256) no Hoare annotation was computed. [2022-11-25 17:54:39,707 INFO L899 garLoopResultBuilder]: For program point __CPROVER_overflow_multFINAL(lines 253 256) no Hoare annotation was computed. [2022-11-25 17:54:39,707 INFO L899 garLoopResultBuilder]: For program point aws_is_power_of_twoFINAL(lines 2626 2631) no Hoare annotation was computed. [2022-11-25 17:54:39,707 INFO L899 garLoopResultBuilder]: For program point aws_is_power_of_twoEXIT(lines 2626 2631) no Hoare annotation was computed. [2022-11-25 17:54:39,707 INFO L902 garLoopResultBuilder]: At program point aws_is_power_of_twoENTRY(lines 2626 2631) the Hoare annotation is: true [2022-11-25 17:54:39,708 INFO L895 garLoopResultBuilder]: At program point L2545(lines 2541 2546) the Hoare annotation is: (let ((.cse0 (= |aws_add_size_checked_#in~b#1| |aws_add_size_checked_aws_add_u64_checked_~b#1|)) (.cse1 (= |aws_add_size_checked_#in~r#1.base| |aws_add_size_checked_aws_add_u64_checked_~r#1.base|)) (.cse2 (= |aws_add_size_checked_#in~r#1.offset| |aws_add_size_checked_aws_add_u64_checked_~r#1.offset|)) (.cse3 (exists ((v_ArrVal_3049 Int) (|v___CPROVER_overflow_mult_~#c~1.base_78| Int)) (and (= (store |old(#valid)| |v___CPROVER_overflow_mult_~#c~1.base_78| v_ArrVal_3049) |#valid|) (= (select |old(#valid)| |v___CPROVER_overflow_mult_~#c~1.base_78|) 0)))) (.cse4 (= ~tl_last_error~0 |old(~tl_last_error~0)|)) (.cse5 (= |old(#valid)| |#valid|)) (.cse6 (= |aws_add_size_checked_#in~a#1| |aws_add_size_checked_aws_add_u64_checked_~a#1|))) (or (forall ((|v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7|)) (not (= (select |old(#valid)| |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7|) 1)))) (and .cse0 (= (select (select |#memory_int| |aws_add_size_checked_#in~r#1.base|) |aws_add_size_checked_#in~r#1.offset|) (+ |aws_add_size_checked_#in~b#1| |aws_add_size_checked_#in~a#1|)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 (<= (+ |aws_add_size_checked_aws_add_u64_checked_#res#1| 1) 0) .cse3 (or (and (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) .cse4) .cse5 .cse6))) [2022-11-25 17:54:39,708 INFO L895 garLoopResultBuilder]: At program point aws_add_size_checkedENTRY(lines 2613 2621) the Hoare annotation is: (or (forall ((|v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7|)) (not (= (select |old(#valid)| |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7|) 1)))) (and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= |old(#valid)| |#valid|))) [2022-11-25 17:54:39,708 INFO L895 garLoopResultBuilder]: At program point L2542(line 2542) the Hoare annotation is: (or (forall ((|v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7|)) (not (= (select |old(#valid)| |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7|) 1)))) (and (= |aws_add_size_checked_#in~b#1| |aws_add_size_checked_aws_add_u64_checked_~b#1|) (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |aws_add_size_checked_#in~r#1.base| |aws_add_size_checked_aws_add_u64_checked_~r#1.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |aws_add_size_checked_#in~r#1.offset| |aws_add_size_checked_aws_add_u64_checked_~r#1.offset|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= |old(#valid)| |#valid|) (= |aws_add_size_checked_#in~a#1| |aws_add_size_checked_aws_add_u64_checked_~a#1|))) [2022-11-25 17:54:39,708 INFO L899 garLoopResultBuilder]: For program point L2543-1(line 2543) no Hoare annotation was computed. [2022-11-25 17:54:39,708 INFO L895 garLoopResultBuilder]: At program point L2543(line 2543) the Hoare annotation is: (or (and (= |aws_add_size_checked_#in~b#1| |aws_add_size_checked_aws_add_u64_checked_~b#1|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |aws_add_size_checked_#in~r#1.base| |aws_add_size_checked_aws_add_u64_checked_~r#1.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |aws_add_size_checked_#in~r#1.offset| |aws_add_size_checked_aws_add_u64_checked_~r#1.offset|) (exists ((v_ArrVal_3049 Int) (|v___CPROVER_overflow_mult_~#c~1.base_78| Int)) (and (= (store |old(#valid)| |v___CPROVER_overflow_mult_~#c~1.base_78| v_ArrVal_3049) |#valid|) (= (select |old(#valid)| |v___CPROVER_overflow_mult_~#c~1.base_78|) 0))) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= |old(#valid)| |#valid|) (= |aws_add_size_checked_#in~a#1| |aws_add_size_checked_aws_add_u64_checked_~a#1|)) (forall ((|v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7|)) (not (= (select |old(#valid)| |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7|) 1))))) [2022-11-25 17:54:39,709 INFO L899 garLoopResultBuilder]: For program point L2542-1(lines 2542 2543) no Hoare annotation was computed. [2022-11-25 17:54:39,709 INFO L899 garLoopResultBuilder]: For program point aws_add_size_checkedFINAL(lines 2613 2621) no Hoare annotation was computed. [2022-11-25 17:54:39,709 INFO L899 garLoopResultBuilder]: For program point aws_add_size_checkedEXIT(lines 2613 2621) no Hoare annotation was computed. [2022-11-25 17:54:39,709 INFO L899 garLoopResultBuilder]: For program point L6815-1(line 6815) no Hoare annotation was computed. [2022-11-25 17:54:39,709 INFO L895 garLoopResultBuilder]: At program point L6815(line 6815) the Hoare annotation is: (and (= |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.offset| 0) (not (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base| |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base|)) (= |ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries#1| 4) (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base|) 1) (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base|) (not (= |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base| 0)) (<= (mod |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1| 18446744073709551616) 4) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base| |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base|) (= |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.offset| |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset|)) [2022-11-25 17:54:39,709 INFO L895 garLoopResultBuilder]: At program point L6811-1(line 6811) the Hoare annotation is: (and (= |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.offset| 0) (= |ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries#1| 4) (= (select |#valid| |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base|) 1) (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base|) (not (= |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base| 0)) (<= (mod |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1| 18446744073709551616) 4) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base| |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base|) (= |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.offset| |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset|)) [2022-11-25 17:54:39,709 INFO L895 garLoopResultBuilder]: At program point L6811(line 6811) the Hoare annotation is: (and (= |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.offset| 0) (= |ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries#1| 4) (= (select |#valid| |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base|) 1) (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base|) (not (= |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base| 0)) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base| |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base|) (= |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.offset| |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset|)) [2022-11-25 17:54:39,709 INFO L902 garLoopResultBuilder]: At program point L10176(line 10176) the Hoare annotation is: true [2022-11-25 17:54:39,709 INFO L899 garLoopResultBuilder]: For program point L6815-3(line 6815) no Hoare annotation was computed. [2022-11-25 17:54:39,710 INFO L895 garLoopResultBuilder]: At program point L6815-2(line 6815) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.offset| 0)) (.cse1 (not (= |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base| 0))) (.cse2 (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base| |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base|)) (.cse3 (= |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.offset| |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset|))) (or (and .cse0 (<= (+ |ULTIMATE.start_ensure_allocated_hash_table_#t~ret548#1| 1) 0) .cse1 .cse2 .cse3) (and .cse0 (= (+ (* |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1| 24) 442721857768999609256) (select (select |#memory_int| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base|) |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.offset|)) (not (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base| |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base|)) (= |ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries#1| 4) (= |ULTIMATE.start_ensure_allocated_hash_table_#t~ret548#1| 0) (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base|) 1) (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base|) .cse1 (<= (mod |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1| 18446744073709551616) 4) .cse2 .cse3))) [2022-11-25 17:54:39,710 INFO L899 garLoopResultBuilder]: For program point L10135-2(line 10135) no Hoare annotation was computed. [2022-11-25 17:54:39,710 INFO L899 garLoopResultBuilder]: For program point L6840-1(line 6840) no Hoare annotation was computed. [2022-11-25 17:54:39,710 INFO L899 garLoopResultBuilder]: For program point L10164(line 10164) no Hoare annotation was computed. [2022-11-25 17:54:39,710 INFO L895 garLoopResultBuilder]: At program point L6840(line 6840) the Hoare annotation is: false [2022-11-25 17:54:39,710 INFO L895 garLoopResultBuilder]: At program point L10164-2(line 10164) the Hoare annotation is: false [2022-11-25 17:54:39,710 INFO L895 garLoopResultBuilder]: At program point L10135(line 10135) the Hoare annotation is: false [2022-11-25 17:54:39,710 INFO L895 garLoopResultBuilder]: At program point L10135-1(line 10135) the Hoare annotation is: false [2022-11-25 17:54:39,711 INFO L899 garLoopResultBuilder]: For program point L10164-3(line 10164) no Hoare annotation was computed. [2022-11-25 17:54:39,711 INFO L899 garLoopResultBuilder]: For program point L10160(lines 10160 10174) no Hoare annotation was computed. [2022-11-25 17:54:39,711 INFO L899 garLoopResultBuilder]: For program point L10160-1(lines 10160 10174) no Hoare annotation was computed. [2022-11-25 17:54:39,711 INFO L895 garLoopResultBuilder]: At program point L10173(line 10173) the Hoare annotation is: false [2022-11-25 17:54:39,711 INFO L899 garLoopResultBuilder]: For program point L6816-1(line 6816) no Hoare annotation was computed. [2022-11-25 17:54:39,711 INFO L899 garLoopResultBuilder]: For program point L10173-1(line 10173) no Hoare annotation was computed. [2022-11-25 17:54:39,711 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-25 17:54:39,712 INFO L895 garLoopResultBuilder]: At program point L6816(line 6816) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base|) 0))) (and (= |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.offset| 0) (not (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base| |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base|)) (= |ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries#1| 4) (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.offset| 0) (= .cse0 (+ (* |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1| 24) 442721857768999609256)) (= (select |#valid| |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base|) 1) (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base|) (not (= |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base| 0)) (= .cse0 |ULTIMATE.start_ensure_allocated_hash_table_#t~mem549#1|) (<= (mod |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1| 18446744073709551616) 4) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base| |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base|) (= |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.offset| |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset|))) [2022-11-25 17:54:39,712 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-25 17:54:39,712 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-11-25 17:54:39,712 INFO L899 garLoopResultBuilder]: For program point L6812-1(line 6812) no Hoare annotation was computed. [2022-11-25 17:54:39,712 INFO L895 garLoopResultBuilder]: At program point L6812(line 6812) the Hoare annotation is: (and (= |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.offset| 0) (= |ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries#1| 4) (= (select |#valid| |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base|) 1) (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base|) (not (= |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base| 0)) (<= (mod |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1| 18446744073709551616) 4) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base| |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base|) (= |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.offset| |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset|)) [2022-11-25 17:54:39,713 INFO L899 garLoopResultBuilder]: For program point L10132(lines 10132 10175) no Hoare annotation was computed. [2022-11-25 17:54:39,713 INFO L899 garLoopResultBuilder]: For program point L6841-1(line 6841) no Hoare annotation was computed. [2022-11-25 17:54:39,713 INFO L895 garLoopResultBuilder]: At program point L6841(line 6841) the Hoare annotation is: false [2022-11-25 17:54:39,713 INFO L895 garLoopResultBuilder]: At program point L6833(lines 6831 6834) the Hoare annotation is: false [2022-11-25 17:54:39,713 INFO L899 garLoopResultBuilder]: For program point L10161(lines 10161 10167) no Hoare annotation was computed. [2022-11-25 17:54:39,713 INFO L899 garLoopResultBuilder]: For program point L10161-2(lines 10160 10172) no Hoare annotation was computed. [2022-11-25 17:54:39,714 INFO L895 garLoopResultBuilder]: At program point L10141(line 10141) the Hoare annotation is: false [2022-11-25 17:54:39,714 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-25 17:54:39,714 INFO L899 garLoopResultBuilder]: For program point L10141-1(line 10141) no Hoare annotation was computed. [2022-11-25 17:54:39,714 INFO L895 garLoopResultBuilder]: At program point L10170(line 10170) the Hoare annotation is: false [2022-11-25 17:54:39,714 INFO L899 garLoopResultBuilder]: For program point L6809(lines 6809 6819) no Hoare annotation was computed. [2022-11-25 17:54:39,714 INFO L895 garLoopResultBuilder]: At program point L10162(line 10162) the Hoare annotation is: false [2022-11-25 17:54:39,714 INFO L895 garLoopResultBuilder]: At program point L10170-1(line 10170) the Hoare annotation is: false [2022-11-25 17:54:39,715 INFO L899 garLoopResultBuilder]: For program point L10170-2(line 10170) no Hoare annotation was computed. [2022-11-25 17:54:39,715 INFO L895 garLoopResultBuilder]: At program point L10154(lines 10154 10158) the Hoare annotation is: false [2022-11-25 17:54:39,715 INFO L899 garLoopResultBuilder]: For program point L10162-1(line 10162) no Hoare annotation was computed. [2022-11-25 17:54:39,715 INFO L899 garLoopResultBuilder]: For program point L10154-1(lines 10154 10158) no Hoare annotation was computed. [2022-11-25 17:54:39,715 INFO L895 garLoopResultBuilder]: At program point L10138(line 10138) the Hoare annotation is: false [2022-11-25 17:54:39,715 INFO L895 garLoopResultBuilder]: At program point L6810(line 6810) the Hoare annotation is: (and (= |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.offset| 0) (= |ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries#1| 4) (= (select |#valid| |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base|) 1) (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base|) (not (= |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base| 0)) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base| |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base|) (= |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.offset| |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset|)) [2022-11-25 17:54:39,716 INFO L895 garLoopResultBuilder]: At program point L6843(lines 6837 6844) the Hoare annotation is: false [2022-11-25 17:54:39,716 INFO L899 garLoopResultBuilder]: For program point L6839-1(line 6839) no Hoare annotation was computed. [2022-11-25 17:54:39,716 INFO L895 garLoopResultBuilder]: At program point L6839(line 6839) the Hoare annotation is: false [2022-11-25 17:54:39,716 INFO L899 garLoopResultBuilder]: For program point L6810-1(line 6810) no Hoare annotation was computed. [2022-11-25 17:54:39,716 INFO L899 garLoopResultBuilder]: For program point L10138-1(line 10138) no Hoare annotation was computed. [2022-11-25 17:54:39,716 INFO L899 garLoopResultBuilder]: For program point L10159-2(line 10159) no Hoare annotation was computed. [2022-11-25 17:54:39,717 INFO L895 garLoopResultBuilder]: At program point L10159(line 10159) the Hoare annotation is: false [2022-11-25 17:54:39,717 INFO L895 garLoopResultBuilder]: At program point L10159-1(line 10159) the Hoare annotation is: false [2022-11-25 17:54:39,717 INFO L899 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2022-11-25 17:54:39,717 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 222 224) the Hoare annotation is: true [2022-11-25 17:54:39,717 INFO L899 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2022-11-25 17:54:39,717 INFO L899 garLoopResultBuilder]: For program point L223-3(lines 222 224) no Hoare annotation was computed. [2022-11-25 17:54:39,717 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 222 224) no Hoare annotation was computed. [2022-11-25 17:54:39,717 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2022-11-25 17:54:39,720 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:54:39,723 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 17:54:39,735 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7,QUANTIFIED] [2022-11-25 17:54:39,736 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7,QUANTIFIED] [2022-11-25 17:54:39,737 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_3049,QUANTIFIED] [2022-11-25 17:54:39,737 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_78,QUANTIFIED] [2022-11-25 17:54:39,737 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_78,QUANTIFIED] [2022-11-25 17:54:39,740 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 17:54:39,741 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 17:54:39,742 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_3049,QUANTIFIED] [2022-11-25 17:54:39,742 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_78,QUANTIFIED] [2022-11-25 17:54:39,742 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_78,QUANTIFIED] [2022-11-25 17:54:39,742 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-25 17:54:39,742 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-25 17:54:39,746 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7,QUANTIFIED] [2022-11-25 17:54:39,746 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7,QUANTIFIED] [2022-11-25 17:54:39,746 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_3049,QUANTIFIED] [2022-11-25 17:54:39,747 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_78,QUANTIFIED] [2022-11-25 17:54:39,747 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_78,QUANTIFIED] [2022-11-25 17:54:39,747 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 17:54:39,748 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 17:54:39,748 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_3049,QUANTIFIED] [2022-11-25 17:54:39,748 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_78,QUANTIFIED] [2022-11-25 17:54:39,748 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_78,QUANTIFIED] [2022-11-25 17:54:39,748 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-25 17:54:39,749 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-25 17:54:39,750 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7,QUANTIFIED] [2022-11-25 17:54:39,751 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7,QUANTIFIED] [2022-11-25 17:54:39,751 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_3049,QUANTIFIED] [2022-11-25 17:54:39,751 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_78,QUANTIFIED] [2022-11-25 17:54:39,751 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_78,QUANTIFIED] [2022-11-25 17:54:39,752 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_3049,QUANTIFIED] [2022-11-25 17:54:39,752 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_78,QUANTIFIED] [2022-11-25 17:54:39,752 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_78,QUANTIFIED] [2022-11-25 17:54:39,752 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 17:54:39,752 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 17:54:39,753 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-25 17:54:39,753 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-25 17:54:39,754 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7,QUANTIFIED] [2022-11-25 17:54:39,754 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7,QUANTIFIED] [2022-11-25 17:54:39,755 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_3049,QUANTIFIED] [2022-11-25 17:54:39,755 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_78,QUANTIFIED] [2022-11-25 17:54:39,755 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_78,QUANTIFIED] [2022-11-25 17:54:39,755 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_3049,QUANTIFIED] [2022-11-25 17:54:39,756 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_78,QUANTIFIED] [2022-11-25 17:54:39,756 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_78,QUANTIFIED] [2022-11-25 17:54:39,756 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 17:54:39,756 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 17:54:39,756 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-25 17:54:39,757 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-25 17:54:39,758 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 05:54:39 BoogieIcfgContainer [2022-11-25 17:54:39,758 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 17:54:39,759 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 17:54:39,759 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 17:54:39,759 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 17:54:39,760 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:43:20" (3/4) ... [2022-11-25 17:54:39,763 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-25 17:54:39,770 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure uninterpreted_equals [2022-11-25 17:54:39,770 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure bounded_malloc [2022-11-25 17:54:39,770 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __CPROVER_uninterpreted_equals [2022-11-25 17:54:39,770 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __CPROVER_uninterpreted_hasher [2022-11-25 17:54:39,771 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_hash_table_is_valid [2022-11-25 17:54:39,771 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_bool [2022-11-25 17:54:39,771 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_mem_release [2022-11-25 17:54:39,771 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure hash_table_state_required_bytes [2022-11-25 17:54:39,771 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure can_fail_calloc [2022-11-25 17:54:39,771 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure s_update_template_size [2022-11-25 17:54:39,771 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_allocator_is_valid [2022-11-25 17:54:39,771 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure s_hash_keys_eq [2022-11-25 17:54:39,772 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_mul_size_checked [2022-11-25 17:54:39,772 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_uint64_t [2022-11-25 17:54:39,772 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure s_hash_for [2022-11-25 17:54:39,772 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __CPROVER_overflow_plus [2022-11-25 17:54:39,772 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2022-11-25 17:54:39,772 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_hash_table_create [2022-11-25 17:54:39,772 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure hash_table_state_is_valid [2022-11-25 17:54:39,772 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure s_safe_eq_check [2022-11-25 17:54:39,773 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure s_alloc_state [2022-11-25 17:54:39,773 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure s_emplace_item [2022-11-25 17:54:39,773 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure s_find_entry [2022-11-25 17:54:39,773 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2022-11-25 17:54:39,773 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_raise_error [2022-11-25 17:54:39,773 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure can_fail_allocator [2022-11-25 17:54:39,773 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __CPROVER_overflow_mult [2022-11-25 17:54:39,773 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_is_power_of_two [2022-11-25 17:54:39,774 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_add_size_checked [2022-11-25 17:54:39,774 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2022-11-25 17:54:39,797 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 256 nodes and edges [2022-11-25 17:54:39,799 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 105 nodes and edges [2022-11-25 17:54:39,801 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 38 nodes and edges [2022-11-25 17:54:39,805 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2022-11-25 17:54:39,808 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2022-11-25 17:54:39,809 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-11-25 17:54:39,811 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-25 17:54:39,813 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-25 17:54:39,862 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((forall v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7 : int :: !(unknown-#StackHeapBarrier-unknown < v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7) || !(\old(\valid)[v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7] == 1)) || ((((((((\old(b) * \old(a) == unknown-#memory_int-unknown[r][r] && (\exists v_ArrVal_3049 : int, v___CPROVER_overflow_mult_~#c~1.base_78 : int :: \old(\valid)[v___CPROVER_overflow_mult_~#c~1.base_78 := v_ArrVal_3049] == \valid && \old(\valid)[v___CPROVER_overflow_mult_~#c~1.base_78] == 0)) && r == r) && tl_last_error == \old(tl_last_error)) && \old(a) == a) && \old(b) == b) && \result == 0) && \old(\valid) == \valid) && r == r)) || ((((((((((\old(unknown-#memory_real-unknown) == unknown-#memory_real-unknown && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && (\exists v_ArrVal_3049 : int, v___CPROVER_overflow_mult_~#c~1.base_78 : int :: \old(\valid)[v___CPROVER_overflow_mult_~#c~1.base_78 := v_ArrVal_3049] == \valid && \old(\valid)[v___CPROVER_overflow_mult_~#c~1.base_78] == 0)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && r == r) && \old(a) == a) && \result + 1 <= 0) && \old(b) == b) && \old(\valid) == \valid) && r == r) [2022-11-25 17:54:39,864 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((forall v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7 : int :: !(unknown-#StackHeapBarrier-unknown < v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7) || !(\old(\valid)[v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7] == 1)) || (((((((\old(b) == b && unknown-#memory_int-unknown[r][r] == \old(b) + \old(a)) && r == r) && r == r) && (\exists v_ArrVal_3049 : int, v___CPROVER_overflow_mult_~#c~1.base_78 : int :: \old(\valid)[v___CPROVER_overflow_mult_~#c~1.base_78 := v_ArrVal_3049] == \valid && \old(\valid)[v___CPROVER_overflow_mult_~#c~1.base_78] == 0)) && tl_last_error == \old(tl_last_error)) && \old(\valid) == \valid) && \old(a) == a)) || (((((((\old(b) == b && r == r) && r == r) && \result + 1 <= 0) && (\exists v_ArrVal_3049 : int, v___CPROVER_overflow_mult_~#c~1.base_78 : int :: \old(\valid)[v___CPROVER_overflow_mult_~#c~1.base_78 := v_ArrVal_3049] == \valid && \old(\valid)[v___CPROVER_overflow_mult_~#c~1.base_78] == 0)) && ((((\old(unknown-#memory_real-unknown) == unknown-#memory_real-unknown && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) || tl_last_error == \old(tl_last_error))) && \old(\valid) == \valid) && \old(a) == a) [2022-11-25 17:54:40,288 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb76e2f-1ba5-4fda-92f9-12f4945b22ff/bin/uautomizer-ZsLfNo2U6R/witness.graphml [2022-11-25 17:54:40,289 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 17:54:40,290 INFO L158 Benchmark]: Toolchain (without parser) took 686409.19ms. Allocated memory was 178.3MB in the beginning and 597.7MB in the end (delta: 419.4MB). Free memory was 124.2MB in the beginning and 196.5MB in the end (delta: -72.3MB). Peak memory consumption was 347.6MB. Max. memory is 16.1GB. [2022-11-25 17:54:40,290 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 127.9MB. Free memory is still 73.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 17:54:40,290 INFO L158 Benchmark]: CACSL2BoogieTranslator took 3937.27ms. Allocated memory was 178.3MB in the beginning and 237.0MB in the end (delta: 58.7MB). Free memory was 124.2MB in the beginning and 117.1MB in the end (delta: 7.1MB). Peak memory consumption was 97.8MB. Max. memory is 16.1GB. [2022-11-25 17:54:40,291 INFO L158 Benchmark]: Boogie Procedure Inliner took 261.29ms. Allocated memory is still 237.0MB. Free memory was 117.1MB in the beginning and 165.8MB in the end (delta: -48.6MB). Peak memory consumption was 11.1MB. Max. memory is 16.1GB. [2022-11-25 17:54:40,291 INFO L158 Benchmark]: Boogie Preprocessor took 136.57ms. Allocated memory is still 237.0MB. Free memory was 165.8MB in the beginning and 154.2MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-25 17:54:40,291 INFO L158 Benchmark]: RCFGBuilder took 2633.28ms. Allocated memory is still 237.0MB. Free memory was 154.2MB in the beginning and 92.2MB in the end (delta: 62.1MB). Peak memory consumption was 69.4MB. Max. memory is 16.1GB. [2022-11-25 17:54:40,292 INFO L158 Benchmark]: TraceAbstraction took 678901.69ms. Allocated memory was 237.0MB in the beginning and 597.7MB in the end (delta: 360.7MB). Free memory was 92.2MB in the beginning and 327.6MB in the end (delta: -235.5MB). Peak memory consumption was 125.3MB. Max. memory is 16.1GB. [2022-11-25 17:54:40,292 INFO L158 Benchmark]: Witness Printer took 529.95ms. Allocated memory is still 597.7MB. Free memory was 327.6MB in the beginning and 196.5MB in the end (delta: 131.1MB). Peak memory consumption was 130.0MB. Max. memory is 16.1GB. [2022-11-25 17:54:40,293 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.31ms. Allocated memory is still 127.9MB. Free memory is still 73.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 3937.27ms. Allocated memory was 178.3MB in the beginning and 237.0MB in the end (delta: 58.7MB). Free memory was 124.2MB in the beginning and 117.1MB in the end (delta: 7.1MB). Peak memory consumption was 97.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 261.29ms. Allocated memory is still 237.0MB. Free memory was 117.1MB in the beginning and 165.8MB in the end (delta: -48.6MB). Peak memory consumption was 11.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 136.57ms. Allocated memory is still 237.0MB. Free memory was 165.8MB in the beginning and 154.2MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * RCFGBuilder took 2633.28ms. Allocated memory is still 237.0MB. Free memory was 154.2MB in the beginning and 92.2MB in the end (delta: 62.1MB). Peak memory consumption was 69.4MB. Max. memory is 16.1GB. * TraceAbstraction took 678901.69ms. Allocated memory was 237.0MB in the beginning and 597.7MB in the end (delta: 360.7MB). Free memory was 92.2MB in the beginning and 327.6MB in the end (delta: -235.5MB). Peak memory consumption was 125.3MB. Max. memory is 16.1GB. * Witness Printer took 529.95ms. Allocated memory is still 597.7MB. Free memory was 327.6MB in the beginning and 196.5MB in the end (delta: 131.1MB). Peak memory consumption was 130.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_3049,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_78,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_78,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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_3049,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_78,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_78,QUANTIFIED] - 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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_3049,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_78,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_78,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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_3049,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_78,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_78,QUANTIFIED] - 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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_3049,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_78,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_78,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_3049,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_78,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_78,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$.offset - 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[v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_3049,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_78,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_78,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_3049,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_78,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_78,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$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 31 procedures, 347 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 678.8s, OverallIterations: 19, TraceHistogramMax: 10, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 114.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 17 mSolverCounterUnknown, 7653 SdHoareTripleChecker+Valid, 100.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6931 mSDsluCounter, 32205 SdHoareTripleChecker+Invalid, 94.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 458 IncrementalHoareTripleChecker+Unchecked, 26667 mSDsCounter, 3583 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 35155 IncrementalHoareTripleChecker+Invalid, 39213 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3583 mSolverCounterUnsat, 5538 mSDtfsCounter, 35155 mSolverCounterSat, 0.5s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2365 GetRequests, 2042 SyntacticMatches, 9 SemanticMatches, 314 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1993 ImplicationChecksByTransitivity, 36.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=520occurred in iteration=17, InterpolantAutomatonStates: 228, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 19 MinimizatonAttempts, 1340 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 134 LocationsWithAnnotation, 2936 PreInvPairs, 2967 NumberOfFragments, 1178 HoareAnnotationTreeSize, 2936 FomulaSimplifications, 1323 FormulaSimplificationTreeSizeReduction, 0.5s HoareSimplificationTime, 134 FomulaSimplificationsInter, 500 FormulaSimplificationTreeSizeReductionInter, 1.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.8s SsaConstructionTime, 506.3s SatisfiabilityAnalysisTime, 48.4s InterpolantComputationTime, 3659 NumberOfCodeBlocks, 3659 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 3690 ConstructedInterpolants, 52 QuantifiedInterpolants, 7956 SizeOfPredicates, 70 NumberOfNonLiveVariables, 18916 ConjunctsInSsa, 555 ConjunctsInUnsatCore, 23 InterpolantComputations, 17 PerfectInterpolantSequences, 4294/4352 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 1 specifications checked. All of them hold - InvariantResult [Line: 6934]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 9448]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 9100]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 10176]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 9502]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7348]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 262]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7369]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 9365]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6831]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 9154]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2637]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6837]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 7280]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 9348]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2497]: Loop Invariant [2022-11-25 17:54:40,307 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7,QUANTIFIED] [2022-11-25 17:54:40,308 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7,QUANTIFIED] [2022-11-25 17:54:40,308 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_3049,QUANTIFIED] [2022-11-25 17:54:40,308 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_78,QUANTIFIED] [2022-11-25 17:54:40,308 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_78,QUANTIFIED] [2022-11-25 17:54:40,309 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 17:54:40,309 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 17:54:40,309 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_3049,QUANTIFIED] [2022-11-25 17:54:40,309 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_78,QUANTIFIED] [2022-11-25 17:54:40,309 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_78,QUANTIFIED] [2022-11-25 17:54:40,310 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-25 17:54:40,310 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-25 17:54:40,311 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7,QUANTIFIED] [2022-11-25 17:54:40,311 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7,QUANTIFIED] [2022-11-25 17:54:40,312 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_3049,QUANTIFIED] [2022-11-25 17:54:40,312 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_78,QUANTIFIED] [2022-11-25 17:54:40,312 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_78,QUANTIFIED] [2022-11-25 17:54:40,312 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 17:54:40,312 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 17:54:40,313 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_3049,QUANTIFIED] [2022-11-25 17:54:40,313 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_78,QUANTIFIED] [2022-11-25 17:54:40,313 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_78,QUANTIFIED] [2022-11-25 17:54:40,313 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-25 17:54:40,313 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: ((forall v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7 : int :: !(unknown-#StackHeapBarrier-unknown < v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7) || !(\old(\valid)[v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7] == 1)) || ((((((((\old(b) * \old(a) == unknown-#memory_int-unknown[r][r] && (\exists v_ArrVal_3049 : int, v___CPROVER_overflow_mult_~#c~1.base_78 : int :: \old(\valid)[v___CPROVER_overflow_mult_~#c~1.base_78 := v_ArrVal_3049] == \valid && \old(\valid)[v___CPROVER_overflow_mult_~#c~1.base_78] == 0)) && r == r) && tl_last_error == \old(tl_last_error)) && \old(a) == a) && \old(b) == b) && \result == 0) && \old(\valid) == \valid) && r == r)) || ((((((((((\old(unknown-#memory_real-unknown) == unknown-#memory_real-unknown && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && (\exists v_ArrVal_3049 : int, v___CPROVER_overflow_mult_~#c~1.base_78 : int :: \old(\valid)[v___CPROVER_overflow_mult_~#c~1.base_78 := v_ArrVal_3049] == \valid && \old(\valid)[v___CPROVER_overflow_mult_~#c~1.base_78] == 0)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && r == r) && \old(a) == a) && \result + 1 <= 0) && \old(b) == b) && \old(\valid) == \valid) && r == r) - InvariantResult [Line: 2541]: Loop Invariant [2022-11-25 17:54:40,315 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7,QUANTIFIED] [2022-11-25 17:54:40,315 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7,QUANTIFIED] [2022-11-25 17:54:40,315 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_3049,QUANTIFIED] [2022-11-25 17:54:40,315 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_78,QUANTIFIED] [2022-11-25 17:54:40,315 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_78,QUANTIFIED] [2022-11-25 17:54:40,316 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_3049,QUANTIFIED] [2022-11-25 17:54:40,316 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_78,QUANTIFIED] [2022-11-25 17:54:40,316 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_78,QUANTIFIED] [2022-11-25 17:54:40,316 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 17:54:40,316 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 17:54:40,317 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-25 17:54:40,317 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-25 17:54:40,318 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7,QUANTIFIED] [2022-11-25 17:54:40,318 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7,QUANTIFIED] [2022-11-25 17:54:40,318 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_3049,QUANTIFIED] [2022-11-25 17:54:40,318 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_78,QUANTIFIED] [2022-11-25 17:54:40,319 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_78,QUANTIFIED] [2022-11-25 17:54:40,319 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_3049,QUANTIFIED] [2022-11-25 17:54:40,319 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_78,QUANTIFIED] [2022-11-25 17:54:40,319 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_78,QUANTIFIED] [2022-11-25 17:54:40,319 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 17:54:40,320 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 17:54:40,320 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-25 17:54:40,320 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: ((forall v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7 : int :: !(unknown-#StackHeapBarrier-unknown < v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7) || !(\old(\valid)[v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7] == 1)) || (((((((\old(b) == b && unknown-#memory_int-unknown[r][r] == \old(b) + \old(a)) && r == r) && r == r) && (\exists v_ArrVal_3049 : int, v___CPROVER_overflow_mult_~#c~1.base_78 : int :: \old(\valid)[v___CPROVER_overflow_mult_~#c~1.base_78 := v_ArrVal_3049] == \valid && \old(\valid)[v___CPROVER_overflow_mult_~#c~1.base_78] == 0)) && tl_last_error == \old(tl_last_error)) && \old(\valid) == \valid) && \old(a) == a)) || (((((((\old(b) == b && r == r) && r == r) && \result + 1 <= 0) && (\exists v_ArrVal_3049 : int, v___CPROVER_overflow_mult_~#c~1.base_78 : int :: \old(\valid)[v___CPROVER_overflow_mult_~#c~1.base_78 := v_ArrVal_3049] == \valid && \old(\valid)[v___CPROVER_overflow_mult_~#c~1.base_78] == 0)) && ((((\old(unknown-#memory_real-unknown) == unknown-#memory_real-unknown && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) || tl_last_error == \old(tl_last_error))) && \old(\valid) == \valid) && \old(a) == a) - InvariantResult [Line: 9433]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7001]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 9484]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 9437]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-11-25 17:54:40,456 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb76e2f-1ba5-4fda-92f9-12f4945b22ff/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE