./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/aws-c-common/aws_string_eq_byte_cursor_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 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_8f6eb4d4-5989-4681-8d1b-fe1a2e701a6b/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f6eb4d4-5989-4681-8d1b-fe1a2e701a6b/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f6eb4d4-5989-4681-8d1b-fe1a2e701a6b/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f6eb4d4-5989-4681-8d1b-fe1a2e701a6b/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/aws-c-common/aws_string_eq_byte_cursor_harness.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f6eb4d4-5989-4681-8d1b-fe1a2e701a6b/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f6eb4d4-5989-4681-8d1b-fe1a2e701a6b/bin/uautomizer-uyxdKDjOR8 --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 caa9ea3c4b01be424b9d4542ff8acdcb39307db8022d65ba85a629a6a4ef591a --- 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-2329fc7 [2022-12-13 15:27:19,676 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 15:27:19,677 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 15:27:19,689 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 15:27:19,689 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 15:27:19,690 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 15:27:19,691 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 15:27:19,692 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 15:27:19,693 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 15:27:19,694 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 15:27:19,694 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 15:27:19,695 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 15:27:19,695 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 15:27:19,696 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 15:27:19,696 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 15:27:19,697 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 15:27:19,698 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 15:27:19,698 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 15:27:19,699 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 15:27:19,700 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 15:27:19,701 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 15:27:19,703 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 15:27:19,704 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 15:27:19,704 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 15:27:19,708 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 15:27:19,708 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 15:27:19,709 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 15:27:19,709 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 15:27:19,710 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 15:27:19,711 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 15:27:19,711 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 15:27:19,712 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 15:27:19,712 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 15:27:19,713 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 15:27:19,714 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 15:27:19,714 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 15:27:19,715 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 15:27:19,715 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 15:27:19,715 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 15:27:19,716 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 15:27:19,716 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 15:27:19,717 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f6eb4d4-5989-4681-8d1b-fe1a2e701a6b/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-12-13 15:27:19,737 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 15:27:19,737 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 15:27:19,737 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 15:27:19,737 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 15:27:19,738 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 15:27:19,738 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 15:27:19,739 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 15:27:19,739 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 15:27:19,739 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 15:27:19,739 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 15:27:19,739 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 15:27:19,740 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 15:27:19,740 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 15:27:19,740 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 15:27:19,740 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 15:27:19,740 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 15:27:19,740 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 15:27:19,741 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 15:27:19,741 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 15:27:19,741 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 15:27:19,741 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 15:27:19,741 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 15:27:19,741 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 15:27:19,742 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 15:27:19,742 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 15:27:19,742 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 15:27:19,742 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 15:27:19,742 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 15:27:19,742 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 15:27:19,743 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 15:27:19,743 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 15:27:19,743 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 15:27:19,743 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_8f6eb4d4-5989-4681-8d1b-fe1a2e701a6b/bin/uautomizer-uyxdKDjOR8/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_8f6eb4d4-5989-4681-8d1b-fe1a2e701a6b/bin/uautomizer-uyxdKDjOR8 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 -> caa9ea3c4b01be424b9d4542ff8acdcb39307db8022d65ba85a629a6a4ef591a [2022-12-13 15:27:19,910 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 15:27:19,927 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 15:27:19,929 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 15:27:19,931 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 15:27:19,931 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 15:27:19,932 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f6eb4d4-5989-4681-8d1b-fe1a2e701a6b/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/aws-c-common/aws_string_eq_byte_cursor_harness.i [2022-12-13 15:27:22,533 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 15:27:22,863 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 15:27:22,863 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f6eb4d4-5989-4681-8d1b-fe1a2e701a6b/sv-benchmarks/c/aws-c-common/aws_string_eq_byte_cursor_harness.i [2022-12-13 15:27:22,882 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f6eb4d4-5989-4681-8d1b-fe1a2e701a6b/bin/uautomizer-uyxdKDjOR8/data/5224a5c0a/7128ecde16b34cbc8338725706422327/FLAG5c9c0d856 [2022-12-13 15:27:22,896 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f6eb4d4-5989-4681-8d1b-fe1a2e701a6b/bin/uautomizer-uyxdKDjOR8/data/5224a5c0a/7128ecde16b34cbc8338725706422327 [2022-12-13 15:27:22,899 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 15:27:22,900 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 15:27:22,902 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 15:27:22,902 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 15:27:22,905 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 15:27:22,906 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 03:27:22" (1/1) ... [2022-12-13 15:27:22,907 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c288e95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:27:22, skipping insertion in model container [2022-12-13 15:27:22,907 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 03:27:22" (1/1) ... [2022-12-13 15:27:22,915 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 15:27:23,005 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 15:27:23,218 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_8f6eb4d4-5989-4681-8d1b-fe1a2e701a6b/sv-benchmarks/c/aws-c-common/aws_string_eq_byte_cursor_harness.i[4499,4512] [2022-12-13 15:27:23,224 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_8f6eb4d4-5989-4681-8d1b-fe1a2e701a6b/sv-benchmarks/c/aws-c-common/aws_string_eq_byte_cursor_harness.i[4559,4572] [2022-12-13 15:27:23,930 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 15:27:23,930 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 15:27:23,931 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 15:27:23,931 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 15:27:23,932 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 15:27:23,942 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 15:27:23,942 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 15:27:23,944 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 15:27:23,944 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 15:27:24,015 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-12-13 15:27:24,015 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-12-13 15:27:24,016 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-12-13 15:27:24,019 WARN L623 FunctionHandler]: Unknown extern function ntohl [2022-12-13 15:27:24,021 WARN L623 FunctionHandler]: Unknown extern function htons [2022-12-13 15:27:24,021 WARN L623 FunctionHandler]: Unknown extern function ntohs [2022-12-13 15:27:24,309 WARN L623 FunctionHandler]: Unknown extern function my_abort [2022-12-13 15:27:24,311 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-12-13 15:27:24,312 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-12-13 15:27:24,313 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-12-13 15:27:24,314 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-12-13 15:27:24,316 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-12-13 15:27:24,316 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-12-13 15:27:24,317 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-12-13 15:27:24,318 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-12-13 15:27:24,318 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-12-13 15:27:24,319 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-12-13 15:27:24,451 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-12-13 15:27:24,486 WARN L623 FunctionHandler]: Unknown extern function memchr [2022-12-13 15:27:24,496 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-12-13 15:27:24,522 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-12-13 15:27:24,528 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 15:27:24,529 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 15:27:24,570 WARN L623 FunctionHandler]: Unknown extern function fprintf [2022-12-13 15:27:24,578 WARN L623 FunctionHandler]: Unknown extern function fprintf [2022-12-13 15:27:24,579 WARN L623 FunctionHandler]: Unknown extern function fprintf [2022-12-13 15:27:24,583 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-12-13 15:27:24,596 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 15:27:24,624 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 15:27:24,633 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_8f6eb4d4-5989-4681-8d1b-fe1a2e701a6b/sv-benchmarks/c/aws-c-common/aws_string_eq_byte_cursor_harness.i[4499,4512] [2022-12-13 15:27:24,633 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_8f6eb4d4-5989-4681-8d1b-fe1a2e701a6b/sv-benchmarks/c/aws-c-common/aws_string_eq_byte_cursor_harness.i[4559,4572] [2022-12-13 15:27:24,655 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 15:27:24,655 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 15:27:24,656 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 15:27:24,656 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 15:27:24,656 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 15:27:24,660 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 15:27:24,660 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 15:27:24,661 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 15:27:24,661 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 15:27:24,665 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-12-13 15:27:24,666 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-12-13 15:27:24,666 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-12-13 15:27:24,668 WARN L623 FunctionHandler]: Unknown extern function ntohl [2022-12-13 15:27:24,669 WARN L623 FunctionHandler]: Unknown extern function htons [2022-12-13 15:27:24,669 WARN L623 FunctionHandler]: Unknown extern function ntohs [2022-12-13 15:27:24,681 WARN L623 FunctionHandler]: Unknown extern function my_abort [2022-12-13 15:27:24,682 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-12-13 15:27:24,682 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-12-13 15:27:24,683 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-12-13 15:27:24,683 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-12-13 15:27:24,684 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-12-13 15:27:24,684 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-12-13 15:27:24,684 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-12-13 15:27:24,685 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-12-13 15:27:24,685 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-12-13 15:27:24,685 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-12-13 15:27:24,700 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-12-13 15:27:24,714 WARN L623 FunctionHandler]: Unknown extern function memchr [2022-12-13 15:27:24,718 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-12-13 15:27:24,729 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-12-13 15:27:24,733 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 15:27:24,733 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 15:27:24,749 WARN L623 FunctionHandler]: Unknown extern function fprintf [2022-12-13 15:27:24,751 WARN L623 FunctionHandler]: Unknown extern function fprintf [2022-12-13 15:27:24,752 WARN L623 FunctionHandler]: Unknown extern function fprintf [2022-12-13 15:27:24,768 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-12-13 15:27:24,775 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 15:27:24,932 INFO L208 MainTranslator]: Completed translation [2022-12-13 15:27:24,933 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:27:24 WrapperNode [2022-12-13 15:27:24,933 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 15:27:24,934 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 15:27:24,934 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 15:27:24,934 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 15:27:24,939 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:27:24" (1/1) ... [2022-12-13 15:27:25,000 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:27:24" (1/1) ... [2022-12-13 15:27:25,057 INFO L138 Inliner]: procedures = 693, calls = 2788, calls flagged for inlining = 60, calls inlined = 7, statements flattened = 863 [2022-12-13 15:27:25,058 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 15:27:25,058 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 15:27:25,058 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 15:27:25,058 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 15:27:25,066 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:27:24" (1/1) ... [2022-12-13 15:27:25,066 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:27:24" (1/1) ... [2022-12-13 15:27:25,071 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:27:24" (1/1) ... [2022-12-13 15:27:25,071 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:27:24" (1/1) ... [2022-12-13 15:27:25,090 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:27:24" (1/1) ... [2022-12-13 15:27:25,092 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:27:24" (1/1) ... [2022-12-13 15:27:25,096 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:27:24" (1/1) ... [2022-12-13 15:27:25,099 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:27:24" (1/1) ... [2022-12-13 15:27:25,106 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 15:27:25,106 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 15:27:25,106 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 15:27:25,106 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 15:27:25,107 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:27:24" (1/1) ... [2022-12-13 15:27:25,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 15:27:25,123 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f6eb4d4-5989-4681-8d1b-fe1a2e701a6b/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:27:25,135 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f6eb4d4-5989-4681-8d1b-fe1a2e701a6b/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 15:27:25,137 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f6eb4d4-5989-4681-8d1b-fe1a2e701a6b/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 15:27:25,168 INFO L130 BoogieDeclarations]: Found specification of procedure aws_string_is_valid [2022-12-13 15:27:25,168 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_string_is_valid [2022-12-13 15:27:25,168 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_cursor_is_valid [2022-12-13 15:27:25,168 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_cursor_is_valid [2022-12-13 15:27:25,168 INFO L130 BoogieDeclarations]: Found specification of procedure ensure_string_is_allocated_bounded_length [2022-12-13 15:27:25,169 INFO L138 BoogieDeclarations]: Found implementation of procedure ensure_string_is_allocated_bounded_length [2022-12-13 15:27:25,169 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2022-12-13 15:27:25,169 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 15:27:25,169 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2022-12-13 15:27:25,169 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2022-12-13 15:27:25,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 15:27:25,169 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-12-13 15:27:25,169 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-12-13 15:27:25,169 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 15:27:25,170 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 15:27:25,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-13 15:27:25,170 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 15:27:25,170 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 15:27:25,170 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2022-12-13 15:27:25,170 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2022-12-13 15:27:25,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-12-13 15:27:25,170 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-12-13 15:27:25,170 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-12-13 15:27:25,170 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 15:27:25,170 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-12-13 15:27:25,171 INFO L130 BoogieDeclarations]: Found specification of procedure aws_array_eq [2022-12-13 15:27:25,171 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_array_eq [2022-12-13 15:27:25,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-12-13 15:27:25,171 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2022-12-13 15:27:25,171 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2022-12-13 15:27:25,171 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2022-12-13 15:27:25,171 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2022-12-13 15:27:25,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 15:27:25,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 15:27:25,370 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 15:27:25,373 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 15:27:26,391 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 15:27:26,398 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 15:27:26,398 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 15:27:26,401 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 03:27:26 BoogieIcfgContainer [2022-12-13 15:27:26,401 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 15:27:26,404 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 15:27:26,404 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 15:27:26,407 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 15:27:26,408 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 03:27:22" (1/3) ... [2022-12-13 15:27:26,408 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a2ee8b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 03:27:26, skipping insertion in model container [2022-12-13 15:27:26,408 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:27:24" (2/3) ... [2022-12-13 15:27:26,409 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a2ee8b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 03:27:26, skipping insertion in model container [2022-12-13 15:27:26,409 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 03:27:26" (3/3) ... [2022-12-13 15:27:26,410 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_string_eq_byte_cursor_harness.i [2022-12-13 15:27:26,430 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 15:27:26,430 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 15:27:26,483 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 15:27:26,489 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;@21095401, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 15:27:26,489 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-12-13 15:27:26,494 INFO L276 IsEmpty]: Start isEmpty. Operand has 123 states, 82 states have (on average 1.2804878048780488) internal successors, (105), 83 states have internal predecessors, (105), 29 states have call successors, (29), 10 states have call predecessors, (29), 10 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2022-12-13 15:27:26,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-12-13 15:27:26,505 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:27:26,506 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2022-12-13 15:27:26,506 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 15:27:26,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:27:26,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1516158171, now seen corresponding path program 1 times [2022-12-13 15:27:26,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:27:26,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732067638] [2022-12-13 15:27:26,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:27:26,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:27:26,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:27,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 15:27:27,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:27,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-12-13 15:27:27,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:27,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-12-13 15:27:27,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:27,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 15:27:27,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:27,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-12-13 15:27:27,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:27,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-12-13 15:27:27,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:27,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-12-13 15:27:27,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:27,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-12-13 15:27:27,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:27,350 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-12-13 15:27:27,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:27:27,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732067638] [2022-12-13 15:27:27,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732067638] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 15:27:27,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1679506151] [2022-12-13 15:27:27,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:27:27,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 15:27:27,352 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f6eb4d4-5989-4681-8d1b-fe1a2e701a6b/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:27:27,353 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f6eb4d4-5989-4681-8d1b-fe1a2e701a6b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 15:27:27,354 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f6eb4d4-5989-4681-8d1b-fe1a2e701a6b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 15:27:27,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:27,702 INFO L263 TraceCheckSpWp]: Trace formula consists of 2475 conjuncts, 1 conjunts are in the unsatisfiable core [2022-12-13 15:27:27,708 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:27:27,723 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-12-13 15:27:27,723 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:27:27,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1679506151] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:27:27,723 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 15:27:27,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 5 [2022-12-13 15:27:27,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076638984] [2022-12-13 15:27:27,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:27:27,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 15:27:27,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:27:27,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 15:27:27,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 15:27:27,757 INFO L87 Difference]: Start difference. First operand has 123 states, 82 states have (on average 1.2804878048780488) internal successors, (105), 83 states have internal predecessors, (105), 29 states have call successors, (29), 10 states have call predecessors, (29), 10 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-12-13 15:27:27,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:27:27,785 INFO L93 Difference]: Finished difference Result 237 states and 329 transitions. [2022-12-13 15:27:27,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 15:27:27,787 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 59 [2022-12-13 15:27:27,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:27:27,795 INFO L225 Difference]: With dead ends: 237 [2022-12-13 15:27:27,795 INFO L226 Difference]: Without dead ends: 118 [2022-12-13 15:27:27,798 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 15:27:27,801 INFO L413 NwaCegarLoop]: 161 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, 161 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-12-13 15:27:27,801 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 15:27:27,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-12-13 15:27:27,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2022-12-13 15:27:27,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 78 states have (on average 1.2692307692307692) internal successors, (99), 79 states have internal predecessors, (99), 29 states have call successors, (29), 10 states have call predecessors, (29), 10 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2022-12-13 15:27:27,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 156 transitions. [2022-12-13 15:27:27,843 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 156 transitions. Word has length 59 [2022-12-13 15:27:27,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:27:27,845 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 156 transitions. [2022-12-13 15:27:27,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-12-13 15:27:27,845 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 156 transitions. [2022-12-13 15:27:27,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-12-13 15:27:27,846 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:27:27,847 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2022-12-13 15:27:27,854 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f6eb4d4-5989-4681-8d1b-fe1a2e701a6b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 15:27:28,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f6eb4d4-5989-4681-8d1b-fe1a2e701a6b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 15:27:28,049 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 15:27:28,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:27:28,050 INFO L85 PathProgramCache]: Analyzing trace with hash -600570023, now seen corresponding path program 1 times [2022-12-13 15:27:28,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:27:28,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112667347] [2022-12-13 15:27:28,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:27:28,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:27:28,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:28,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 15:27:28,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:28,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-12-13 15:27:28,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:28,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-12-13 15:27:28,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:28,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 15:27:28,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:28,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-12-13 15:27:28,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:28,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-12-13 15:27:28,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:28,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-12-13 15:27:28,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:28,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-12-13 15:27:28,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:28,520 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-12-13 15:27:28,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:27:28,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112667347] [2022-12-13 15:27:28,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112667347] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 15:27:28,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2085713533] [2022-12-13 15:27:28,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:27:28,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 15:27:28,521 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f6eb4d4-5989-4681-8d1b-fe1a2e701a6b/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:27:28,522 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f6eb4d4-5989-4681-8d1b-fe1a2e701a6b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 15:27:28,523 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f6eb4d4-5989-4681-8d1b-fe1a2e701a6b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 15:27:28,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:28,889 INFO L263 TraceCheckSpWp]: Trace formula consists of 2475 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 15:27:28,892 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:27:28,990 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-13 15:27:28,990 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 15:27:29,091 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-12-13 15:27:29,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2085713533] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 15:27:29,091 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 15:27:29,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 11 [2022-12-13 15:27:29,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71749157] [2022-12-13 15:27:29,092 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 15:27:29,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 15:27:29,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:27:29,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 15:27:29,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-12-13 15:27:29,094 INFO L87 Difference]: Start difference. First operand 118 states and 156 transitions. Second operand has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 7 states have call successors, (20), 3 states have call predecessors, (20), 5 states have return successors, (19), 7 states have call predecessors, (19), 7 states have call successors, (19) [2022-12-13 15:27:29,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:27:29,262 INFO L93 Difference]: Finished difference Result 202 states and 269 transitions. [2022-12-13 15:27:29,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 15:27:29,262 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 7 states have call successors, (20), 3 states have call predecessors, (20), 5 states have return successors, (19), 7 states have call predecessors, (19), 7 states have call successors, (19) Word has length 59 [2022-12-13 15:27:29,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:27:29,265 INFO L225 Difference]: With dead ends: 202 [2022-12-13 15:27:29,265 INFO L226 Difference]: Without dead ends: 121 [2022-12-13 15:27:29,266 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 127 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2022-12-13 15:27:29,267 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 208 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 15:27:29,268 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 678 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 15:27:29,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-12-13 15:27:29,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2022-12-13 15:27:29,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 80 states have (on average 1.2625) internal successors, (101), 82 states have internal predecessors, (101), 29 states have call successors, (29), 10 states have call predecessors, (29), 11 states have return successors, (29), 28 states have call predecessors, (29), 28 states have call successors, (29) [2022-12-13 15:27:29,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 159 transitions. [2022-12-13 15:27:29,282 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 159 transitions. Word has length 59 [2022-12-13 15:27:29,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:27:29,282 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 159 transitions. [2022-12-13 15:27:29,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 7 states have call successors, (20), 3 states have call predecessors, (20), 5 states have return successors, (19), 7 states have call predecessors, (19), 7 states have call successors, (19) [2022-12-13 15:27:29,282 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 159 transitions. [2022-12-13 15:27:29,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-12-13 15:27:29,284 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:27:29,284 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 15:27:29,293 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f6eb4d4-5989-4681-8d1b-fe1a2e701a6b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-13 15:27:29,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f6eb4d4-5989-4681-8d1b-fe1a2e701a6b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 15:27:29,486 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 15:27:29,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:27:29,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1282062374, now seen corresponding path program 1 times [2022-12-13 15:27:29,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:27:29,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543579741] [2022-12-13 15:27:29,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:27:29,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:27:29,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:29,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 15:27:29,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:29,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-12-13 15:27:29,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:29,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-12-13 15:27:29,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:29,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 15:27:29,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:29,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-12-13 15:27:29,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:29,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 15:27:29,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:29,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 15:27:29,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:29,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-12-13 15:27:29,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:29,904 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-12-13 15:27:29,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:27:29,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543579741] [2022-12-13 15:27:29,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543579741] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:27:29,904 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:27:29,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 15:27:29,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849689357] [2022-12-13 15:27:29,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:27:29,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 15:27:29,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:27:29,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 15:27:29,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 15:27:29,906 INFO L87 Difference]: Start difference. First operand 121 states and 159 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-12-13 15:27:29,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:27:29,937 INFO L93 Difference]: Finished difference Result 205 states and 273 transitions. [2022-12-13 15:27:29,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 15:27:29,938 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 63 [2022-12-13 15:27:29,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:27:29,940 INFO L225 Difference]: With dead ends: 205 [2022-12-13 15:27:29,940 INFO L226 Difference]: Without dead ends: 151 [2022-12-13 15:27:29,940 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 15:27:29,941 INFO L413 NwaCegarLoop]: 164 mSDtfsCounter, 11 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 15:27:29,941 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 472 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 15:27:29,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-12-13 15:27:29,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 149. [2022-12-13 15:27:29,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 98 states have (on average 1.2653061224489797) internal successors, (124), 100 states have internal predecessors, (124), 39 states have call successors, (39), 10 states have call predecessors, (39), 11 states have return successors, (40), 38 states have call predecessors, (40), 38 states have call successors, (40) [2022-12-13 15:27:29,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 203 transitions. [2022-12-13 15:27:29,951 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 203 transitions. Word has length 63 [2022-12-13 15:27:29,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:27:29,951 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 203 transitions. [2022-12-13 15:27:29,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-12-13 15:27:29,951 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 203 transitions. [2022-12-13 15:27:29,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-12-13 15:27:29,953 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:27:29,954 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2022-12-13 15:27:29,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 15:27:29,954 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 15:27:29,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:27:29,954 INFO L85 PathProgramCache]: Analyzing trace with hash -1565828381, now seen corresponding path program 1 times [2022-12-13 15:27:29,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:27:29,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231022751] [2022-12-13 15:27:29,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:27:29,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:27:30,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:30,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 15:27:30,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:30,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-12-13 15:27:30,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:30,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-12-13 15:27:30,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:30,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 15:27:30,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:30,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-12-13 15:27:30,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:30,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 15:27:30,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:30,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 15:27:30,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:30,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-12-13 15:27:30,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:30,537 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-12-13 15:27:30,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:27:30,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231022751] [2022-12-13 15:27:30,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231022751] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:27:30,537 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:27:30,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 15:27:30,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007231014] [2022-12-13 15:27:30,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:27:30,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 15:27:30,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:27:30,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 15:27:30,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 15:27:30,539 INFO L87 Difference]: Start difference. First operand 149 states and 203 transitions. Second operand has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2022-12-13 15:27:30,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:27:30,594 INFO L93 Difference]: Finished difference Result 160 states and 217 transitions. [2022-12-13 15:27:30,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 15:27:30,594 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 63 [2022-12-13 15:27:30,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:27:30,595 INFO L225 Difference]: With dead ends: 160 [2022-12-13 15:27:30,596 INFO L226 Difference]: Without dead ends: 153 [2022-12-13 15:27:30,596 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-12-13 15:27:30,596 INFO L413 NwaCegarLoop]: 155 mSDtfsCounter, 17 mSDsluCounter, 894 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 1049 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 15:27:30,597 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 1049 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 15:27:30,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-12-13 15:27:30,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2022-12-13 15:27:30,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 101 states have (on average 1.2574257425742574) internal successors, (127), 104 states have internal predecessors, (127), 39 states have call successors, (39), 10 states have call predecessors, (39), 12 states have return successors, (44), 38 states have call predecessors, (44), 38 states have call successors, (44) [2022-12-13 15:27:30,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 210 transitions. [2022-12-13 15:27:30,606 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 210 transitions. Word has length 63 [2022-12-13 15:27:30,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:27:30,606 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 210 transitions. [2022-12-13 15:27:30,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2022-12-13 15:27:30,606 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 210 transitions. [2022-12-13 15:27:30,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-12-13 15:27:30,607 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:27:30,608 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2022-12-13 15:27:30,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 15:27:30,608 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 15:27:30,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:27:30,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1937260075, now seen corresponding path program 1 times [2022-12-13 15:27:30,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:27:30,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366410777] [2022-12-13 15:27:30,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:27:30,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:27:30,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:31,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 15:27:31,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:31,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-12-13 15:27:31,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:31,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-12-13 15:27:31,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:31,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 15:27:31,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:31,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-12-13 15:27:31,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:31,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 15:27:31,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:31,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 15:27:31,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:31,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-12-13 15:27:31,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:31,659 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-12-13 15:27:31,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:27:31,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366410777] [2022-12-13 15:27:31,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366410777] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 15:27:31,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2066667652] [2022-12-13 15:27:31,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:27:31,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 15:27:31,660 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f6eb4d4-5989-4681-8d1b-fe1a2e701a6b/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:27:31,661 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f6eb4d4-5989-4681-8d1b-fe1a2e701a6b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 15:27:31,662 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f6eb4d4-5989-4681-8d1b-fe1a2e701a6b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 15:27:31,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:32,005 INFO L263 TraceCheckSpWp]: Trace formula consists of 2497 conjuncts, 30 conjunts are in the unsatisfiable core [2022-12-13 15:27:32,008 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:27:32,681 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-12-13 15:27:32,682 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 15:27:32,877 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 26 treesize of output 14 [2022-12-13 15:27:32,914 INFO L321 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-12-13 15:27:32,914 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 24 [2022-12-13 15:27:32,925 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-12-13 15:27:32,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2066667652] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 15:27:32,925 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 15:27:32,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 9] total 18 [2022-12-13 15:27:32,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995070075] [2022-12-13 15:27:32,926 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 15:27:32,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-13 15:27:32,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:27:32,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-13 15:27:32,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2022-12-13 15:27:32,927 INFO L87 Difference]: Start difference. First operand 153 states and 210 transitions. Second operand has 18 states, 18 states have (on average 4.055555555555555) internal successors, (73), 18 states have internal predecessors, (73), 5 states have call successors, (16), 3 states have call predecessors, (16), 5 states have return successors, (15), 5 states have call predecessors, (15), 4 states have call successors, (15) [2022-12-13 15:27:34,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:27:34,281 INFO L93 Difference]: Finished difference Result 288 states and 387 transitions. [2022-12-13 15:27:34,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-13 15:27:34,282 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.055555555555555) internal successors, (73), 18 states have internal predecessors, (73), 5 states have call successors, (16), 3 states have call predecessors, (16), 5 states have return successors, (15), 5 states have call predecessors, (15), 4 states have call successors, (15) Word has length 67 [2022-12-13 15:27:34,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:27:34,284 INFO L225 Difference]: With dead ends: 288 [2022-12-13 15:27:34,284 INFO L226 Difference]: Without dead ends: 242 [2022-12-13 15:27:34,285 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 129 SyntacticMatches, 12 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=176, Invalid=636, Unknown=0, NotChecked=0, Total=812 [2022-12-13 15:27:34,286 INFO L413 NwaCegarLoop]: 202 mSDtfsCounter, 196 mSDsluCounter, 1220 mSDsCounter, 0 mSdLazyCounter, 775 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 1422 SdHoareTripleChecker+Invalid, 793 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 775 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-12-13 15:27:34,286 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 1422 Invalid, 793 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 775 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-12-13 15:27:34,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2022-12-13 15:27:34,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 233. [2022-12-13 15:27:34,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 156 states have (on average 1.2564102564102564) internal successors, (196), 159 states have internal predecessors, (196), 56 states have call successors, (56), 18 states have call predecessors, (56), 20 states have return successors, (59), 55 states have call predecessors, (59), 54 states have call successors, (59) [2022-12-13 15:27:34,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 311 transitions. [2022-12-13 15:27:34,312 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 311 transitions. Word has length 67 [2022-12-13 15:27:34,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:27:34,312 INFO L495 AbstractCegarLoop]: Abstraction has 233 states and 311 transitions. [2022-12-13 15:27:34,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.055555555555555) internal successors, (73), 18 states have internal predecessors, (73), 5 states have call successors, (16), 3 states have call predecessors, (16), 5 states have return successors, (15), 5 states have call predecessors, (15), 4 states have call successors, (15) [2022-12-13 15:27:34,312 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 311 transitions. [2022-12-13 15:27:34,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-12-13 15:27:34,314 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:27:34,314 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2022-12-13 15:27:34,321 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f6eb4d4-5989-4681-8d1b-fe1a2e701a6b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-13 15:27:34,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f6eb4d4-5989-4681-8d1b-fe1a2e701a6b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 15:27:34,515 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 15:27:34,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:27:34,516 INFO L85 PathProgramCache]: Analyzing trace with hash -2019839885, now seen corresponding path program 1 times [2022-12-13 15:27:34,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:27:34,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957707392] [2022-12-13 15:27:34,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:27:34,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:27:34,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:35,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 15:27:35,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:35,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-12-13 15:27:35,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:35,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-12-13 15:27:35,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:35,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-12-13 15:27:35,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:35,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-12-13 15:27:35,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:35,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-12-13 15:27:35,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:35,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-12-13 15:27:35,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:35,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-12-13 15:27:35,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:35,174 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-12-13 15:27:35,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:27:35,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957707392] [2022-12-13 15:27:35,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957707392] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 15:27:35,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [411368498] [2022-12-13 15:27:35,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:27:35,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 15:27:35,175 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f6eb4d4-5989-4681-8d1b-fe1a2e701a6b/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:27:35,176 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f6eb4d4-5989-4681-8d1b-fe1a2e701a6b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 15:27:35,177 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f6eb4d4-5989-4681-8d1b-fe1a2e701a6b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 15:27:35,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:35,501 INFO L263 TraceCheckSpWp]: Trace formula consists of 2509 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-13 15:27:35,503 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:27:35,541 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-13 15:27:35,542 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:27:35,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [411368498] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:27:35,542 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 15:27:35,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 10 [2022-12-13 15:27:35,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313334651] [2022-12-13 15:27:35,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:27:35,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 15:27:35,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:27:35,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 15:27:35,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-12-13 15:27:35,543 INFO L87 Difference]: Start difference. First operand 233 states and 311 transitions. Second operand has 9 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-12-13 15:27:35,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:27:35,661 INFO L93 Difference]: Finished difference Result 352 states and 474 transitions. [2022-12-13 15:27:35,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 15:27:35,661 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 71 [2022-12-13 15:27:35,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:27:35,662 INFO L225 Difference]: With dead ends: 352 [2022-12-13 15:27:35,662 INFO L226 Difference]: Without dead ends: 244 [2022-12-13 15:27:35,663 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 85 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-12-13 15:27:35,663 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 13 mSDsluCounter, 965 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 1110 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 15:27:35,664 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 1110 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 15:27:35,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2022-12-13 15:27:35,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 238. [2022-12-13 15:27:35,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 160 states have (on average 1.25) internal successors, (200), 164 states have internal predecessors, (200), 56 states have call successors, (56), 18 states have call predecessors, (56), 21 states have return successors, (62), 55 states have call predecessors, (62), 54 states have call successors, (62) [2022-12-13 15:27:35,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 318 transitions. [2022-12-13 15:27:35,677 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 318 transitions. Word has length 71 [2022-12-13 15:27:35,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:27:35,678 INFO L495 AbstractCegarLoop]: Abstraction has 238 states and 318 transitions. [2022-12-13 15:27:35,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-12-13 15:27:35,678 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 318 transitions. [2022-12-13 15:27:35,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-12-13 15:27:35,679 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:27:35,679 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2022-12-13 15:27:35,688 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f6eb4d4-5989-4681-8d1b-fe1a2e701a6b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-13 15:27:35,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f6eb4d4-5989-4681-8d1b-fe1a2e701a6b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-12-13 15:27:35,881 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 15:27:35,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:27:35,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1756062200, now seen corresponding path program 1 times [2022-12-13 15:27:35,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:27:35,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890562529] [2022-12-13 15:27:35,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:27:35,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:27:36,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:36,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 15:27:36,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:36,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-12-13 15:27:36,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:36,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-12-13 15:27:36,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:36,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-12-13 15:27:36,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:36,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 15:27:36,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:36,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-12-13 15:27:36,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:36,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-12-13 15:27:36,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:36,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-12-13 15:27:36,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:36,436 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-12-13 15:27:36,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:27:36,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890562529] [2022-12-13 15:27:36,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890562529] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 15:27:36,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [34716340] [2022-12-13 15:27:36,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:27:36,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 15:27:36,437 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f6eb4d4-5989-4681-8d1b-fe1a2e701a6b/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:27:36,438 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f6eb4d4-5989-4681-8d1b-fe1a2e701a6b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 15:27:36,438 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f6eb4d4-5989-4681-8d1b-fe1a2e701a6b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-13 15:27:36,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:36,793 INFO L263 TraceCheckSpWp]: Trace formula consists of 2514 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 15:27:36,797 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:27:36,890 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-13 15:27:36,890 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:27:36,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [34716340] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:27:36,890 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 15:27:36,890 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-12-13 15:27:36,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413035962] [2022-12-13 15:27:36,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:27:36,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 15:27:36,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:27:36,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 15:27:36,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-13 15:27:36,892 INFO L87 Difference]: Start difference. First operand 238 states and 318 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-12-13 15:27:37,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:27:37,309 INFO L93 Difference]: Finished difference Result 410 states and 549 transitions. [2022-12-13 15:27:37,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 15:27:37,310 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 73 [2022-12-13 15:27:37,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:27:37,311 INFO L225 Difference]: With dead ends: 410 [2022-12-13 15:27:37,311 INFO L226 Difference]: Without dead ends: 243 [2022-12-13 15:27:37,312 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-12-13 15:27:37,313 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 19 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 15:27:37,313 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 545 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 15:27:37,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2022-12-13 15:27:37,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 238. [2022-12-13 15:27:37,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 160 states have (on average 1.2375) internal successors, (198), 164 states have internal predecessors, (198), 56 states have call successors, (56), 18 states have call predecessors, (56), 21 states have return successors, (62), 55 states have call predecessors, (62), 54 states have call successors, (62) [2022-12-13 15:27:37,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 316 transitions. [2022-12-13 15:27:37,339 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 316 transitions. Word has length 73 [2022-12-13 15:27:37,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:27:37,339 INFO L495 AbstractCegarLoop]: Abstraction has 238 states and 316 transitions. [2022-12-13 15:27:37,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-12-13 15:27:37,340 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 316 transitions. [2022-12-13 15:27:37,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-12-13 15:27:37,341 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:27:37,341 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2022-12-13 15:27:37,348 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f6eb4d4-5989-4681-8d1b-fe1a2e701a6b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-13 15:27:37,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f6eb4d4-5989-4681-8d1b-fe1a2e701a6b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 15:27:37,543 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 15:27:37,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:27:37,544 INFO L85 PathProgramCache]: Analyzing trace with hash -272523910, now seen corresponding path program 1 times [2022-12-13 15:27:37,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:27:37,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930505380] [2022-12-13 15:27:37,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:27:37,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:27:37,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:38,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 15:27:38,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:38,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-12-13 15:27:38,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:38,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-12-13 15:27:38,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:38,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-12-13 15:27:38,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:38,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 15:27:38,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:38,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-12-13 15:27:38,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:38,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-12-13 15:27:38,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:38,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-12-13 15:27:38,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:38,737 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-12-13 15:27:38,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:27:38,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930505380] [2022-12-13 15:27:38,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930505380] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 15:27:38,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [653663794] [2022-12-13 15:27:38,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:27:38,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 15:27:38,737 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f6eb4d4-5989-4681-8d1b-fe1a2e701a6b/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:27:38,738 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f6eb4d4-5989-4681-8d1b-fe1a2e701a6b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 15:27:38,739 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f6eb4d4-5989-4681-8d1b-fe1a2e701a6b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-13 15:27:39,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:39,095 INFO L263 TraceCheckSpWp]: Trace formula consists of 2519 conjuncts, 39 conjunts are in the unsatisfiable core [2022-12-13 15:27:39,099 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:27:39,137 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-12-13 15:27:39,141 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-12-13 15:27:39,476 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-12-13 15:27:39,476 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:27:39,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [653663794] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:27:39,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 15:27:39,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [10] total 19 [2022-12-13 15:27:39,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247690576] [2022-12-13 15:27:39,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:27:39,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 15:27:39,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:27:39,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 15:27:39,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2022-12-13 15:27:39,478 INFO L87 Difference]: Start difference. First operand 238 states and 316 transitions. Second operand has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 10 states have internal predecessors, (48), 4 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2022-12-13 15:27:41,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:27:41,297 INFO L93 Difference]: Finished difference Result 569 states and 759 transitions. [2022-12-13 15:27:41,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 15:27:41,297 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 10 states have internal predecessors, (48), 4 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) Word has length 73 [2022-12-13 15:27:41,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:27:41,299 INFO L225 Difference]: With dead ends: 569 [2022-12-13 15:27:41,299 INFO L226 Difference]: Without dead ends: 456 [2022-12-13 15:27:41,299 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=115, Invalid=437, Unknown=0, NotChecked=0, Total=552 [2022-12-13 15:27:41,300 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 183 mSDsluCounter, 869 mSDsCounter, 0 mSdLazyCounter, 504 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 1027 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-12-13 15:27:41,300 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 1027 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 504 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-12-13 15:27:41,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2022-12-13 15:27:41,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 436. [2022-12-13 15:27:41,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 436 states, 298 states have (on average 1.24496644295302) internal successors, (371), 306 states have internal predecessors, (371), 99 states have call successors, (99), 32 states have call predecessors, (99), 38 states have return successors, (111), 97 states have call predecessors, (111), 95 states have call successors, (111) [2022-12-13 15:27:41,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 581 transitions. [2022-12-13 15:27:41,323 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 581 transitions. Word has length 73 [2022-12-13 15:27:41,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:27:41,324 INFO L495 AbstractCegarLoop]: Abstraction has 436 states and 581 transitions. [2022-12-13 15:27:41,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 10 states have internal predecessors, (48), 4 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2022-12-13 15:27:41,324 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 581 transitions. [2022-12-13 15:27:41,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-12-13 15:27:41,325 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:27:41,325 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2022-12-13 15:27:41,332 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f6eb4d4-5989-4681-8d1b-fe1a2e701a6b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-13 15:27:41,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f6eb4d4-5989-4681-8d1b-fe1a2e701a6b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 15:27:41,525 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 15:27:41,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:27:41,526 INFO L85 PathProgramCache]: Analyzing trace with hash 603495096, now seen corresponding path program 1 times [2022-12-13 15:27:41,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:27:41,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189404792] [2022-12-13 15:27:41,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:27:41,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:27:41,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:41,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 15:27:41,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:41,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-12-13 15:27:41,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:41,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-12-13 15:27:41,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:41,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-12-13 15:27:41,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:41,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 15:27:41,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:41,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-12-13 15:27:41,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:41,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-12-13 15:27:41,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:41,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-12-13 15:27:41,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:41,700 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-12-13 15:27:41,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:27:41,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189404792] [2022-12-13 15:27:41,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189404792] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 15:27:41,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1817307585] [2022-12-13 15:27:41,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:27:41,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 15:27:41,701 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f6eb4d4-5989-4681-8d1b-fe1a2e701a6b/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:27:41,701 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f6eb4d4-5989-4681-8d1b-fe1a2e701a6b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 15:27:41,702 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f6eb4d4-5989-4681-8d1b-fe1a2e701a6b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-13 15:27:41,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:41,992 INFO L263 TraceCheckSpWp]: Trace formula consists of 2514 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 15:27:41,994 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:27:42,000 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-13 15:27:42,000 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:27:42,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1817307585] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:27:42,001 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 15:27:42,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2022-12-13 15:27:42,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789996086] [2022-12-13 15:27:42,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:27:42,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 15:27:42,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:27:42,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 15:27:42,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 15:27:42,002 INFO L87 Difference]: Start difference. First operand 436 states and 581 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-12-13 15:27:42,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:27:42,041 INFO L93 Difference]: Finished difference Result 714 states and 932 transitions. [2022-12-13 15:27:42,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 15:27:42,042 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 73 [2022-12-13 15:27:42,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:27:42,044 INFO L225 Difference]: With dead ends: 714 [2022-12-13 15:27:42,044 INFO L226 Difference]: Without dead ends: 351 [2022-12-13 15:27:42,045 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 15:27:42,046 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 6 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 15:27:42,046 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 457 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 15:27:42,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2022-12-13 15:27:42,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 336. [2022-12-13 15:27:42,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 231 states have (on average 1.2164502164502164) internal successors, (281), 236 states have internal predecessors, (281), 73 states have call successors, (73), 28 states have call predecessors, (73), 31 states have return successors, (78), 71 states have call predecessors, (78), 70 states have call successors, (78) [2022-12-13 15:27:42,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 432 transitions. [2022-12-13 15:27:42,075 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 432 transitions. Word has length 73 [2022-12-13 15:27:42,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:27:42,076 INFO L495 AbstractCegarLoop]: Abstraction has 336 states and 432 transitions. [2022-12-13 15:27:42,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-12-13 15:27:42,076 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 432 transitions. [2022-12-13 15:27:42,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-12-13 15:27:42,077 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:27:42,077 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2022-12-13 15:27:42,084 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f6eb4d4-5989-4681-8d1b-fe1a2e701a6b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-13 15:27:42,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f6eb4d4-5989-4681-8d1b-fe1a2e701a6b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 15:27:42,279 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 15:27:42,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:27:42,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1447989340, now seen corresponding path program 1 times [2022-12-13 15:27:42,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:27:42,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247656061] [2022-12-13 15:27:42,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:27:42,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:27:42,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:43,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 15:27:43,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:43,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-12-13 15:27:43,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:43,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 15:27:43,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:43,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 15:27:43,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:43,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-12-13 15:27:43,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:43,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-12-13 15:27:43,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:43,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-12-13 15:27:43,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:43,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-12-13 15:27:43,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:43,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-12-13 15:27:43,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:43,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-12-13 15:27:43,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:43,277 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-12-13 15:27:43,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:27:43,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247656061] [2022-12-13 15:27:43,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247656061] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:27:43,277 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:27:43,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-13 15:27:43,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390684683] [2022-12-13 15:27:43,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:27:43,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 15:27:43,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:27:43,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 15:27:43,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-12-13 15:27:43,278 INFO L87 Difference]: Start difference. First operand 336 states and 432 transitions. Second operand has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 10 states have internal predecessors, (50), 4 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 5 states have call predecessors, (10), 3 states have call successors, (10) [2022-12-13 15:27:43,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:27:43,940 INFO L93 Difference]: Finished difference Result 364 states and 461 transitions. [2022-12-13 15:27:43,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 15:27:43,940 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 10 states have internal predecessors, (50), 4 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 5 states have call predecessors, (10), 3 states have call successors, (10) Word has length 84 [2022-12-13 15:27:43,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:27:43,941 INFO L225 Difference]: With dead ends: 364 [2022-12-13 15:27:43,941 INFO L226 Difference]: Without dead ends: 357 [2022-12-13 15:27:43,942 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2022-12-13 15:27:43,942 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 152 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 914 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 712 SdHoareTripleChecker+Invalid, 977 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 914 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-13 15:27:43,942 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 712 Invalid, 977 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 914 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-13 15:27:43,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2022-12-13 15:27:43,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 338. [2022-12-13 15:27:43,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 233 states have (on average 1.2145922746781115) internal successors, (283), 238 states have internal predecessors, (283), 73 states have call successors, (73), 28 states have call predecessors, (73), 31 states have return successors, (78), 71 states have call predecessors, (78), 70 states have call successors, (78) [2022-12-13 15:27:43,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 434 transitions. [2022-12-13 15:27:43,961 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 434 transitions. Word has length 84 [2022-12-13 15:27:43,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:27:43,961 INFO L495 AbstractCegarLoop]: Abstraction has 338 states and 434 transitions. [2022-12-13 15:27:43,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 10 states have internal predecessors, (50), 4 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 5 states have call predecessors, (10), 3 states have call successors, (10) [2022-12-13 15:27:43,961 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 434 transitions. [2022-12-13 15:27:43,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-12-13 15:27:43,962 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:27:43,962 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2022-12-13 15:27:43,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 15:27:43,962 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 15:27:43,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:27:43,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1189823902, now seen corresponding path program 1 times [2022-12-13 15:27:43,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:27:43,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094553847] [2022-12-13 15:27:43,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:27:43,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:27:44,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:44,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 15:27:44,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:44,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-12-13 15:27:44,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:44,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 15:27:44,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:44,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 15:27:44,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:44,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-12-13 15:27:44,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:44,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-12-13 15:27:44,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:44,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-12-13 15:27:44,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:44,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-12-13 15:27:44,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:44,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-12-13 15:27:44,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:44,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-12-13 15:27:44,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:44,352 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-12-13 15:27:44,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:27:44,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094553847] [2022-12-13 15:27:44,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094553847] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:27:44,353 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:27:44,353 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 15:27:44,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10195119] [2022-12-13 15:27:44,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:27:44,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 15:27:44,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:27:44,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 15:27:44,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 15:27:44,354 INFO L87 Difference]: Start difference. First operand 338 states and 434 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2022-12-13 15:27:44,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:27:44,595 INFO L93 Difference]: Finished difference Result 533 states and 676 transitions. [2022-12-13 15:27:44,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 15:27:44,595 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) Word has length 84 [2022-12-13 15:27:44,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:27:44,597 INFO L225 Difference]: With dead ends: 533 [2022-12-13 15:27:44,597 INFO L226 Difference]: Without dead ends: 331 [2022-12-13 15:27:44,597 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-13 15:27:44,598 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 59 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 15:27:44,598 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 308 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 15:27:44,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2022-12-13 15:27:44,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 327. [2022-12-13 15:27:44,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 223 states have (on average 1.210762331838565) internal successors, (270), 227 states have internal predecessors, (270), 73 states have call successors, (73), 28 states have call predecessors, (73), 30 states have return successors, (75), 71 states have call predecessors, (75), 70 states have call successors, (75) [2022-12-13 15:27:44,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 418 transitions. [2022-12-13 15:27:44,616 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 418 transitions. Word has length 84 [2022-12-13 15:27:44,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:27:44,616 INFO L495 AbstractCegarLoop]: Abstraction has 327 states and 418 transitions. [2022-12-13 15:27:44,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2022-12-13 15:27:44,616 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 418 transitions. [2022-12-13 15:27:44,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-12-13 15:27:44,617 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:27:44,617 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 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] [2022-12-13 15:27:44,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 15:27:44,617 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 15:27:44,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:27:44,617 INFO L85 PathProgramCache]: Analyzing trace with hash 295487979, now seen corresponding path program 1 times [2022-12-13 15:27:44,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:27:44,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531286452] [2022-12-13 15:27:44,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:27:44,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:27:44,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:45,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 15:27:45,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:45,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-12-13 15:27:45,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:45,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 15:27:45,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:45,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 15:27:45,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:45,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-12-13 15:27:45,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:45,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-12-13 15:27:45,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:45,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-12-13 15:27:45,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:45,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-12-13 15:27:45,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:45,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-12-13 15:27:45,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:45,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-12-13 15:27:45,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:45,464 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-12-13 15:27:45,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:27:45,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531286452] [2022-12-13 15:27:45,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531286452] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:27:45,464 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:27:45,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-12-13 15:27:45,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389972180] [2022-12-13 15:27:45,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:27:45,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 15:27:45,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:27:45,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 15:27:45,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2022-12-13 15:27:45,466 INFO L87 Difference]: Start difference. First operand 327 states and 418 transitions. Second operand has 14 states, 13 states have (on average 3.769230769230769) internal successors, (49), 11 states have internal predecessors, (49), 2 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2022-12-13 15:27:46,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:27:46,141 INFO L93 Difference]: Finished difference Result 354 states and 444 transitions. [2022-12-13 15:27:46,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 15:27:46,142 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.769230769230769) internal successors, (49), 11 states have internal predecessors, (49), 2 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) Word has length 86 [2022-12-13 15:27:46,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:27:46,144 INFO L225 Difference]: With dead ends: 354 [2022-12-13 15:27:46,144 INFO L226 Difference]: Without dead ends: 316 [2022-12-13 15:27:46,144 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=527, Unknown=0, NotChecked=0, Total=650 [2022-12-13 15:27:46,145 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 89 mSDsluCounter, 852 mSDsCounter, 0 mSdLazyCounter, 871 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 957 SdHoareTripleChecker+Invalid, 902 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 871 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-13 15:27:46,145 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 957 Invalid, 902 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 871 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-13 15:27:46,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2022-12-13 15:27:46,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 295. [2022-12-13 15:27:46,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 203 states have (on average 1.187192118226601) internal successors, (241), 207 states have internal predecessors, (241), 61 states have call successors, (61), 28 states have call predecessors, (61), 30 states have return successors, (61), 59 states have call predecessors, (61), 58 states have call successors, (61) [2022-12-13 15:27:46,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 363 transitions. [2022-12-13 15:27:46,161 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 363 transitions. Word has length 86 [2022-12-13 15:27:46,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:27:46,161 INFO L495 AbstractCegarLoop]: Abstraction has 295 states and 363 transitions. [2022-12-13 15:27:46,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.769230769230769) internal successors, (49), 11 states have internal predecessors, (49), 2 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2022-12-13 15:27:46,161 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 363 transitions. [2022-12-13 15:27:46,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-12-13 15:27:46,162 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:27:46,162 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 15:27:46,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 15:27:46,162 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 15:27:46,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:27:46,162 INFO L85 PathProgramCache]: Analyzing trace with hash -1406944127, now seen corresponding path program 1 times [2022-12-13 15:27:46,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:27:46,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050751227] [2022-12-13 15:27:46,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:27:46,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:27:46,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:46,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 15:27:46,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:46,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 15:27:46,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:46,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 15:27:46,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:46,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 15:27:46,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:46,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 15:27:46,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:46,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 15:27:46,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:46,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 15:27:46,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:46,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 15:27:46,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:46,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-12-13 15:27:46,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:46,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-12-13 15:27:46,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:46,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-12-13 15:27:46,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:46,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-12-13 15:27:46,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:46,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-12-13 15:27:46,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:46,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-12-13 15:27:46,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:46,949 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-12-13 15:27:46,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:27:46,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050751227] [2022-12-13 15:27:46,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050751227] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 15:27:46,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [728131359] [2022-12-13 15:27:46,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:27:46,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 15:27:46,950 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f6eb4d4-5989-4681-8d1b-fe1a2e701a6b/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:27:46,951 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f6eb4d4-5989-4681-8d1b-fe1a2e701a6b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 15:27:46,951 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f6eb4d4-5989-4681-8d1b-fe1a2e701a6b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-13 15:27:47,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:47,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 2636 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-13 15:27:47,209 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:27:47,289 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-12-13 15:27:47,289 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:27:47,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [728131359] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:27:47,290 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 15:27:47,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [17] total 22 [2022-12-13 15:27:47,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403186231] [2022-12-13 15:27:47,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:27:47,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 15:27:47,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:27:47,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 15:27:47,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=416, Unknown=0, NotChecked=0, Total=462 [2022-12-13 15:27:47,291 INFO L87 Difference]: Start difference. First operand 295 states and 363 transitions. Second operand has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 9 states have internal predecessors, (50), 5 states have call successors, (15), 2 states have call predecessors, (15), 4 states have return successors, (14), 7 states have call predecessors, (14), 5 states have call successors, (14) [2022-12-13 15:27:47,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:27:47,432 INFO L93 Difference]: Finished difference Result 399 states and 481 transitions. [2022-12-13 15:27:47,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 15:27:47,433 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 9 states have internal predecessors, (50), 5 states have call successors, (15), 2 states have call predecessors, (15), 4 states have return successors, (14), 7 states have call predecessors, (14), 5 states have call successors, (14) Word has length 97 [2022-12-13 15:27:47,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:27:47,434 INFO L225 Difference]: With dead ends: 399 [2022-12-13 15:27:47,434 INFO L226 Difference]: Without dead ends: 295 [2022-12-13 15:27:47,434 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=586, Unknown=0, NotChecked=0, Total=650 [2022-12-13 15:27:47,435 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 49 mSDsluCounter, 1052 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 1181 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 15:27:47,435 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 1181 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 15:27:47,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2022-12-13 15:27:47,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 295. [2022-12-13 15:27:47,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 203 states have (on average 1.1724137931034482) internal successors, (238), 207 states have internal predecessors, (238), 61 states have call successors, (61), 28 states have call predecessors, (61), 30 states have return successors, (61), 59 states have call predecessors, (61), 58 states have call successors, (61) [2022-12-13 15:27:47,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 360 transitions. [2022-12-13 15:27:47,456 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 360 transitions. Word has length 97 [2022-12-13 15:27:47,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:27:47,457 INFO L495 AbstractCegarLoop]: Abstraction has 295 states and 360 transitions. [2022-12-13 15:27:47,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 9 states have internal predecessors, (50), 5 states have call successors, (15), 2 states have call predecessors, (15), 4 states have return successors, (14), 7 states have call predecessors, (14), 5 states have call successors, (14) [2022-12-13 15:27:47,457 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 360 transitions. [2022-12-13 15:27:47,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-12-13 15:27:47,458 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:27:47,458 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 15:27:47,466 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f6eb4d4-5989-4681-8d1b-fe1a2e701a6b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-13 15:27:47,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f6eb4d4-5989-4681-8d1b-fe1a2e701a6b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-12-13 15:27:47,659 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 15:27:47,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:27:47,659 INFO L85 PathProgramCache]: Analyzing trace with hash 760529425, now seen corresponding path program 1 times [2022-12-13 15:27:47,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:27:47,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738986381] [2022-12-13 15:27:47,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:27:47,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:27:47,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:47,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 15:27:47,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:47,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 15:27:47,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:48,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 15:27:48,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:48,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 15:27:48,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:48,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 15:27:48,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:48,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 15:27:48,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:48,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 15:27:48,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:48,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 15:27:48,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:48,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-12-13 15:27:48,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:48,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-12-13 15:27:48,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:48,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-12-13 15:27:48,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:48,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-12-13 15:27:48,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:48,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-12-13 15:27:48,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:48,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-12-13 15:27:48,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:48,384 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-12-13 15:27:48,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:27:48,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738986381] [2022-12-13 15:27:48,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738986381] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 15:27:48,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [777899670] [2022-12-13 15:27:48,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:27:48,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 15:27:48,385 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f6eb4d4-5989-4681-8d1b-fe1a2e701a6b/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:27:48,386 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f6eb4d4-5989-4681-8d1b-fe1a2e701a6b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 15:27:48,386 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f6eb4d4-5989-4681-8d1b-fe1a2e701a6b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-13 15:27:48,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:48,678 INFO L263 TraceCheckSpWp]: Trace formula consists of 2630 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 15:27:48,681 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:27:48,826 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-12-13 15:27:48,826 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:27:48,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [777899670] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:27:48,827 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 15:27:48,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [17] total 21 [2022-12-13 15:27:48,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186411222] [2022-12-13 15:27:48,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:27:48,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 15:27:48,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:27:48,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 15:27:48,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=374, Unknown=0, NotChecked=0, Total=420 [2022-12-13 15:27:48,828 INFO L87 Difference]: Start difference. First operand 295 states and 360 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 4 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2022-12-13 15:27:48,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:27:48,976 INFO L93 Difference]: Finished difference Result 513 states and 645 transitions. [2022-12-13 15:27:48,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 15:27:48,977 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 4 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) Word has length 98 [2022-12-13 15:27:48,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:27:48,978 INFO L225 Difference]: With dead ends: 513 [2022-12-13 15:27:48,978 INFO L226 Difference]: Without dead ends: 370 [2022-12-13 15:27:48,979 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=451, Unknown=0, NotChecked=0, Total=506 [2022-12-13 15:27:48,979 INFO L413 NwaCegarLoop]: 164 mSDtfsCounter, 17 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 15:27:48,979 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 724 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 15:27:48,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2022-12-13 15:27:49,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 322. [2022-12-13 15:27:49,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 221 states have (on average 1.158371040723982) internal successors, (256), 225 states have internal predecessors, (256), 70 states have call successors, (70), 28 states have call predecessors, (70), 30 states have return successors, (72), 68 states have call predecessors, (72), 67 states have call successors, (72) [2022-12-13 15:27:49,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 398 transitions. [2022-12-13 15:27:49,007 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 398 transitions. Word has length 98 [2022-12-13 15:27:49,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:27:49,007 INFO L495 AbstractCegarLoop]: Abstraction has 322 states and 398 transitions. [2022-12-13 15:27:49,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 4 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2022-12-13 15:27:49,007 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 398 transitions. [2022-12-13 15:27:49,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-12-13 15:27:49,008 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:27:49,008 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 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] [2022-12-13 15:27:49,017 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f6eb4d4-5989-4681-8d1b-fe1a2e701a6b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-13 15:27:49,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f6eb4d4-5989-4681-8d1b-fe1a2e701a6b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-12-13 15:27:49,209 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 15:27:49,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:27:49,209 INFO L85 PathProgramCache]: Analyzing trace with hash 579357075, now seen corresponding path program 1 times [2022-12-13 15:27:49,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:27:49,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093042251] [2022-12-13 15:27:49,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:27:49,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:27:49,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:49,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 15:27:49,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:49,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 15:27:49,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:49,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 15:27:49,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:49,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 15:27:49,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:49,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 15:27:49,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:49,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 15:27:49,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:49,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 15:27:49,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:49,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 15:27:49,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:49,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-12-13 15:27:49,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:49,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-12-13 15:27:49,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:49,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-12-13 15:27:49,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:49,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-12-13 15:27:49,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:49,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-12-13 15:27:49,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:49,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-12-13 15:27:49,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:49,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-12-13 15:27:49,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:49,854 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-12-13 15:27:49,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:27:49,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093042251] [2022-12-13 15:27:49,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093042251] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 15:27:49,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1197570977] [2022-12-13 15:27:49,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:27:49,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 15:27:49,855 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f6eb4d4-5989-4681-8d1b-fe1a2e701a6b/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:27:49,856 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f6eb4d4-5989-4681-8d1b-fe1a2e701a6b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 15:27:49,857 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f6eb4d4-5989-4681-8d1b-fe1a2e701a6b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-13 15:27:50,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:50,231 INFO L263 TraceCheckSpWp]: Trace formula consists of 2648 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-13 15:27:50,233 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:27:50,327 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-12-13 15:27:50,327 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:27:50,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1197570977] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:27:50,327 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 15:27:50,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [17] total 22 [2022-12-13 15:27:50,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055738769] [2022-12-13 15:27:50,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:27:50,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 15:27:50,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:27:50,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 15:27:50,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=416, Unknown=0, NotChecked=0, Total=462 [2022-12-13 15:27:50,329 INFO L87 Difference]: Start difference. First operand 322 states and 398 transitions. Second operand has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 9 states have internal predecessors, (59), 4 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (15), 6 states have call predecessors, (15), 4 states have call successors, (15) [2022-12-13 15:27:50,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:27:50,479 INFO L93 Difference]: Finished difference Result 474 states and 568 transitions. [2022-12-13 15:27:50,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 15:27:50,480 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 9 states have internal predecessors, (59), 4 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (15), 6 states have call predecessors, (15), 4 states have call successors, (15) Word has length 105 [2022-12-13 15:27:50,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:27:50,481 INFO L225 Difference]: With dead ends: 474 [2022-12-13 15:27:50,481 INFO L226 Difference]: Without dead ends: 295 [2022-12-13 15:27:50,481 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=586, Unknown=0, NotChecked=0, Total=650 [2022-12-13 15:27:50,482 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 32 mSDsluCounter, 1099 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 1229 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 15:27:50,482 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 1229 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 15:27:50,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2022-12-13 15:27:50,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 295. [2022-12-13 15:27:50,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 203 states have (on average 1.1576354679802956) internal successors, (235), 207 states have internal predecessors, (235), 61 states have call successors, (61), 28 states have call predecessors, (61), 30 states have return successors, (61), 59 states have call predecessors, (61), 58 states have call successors, (61) [2022-12-13 15:27:50,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 357 transitions. [2022-12-13 15:27:50,502 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 357 transitions. Word has length 105 [2022-12-13 15:27:50,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:27:50,502 INFO L495 AbstractCegarLoop]: Abstraction has 295 states and 357 transitions. [2022-12-13 15:27:50,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 9 states have internal predecessors, (59), 4 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (15), 6 states have call predecessors, (15), 4 states have call successors, (15) [2022-12-13 15:27:50,502 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 357 transitions. [2022-12-13 15:27:50,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-12-13 15:27:50,503 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:27:50,503 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 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] [2022-12-13 15:27:50,510 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f6eb4d4-5989-4681-8d1b-fe1a2e701a6b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-12-13 15:27:50,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f6eb4d4-5989-4681-8d1b-fe1a2e701a6b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-13 15:27:50,703 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 15:27:50,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:27:50,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1720522272, now seen corresponding path program 1 times [2022-12-13 15:27:50,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:27:50,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779325920] [2022-12-13 15:27:50,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:27:50,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:27:50,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:50,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 15:27:50,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:50,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 15:27:50,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:50,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 15:27:50,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:50,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 15:27:50,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:50,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 15:27:50,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:50,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 15:27:50,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:50,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 15:27:50,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:50,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 15:27:50,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:50,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-12-13 15:27:50,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:50,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-12-13 15:27:50,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:50,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-12-13 15:27:50,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:50,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-12-13 15:27:50,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:50,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-12-13 15:27:50,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:50,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-12-13 15:27:50,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:50,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-12-13 15:27:50,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:50,992 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-12-13 15:27:50,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:27:50,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779325920] [2022-12-13 15:27:50,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779325920] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:27:50,993 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:27:50,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 15:27:50,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780028435] [2022-12-13 15:27:50,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:27:50,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 15:27:50,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:27:50,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 15:27:50,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 15:27:50,994 INFO L87 Difference]: Start difference. First operand 295 states and 357 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-12-13 15:27:51,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:27:51,243 INFO L93 Difference]: Finished difference Result 399 states and 475 transitions. [2022-12-13 15:27:51,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 15:27:51,243 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 107 [2022-12-13 15:27:51,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:27:51,244 INFO L225 Difference]: With dead ends: 399 [2022-12-13 15:27:51,244 INFO L226 Difference]: Without dead ends: 295 [2022-12-13 15:27:51,245 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-13 15:27:51,245 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 50 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 15:27:51,245 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 289 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 15:27:51,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2022-12-13 15:27:51,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 295. [2022-12-13 15:27:51,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 203 states have (on average 1.1428571428571428) internal successors, (232), 207 states have internal predecessors, (232), 61 states have call successors, (61), 28 states have call predecessors, (61), 30 states have return successors, (61), 59 states have call predecessors, (61), 58 states have call successors, (61) [2022-12-13 15:27:51,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 354 transitions. [2022-12-13 15:27:51,263 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 354 transitions. Word has length 107 [2022-12-13 15:27:51,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:27:51,263 INFO L495 AbstractCegarLoop]: Abstraction has 295 states and 354 transitions. [2022-12-13 15:27:51,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-12-13 15:27:51,263 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 354 transitions. [2022-12-13 15:27:51,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-12-13 15:27:51,264 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:27:51,264 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 4, 4, 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] [2022-12-13 15:27:51,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-13 15:27:51,265 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 15:27:51,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:27:51,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1000442815, now seen corresponding path program 1 times [2022-12-13 15:27:51,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:27:51,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955831607] [2022-12-13 15:27:51,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:27:51,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:27:51,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:51,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 15:27:51,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:51,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 15:27:51,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:51,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 15:27:51,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:51,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 15:27:51,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:51,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 15:27:51,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:51,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 15:27:51,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:51,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 15:27:51,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:51,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 15:27:51,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:51,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-12-13 15:27:51,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:51,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-12-13 15:27:51,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:51,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-12-13 15:27:51,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:51,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-12-13 15:27:51,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:51,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-12-13 15:27:51,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:51,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-12-13 15:27:51,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:51,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-12-13 15:27:51,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:51,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 15:27:51,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:51,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 15:27:51,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:51,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-12-13 15:27:51,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:51,529 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2022-12-13 15:27:51,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:27:51,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955831607] [2022-12-13 15:27:51,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955831607] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:27:51,530 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:27:51,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 15:27:51,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139563489] [2022-12-13 15:27:51,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:27:51,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 15:27:51,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:27:51,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 15:27:51,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 15:27:51,531 INFO L87 Difference]: Start difference. First operand 295 states and 354 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 4 states have internal predecessors, (56), 3 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2022-12-13 15:27:51,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:27:51,738 INFO L93 Difference]: Finished difference Result 438 states and 526 transitions. [2022-12-13 15:27:51,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 15:27:51,738 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 4 states have internal predecessors, (56), 3 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 123 [2022-12-13 15:27:51,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:27:51,740 INFO L225 Difference]: With dead ends: 438 [2022-12-13 15:27:51,740 INFO L226 Difference]: Without dead ends: 295 [2022-12-13 15:27:51,740 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 15:27:51,741 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 97 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 15:27:51,741 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 242 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 15:27:51,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2022-12-13 15:27:51,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 295. [2022-12-13 15:27:51,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 203 states have (on average 1.1280788177339902) internal successors, (229), 207 states have internal predecessors, (229), 61 states have call successors, (61), 28 states have call predecessors, (61), 30 states have return successors, (61), 59 states have call predecessors, (61), 58 states have call successors, (61) [2022-12-13 15:27:51,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 351 transitions. [2022-12-13 15:27:51,757 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 351 transitions. Word has length 123 [2022-12-13 15:27:51,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:27:51,757 INFO L495 AbstractCegarLoop]: Abstraction has 295 states and 351 transitions. [2022-12-13 15:27:51,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 4 states have internal predecessors, (56), 3 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2022-12-13 15:27:51,757 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 351 transitions. [2022-12-13 15:27:51,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-12-13 15:27:51,758 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:27:51,758 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 4, 4, 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] [2022-12-13 15:27:51,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-13 15:27:51,758 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 15:27:51,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:27:51,758 INFO L85 PathProgramCache]: Analyzing trace with hash 1057465539, now seen corresponding path program 1 times [2022-12-13 15:27:51,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:27:51,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651242570] [2022-12-13 15:27:51,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:27:51,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:27:51,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:52,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 15:27:52,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:52,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 15:27:52,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:52,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 15:27:52,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:52,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 15:27:52,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:52,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 15:27:52,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:52,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 15:27:52,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:52,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 15:27:52,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:52,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 15:27:52,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:52,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-12-13 15:27:52,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:52,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-12-13 15:27:52,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:52,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-12-13 15:27:52,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:52,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-12-13 15:27:52,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:52,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-12-13 15:27:52,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:52,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-12-13 15:27:52,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:52,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-12-13 15:27:52,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:52,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-12-13 15:27:52,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:52,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 15:27:52,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:52,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 15:27:52,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:52,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-12-13 15:27:52,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:52,173 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2022-12-13 15:27:52,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:27:52,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651242570] [2022-12-13 15:27:52,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651242570] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:27:52,173 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:27:52,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 15:27:52,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674340615] [2022-12-13 15:27:52,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:27:52,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 15:27:52,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:27:52,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 15:27:52,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-13 15:27:52,174 INFO L87 Difference]: Start difference. First operand 295 states and 351 transitions. Second operand has 8 states, 7 states have (on average 8.714285714285714) internal successors, (61), 6 states have internal predecessors, (61), 3 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2022-12-13 15:27:52,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:27:52,432 INFO L93 Difference]: Finished difference Result 450 states and 535 transitions. [2022-12-13 15:27:52,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 15:27:52,433 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.714285714285714) internal successors, (61), 6 states have internal predecessors, (61), 3 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) Word has length 130 [2022-12-13 15:27:52,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:27:52,434 INFO L225 Difference]: With dead ends: 450 [2022-12-13 15:27:52,434 INFO L226 Difference]: Without dead ends: 295 [2022-12-13 15:27:52,434 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-12-13 15:27:52,434 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 73 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 15:27:52,435 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 307 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 15:27:52,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2022-12-13 15:27:52,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 295. [2022-12-13 15:27:52,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 203 states have (on average 1.1133004926108374) internal successors, (226), 207 states have internal predecessors, (226), 61 states have call successors, (61), 28 states have call predecessors, (61), 30 states have return successors, (61), 59 states have call predecessors, (61), 58 states have call successors, (61) [2022-12-13 15:27:52,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 348 transitions. [2022-12-13 15:27:52,450 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 348 transitions. Word has length 130 [2022-12-13 15:27:52,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:27:52,451 INFO L495 AbstractCegarLoop]: Abstraction has 295 states and 348 transitions. [2022-12-13 15:27:52,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.714285714285714) internal successors, (61), 6 states have internal predecessors, (61), 3 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2022-12-13 15:27:52,451 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 348 transitions. [2022-12-13 15:27:52,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-12-13 15:27:52,451 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:27:52,452 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 4, 4, 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] [2022-12-13 15:27:52,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-13 15:27:52,452 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 15:27:52,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:27:52,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1919466878, now seen corresponding path program 1 times [2022-12-13 15:27:52,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:27:52,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187063657] [2022-12-13 15:27:52,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:27:52,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:27:52,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:52,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 15:27:52,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:52,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 15:27:52,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:52,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 15:27:52,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:52,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 15:27:52,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:52,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 15:27:52,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:52,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 15:27:52,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:52,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 15:27:52,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:52,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 15:27:52,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:52,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-12-13 15:27:52,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:52,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-12-13 15:27:52,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:52,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-12-13 15:27:52,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:52,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-12-13 15:27:52,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:52,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-12-13 15:27:52,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:52,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-12-13 15:27:52,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:52,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-12-13 15:27:52,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:52,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-12-13 15:27:52,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:52,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 15:27:52,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:52,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 15:27:52,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:52,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-12-13 15:27:52,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:52,821 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2022-12-13 15:27:52,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:27:52,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187063657] [2022-12-13 15:27:52,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187063657] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:27:52,822 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:27:52,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 15:27:52,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362843106] [2022-12-13 15:27:52,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:27:52,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 15:27:52,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:27:52,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 15:27:52,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-13 15:27:52,823 INFO L87 Difference]: Start difference. First operand 295 states and 348 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 2 states have call successors, (19) [2022-12-13 15:27:53,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:27:53,082 INFO L93 Difference]: Finished difference Result 408 states and 475 transitions. [2022-12-13 15:27:53,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 15:27:53,083 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 2 states have call successors, (19) Word has length 132 [2022-12-13 15:27:53,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:27:53,084 INFO L225 Difference]: With dead ends: 408 [2022-12-13 15:27:53,084 INFO L226 Difference]: Without dead ends: 295 [2022-12-13 15:27:53,084 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-12-13 15:27:53,085 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 50 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 15:27:53,085 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 407 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 15:27:53,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2022-12-13 15:27:53,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 295. [2022-12-13 15:27:53,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 203 states have (on average 1.0985221674876848) internal successors, (223), 207 states have internal predecessors, (223), 61 states have call successors, (61), 28 states have call predecessors, (61), 30 states have return successors, (61), 59 states have call predecessors, (61), 58 states have call successors, (61) [2022-12-13 15:27:53,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 345 transitions. [2022-12-13 15:27:53,101 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 345 transitions. Word has length 132 [2022-12-13 15:27:53,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:27:53,101 INFO L495 AbstractCegarLoop]: Abstraction has 295 states and 345 transitions. [2022-12-13 15:27:53,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 2 states have call successors, (19) [2022-12-13 15:27:53,101 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 345 transitions. [2022-12-13 15:27:53,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-12-13 15:27:53,102 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:27:53,102 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 4, 4, 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] [2022-12-13 15:27:53,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-13 15:27:53,102 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 15:27:53,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:27:53,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1523548186, now seen corresponding path program 1 times [2022-12-13 15:27:53,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:27:53,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127707991] [2022-12-13 15:27:53,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:27:53,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:27:53,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:53,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 15:27:53,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:53,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 15:27:53,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:53,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 15:27:53,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:53,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 15:27:53,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:54,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 15:27:54,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:54,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 15:27:54,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:54,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 15:27:54,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:54,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 15:27:54,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:54,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-12-13 15:27:54,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:54,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-12-13 15:27:54,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:54,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-12-13 15:27:54,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:54,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-12-13 15:27:54,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:54,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-12-13 15:27:54,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:54,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-12-13 15:27:54,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:54,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-12-13 15:27:54,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:54,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-12-13 15:27:54,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:54,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 15:27:54,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:54,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 15:27:54,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:54,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-12-13 15:27:54,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:54,190 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-12-13 15:27:54,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:27:54,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127707991] [2022-12-13 15:27:54,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127707991] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 15:27:54,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [879302277] [2022-12-13 15:27:54,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:27:54,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 15:27:54,190 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f6eb4d4-5989-4681-8d1b-fe1a2e701a6b/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:27:54,191 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f6eb4d4-5989-4681-8d1b-fe1a2e701a6b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 15:27:54,192 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f6eb4d4-5989-4681-8d1b-fe1a2e701a6b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-13 15:27:54,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:27:54,550 INFO L263 TraceCheckSpWp]: Trace formula consists of 2743 conjuncts, 101 conjunts are in the unsatisfiable core [2022-12-13 15:27:54,553 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:27:57,449 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 62 proven. 9 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-12-13 15:27:57,450 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 15:28:01,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [879302277] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 15:28:01,324 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 15:28:01,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 34] total 44 [2022-12-13 15:28:01,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751814224] [2022-12-13 15:28:01,324 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 15:28:01,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-12-13 15:28:01,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:28:01,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-12-13 15:28:01,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=2992, Unknown=0, NotChecked=0, Total=3192 [2022-12-13 15:28:01,326 INFO L87 Difference]: Start difference. First operand 295 states and 345 transitions. Second operand has 44 states, 38 states have (on average 3.1315789473684212) internal successors, (119), 33 states have internal predecessors, (119), 15 states have call successors, (39), 7 states have call predecessors, (39), 11 states have return successors, (37), 15 states have call predecessors, (37), 14 states have call successors, (37) [2022-12-13 15:28:03,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:28:03,594 INFO L93 Difference]: Finished difference Result 305 states and 352 transitions. [2022-12-13 15:28:03,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 15:28:03,594 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 38 states have (on average 3.1315789473684212) internal successors, (119), 33 states have internal predecessors, (119), 15 states have call successors, (39), 7 states have call predecessors, (39), 11 states have return successors, (37), 15 states have call predecessors, (37), 14 states have call successors, (37) Word has length 133 [2022-12-13 15:28:03,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:28:03,595 INFO L225 Difference]: With dead ends: 305 [2022-12-13 15:28:03,595 INFO L226 Difference]: Without dead ends: 0 [2022-12-13 15:28:03,596 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 140 SyntacticMatches, 5 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 946 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=287, Invalid=4405, Unknown=0, NotChecked=0, Total=4692 [2022-12-13 15:28:03,597 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 41 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 838 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 862 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 838 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-12-13 15:28:03,597 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 449 Invalid, 862 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 838 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-12-13 15:28:03,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-12-13 15:28:03,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-12-13 15:28:03,597 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-12-13 15:28:03,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-12-13 15:28:03,597 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 133 [2022-12-13 15:28:03,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:28:03,598 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-12-13 15:28:03,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 38 states have (on average 3.1315789473684212) internal successors, (119), 33 states have internal predecessors, (119), 15 states have call successors, (39), 7 states have call predecessors, (39), 11 states have return successors, (37), 15 states have call predecessors, (37), 14 states have call successors, (37) [2022-12-13 15:28:03,598 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-12-13 15:28:03,598 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-12-13 15:28:03,600 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-12-13 15:28:03,607 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f6eb4d4-5989-4681-8d1b-fe1a2e701a6b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-12-13 15:28:03,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f6eb4d4-5989-4681-8d1b-fe1a2e701a6b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 15:28:03,805 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-12-13 15:28:05,233 INFO L899 garLoopResultBuilder]: For program point ensure_string_is_allocated_bounded_lengthEXIT(lines 6800 6804) no Hoare annotation was computed. [2022-12-13 15:28:05,234 INFO L895 garLoopResultBuilder]: At program point L6810(line 6810) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (forall ((|v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_5| Int)) (not (<= 0 (let ((.cse0 (select (select |old(#memory_int)| |v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_5|) 0))) (+ .cse0 (* 18446744073709551616 (div (- .cse0) 18446744073709551616))))))) (forall ((|v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_17| Int) (|v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset_BEFORE_CALL_15| Int)) (let ((.cse1 (+ |v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset_BEFORE_CALL_15| 8))) (or (not (= (select (select |old(#memory_$Pointer$.base)| |v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_17|) .cse1) 0)) (not (= (select (select |old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_17|) .cse1) 0))))) (and (or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= 16 |ensure_string_is_allocated_bounded_length_~max_size#1|)) (not (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.base| 0)) (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.offset| 0) (exists ((|v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_17| Int) (|v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset_BEFORE_CALL_15| Int)) (let ((.cse2 (+ |v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset_BEFORE_CALL_15| 8))) (and (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_17|) .cse2) 0) (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_17|) .cse2) 0)))) (not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16)) (exists ((|v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_5| Int)) (<= 0 (let ((.cse3 (select (select |#memory_int| |v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_5|) 0))) (+ (* 18446744073709551616 (div (- .cse3) 18446744073709551616)) .cse3)))))) [2022-12-13 15:28:05,234 INFO L899 garLoopResultBuilder]: For program point L6807-1(line 6807) no Hoare annotation was computed. [2022-12-13 15:28:05,234 INFO L895 garLoopResultBuilder]: At program point ensure_string_is_allocated_returnLabel#1(lines 6806 6816) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (and (or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= 16 |ensure_string_is_allocated_bounded_length_~max_size#1|)) (not (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.base| 0)) (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.offset| 0) (not (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_#res#1.base| 0)) (not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16)) (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_#res#1.offset| 0)) (forall ((|v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_5| Int)) (not (<= 0 (let ((.cse0 (select (select |old(#memory_int)| |v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_5|) 0))) (+ .cse0 (* 18446744073709551616 (div (- .cse0) 18446744073709551616))))))) (forall ((|v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_17| Int) (|v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset_BEFORE_CALL_15| Int)) (let ((.cse1 (+ |v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset_BEFORE_CALL_15| 8))) (or (not (= (select (select |old(#memory_$Pointer$.base)| |v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_17|) .cse1) 0)) (not (= (select (select |old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_17|) .cse1) 0)))))) [2022-12-13 15:28:05,235 INFO L895 garLoopResultBuilder]: At program point L6807(line 6807) the Hoare annotation is: (or (let ((.cse0 (not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16)))) (and (= |old(#length)| |#length|) (or (<= 0 (+ (div |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~len#1| 18446744073709551616) (div (+ (- |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~len#1|) 15) 18446744073709551616))) .cse0) (or .cse0 (<= 0 (+ (div (+ (- |ensure_string_is_allocated_bounded_length_~len~1#1|) 15) 18446744073709551616) (div |ensure_string_is_allocated_bounded_length_~len~1#1| 18446744073709551616)))) (= |old(#memory_real)| |#memory_real|) (or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= 16 |ensure_string_is_allocated_bounded_length_~max_size#1|)) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))) (not (< 0 |#StackHeapBarrier|)) (forall ((|v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_5| Int)) (not (<= 0 (let ((.cse1 (select (select |old(#memory_int)| |v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_5|) 0))) (+ .cse1 (* 18446744073709551616 (div (- .cse1) 18446744073709551616))))))) (forall ((|v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_17| Int) (|v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset_BEFORE_CALL_15| Int)) (let ((.cse2 (+ |v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset_BEFORE_CALL_15| 8))) (or (not (= (select (select |old(#memory_$Pointer$.base)| |v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_17|) .cse2) 0)) (not (= (select (select |old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_17|) .cse2) 0)))))) [2022-12-13 15:28:05,235 INFO L899 garLoopResultBuilder]: For program point L6810-3(line 6810) no Hoare annotation was computed. [2022-12-13 15:28:05,235 INFO L895 garLoopResultBuilder]: At program point L6810-2(line 6810) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (forall ((|v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_5| Int)) (not (<= 0 (let ((.cse0 (select (select |old(#memory_int)| |v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_5|) 0))) (+ .cse0 (* 18446744073709551616 (div (- .cse0) 18446744073709551616))))))) (forall ((|v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_17| Int) (|v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset_BEFORE_CALL_15| Int)) (let ((.cse1 (+ |v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset_BEFORE_CALL_15| 8))) (or (not (= (select (select |old(#memory_$Pointer$.base)| |v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_17|) .cse1) 0)) (not (= (select (select |old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_17|) .cse1) 0))))) (and (or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= 16 |ensure_string_is_allocated_bounded_length_~max_size#1|)) (not (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.base| 0)) (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.offset| 0) (exists ((|v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_17| Int) (|v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset_BEFORE_CALL_15| Int)) (let ((.cse2 (+ |v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset_BEFORE_CALL_15| 8))) (and (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_17|) .cse2) 0) (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_17|) .cse2) 0)))) (not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16)) (exists ((|v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_5| Int)) (<= 0 (let ((.cse3 (select (select |#memory_int| |v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_5|) 0))) (+ (* 18446744073709551616 (div (- .cse3) 18446744073709551616)) .cse3)))))) [2022-12-13 15:28:05,235 INFO L899 garLoopResultBuilder]: For program point L6810-1(lines 6810 6811) no Hoare annotation was computed. [2022-12-13 15:28:05,236 INFO L895 garLoopResultBuilder]: At program point L6802(line 6802) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= 16 |ensure_string_is_allocated_bounded_length_~max_size#1|)) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|)) (forall ((|v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_5| Int)) (not (<= 0 (let ((.cse0 (select (select |old(#memory_int)| |v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_5|) 0))) (+ .cse0 (* 18446744073709551616 (div (- .cse0) 18446744073709551616))))))) (forall ((|v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_17| Int) (|v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset_BEFORE_CALL_15| Int)) (let ((.cse1 (+ |v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset_BEFORE_CALL_15| 8))) (or (not (= (select (select |old(#memory_$Pointer$.base)| |v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_17|) .cse1) 0)) (not (= (select (select |old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_17|) .cse1) 0)))))) [2022-12-13 15:28:05,236 INFO L899 garLoopResultBuilder]: For program point L6810-5(lines 6810 6811) no Hoare annotation was computed. [2022-12-13 15:28:05,236 INFO L899 garLoopResultBuilder]: For program point L6801-1(line 6801) no Hoare annotation was computed. [2022-12-13 15:28:05,236 INFO L895 garLoopResultBuilder]: At program point L6801(line 6801) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= 16 |ensure_string_is_allocated_bounded_length_~max_size#1|)) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|)) (forall ((|v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_5| Int)) (not (<= 0 (let ((.cse0 (select (select |old(#memory_int)| |v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_5|) 0))) (+ .cse0 (* 18446744073709551616 (div (- .cse0) 18446744073709551616))))))) (forall ((|v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_17| Int) (|v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset_BEFORE_CALL_15| Int)) (let ((.cse1 (+ |v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset_BEFORE_CALL_15| 8))) (or (not (= (select (select |old(#memory_$Pointer$.base)| |v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_17|) .cse1) 0)) (not (= (select (select |old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_17|) .cse1) 0)))))) [2022-12-13 15:28:05,236 INFO L899 garLoopResultBuilder]: For program point L6802-1(line 6802) no Hoare annotation was computed. [2022-12-13 15:28:05,236 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 6800 6804) the Hoare annotation is: (or (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)|) (= |old(#valid)| |#valid|)) (not (< 0 |#StackHeapBarrier|)) (forall ((|v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_5| Int)) (not (<= 0 (let ((.cse0 (select (select |old(#memory_int)| |v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_5|) 0))) (+ .cse0 (* 18446744073709551616 (div (- .cse0) 18446744073709551616))))))) (forall ((|v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_17| Int) (|v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset_BEFORE_CALL_15| Int)) (let ((.cse1 (+ |v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset_BEFORE_CALL_15| 8))) (or (not (= (select (select |old(#memory_$Pointer$.base)| |v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_17|) .cse1) 0)) (not (= (select (select |old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_17|) .cse1) 0)))))) [2022-12-13 15:28:05,236 INFO L899 garLoopResultBuilder]: For program point ensure_string_is_allocated_bounded_lengthFINAL(lines 6800 6804) no Hoare annotation was computed. [2022-12-13 15:28:05,236 INFO L899 garLoopResultBuilder]: For program point bounded_mallocFINAL(lines 6882 6887) no Hoare annotation was computed. [2022-12-13 15:28:05,237 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 6882 6887) the Hoare annotation is: (or (forall ((|v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_17| Int) (|v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset_BEFORE_CALL_15| Int)) (let ((.cse0 (+ |v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset_BEFORE_CALL_15| 8))) (or (not (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_17|) .cse0) 0)) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_17|) .cse0) 0))))) (not (< 0 |#StackHeapBarrier|)) (forall ((|v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_5| Int)) (not (<= 0 (let ((.cse1 (select (select |#memory_int| |v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_5|) 0))) (+ (* 18446744073709551616 (div (- .cse1) 18446744073709551616)) .cse1))))) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) [2022-12-13 15:28:05,237 INFO L899 garLoopResultBuilder]: For program point bounded_mallocEXIT(lines 6882 6887) no Hoare annotation was computed. [2022-12-13 15:28:05,237 INFO L899 garLoopResultBuilder]: For program point L6883-1(lines 6883 6885) no Hoare annotation was computed. [2022-12-13 15:28:05,237 INFO L895 garLoopResultBuilder]: At program point L6883(lines 6883 6885) the Hoare annotation is: (or (forall ((|v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_17| Int) (|v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset_BEFORE_CALL_15| Int)) (let ((.cse0 (+ |v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset_BEFORE_CALL_15| 8))) (or (not (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_17|) .cse0) 0)) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_17|) .cse0) 0))))) (not (< 0 |#StackHeapBarrier|)) (forall ((|v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_5| Int)) (not (<= 0 (let ((.cse1 (select (select |#memory_int| |v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_5|) 0))) (+ (* 18446744073709551616 (div (- .cse1) 18446744073709551616)) .cse1))))) (and (= |bounded_malloc_#in~size| bounded_malloc_~size) (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) [2022-12-13 15:28:05,237 INFO L899 garLoopResultBuilder]: For program point L7697(lines 7697 7701) no Hoare annotation was computed. [2022-12-13 15:28:05,237 INFO L899 garLoopResultBuilder]: For program point aws_array_eqEXIT(lines 7684 7704) no Hoare annotation was computed. [2022-12-13 15:28:05,237 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 7684 7704) the Hoare annotation is: true [2022-12-13 15:28:05,237 INFO L902 garLoopResultBuilder]: At program point L7686(line 7686) the Hoare annotation is: true [2022-12-13 15:28:05,237 INFO L899 garLoopResultBuilder]: For program point L7688(lines 7685 7704) no Hoare annotation was computed. [2022-12-13 15:28:05,237 INFO L899 garLoopResultBuilder]: For program point aws_array_eqFINAL(lines 7684 7704) no Hoare annotation was computed. [2022-12-13 15:28:05,237 INFO L902 garLoopResultBuilder]: At program point L7686-1(line 7686) the Hoare annotation is: true [2022-12-13 15:28:05,237 INFO L899 garLoopResultBuilder]: For program point nondet_boolFINAL(line 261) no Hoare annotation was computed. [2022-12-13 15:28:05,237 INFO L899 garLoopResultBuilder]: For program point nondet_boolEXIT(line 261) no Hoare annotation was computed. [2022-12-13 15:28:05,237 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 261) the Hoare annotation is: true [2022-12-13 15:28:05,237 INFO L899 garLoopResultBuilder]: For program point L211-2(lines 210 212) no Hoare annotation was computed. [2022-12-13 15:28:05,237 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 210 212) the Hoare annotation is: true [2022-12-13 15:28:05,237 INFO L899 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2022-12-13 15:28:05,237 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 210 212) no Hoare annotation was computed. [2022-12-13 15:28:05,237 INFO L899 garLoopResultBuilder]: For program point can_fail_allocatorFINAL(lines 6889 6891) no Hoare annotation was computed. [2022-12-13 15:28:05,238 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 6889 6891) the Hoare annotation is: true [2022-12-13 15:28:05,238 INFO L899 garLoopResultBuilder]: For program point can_fail_allocatorEXIT(lines 6889 6891) no Hoare annotation was computed. [2022-12-13 15:28:05,238 INFO L899 garLoopResultBuilder]: For program point L6256-2(line 6256) no Hoare annotation was computed. [2022-12-13 15:28:05,238 INFO L899 garLoopResultBuilder]: For program point L6256(line 6256) no Hoare annotation was computed. [2022-12-13 15:28:05,238 INFO L899 garLoopResultBuilder]: For program point L6256-5(line 6256) no Hoare annotation was computed. [2022-12-13 15:28:05,238 INFO L899 garLoopResultBuilder]: For program point aws_string_is_validFINAL(lines 6252 6257) no Hoare annotation was computed. [2022-12-13 15:28:05,238 INFO L899 garLoopResultBuilder]: For program point L6256-3(line 6256) no Hoare annotation was computed. [2022-12-13 15:28:05,238 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 6252 6257) the Hoare annotation is: true [2022-12-13 15:28:05,238 INFO L899 garLoopResultBuilder]: For program point aws_string_is_validEXIT(lines 6252 6257) no Hoare annotation was computed. [2022-12-13 15:28:05,238 INFO L899 garLoopResultBuilder]: For program point L7371(line 7371) no Hoare annotation was computed. [2022-12-13 15:28:05,238 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 7368 7372) the Hoare annotation is: true [2022-12-13 15:28:05,238 INFO L899 garLoopResultBuilder]: For program point L7371-5(line 7371) no Hoare annotation was computed. [2022-12-13 15:28:05,238 INFO L899 garLoopResultBuilder]: For program point L7371-4(line 7371) no Hoare annotation was computed. [2022-12-13 15:28:05,238 INFO L899 garLoopResultBuilder]: For program point L7371-2(line 7371) no Hoare annotation was computed. [2022-12-13 15:28:05,238 INFO L899 garLoopResultBuilder]: For program point L7371-8(line 7371) no Hoare annotation was computed. [2022-12-13 15:28:05,238 INFO L899 garLoopResultBuilder]: For program point L7371-6(line 7371) no Hoare annotation was computed. [2022-12-13 15:28:05,238 INFO L899 garLoopResultBuilder]: For program point aws_byte_cursor_is_validEXIT(lines 7368 7372) no Hoare annotation was computed. [2022-12-13 15:28:05,238 INFO L899 garLoopResultBuilder]: For program point L7371-11(line 7371) no Hoare annotation was computed. [2022-12-13 15:28:05,238 INFO L899 garLoopResultBuilder]: For program point L7371-10(line 7371) no Hoare annotation was computed. [2022-12-13 15:28:05,238 INFO L899 garLoopResultBuilder]: For program point L7370(lines 7370 7371) no Hoare annotation was computed. [2022-12-13 15:28:05,238 INFO L899 garLoopResultBuilder]: For program point L7370-2(lines 7370 7371) no Hoare annotation was computed. [2022-12-13 15:28:05,238 INFO L899 garLoopResultBuilder]: For program point aws_byte_cursor_is_validFINAL(lines 7368 7372) no Hoare annotation was computed. [2022-12-13 15:28:05,238 INFO L899 garLoopResultBuilder]: For program point nondet_uint64_tEXIT(line 266) no Hoare annotation was computed. [2022-12-13 15:28:05,239 INFO L899 garLoopResultBuilder]: For program point nondet_uint64_tFINAL(line 266) no Hoare annotation was computed. [2022-12-13 15:28:05,239 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 266) the Hoare annotation is: true [2022-12-13 15:28:05,239 INFO L899 garLoopResultBuilder]: For program point L6675-1(line 6675) no Hoare annotation was computed. [2022-12-13 15:28:05,239 INFO L895 garLoopResultBuilder]: At program point L6675(line 6675) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset| 8))) (and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) .cse0) 0) (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base| |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) .cse0) 0) (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| 0) (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|) (exists ((|v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_5| Int)) (<= 0 (let ((.cse1 (select (select |#memory_int| |v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_5|) 0))) (+ (* 18446744073709551616 (div (- .cse1) 18446744073709551616)) .cse1)))) (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.offset| 0) (<= 2 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.base| 0) (< 0 |#StackHeapBarrier|))) [2022-12-13 15:28:05,239 INFO L899 garLoopResultBuilder]: For program point L9549(lines 9549 9559) no Hoare annotation was computed. [2022-12-13 15:28:05,239 INFO L895 garLoopResultBuilder]: At program point L9549-1(lines 9549 9559) the Hoare annotation is: (let ((.cse0 (<= 2 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|)) (.cse1 (< 0 |#StackHeapBarrier|))) (or (and (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base| |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.base|) (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) 8) 0)) (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|) .cse0 .cse1) (and (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset| 0) (<= 0 (let ((.cse2 (select (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|))) (+ (* 18446744073709551616 (div (- .cse2) 18446744073709551616)) .cse2))) .cse0 .cse1))) [2022-12-13 15:28:05,239 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(line 9562) the Hoare annotation is: true [2022-12-13 15:28:05,239 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-12-13 15:28:05,239 INFO L895 garLoopResultBuilder]: At program point L7106(line 7106) the Hoare annotation is: false [2022-12-13 15:28:05,239 INFO L899 garLoopResultBuilder]: For program point L7106-1(line 7106) no Hoare annotation was computed. [2022-12-13 15:28:05,239 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2022-12-13 15:28:05,239 INFO L899 garLoopResultBuilder]: For program point L7107-1(lines 7107 7109) no Hoare annotation was computed. [2022-12-13 15:28:05,239 INFO L895 garLoopResultBuilder]: At program point L7107(lines 7107 7109) the Hoare annotation is: false [2022-12-13 15:28:05,239 INFO L899 garLoopResultBuilder]: For program point L7099(lines 7099 7112) no Hoare annotation was computed. [2022-12-13 15:28:05,239 INFO L895 garLoopResultBuilder]: At program point L9560(line 9560) the Hoare annotation is: (and (<= 1 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_#t~ret1348#1|) (<= 2 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) (<= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_#t~ret1348#1| 1) (< 0 |#StackHeapBarrier|)) [2022-12-13 15:28:05,239 INFO L899 garLoopResultBuilder]: For program point L9560-1(line 9560) no Hoare annotation was computed. [2022-12-13 15:28:05,240 INFO L895 garLoopResultBuilder]: At program point L9329-4(line 9329) the Hoare annotation is: (let ((.cse1 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.offset| 0)) (.cse2 (<= 2 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|)) (.cse3 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.base| 0)) (.cse4 (< 0 |#StackHeapBarrier|))) (or (and (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset| 0) (<= 0 (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|))) (+ (* 18446744073709551616 (div (- .cse0) 18446744073709551616)) .cse0))) .cse1 .cse2 .cse3 .cse4) (and (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base| |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.base|) (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) 8) 0)) (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|) .cse1 .cse2 .cse3 .cse4))) [2022-12-13 15:28:05,240 INFO L899 garLoopResultBuilder]: For program point L9329-5(line 9329) no Hoare annotation was computed. [2022-12-13 15:28:05,240 INFO L899 garLoopResultBuilder]: For program point L9329(line 9329) no Hoare annotation was computed. [2022-12-13 15:28:05,240 INFO L895 garLoopResultBuilder]: At program point L9552(line 9552) the Hoare annotation is: false [2022-12-13 15:28:05,240 INFO L895 garLoopResultBuilder]: At program point L9329-2(line 9329) the Hoare annotation is: (let ((.cse1 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.offset| 0)) (.cse2 (<= 2 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|)) (.cse3 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.base| 0)) (.cse4 (< 0 |#StackHeapBarrier|))) (or (and (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset| 0) (<= 0 (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|))) (+ (* 18446744073709551616 (div (- .cse0) 18446744073709551616)) .cse0))) .cse1 .cse2 .cse3 .cse4) (and (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base| |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.base|) (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) 8) 0)) (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|) .cse1 .cse2 .cse3 .cse4))) [2022-12-13 15:28:05,240 INFO L895 garLoopResultBuilder]: At program point L9552-1(line 9552) the Hoare annotation is: false [2022-12-13 15:28:05,240 INFO L899 garLoopResultBuilder]: For program point L9329-3(line 9329) no Hoare annotation was computed. [2022-12-13 15:28:05,240 INFO L899 garLoopResultBuilder]: For program point L9552-2(line 9552) no Hoare annotation was computed. [2022-12-13 15:28:05,240 INFO L895 garLoopResultBuilder]: At program point L9544(line 9544) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base| |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.base|)) (.cse1 (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|)) (.cse2 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.offset| 0)) (.cse3 (<= 2 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|)) (.cse4 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.base| 0)) (.cse5 (< 0 |#StackHeapBarrier|))) (or (and (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) (+ |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset| 8)) 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) 8) 0)) .cse1 .cse2 .cse3 .cse4 .cse5))) [2022-12-13 15:28:05,240 INFO L895 garLoopResultBuilder]: At program point L9544-1(line 9544) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset| 0)) (.cse4 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.offset| 0)) (.cse1 (<= 2 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|)) (.cse5 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.base| 0)) (.cse2 (< 0 |#StackHeapBarrier|))) (or (and .cse0 (<= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_#t~ret1339#1| 0) (<= 0 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_#t~ret1339#1|) .cse1 .cse2) (and .cse0 (<= 0 (let ((.cse3 (select (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|))) (+ (* 18446744073709551616 (div (- .cse3) 18446744073709551616)) .cse3))) .cse4 .cse1 .cse5 .cse2) (and (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base| |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.base|) (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) 8) 0)) (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|) .cse4 .cse1 .cse5 .cse2))) [2022-12-13 15:28:05,240 INFO L899 garLoopResultBuilder]: For program point L9544-2(line 9544) no Hoare annotation was computed. [2022-12-13 15:28:05,240 INFO L899 garLoopResultBuilder]: For program point L7100-1(lines 7099 7112) no Hoare annotation was computed. [2022-12-13 15:28:05,240 INFO L895 garLoopResultBuilder]: At program point L7100(line 7100) the Hoare annotation is: false [2022-12-13 15:28:05,240 INFO L899 garLoopResultBuilder]: For program point L9330(line 9330) no Hoare annotation was computed. [2022-12-13 15:28:05,240 INFO L899 garLoopResultBuilder]: For program point L9330-5(line 9330) no Hoare annotation was computed. [2022-12-13 15:28:05,240 INFO L899 garLoopResultBuilder]: For program point L9553(lines 9553 9558) no Hoare annotation was computed. [2022-12-13 15:28:05,241 INFO L895 garLoopResultBuilder]: At program point L9330-2(line 9330) the Hoare annotation is: (let ((.cse1 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.offset| 0)) (.cse2 (<= 2 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|)) (.cse3 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.base| 0)) (.cse4 (< 0 |#StackHeapBarrier|))) (or (and (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset| 0) (<= 0 (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|))) (+ (* 18446744073709551616 (div (- .cse0) 18446744073709551616)) .cse0))) .cse1 .cse2 .cse3 .cse4) (and (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base| |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.base|) (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) 8) 0)) (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|) .cse1 .cse2 .cse3 .cse4))) [2022-12-13 15:28:05,241 INFO L899 garLoopResultBuilder]: For program point L9330-3(line 9330) no Hoare annotation was computed. [2022-12-13 15:28:05,241 INFO L895 garLoopResultBuilder]: At program point L9330-4(line 9330) the Hoare annotation is: (let ((.cse3 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.base| 0))) (let ((.cse5 (= |ULTIMATE.start_aws_string_eq_byte_cursor_~cur#1.base| 0)) (.cse0 (<= 0 (let ((.cse13 (select (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|))) (+ (* 18446744073709551616 (div (- .cse13) 18446744073709551616)) .cse13)))) (.cse6 (not .cse3)) (.cse7 (not (= |ULTIMATE.start_aws_string_eq_byte_cursor_~str#1.base| 0))) (.cse8 (= |ULTIMATE.start_aws_string_eq_byte_cursor_~cur#1.offset| 0)) (.cse9 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base| |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.base|)) (.cse10 (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| 0)) (.cse11 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) 8) 0))) (.cse12 (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|)) (.cse1 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.offset| 0)) (.cse2 (<= 2 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|)) (.cse4 (< 0 |#StackHeapBarrier|))) (or (and (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset| 0) .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse2 .cse4) (and .cse5 .cse0 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) (+ |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset| 8)) 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse2 .cse4) (and .cse9 .cse10 .cse11 .cse12 .cse1 .cse2 .cse3 .cse4)))) [2022-12-13 15:28:05,241 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-12-13 15:28:05,241 INFO L899 garLoopResultBuilder]: For program point L9537(lines 9537 9561) no Hoare annotation was computed. [2022-12-13 15:28:05,241 INFO L899 garLoopResultBuilder]: For program point L9331(lines 9331 9339) no Hoare annotation was computed. [2022-12-13 15:28:05,241 INFO L895 garLoopResultBuilder]: At program point L9554(line 9554) the Hoare annotation is: false [2022-12-13 15:28:05,241 INFO L899 garLoopResultBuilder]: For program point L6672(lines 6672 6676) no Hoare annotation was computed. [2022-12-13 15:28:05,241 INFO L899 garLoopResultBuilder]: For program point L9554-1(line 9554) no Hoare annotation was computed. [2022-12-13 15:28:05,241 INFO L895 garLoopResultBuilder]: At program point L7110(line 7110) the Hoare annotation is: false [2022-12-13 15:28:05,241 INFO L895 garLoopResultBuilder]: At program point L9538(line 9538) the Hoare annotation is: (and (exists ((|v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_17| Int) (|v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset_BEFORE_CALL_15| Int)) (let ((.cse0 (+ |v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset_BEFORE_CALL_15| 8))) (and (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_17|) .cse0) 0) (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_17|) .cse0) 0)))) (exists ((|v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_5| Int)) (<= 0 (let ((.cse1 (select (select |#memory_int| |v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_5|) 0))) (+ (* 18446744073709551616 (div (- .cse1) 18446744073709551616)) .cse1)))) (< 0 |#StackHeapBarrier|)) [2022-12-13 15:28:05,241 INFO L899 garLoopResultBuilder]: For program point L7110-1(line 7110) no Hoare annotation was computed. [2022-12-13 15:28:05,241 INFO L899 garLoopResultBuilder]: For program point L9538-5(lines 9538 9539) no Hoare annotation was computed. [2022-12-13 15:28:05,241 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-12-13 15:28:05,241 INFO L899 garLoopResultBuilder]: For program point L9340(lines 9340 9348) no Hoare annotation was computed. [2022-12-13 15:28:05,241 INFO L899 garLoopResultBuilder]: For program point L9538-1(lines 9538 9539) no Hoare annotation was computed. [2022-12-13 15:28:05,241 INFO L895 garLoopResultBuilder]: At program point L9538-2(line 9538) the Hoare annotation is: (and (exists ((|v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_17| Int) (|v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset_BEFORE_CALL_15| Int)) (let ((.cse0 (+ |v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset_BEFORE_CALL_15| 8))) (and (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_17|) .cse0) 0) (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_17|) .cse0) 0)))) (exists ((|v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_5| Int)) (<= 0 (let ((.cse1 (select (select |#memory_int| |v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_5|) 0))) (+ (* 18446744073709551616 (div (- .cse1) 18446744073709551616)) .cse1)))) (< 0 |#StackHeapBarrier|)) [2022-12-13 15:28:05,242 INFO L899 garLoopResultBuilder]: For program point L9538-3(line 9538) no Hoare annotation was computed. [2022-12-13 15:28:05,242 INFO L899 garLoopResultBuilder]: For program point L9555(lines 9555 9557) no Hoare annotation was computed. [2022-12-13 15:28:05,242 INFO L899 garLoopResultBuilder]: For program point L6673-3(lines 6673 6675) no Hoare annotation was computed. [2022-12-13 15:28:05,242 INFO L899 garLoopResultBuilder]: For program point L6673-1(lines 6673 6675) no Hoare annotation was computed. [2022-12-13 15:28:05,242 INFO L895 garLoopResultBuilder]: At program point L6673(line 6673) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset| 8))) (and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) .cse0) 0) (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base| |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) .cse0) 0) (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| 0) (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|) (exists ((|v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_5| Int)) (<= 0 (let ((.cse1 (select (select |#memory_int| |v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_5|) 0))) (+ (* 18446744073709551616 (div (- .cse1) 18446744073709551616)) .cse1)))) (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.offset| 0) (<= 2 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.base| 0) (< 0 |#StackHeapBarrier|))) [2022-12-13 15:28:05,242 INFO L895 garLoopResultBuilder]: At program point L9349(line 9349) the Hoare annotation is: (let ((.cse1 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.offset| 0)) (.cse2 (<= 2 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|)) (.cse3 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.base| 0)) (.cse4 (< 0 |#StackHeapBarrier|))) (or (and (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset| 0) (<= 0 (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|))) (+ (* 18446744073709551616 (div (- .cse0) 18446744073709551616)) .cse0))) .cse1 .cse2 .cse3 .cse4) (and (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base| |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.base|) (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) 8) 0)) (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|) .cse1 .cse2 .cse3 .cse4))) [2022-12-13 15:28:05,242 INFO L899 garLoopResultBuilder]: For program point L9349-1(line 9349) no Hoare annotation was computed. [2022-12-13 15:28:05,242 INFO L895 garLoopResultBuilder]: At program point L9548(line 9548) the Hoare annotation is: (let ((.cse1 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.offset| 0)) (.cse2 (<= 2 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|)) (.cse3 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.base| 0)) (.cse4 (< 0 |#StackHeapBarrier|))) (or (and (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset| 0) (<= 0 (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|))) (+ (* 18446744073709551616 (div (- .cse0) 18446744073709551616)) .cse0))) .cse1 .cse2 .cse3 .cse4) (and (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base| |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.base|) (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) 8) 0)) (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|) .cse1 .cse2 .cse3 .cse4))) [2022-12-13 15:28:05,242 INFO L899 garLoopResultBuilder]: For program point L9548-1(line 9548) no Hoare annotation was computed. [2022-12-13 15:28:05,242 INFO L895 garLoopResultBuilder]: At program point aws_string_eq_byte_cursor_returnLabel#1(lines 9327 9350) the Hoare annotation is: (let ((.cse3 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.base| 0))) (let ((.cse5 (= |ULTIMATE.start_aws_string_eq_byte_cursor_#res#1| 0)) (.cse0 (<= 0 (let ((.cse12 (select (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|))) (+ (* 18446744073709551616 (div (- .cse12) 18446744073709551616)) .cse12)))) (.cse6 (not .cse3)) (.cse7 (not (= |ULTIMATE.start_aws_string_eq_byte_cursor_~str#1.base| 0))) (.cse8 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base| |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.base|)) (.cse9 (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| 0)) (.cse10 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) 8) 0))) (.cse11 (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|)) (.cse1 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.offset| 0)) (.cse2 (<= 2 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|)) (.cse4 (< 0 |#StackHeapBarrier|))) (or (and (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset| 0) .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse2 .cse4) (and .cse5 .cse0 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) (+ |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset| 8)) 0) .cse6 .cse7 .cse8 .cse9 .cse11 .cse2 .cse4) (and .cse8 .cse9 .cse10 .cse11 .cse1 .cse2 .cse3 .cse4)))) [2022-12-13 15:28:05,242 INFO L899 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2022-12-13 15:28:05,242 INFO L899 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2022-12-13 15:28:05,242 INFO L899 garLoopResultBuilder]: For program point L223-3(lines 222 224) no Hoare annotation was computed. [2022-12-13 15:28:05,242 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 222 224) no Hoare annotation was computed. [2022-12-13 15:28:05,242 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 222 224) the Hoare annotation is: true [2022-12-13 15:28:05,243 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2022-12-13 15:28:05,245 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, 1] [2022-12-13 15:28:05,246 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 15:28:05,251 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_5,QUANTIFIED] [2022-12-13 15:28:05,251 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_5,QUANTIFIED] [2022-12-13 15:28:05,252 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 15:28:05,252 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_17,QUANTIFIED] [2022-12-13 15:28:05,252 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset_BEFORE_CALL_15,QUANTIFIED] [2022-12-13 15:28:05,252 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 15:28:05,252 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_17,QUANTIFIED] [2022-12-13 15:28:05,252 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset_BEFORE_CALL_15,QUANTIFIED] [2022-12-13 15:28:05,255 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_5,QUANTIFIED] [2022-12-13 15:28:05,256 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_5,QUANTIFIED] [2022-12-13 15:28:05,256 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 15:28:05,256 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_17,QUANTIFIED] [2022-12-13 15:28:05,256 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset_BEFORE_CALL_15,QUANTIFIED] [2022-12-13 15:28:05,256 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 15:28:05,256 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_17,QUANTIFIED] [2022-12-13 15:28:05,256 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset_BEFORE_CALL_15,QUANTIFIED] [2022-12-13 15:28:05,257 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 15:28:05,258 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 15:28:05,258 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 15:28:05,258 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 15:28:05,259 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 15:28:05,259 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 15:28:05,260 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 03:28:05 BoogieIcfgContainer [2022-12-13 15:28:05,260 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 15:28:05,260 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 15:28:05,260 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 15:28:05,260 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 15:28:05,261 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 03:27:26" (3/4) ... [2022-12-13 15:28:05,263 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-12-13 15:28:05,267 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ensure_string_is_allocated_bounded_length [2022-12-13 15:28:05,267 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure bounded_malloc [2022-12-13 15:28:05,267 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_byte_cursor_is_valid [2022-12-13 15:28:05,267 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_array_eq [2022-12-13 15:28:05,267 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_uint64_t [2022-12-13 15:28:05,267 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_bool [2022-12-13 15:28:05,267 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2022-12-13 15:28:05,267 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2022-12-13 15:28:05,267 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure can_fail_allocator [2022-12-13 15:28:05,267 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_string_is_valid [2022-12-13 15:28:05,274 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 127 nodes and edges [2022-12-13 15:28:05,275 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 57 nodes and edges [2022-12-13 15:28:05,276 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 27 nodes and edges [2022-12-13 15:28:05,276 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2022-12-13 15:28:05,277 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2022-12-13 15:28:05,277 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-12-13 15:28:05,278 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-12-13 15:28:05,278 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-12-13 15:28:05,297 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((cursor == 0 && 0 <= 18446744073709551616 * (-unknown-#memory_int-unknown[cursor][cursor] / 18446744073709551616) + unknown-#memory_int-unknown[cursor][cursor]) && str == 0) && 2 <= cursor) && str == 0) && 0 < unknown-#StackHeapBarrier-unknown) || ((((((((\result == 0 && !(str == 0)) && !(str == 0)) && cursor == cursor) && cursor == 0) && !(#memory_$Pointer$[cursor][8] == 0)) && cursor == cursor) && 2 <= cursor) && 0 < unknown-#StackHeapBarrier-unknown)) || (((((((((\result == 0 && 0 <= 18446744073709551616 * (-unknown-#memory_int-unknown[cursor][cursor] / 18446744073709551616) + unknown-#memory_int-unknown[cursor][cursor]) && #memory_$Pointer$[cursor][cursor + 8] == 0) && !(str == 0)) && !(str == 0)) && cursor == cursor) && cursor == 0) && cursor == cursor) && 2 <= cursor) && 0 < unknown-#StackHeapBarrier-unknown)) || (((((((cursor == cursor && cursor == 0) && !(#memory_$Pointer$[cursor][8] == 0)) && cursor == cursor) && str == 0) && 2 <= cursor) && str == 0) && 0 < unknown-#StackHeapBarrier-unknown) [2022-12-13 15:28:05,297 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((!(0 < unknown-#StackHeapBarrier-unknown) || ((((((\old(max_size) == max_size || 16 == max_size) && !(str == 0)) && str == 0) && !(\result == 0)) && !(\old(max_size) == 16)) && \result == 0)) || (forall v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_5 : int :: !(0 <= \old(unknown-#memory_int-unknown)[v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_5][0] + 18446744073709551616 * (-\old(unknown-#memory_int-unknown)[v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_5][0] / 18446744073709551616)))) || (forall v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_17 : int, v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset_BEFORE_CALL_15 : int :: !(\old(#memory_$Pointer$)[v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_17][v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset_BEFORE_CALL_15 + 8] == 0) || !(\old(#memory_$Pointer$)[v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_17][v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset_BEFORE_CALL_15 + 8] == 0)) [2022-12-13 15:28:05,619 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f6eb4d4-5989-4681-8d1b-fe1a2e701a6b/bin/uautomizer-uyxdKDjOR8/witness.graphml [2022-12-13 15:28:05,619 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 15:28:05,619 INFO L158 Benchmark]: Toolchain (without parser) took 42719.20ms. Allocated memory was 138.4MB in the beginning and 423.6MB in the end (delta: 285.2MB). Free memory was 93.0MB in the beginning and 101.0MB in the end (delta: -8.0MB). Peak memory consumption was 279.3MB. Max. memory is 16.1GB. [2022-12-13 15:28:05,619 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 138.4MB. Free memory is still 108.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 15:28:05,619 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2031.55ms. Allocated memory was 138.4MB in the beginning and 167.8MB in the end (delta: 29.4MB). Free memory was 93.0MB in the beginning and 96.3MB in the end (delta: -3.3MB). Peak memory consumption was 85.9MB. Max. memory is 16.1GB. [2022-12-13 15:28:05,620 INFO L158 Benchmark]: Boogie Procedure Inliner took 124.10ms. Allocated memory is still 167.8MB. Free memory was 95.3MB in the beginning and 83.7MB in the end (delta: 11.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-12-13 15:28:05,620 INFO L158 Benchmark]: Boogie Preprocessor took 47.67ms. Allocated memory is still 167.8MB. Free memory was 83.7MB in the beginning and 77.5MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-12-13 15:28:05,620 INFO L158 Benchmark]: RCFGBuilder took 1294.73ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 77.5MB in the beginning and 123.1MB in the end (delta: -45.6MB). Peak memory consumption was 36.1MB. Max. memory is 16.1GB. [2022-12-13 15:28:05,620 INFO L158 Benchmark]: TraceAbstraction took 38856.05ms. Allocated memory was 201.3MB in the beginning and 423.6MB in the end (delta: 222.3MB). Free memory was 122.0MB in the beginning and 233.2MB in the end (delta: -111.1MB). Peak memory consumption was 249.6MB. Max. memory is 16.1GB. [2022-12-13 15:28:05,620 INFO L158 Benchmark]: Witness Printer took 358.82ms. Allocated memory is still 423.6MB. Free memory was 233.2MB in the beginning and 101.0MB in the end (delta: 132.1MB). Peak memory consumption was 130.0MB. Max. memory is 16.1GB. [2022-12-13 15:28:05,621 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.13ms. Allocated memory is still 138.4MB. Free memory is still 108.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2031.55ms. Allocated memory was 138.4MB in the beginning and 167.8MB in the end (delta: 29.4MB). Free memory was 93.0MB in the beginning and 96.3MB in the end (delta: -3.3MB). Peak memory consumption was 85.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 124.10ms. Allocated memory is still 167.8MB. Free memory was 95.3MB in the beginning and 83.7MB in the end (delta: 11.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.67ms. Allocated memory is still 167.8MB. Free memory was 83.7MB in the beginning and 77.5MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1294.73ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 77.5MB in the beginning and 123.1MB in the end (delta: -45.6MB). Peak memory consumption was 36.1MB. Max. memory is 16.1GB. * TraceAbstraction took 38856.05ms. Allocated memory was 201.3MB in the beginning and 423.6MB in the end (delta: 222.3MB). Free memory was 122.0MB in the beginning and 233.2MB in the end (delta: -111.1MB). Peak memory consumption was 249.6MB. Max. memory is 16.1GB. * Witness Printer took 358.82ms. Allocated memory is still 423.6MB. Free memory was 233.2MB in the beginning and 101.0MB in the end (delta: 132.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_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_5,QUANTIFIED] - 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_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset_BEFORE_CALL_15,QUANTIFIED] - 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_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset_BEFORE_CALL_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_5,QUANTIFIED] - 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_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset_BEFORE_CALL_15,QUANTIFIED] - 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_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset_BEFORE_CALL_15,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$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base * 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 11 procedures, 123 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 38.8s, OverallIterations: 20, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 9.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1492 SdHoareTripleChecker+Valid, 7.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1362 mSDsluCounter, 13726 SdHoareTripleChecker+Invalid, 6.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11194 mSDsCounter, 433 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6101 IncrementalHoareTripleChecker+Invalid, 6534 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 433 mSolverCounterUnsat, 2532 mSDtfsCounter, 6101 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1749 GetRequests, 1428 SyntacticMatches, 20 SemanticMatches, 301 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1535 ImplicationChecksByTransitivity, 8.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=436occurred in iteration=8, InterpolantAutomatonStates: 174, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 20 MinimizatonAttempts, 149 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 42 LocationsWithAnnotation, 624 PreInvPairs, 666 NumberOfFragments, 1783 HoareAnnotationTreeSize, 624 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 42 FomulaSimplificationsInter, 1701 FormulaSimplificationTreeSizeReductionInter, 1.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 3.3s SatisfiabilityAnalysisTime, 19.7s InterpolantComputationTime, 2688 NumberOfCodeBlocks, 2688 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 2781 ConstructedInterpolants, 73 QuantifiedInterpolants, 11559 SizeOfPredicates, 85 NumberOfNonLiveVariables, 28160 ConjunctsInSsa, 247 ConjunctsInUnsatCore, 33 InterpolantComputations, 17 PerfectInterpolantSequences, 1487/1647 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: 6806]: Loop Invariant [2022-12-13 15:28:05,625 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_5,QUANTIFIED] [2022-12-13 15:28:05,625 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_5,QUANTIFIED] [2022-12-13 15:28:05,625 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 15:28:05,625 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_17,QUANTIFIED] [2022-12-13 15:28:05,625 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset_BEFORE_CALL_15,QUANTIFIED] [2022-12-13 15:28:05,625 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 15:28:05,625 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_17,QUANTIFIED] [2022-12-13 15:28:05,625 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset_BEFORE_CALL_15,QUANTIFIED] [2022-12-13 15:28:05,626 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_5,QUANTIFIED] [2022-12-13 15:28:05,626 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_5,QUANTIFIED] [2022-12-13 15:28:05,626 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 15:28:05,626 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_17,QUANTIFIED] [2022-12-13 15:28:05,626 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset_BEFORE_CALL_15,QUANTIFIED] [2022-12-13 15:28:05,626 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 15:28:05,626 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_17,QUANTIFIED] [2022-12-13 15:28:05,626 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset_BEFORE_CALL_15,QUANTIFIED] Derived loop invariant: ((!(0 < unknown-#StackHeapBarrier-unknown) || ((((((\old(max_size) == max_size || 16 == max_size) && !(str == 0)) && str == 0) && !(\result == 0)) && !(\old(max_size) == 16)) && \result == 0)) || (forall v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_5 : int :: !(0 <= \old(unknown-#memory_int-unknown)[v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_5][0] + 18446744073709551616 * (-\old(unknown-#memory_int-unknown)[v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_5][0] / 18446744073709551616)))) || (forall v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_17 : int, v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset_BEFORE_CALL_15 : int :: !(\old(#memory_$Pointer$)[v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_17][v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset_BEFORE_CALL_15 + 8] == 0) || !(\old(#memory_$Pointer$)[v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_17][v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset_BEFORE_CALL_15 + 8] == 0)) - InvariantResult [Line: 9562]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 9327]: Loop Invariant [2022-12-13 15:28:05,627 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 15:28:05,627 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 15:28:05,627 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 15:28:05,628 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 15:28:05,628 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 15:28:05,628 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (((((((cursor == 0 && 0 <= 18446744073709551616 * (-unknown-#memory_int-unknown[cursor][cursor] / 18446744073709551616) + unknown-#memory_int-unknown[cursor][cursor]) && str == 0) && 2 <= cursor) && str == 0) && 0 < unknown-#StackHeapBarrier-unknown) || ((((((((\result == 0 && !(str == 0)) && !(str == 0)) && cursor == cursor) && cursor == 0) && !(#memory_$Pointer$[cursor][8] == 0)) && cursor == cursor) && 2 <= cursor) && 0 < unknown-#StackHeapBarrier-unknown)) || (((((((((\result == 0 && 0 <= 18446744073709551616 * (-unknown-#memory_int-unknown[cursor][cursor] / 18446744073709551616) + unknown-#memory_int-unknown[cursor][cursor]) && #memory_$Pointer$[cursor][cursor + 8] == 0) && !(str == 0)) && !(str == 0)) && cursor == cursor) && cursor == 0) && cursor == cursor) && 2 <= cursor) && 0 < unknown-#StackHeapBarrier-unknown)) || (((((((cursor == cursor && cursor == 0) && !(#memory_$Pointer$[cursor][8] == 0)) && cursor == cursor) && str == 0) && 2 <= cursor) && str == 0) && 0 < unknown-#StackHeapBarrier-unknown) RESULT: Ultimate proved your program to be correct! [2022-12-13 15:28:05,641 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f6eb4d4-5989-4681-8d1b-fe1a2e701a6b/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE