./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/aws-c-common/aws_linked_list_rbegin_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc 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_d7e573dc-ea7c-487b-91f3-c5b08a46fc9a/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7e573dc-ea7c-487b-91f3-c5b08a46fc9a/bin/utaipan-verify-nQ1chXbOIh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7e573dc-ea7c-487b-91f3-c5b08a46fc9a/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7e573dc-ea7c-487b-91f3-c5b08a46fc9a/bin/utaipan-verify-nQ1chXbOIh/config/TaipanReach.xml -i ../../sv-benchmarks/c/aws-c-common/aws_linked_list_rbegin_harness.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7e573dc-ea7c-487b-91f3-c5b08a46fc9a/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7e573dc-ea7c-487b-91f3-c5b08a46fc9a/bin/utaipan-verify-nQ1chXbOIh --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 3bef4637cc296c755ba815d09f028f51f0bde7e0d2e6155f2b5c648b5201a193 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 13:10:59,728 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 13:10:59,791 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7e573dc-ea7c-487b-91f3-c5b08a46fc9a/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-64bit-Taipan_Default.epf [2023-12-02 13:10:59,797 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 13:10:59,797 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 13:10:59,821 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 13:10:59,821 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 13:10:59,821 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 13:10:59,822 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 13:10:59,823 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 13:10:59,823 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 13:10:59,824 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 13:10:59,824 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 13:10:59,825 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-12-02 13:10:59,831 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 13:10:59,831 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 13:10:59,832 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-12-02 13:10:59,832 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-12-02 13:10:59,833 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 13:10:59,833 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-12-02 13:10:59,834 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-12-02 13:10:59,835 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-12-02 13:10:59,835 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 13:10:59,836 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-02 13:10:59,836 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 13:10:59,837 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 13:10:59,837 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-02 13:10:59,838 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 13:10:59,838 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-02 13:10:59,838 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-02 13:10:59,839 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 13:10:59,839 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 13:10:59,839 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 13:10:59,840 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 13:10:59,840 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 13:10:59,840 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 13:10:59,840 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 13:10:59,841 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-02 13:10:59,841 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-12-02 13:10:59,841 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 13:10:59,841 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 13:10:59,842 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-02 13:10:59,842 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 13:10:59,842 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 13:10:59,842 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_d7e573dc-ea7c-487b-91f3-c5b08a46fc9a/bin/utaipan-verify-nQ1chXbOIh/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_d7e573dc-ea7c-487b-91f3-c5b08a46fc9a/bin/utaipan-verify-nQ1chXbOIh Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> Taipan 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 -> 3bef4637cc296c755ba815d09f028f51f0bde7e0d2e6155f2b5c648b5201a193 [2023-12-02 13:11:00,050 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 13:11:00,070 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 13:11:00,072 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 13:11:00,073 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 13:11:00,074 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 13:11:00,075 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7e573dc-ea7c-487b-91f3-c5b08a46fc9a/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/aws-c-common/aws_linked_list_rbegin_harness.i [2023-12-02 13:11:02,845 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 13:11:03,212 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 13:11:03,213 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7e573dc-ea7c-487b-91f3-c5b08a46fc9a/sv-benchmarks/c/aws-c-common/aws_linked_list_rbegin_harness.i [2023-12-02 13:11:03,240 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7e573dc-ea7c-487b-91f3-c5b08a46fc9a/bin/utaipan-verify-nQ1chXbOIh/data/862b80130/32a3389ae4b149c7a194809ee8d67ff6/FLAGb77b784d5 [2023-12-02 13:11:03,412 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7e573dc-ea7c-487b-91f3-c5b08a46fc9a/bin/utaipan-verify-nQ1chXbOIh/data/862b80130/32a3389ae4b149c7a194809ee8d67ff6 [2023-12-02 13:11:03,415 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 13:11:03,416 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 13:11:03,417 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 13:11:03,418 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 13:11:03,422 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 13:11:03,423 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 01:11:03" (1/1) ... [2023-12-02 13:11:03,424 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f90db0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:11:03, skipping insertion in model container [2023-12-02 13:11:03,424 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 01:11:03" (1/1) ... [2023-12-02 13:11:03,537 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 13:11:03,734 WARN L240 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_d7e573dc-ea7c-487b-91f3-c5b08a46fc9a/sv-benchmarks/c/aws-c-common/aws_linked_list_rbegin_harness.i[4496,4509] [2023-12-02 13:11:03,740 WARN L240 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_d7e573dc-ea7c-487b-91f3-c5b08a46fc9a/sv-benchmarks/c/aws-c-common/aws_linked_list_rbegin_harness.i[4556,4569] [2023-12-02 13:11:04,451 WARN L1590 CHandler]: Possible shadowing of function index [2023-12-02 13:11:04,452 WARN L1590 CHandler]: Possible shadowing of function index [2023-12-02 13:11:04,453 WARN L1590 CHandler]: Possible shadowing of function index [2023-12-02 13:11:04,454 WARN L1590 CHandler]: Possible shadowing of function index [2023-12-02 13:11:04,455 WARN L1590 CHandler]: Possible shadowing of function index [2023-12-02 13:11:04,471 WARN L1590 CHandler]: Possible shadowing of function index [2023-12-02 13:11:04,472 WARN L1590 CHandler]: Possible shadowing of function index [2023-12-02 13:11:04,474 WARN L1590 CHandler]: Possible shadowing of function index [2023-12-02 13:11:04,475 WARN L1590 CHandler]: Possible shadowing of function index [2023-12-02 13:11:04,477 WARN L1590 CHandler]: Possible shadowing of function index [2023-12-02 13:11:04,478 WARN L1590 CHandler]: Possible shadowing of function index [2023-12-02 13:11:04,479 WARN L1590 CHandler]: Possible shadowing of function index [2023-12-02 13:11:04,480 WARN L1590 CHandler]: Possible shadowing of function index [2023-12-02 13:11:04,798 WARN L638 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-12-02 13:11:04,800 WARN L638 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-12-02 13:11:04,801 WARN L638 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-12-02 13:11:04,802 WARN L638 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-12-02 13:11:04,804 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-12-02 13:11:04,804 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-12-02 13:11:04,805 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-12-02 13:11:04,806 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-12-02 13:11:04,806 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-12-02 13:11:04,807 WARN L638 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-12-02 13:11:04,940 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 13:11:04,958 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 13:11:04,972 WARN L240 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_d7e573dc-ea7c-487b-91f3-c5b08a46fc9a/sv-benchmarks/c/aws-c-common/aws_linked_list_rbegin_harness.i[4496,4509] [2023-12-02 13:11:04,973 WARN L240 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_d7e573dc-ea7c-487b-91f3-c5b08a46fc9a/sv-benchmarks/c/aws-c-common/aws_linked_list_rbegin_harness.i[4556,4569] [2023-12-02 13:11:05,015 WARN L1590 CHandler]: Possible shadowing of function index [2023-12-02 13:11:05,016 WARN L1590 CHandler]: Possible shadowing of function index [2023-12-02 13:11:05,016 WARN L1590 CHandler]: Possible shadowing of function index [2023-12-02 13:11:05,017 WARN L1590 CHandler]: Possible shadowing of function index [2023-12-02 13:11:05,018 WARN L1590 CHandler]: Possible shadowing of function index [2023-12-02 13:11:05,027 WARN L1590 CHandler]: Possible shadowing of function index [2023-12-02 13:11:05,028 WARN L1590 CHandler]: Possible shadowing of function index [2023-12-02 13:11:05,029 WARN L1590 CHandler]: Possible shadowing of function index [2023-12-02 13:11:05,030 WARN L1590 CHandler]: Possible shadowing of function index [2023-12-02 13:11:05,031 WARN L1590 CHandler]: Possible shadowing of function index [2023-12-02 13:11:05,031 WARN L1590 CHandler]: Possible shadowing of function index [2023-12-02 13:11:05,032 WARN L1590 CHandler]: Possible shadowing of function index [2023-12-02 13:11:05,032 WARN L1590 CHandler]: Possible shadowing of function index [2023-12-02 13:11:05,068 WARN L638 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-12-02 13:11:05,069 WARN L638 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-12-02 13:11:05,069 WARN L638 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-12-02 13:11:05,070 WARN L638 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-12-02 13:11:05,071 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-12-02 13:11:05,072 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-12-02 13:11:05,072 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-12-02 13:11:05,073 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-12-02 13:11:05,073 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-12-02 13:11:05,074 WARN L638 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-12-02 13:11:05,111 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 13:11:05,400 WARN L675 CHandler]: The function __atomic_fetch_or is called, but not defined or handled by StandardFunctionHandler. [2023-12-02 13:11:05,400 WARN L675 CHandler]: The function __atomic_fetch_sub is called, but not defined or handled by StandardFunctionHandler. [2023-12-02 13:11:05,400 WARN L675 CHandler]: The function __atomic_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-12-02 13:11:05,400 WARN L675 CHandler]: The function __atomic_fetch_xor is called, but not defined or handled by StandardFunctionHandler. [2023-12-02 13:11:05,400 WARN L675 CHandler]: The function htons is called, but not defined or handled by StandardFunctionHandler. [2023-12-02 13:11:05,400 WARN L675 CHandler]: The function ntohl is called, but not defined or handled by StandardFunctionHandler. [2023-12-02 13:11:05,401 WARN L675 CHandler]: The function __atomic_compare_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-12-02 13:11:05,401 WARN L675 CHandler]: The function __atomic_fetch_add is called, but not defined or handled by StandardFunctionHandler. [2023-12-02 13:11:05,401 WARN L675 CHandler]: The function htonl is called, but not defined or handled by StandardFunctionHandler. [2023-12-02 13:11:05,401 WARN L675 CHandler]: The function __atomic_store_n is called, but not defined or handled by StandardFunctionHandler. [2023-12-02 13:11:05,401 WARN L675 CHandler]: The function ntohs is called, but not defined or handled by StandardFunctionHandler. [2023-12-02 13:11:05,401 WARN L675 CHandler]: The function __atomic_load_n is called, but not defined or handled by StandardFunctionHandler. [2023-12-02 13:11:05,401 WARN L675 CHandler]: The function memcmp is called, but not defined or handled by StandardFunctionHandler. [2023-12-02 13:11:05,402 WARN L675 CHandler]: The function __atomic_thread_fence is called, but not defined or handled by StandardFunctionHandler. [2023-12-02 13:11:05,402 WARN L675 CHandler]: The function __atomic_fetch_and is called, but not defined or handled by StandardFunctionHandler. [2023-12-02 13:11:05,402 WARN L675 CHandler]: The function aws_array_list_ensure_capacity is called, but not defined or handled by StandardFunctionHandler. [2023-12-02 13:11:05,409 INFO L206 MainTranslator]: Completed translation [2023-12-02 13:11:05,410 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:11:05 WrapperNode [2023-12-02 13:11:05,410 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 13:11:05,411 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 13:11:05,411 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 13:11:05,411 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 13:11:05,419 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:11:05" (1/1) ... [2023-12-02 13:11:05,481 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:11:05" (1/1) ... [2023-12-02 13:11:05,522 INFO L138 Inliner]: procedures = 678, calls = 1041, calls flagged for inlining = 52, calls inlined = 6, statements flattened = 141 [2023-12-02 13:11:05,522 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 13:11:05,523 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 13:11:05,523 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 13:11:05,523 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 13:11:05,533 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:11:05" (1/1) ... [2023-12-02 13:11:05,533 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:11:05" (1/1) ... [2023-12-02 13:11:05,538 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:11:05" (1/1) ... [2023-12-02 13:11:05,538 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:11:05" (1/1) ... [2023-12-02 13:11:05,552 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:11:05" (1/1) ... [2023-12-02 13:11:05,556 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:11:05" (1/1) ... [2023-12-02 13:11:05,561 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:11:05" (1/1) ... [2023-12-02 13:11:05,563 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:11:05" (1/1) ... [2023-12-02 13:11:05,569 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 13:11:05,570 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 13:11:05,571 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 13:11:05,571 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 13:11:05,572 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:11:05" (1/1) ... [2023-12-02 13:11:05,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 13:11:05,590 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7e573dc-ea7c-487b-91f3-c5b08a46fc9a/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:11:05,607 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7e573dc-ea7c-487b-91f3-c5b08a46fc9a/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 13:11:05,613 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7e573dc-ea7c-487b-91f3-c5b08a46fc9a/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 13:11:05,644 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-02 13:11:05,644 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-12-02 13:11:05,644 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-12-02 13:11:05,644 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2023-12-02 13:11:05,644 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2023-12-02 13:11:05,644 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-02 13:11:05,645 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_is_valid [2023-12-02 13:11:05,645 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_is_valid [2023-12-02 13:11:05,645 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 13:11:05,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-12-02 13:11:05,645 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 13:11:05,645 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 13:11:05,645 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-02 13:11:05,645 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-02 13:11:05,646 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-02 13:11:05,646 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-12-02 13:11:05,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-12-02 13:11:05,646 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2023-12-02 13:11:05,646 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2023-12-02 13:11:05,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-02 13:11:05,850 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 13:11:05,852 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 13:11:06,060 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 13:11:06,163 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 13:11:06,164 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-02 13:11:06,165 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:11:06 BoogieIcfgContainer [2023-12-02 13:11:06,165 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 13:11:06,168 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 13:11:06,168 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 13:11:06,171 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 13:11:06,171 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 01:11:03" (1/3) ... [2023-12-02 13:11:06,172 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10e7eadf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 01:11:06, skipping insertion in model container [2023-12-02 13:11:06,172 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:11:05" (2/3) ... [2023-12-02 13:11:06,172 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10e7eadf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 01:11:06, skipping insertion in model container [2023-12-02 13:11:06,173 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:11:06" (3/3) ... [2023-12-02 13:11:06,188 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_linked_list_rbegin_harness.i [2023-12-02 13:11:06,207 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 13:11:06,207 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-02 13:11:06,246 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 13:11:06,252 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=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@6f333a45, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 13:11:06,252 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-02 13:11:06,255 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 27 states have internal predecessors, (34), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2023-12-02 13:11:06,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-12-02 13:11:06,262 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:11:06,263 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-02 13:11:06,263 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 13:11:06,268 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:11:06,268 INFO L85 PathProgramCache]: Analyzing trace with hash -506232321, now seen corresponding path program 1 times [2023-12-02 13:11:06,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:11:06,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057347204] [2023-12-02 13:11:06,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:11:06,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:11:06,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:11:06,858 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-02 13:11:06,858 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:11:06,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057347204] [2023-12-02 13:11:06,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057347204] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:11:06,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [43612655] [2023-12-02 13:11:06,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:11:06,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:11:06,860 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7e573dc-ea7c-487b-91f3-c5b08a46fc9a/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:11:06,864 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7e573dc-ea7c-487b-91f3-c5b08a46fc9a/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:11:06,872 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7e573dc-ea7c-487b-91f3-c5b08a46fc9a/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-02 13:11:07,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:11:07,086 INFO L262 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 73 conjunts are in the unsatisfiable core [2023-12-02 13:11:07,098 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:11:07,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2023-12-02 13:11:07,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2023-12-02 13:11:07,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2023-12-02 13:11:07,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2023-12-02 13:11:09,884 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-02 13:11:09,884 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 13:11:09,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [43612655] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:11:09,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 13:11:09,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [5] total 12 [2023-12-02 13:11:09,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90377481] [2023-12-02 13:11:09,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:11:09,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-02 13:11:09,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:11:09,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-02 13:11:09,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2023-12-02 13:11:09,914 INFO L87 Difference]: Start difference. First operand has 46 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 27 states have internal predecessors, (34), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2023-12-02 13:11:10,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:11:10,439 INFO L93 Difference]: Finished difference Result 124 states and 173 transitions. [2023-12-02 13:11:10,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-02 13:11:10,441 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 37 [2023-12-02 13:11:10,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:11:10,448 INFO L225 Difference]: With dead ends: 124 [2023-12-02 13:11:10,448 INFO L226 Difference]: Without dead ends: 81 [2023-12-02 13:11:10,451 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 23 SyntacticMatches, 8 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2023-12-02 13:11:10,454 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 33 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-02 13:11:10,455 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 244 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-02 13:11:10,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-12-02 13:11:10,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2023-12-02 13:11:10,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 45 states have (on average 1.288888888888889) internal successors, (58), 47 states have internal predecessors, (58), 24 states have call successors, (24), 9 states have call predecessors, (24), 9 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2023-12-02 13:11:10,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 104 transitions. [2023-12-02 13:11:10,501 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 104 transitions. Word has length 37 [2023-12-02 13:11:10,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:11:10,502 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 104 transitions. [2023-12-02 13:11:10,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2023-12-02 13:11:10,502 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 104 transitions. [2023-12-02 13:11:10,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-02 13:11:10,505 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:11:10,505 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-02 13:11:10,512 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7e573dc-ea7c-487b-91f3-c5b08a46fc9a/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-02 13:11:10,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7e573dc-ea7c-487b-91f3-c5b08a46fc9a/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2023-12-02 13:11:10,707 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 13:11:10,707 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:11:10,707 INFO L85 PathProgramCache]: Analyzing trace with hash -1923609863, now seen corresponding path program 1 times [2023-12-02 13:11:10,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:11:10,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936883190] [2023-12-02 13:11:10,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:11:10,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:11:10,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:11:10,969 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-12-02 13:11:10,969 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:11:10,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936883190] [2023-12-02 13:11:10,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936883190] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:11:10,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1607639453] [2023-12-02 13:11:10,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:11:10,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:11:10,970 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7e573dc-ea7c-487b-91f3-c5b08a46fc9a/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:11:10,971 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7e573dc-ea7c-487b-91f3-c5b08a46fc9a/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:11:10,980 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7e573dc-ea7c-487b-91f3-c5b08a46fc9a/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-02 13:11:11,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:11:11,160 INFO L262 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 69 conjunts are in the unsatisfiable core [2023-12-02 13:11:11,168 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:11:11,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2023-12-02 13:11:11,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2023-12-02 13:11:11,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 36 [2023-12-02 13:11:11,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:11:11,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-12-02 13:11:11,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 36 [2023-12-02 13:11:11,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:11:11,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2023-12-02 13:11:11,492 INFO L349 Elim1Store]: treesize reduction 96, result has 23.2 percent of original size [2023-12-02 13:11:11,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 142 treesize of output 93 [2023-12-02 13:11:11,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:11:11,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 21 [2023-12-02 13:11:12,649 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-02 13:11:12,650 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:11:19,416 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 13:11:19,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 388 treesize of output 473 [2023-12-02 13:11:20,369 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 13:11:20,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 364 treesize of output 449 [2023-12-02 13:11:21,341 INFO L349 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2023-12-02 13:11:21,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 49 treesize of output 62 [2023-12-02 13:11:21,379 INFO L349 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2023-12-02 13:11:21,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 49 treesize of output 62 [2023-12-02 13:11:21,431 INFO L349 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2023-12-02 13:11:21,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 49 treesize of output 62 [2023-12-02 13:11:21,474 INFO L349 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2023-12-02 13:11:21,474 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 49 treesize of output 62 [2023-12-02 13:11:21,589 INFO L349 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2023-12-02 13:11:21,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 49 treesize of output 62 [2023-12-02 13:11:21,656 INFO L349 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2023-12-02 13:11:21,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 49 treesize of output 62 [2023-12-02 13:11:22,880 INFO L349 Elim1Store]: treesize reduction 73, result has 7.6 percent of original size [2023-12-02 13:11:22,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 230 treesize of output 189 [2023-12-02 13:11:23,014 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 13:11:23,015 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 13:11:23,018 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 13:11:23,028 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 13:11:23,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 39 [2023-12-02 13:11:23,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:11:23,054 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 13:11:23,054 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 81 treesize of output 71 [2023-12-02 13:11:23,205 INFO L349 Elim1Store]: treesize reduction 73, result has 7.6 percent of original size [2023-12-02 13:11:23,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 230 treesize of output 189 [2023-12-02 13:11:23,558 INFO L349 Elim1Store]: treesize reduction 73, result has 7.6 percent of original size [2023-12-02 13:11:23,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 124 treesize of output 109 [2023-12-02 13:11:23,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:11:23,766 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 13:11:23,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 120 treesize of output 114 [2023-12-02 13:11:23,778 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 13:11:23,779 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 13:11:23,784 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 13:11:23,801 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 13:11:23,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 35 [2023-12-02 13:11:23,875 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2023-12-02 13:11:23,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 61 [2023-12-02 13:11:25,925 INFO L349 Elim1Store]: treesize reduction 73, result has 7.6 percent of original size [2023-12-02 13:11:25,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 230 treesize of output 189 [2023-12-02 13:11:26,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:11:26,175 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 13:11:26,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 1 [2023-12-02 13:11:26,196 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 13:11:26,210 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 13:11:26,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 19 [2023-12-02 13:11:26,274 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 13:11:26,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 28 [2023-12-02 13:11:26,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-12-02 13:11:26,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2023-12-02 13:11:26,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2023-12-02 13:11:26,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-12-02 13:11:26,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 36 [2023-12-02 13:11:26,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2023-12-02 13:11:26,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2023-12-02 13:11:26,506 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 13:11:26,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 4 [2023-12-02 13:11:26,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2023-12-02 13:11:26,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 18 [2023-12-02 13:11:26,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2023-12-02 13:11:26,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-12-02 13:11:26,839 INFO L349 Elim1Store]: treesize reduction 72, result has 17.2 percent of original size [2023-12-02 13:11:26,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 130 treesize of output 121 [2023-12-02 13:11:26,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-12-02 13:11:26,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2023-12-02 13:11:26,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2023-12-02 13:11:26,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2023-12-02 13:11:27,010 INFO L349 Elim1Store]: treesize reduction 29, result has 3.3 percent of original size [2023-12-02 13:11:27,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 49 treesize of output 40 [2023-12-02 13:11:27,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2023-12-02 13:11:27,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2023-12-02 13:11:27,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 4 [2023-12-02 13:11:27,652 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse12 (+ 16 |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|)) (.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|)) (.cse3 (+ |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 24)) (.cse6 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|)) (.cse8 (+ 8 |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|))) (and (forall ((v_ArrVal_175 Int)) (or (= v_ArrVal_175 0) (< |c_#StackHeapBarrier| (+ v_ArrVal_175 1)) (forall ((v_DerPreprocessor_77 Int) (v_DerPreprocessor_78 Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~node~0#1.offset_16| Int) (v_prenex_5 Int) (v_arrayElimArr_4 (Array Int Int)) (v_DerPreprocessor_15 Int) (v_DerPreprocessor_16 Int) (v_subst_6 Int) (v_subst_2 Int) (v_subst_1 Int) (v_arrayElimArr_9 (Array Int Int))) (let ((.cse0 (store v_arrayElimArr_4 v_subst_1 v_DerPreprocessor_77)) (.cse1 (store (store v_arrayElimArr_4 v_subst_1 v_DerPreprocessor_15) v_subst_2 v_DerPreprocessor_16))) (or (not (= (store (store .cse0 v_subst_6 (select .cse1 v_subst_6)) v_subst_2 v_DerPreprocessor_16) .cse1)) (not (= (select v_arrayElimArr_9 v_subst_1) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|)) (not (= (select (select (let ((.cse2 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse4 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| v_ArrVal_175)) v_ArrVal_175 v_arrayElimArr_9))) (store .cse2 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse2 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse3 v_ArrVal_175))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|) 0)) (not (= v_DerPreprocessor_77 (select (store .cse0 v_subst_6 v_DerPreprocessor_78) v_subst_1))) (not (= v_DerPreprocessor_15 (select .cse1 v_subst_1))) (not (= (select (select (let ((.cse5 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse6 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~node~0#1.offset_16|)) v_ArrVal_175 v_arrayElimArr_4))) (store .cse5 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse5 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse3 v_prenex_5))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|) 0))))))) (forall ((v_ArrVal_175 Int)) (or (forall ((v_arrayElimArr_10 (Array Int Int)) (v_subst_6 Int) (v_subst_4 Int) (v_subst_1 Int) (v_DerPreprocessor_84 Int) (v_DerPreprocessor_41 Int)) (let ((.cse10 (store v_arrayElimArr_10 v_subst_4 v_DerPreprocessor_84))) (let ((.cse9 (store (store .cse10 v_subst_6 v_DerPreprocessor_41) v_subst_1 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|))) (or (= v_subst_4 v_subst_1) (= (select (select (let ((.cse7 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse4 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| v_ArrVal_175)) v_ArrVal_175 v_arrayElimArr_10))) (store .cse7 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse7 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse3 v_ArrVal_175))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse8) 0) (not (= v_DerPreprocessor_41 (select .cse9 v_subst_6))) (not (= v_DerPreprocessor_84 (select (store .cse10 v_subst_6 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) v_subst_4))) (not (= |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (select v_arrayElimArr_10 v_subst_4))) (not (= .cse9 (store (store v_arrayElimArr_10 v_subst_4 (select .cse9 v_subst_4)) v_subst_1 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|))))))) (= v_ArrVal_175 0) (< |c_#StackHeapBarrier| (+ v_ArrVal_175 1)))) (forall ((v_ArrVal_175 Int)) (or (= v_ArrVal_175 0) (< |c_#StackHeapBarrier| (+ v_ArrVal_175 1)) (forall ((v_arrayElimArr_7 (Array Int Int)) (v_subst_6 Int)) (or (not (= |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (select v_arrayElimArr_7 v_subst_6))) (= (select (select (let ((.cse11 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse4 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| v_ArrVal_175)) v_ArrVal_175 v_arrayElimArr_7))) (store .cse11 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse11 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse3 v_ArrVal_175))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse12) 0) (forall ((v_DerPreprocessor_50 Int) (v_subst_1 Int)) (not (= v_DerPreprocessor_50 (select (store (store v_arrayElimArr_7 v_subst_6 v_DerPreprocessor_50) v_subst_1 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) v_subst_6)))))))) (or (not (= |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base| 0)) (not (= |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset| 0))) (forall ((v_ArrVal_175 Int)) (or (forall ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_13 Int) (v_DerPreprocessor_14 Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~node~0#1.offset_16| Int) (v_prenex_3 Int) (v_subst_6 Int) (v_subst_2 Int) (v_DerPreprocessor_75 Int) (v_subst_1 Int) (v_DerPreprocessor_76 Int)) (let ((.cse14 (store (store v_arrayElimArr_6 v_subst_1 v_DerPreprocessor_13) v_subst_2 v_DerPreprocessor_14)) (.cse15 (store v_arrayElimArr_6 v_subst_1 v_DerPreprocessor_75))) (or (= (select (select (let ((.cse13 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse6 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~node~0#1.offset_16|)) v_ArrVal_175 v_arrayElimArr_6))) (store .cse13 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse13 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse3 v_prenex_3))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse8) 0) (not (= v_DerPreprocessor_13 (select .cse14 v_subst_1))) (not (= (store (store .cse15 v_subst_6 (select .cse14 v_subst_6)) v_subst_2 v_DerPreprocessor_14) .cse14)) (not (= v_DerPreprocessor_75 (select (store .cse15 v_subst_6 v_DerPreprocessor_76) v_subst_1)))))) (= v_ArrVal_175 0) (< |c_#StackHeapBarrier| (+ v_ArrVal_175 1)))) (forall ((v_ArrVal_175 Int)) (or (= v_ArrVal_175 0) (forall ((v_arrayElimArr_6 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~node~0#1.offset_16| Int) (v_prenex_3 Int) (v_subst_5 Int) (v_subst_2 Int) (v_DerPreprocessor_73 Int) (v_DerPreprocessor_74 Int)) (or (= (select (select (let ((.cse16 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse6 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~node~0#1.offset_16|)) v_ArrVal_175 v_arrayElimArr_6))) (store .cse16 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse16 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse3 v_prenex_3))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse8) 0) (not (= v_DerPreprocessor_73 (select (store (store v_arrayElimArr_6 v_subst_2 v_DerPreprocessor_73) v_subst_5 v_DerPreprocessor_74) v_subst_2))))) (< |c_#StackHeapBarrier| (+ v_ArrVal_175 1)))) (forall ((v_ArrVal_175 Int)) (or (forall ((v_DerPreprocessor_77 Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~node~0#1.offset_16| Int) (v_prenex_5 Int) (v_DerPreprocessor_78 Int) (v_arrayElimArr_4 (Array Int Int)) (v_DerPreprocessor_15 Int) (v_DerPreprocessor_16 Int) (v_subst_5 Int) (v_subst_2 Int) (v_subst_1 Int) (v_arrayElimArr_9 (Array Int Int))) (let ((.cse17 (store v_arrayElimArr_4 v_subst_1 v_DerPreprocessor_77)) (.cse18 (store (store v_arrayElimArr_4 v_subst_1 v_DerPreprocessor_15) v_subst_2 v_DerPreprocessor_16))) (or (not (= v_DerPreprocessor_77 (select (store .cse17 v_subst_5 v_DerPreprocessor_78) v_subst_1))) (not (= (store (store .cse17 v_subst_5 (select .cse18 v_subst_5)) v_subst_2 v_DerPreprocessor_16) .cse18)) (not (= (select v_arrayElimArr_9 v_subst_1) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|)) (not (= (select (select (let ((.cse19 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse4 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| v_ArrVal_175)) v_ArrVal_175 v_arrayElimArr_9))) (store .cse19 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse19 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse3 v_ArrVal_175))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|) 0)) (not (= v_DerPreprocessor_15 (select .cse18 v_subst_1))) (not (= (select (select (let ((.cse20 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse6 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~node~0#1.offset_16|)) v_ArrVal_175 v_arrayElimArr_4))) (store .cse20 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse20 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse3 v_prenex_5))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|) 0))))) (= v_ArrVal_175 0) (< |c_#StackHeapBarrier| (+ v_ArrVal_175 1)))) (forall ((v_ArrVal_175 Int)) (or (forall ((v_arrayElimArr_10 (Array Int Int)) (v_DerPreprocessor_39 Int) (v_subst_6 Int) (v_subst_5 Int) (v_DerPreprocessor_86 Int) (v_subst_1 Int)) (let ((.cse21 (store (store v_arrayElimArr_10 v_subst_5 v_DerPreprocessor_39) v_subst_1 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|)) (.cse22 (store v_arrayElimArr_10 v_subst_5 v_DerPreprocessor_86))) (or (not (= (select .cse21 v_subst_5) v_DerPreprocessor_39)) (not (= (store (store .cse22 v_subst_6 (select .cse21 v_subst_6)) v_subst_1 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse21)) (= (select (select (let ((.cse23 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse4 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| v_ArrVal_175)) v_ArrVal_175 v_arrayElimArr_10))) (store .cse23 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse23 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse3 v_ArrVal_175))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse8) 0) (not (= v_DerPreprocessor_86 (select (store .cse22 v_subst_6 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) v_subst_5))) (not (= |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (select v_arrayElimArr_10 v_subst_5)))))) (= v_ArrVal_175 0) (< |c_#StackHeapBarrier| (+ v_ArrVal_175 1)))) (forall ((v_ArrVal_175 Int)) (or (forall ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_69 Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~node~0#1.offset_16| Int) (v_prenex_3 Int) (v_DerPreprocessor_71 Int) (v_subst_5 Int) (v_DerPreprocessor_72 Int) (v_subst_3 Int) (v_DerPreprocessor_70 Int) (v_subst_2 Int) (v_subst_1 Int)) (let ((.cse25 (store (store (store (store v_arrayElimArr_6 v_subst_3 v_DerPreprocessor_69) v_subst_2 v_DerPreprocessor_70) v_subst_1 v_DerPreprocessor_71) v_subst_5 v_DerPreprocessor_72))) (or (= v_subst_3 v_subst_2) (= (select (select (let ((.cse24 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse6 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~node~0#1.offset_16|)) v_ArrVal_175 v_arrayElimArr_6))) (store .cse24 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse24 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse3 v_prenex_3))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse8) 0) (not (= .cse25 (store (store v_arrayElimArr_6 v_subst_3 (select .cse25 v_subst_3)) v_subst_5 v_DerPreprocessor_72))) (= v_subst_5 v_subst_3) (not (= (select .cse25 v_subst_1) v_DerPreprocessor_71)) (not (= v_DerPreprocessor_70 (select .cse25 v_subst_2))) (= v_subst_3 v_subst_1)))) (= v_ArrVal_175 0) (< |c_#StackHeapBarrier| (+ v_ArrVal_175 1)))) (forall ((v_ArrVal_175 Int)) (or (forall ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_13 Int) (v_DerPreprocessor_14 Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~node~0#1.offset_16| Int) (v_prenex_3 Int) (v_subst_6 Int) (v_subst_2 Int)) (or (= (select (select (let ((.cse26 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse6 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~node~0#1.offset_16|)) v_ArrVal_175 v_arrayElimArr_6))) (store .cse26 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse26 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse3 v_prenex_3))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse8) 0) (not (= v_DerPreprocessor_13 (select (store (store v_arrayElimArr_6 v_subst_6 v_DerPreprocessor_13) v_subst_2 v_DerPreprocessor_14) v_subst_6))))) (= v_ArrVal_175 0) (< |c_#StackHeapBarrier| (+ v_ArrVal_175 1)))) (forall ((v_ArrVal_175 Int)) (let ((.cse28 (+ |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset| 24))) (or (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~node~0#1.offset_16| Int) (v_arrayElimArr_3 (Array Int Int)) (v_prenex_1 Int)) (not (= (select (select (let ((.cse27 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse6 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~node~0#1.offset_16|)) v_ArrVal_175 v_arrayElimArr_3))) (store .cse27 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse27 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse3 v_prenex_1))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse28) 0))) (= v_ArrVal_175 0) (forall ((v_arrayElimArr_8 (Array Int Int)) (v_subst_5 Int)) (or (not (= |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (select v_arrayElimArr_8 v_subst_5))) (not (= (select (select (let ((.cse29 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse4 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| v_ArrVal_175)) v_ArrVal_175 v_arrayElimArr_8))) (store .cse29 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse29 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse3 v_ArrVal_175))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse28) 0)))) (< |c_#StackHeapBarrier| (+ v_ArrVal_175 1))))) (forall ((v_ArrVal_175 Int)) (or (= v_ArrVal_175 0) (< |c_#StackHeapBarrier| (+ v_ArrVal_175 1)) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_13 Int) (v_DerPreprocessor_14 Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~node~0#1.offset_16| Int) (v_prenex_3 Int) (v_subst_5 Int) (v_DerPreprocessor_75 Int) (v_subst_2 Int) (v_subst_1 Int) (v_DerPreprocessor_76 Int)) (let ((.cse31 (store v_arrayElimArr_6 v_subst_1 v_DerPreprocessor_75)) (.cse32 (store (store v_arrayElimArr_6 v_subst_1 v_DerPreprocessor_13) v_subst_2 v_DerPreprocessor_14))) (or (= (select (select (let ((.cse30 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse6 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~node~0#1.offset_16|)) v_ArrVal_175 v_arrayElimArr_6))) (store .cse30 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse30 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse3 v_prenex_3))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse8) 0) (not (= v_DerPreprocessor_75 (select (store .cse31 v_subst_5 v_DerPreprocessor_76) v_subst_1))) (not (= v_DerPreprocessor_13 (select .cse32 v_subst_1))) (not (= (store (store .cse31 v_subst_5 (select .cse32 v_subst_5)) v_subst_2 v_DerPreprocessor_14) .cse32))))))) (forall ((v_ArrVal_175 Int)) (or (= v_ArrVal_175 0) (< |c_#StackHeapBarrier| (+ v_ArrVal_175 1)) (forall ((v_arrayElimArr_6 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~node~0#1.offset_16| Int) (v_prenex_3 Int) (v_subst_6 Int) (v_subst_2 Int) (v_DerPreprocessor_73 Int) (v_DerPreprocessor_74 Int)) (or (= (select (select (let ((.cse33 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse6 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~node~0#1.offset_16|)) v_ArrVal_175 v_arrayElimArr_6))) (store .cse33 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse33 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse3 v_prenex_3))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse8) 0) (not (= (select (store (store v_arrayElimArr_6 v_subst_2 v_DerPreprocessor_73) v_subst_6 v_DerPreprocessor_74) v_subst_2) v_DerPreprocessor_73)))))) (forall ((v_ArrVal_175 Int)) (or (= v_ArrVal_175 0) (< |c_#StackHeapBarrier| (+ v_ArrVal_175 1)) (forall ((v_arrayElimArr_5 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~node~0#1.offset_16| Int) (v_ArrVal_182 Int)) (= (select (select (let ((.cse34 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse6 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~node~0#1.offset_16|)) v_ArrVal_175 v_arrayElimArr_5))) (store .cse34 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse34 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse3 v_ArrVal_182))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse12) 0)))) (forall ((v_ArrVal_175 Int)) (or (= v_ArrVal_175 0) (forall ((v_DerPreprocessor_77 Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~node~0#1.offset_16| Int) (v_prenex_5 Int) (v_DerPreprocessor_78 Int) (v_arrayElimArr_4 (Array Int Int)) (v_DerPreprocessor_15 Int) (v_DerPreprocessor_16 Int) (v_subst_6 Int) (v_subst_5 Int) (v_subst_2 Int) (v_arrayElimArr_9 (Array Int Int))) (let ((.cse36 (store v_arrayElimArr_4 v_subst_6 v_DerPreprocessor_77)) (.cse35 (store (store v_arrayElimArr_4 v_subst_6 v_DerPreprocessor_15) v_subst_2 v_DerPreprocessor_16))) (or (not (= (select .cse35 v_subst_6) v_DerPreprocessor_15)) (not (= v_DerPreprocessor_77 (select (store .cse36 v_subst_5 v_DerPreprocessor_78) v_subst_6))) (not (= (select (select (let ((.cse37 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse4 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| v_ArrVal_175)) v_ArrVal_175 v_arrayElimArr_9))) (store .cse37 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse37 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse3 v_ArrVal_175))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|) 0)) (not (= (select (select (let ((.cse38 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse6 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~node~0#1.offset_16|)) v_ArrVal_175 v_arrayElimArr_4))) (store .cse38 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse38 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse3 v_prenex_5))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|) 0)) (not (= (select v_arrayElimArr_9 v_subst_6) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|)) (not (= (store (store .cse36 v_subst_5 (select .cse35 v_subst_5)) v_subst_2 v_DerPreprocessor_16) .cse35))))) (< |c_#StackHeapBarrier| (+ v_ArrVal_175 1)))) (forall ((v_ArrVal_175 Int)) (or (forall ((v_arrayElimArr_10 (Array Int Int)) (v_DerPreprocessor_29 Int) (v_subst_5 Int) (v_subst_1 Int)) (or (not (= |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (select v_arrayElimArr_10 v_subst_1))) (= (select (select (let ((.cse39 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse4 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| v_ArrVal_175)) v_ArrVal_175 v_arrayElimArr_10))) (store .cse39 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse39 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse3 v_ArrVal_175))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse8) 0) (not (= v_DerPreprocessor_29 (select (store (store v_arrayElimArr_10 v_subst_1 v_DerPreprocessor_29) v_subst_5 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) v_subst_1))))) (= v_ArrVal_175 0) (< |c_#StackHeapBarrier| (+ v_ArrVal_175 1)))) (forall ((v_ArrVal_175 Int)) (or (= v_ArrVal_175 0) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_13 Int) (v_DerPreprocessor_14 Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~node~0#1.offset_16| Int) (v_prenex_3 Int) (v_subst_6 Int) (v_subst_5 Int) (v_DerPreprocessor_75 Int) (v_subst_2 Int) (v_DerPreprocessor_76 Int)) (let ((.cse41 (store v_arrayElimArr_6 v_subst_6 v_DerPreprocessor_75)) (.cse42 (store (store v_arrayElimArr_6 v_subst_6 v_DerPreprocessor_13) v_subst_2 v_DerPreprocessor_14))) (or (= (select (select (let ((.cse40 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse6 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~node~0#1.offset_16|)) v_ArrVal_175 v_arrayElimArr_6))) (store .cse40 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse40 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse3 v_prenex_3))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse8) 0) (not (= v_DerPreprocessor_75 (select (store .cse41 v_subst_5 v_DerPreprocessor_76) v_subst_6))) (not (= v_DerPreprocessor_13 (select .cse42 v_subst_6))) (not (= .cse42 (store (store .cse41 v_subst_5 (select .cse42 v_subst_5)) v_subst_2 v_DerPreprocessor_14)))))) (< |c_#StackHeapBarrier| (+ v_ArrVal_175 1)))) (forall ((v_ArrVal_175 Int)) (or (forall ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_69 Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~node~0#1.offset_16| Int) (v_prenex_3 Int) (v_subst_6 Int) (v_DerPreprocessor_71 Int) (v_subst_5 Int) (v_DerPreprocessor_72 Int) (v_subst_3 Int) (v_DerPreprocessor_70 Int) (v_subst_2 Int)) (let ((.cse44 (store (store (store (store v_arrayElimArr_6 v_subst_3 v_DerPreprocessor_69) v_subst_2 v_DerPreprocessor_70) v_subst_6 v_DerPreprocessor_71) v_subst_5 v_DerPreprocessor_72))) (or (= v_subst_3 v_subst_2) (= (select (select (let ((.cse43 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse6 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~node~0#1.offset_16|)) v_ArrVal_175 v_arrayElimArr_6))) (store .cse43 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse43 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse3 v_prenex_3))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse8) 0) (not (= v_DerPreprocessor_70 (select .cse44 v_subst_2))) (not (= v_DerPreprocessor_71 (select .cse44 v_subst_6))) (not (= (store (store v_arrayElimArr_6 v_subst_3 (select .cse44 v_subst_3)) v_subst_5 v_DerPreprocessor_72) .cse44)) (= v_subst_5 v_subst_3) (= v_subst_6 v_subst_3)))) (= v_ArrVal_175 0) (< |c_#StackHeapBarrier| (+ v_ArrVal_175 1)))) (forall ((v_ArrVal_175 Int)) (or (forall ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_69 Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~node~0#1.offset_16| Int) (v_prenex_3 Int) (v_DerPreprocessor_71 Int) (v_subst_6 Int) (v_DerPreprocessor_72 Int) (v_subst_3 Int) (v_DerPreprocessor_70 Int) (v_subst_2 Int) (v_subst_1 Int)) (let ((.cse46 (store (store (store (store v_arrayElimArr_6 v_subst_3 v_DerPreprocessor_69) v_subst_2 v_DerPreprocessor_70) v_subst_1 v_DerPreprocessor_71) v_subst_6 v_DerPreprocessor_72))) (or (= v_subst_3 v_subst_2) (= (select (select (let ((.cse45 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse6 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~node~0#1.offset_16|)) v_ArrVal_175 v_arrayElimArr_6))) (store .cse45 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse45 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse3 v_prenex_3))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse8) 0) (not (= (select .cse46 v_subst_2) v_DerPreprocessor_70)) (not (= (store (store v_arrayElimArr_6 v_subst_3 (select .cse46 v_subst_3)) v_subst_6 v_DerPreprocessor_72) .cse46)) (= v_subst_3 v_subst_1) (not (= v_DerPreprocessor_71 (select .cse46 v_subst_1))) (= v_subst_6 v_subst_3)))) (= v_ArrVal_175 0) (< |c_#StackHeapBarrier| (+ v_ArrVal_175 1)))) (forall ((v_ArrVal_175 Int)) (or (= v_ArrVal_175 0) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_13 Int) (v_DerPreprocessor_14 Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~node~0#1.offset_16| Int) (v_prenex_3 Int) (v_subst_5 Int) (v_subst_2 Int)) (or (= (select (select (let ((.cse47 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse6 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~node~0#1.offset_16|)) v_ArrVal_175 v_arrayElimArr_6))) (store .cse47 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse47 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse3 v_prenex_3))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse8) 0) (not (= v_DerPreprocessor_13 (select (store (store v_arrayElimArr_6 v_subst_5 v_DerPreprocessor_13) v_subst_2 v_DerPreprocessor_14) v_subst_5))))) (< |c_#StackHeapBarrier| (+ v_ArrVal_175 1)))))) is different from false [2023-12-02 13:11:29,668 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse12 (+ 16 |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|)) (.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|)) (.cse3 (+ |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 24)) (.cse6 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|)) (.cse8 (+ 8 |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|))) (and (forall ((v_ArrVal_175 Int)) (or (= v_ArrVal_175 0) (< |c_#StackHeapBarrier| (+ v_ArrVal_175 1)) (forall ((v_DerPreprocessor_77 Int) (v_DerPreprocessor_78 Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~node~0#1.offset_16| Int) (v_prenex_5 Int) (v_arrayElimArr_4 (Array Int Int)) (v_DerPreprocessor_15 Int) (v_DerPreprocessor_16 Int) (v_subst_6 Int) (v_subst_2 Int) (v_subst_1 Int) (v_arrayElimArr_9 (Array Int Int))) (let ((.cse0 (store v_arrayElimArr_4 v_subst_1 v_DerPreprocessor_77)) (.cse1 (store (store v_arrayElimArr_4 v_subst_1 v_DerPreprocessor_15) v_subst_2 v_DerPreprocessor_16))) (or (not (= (store (store .cse0 v_subst_6 (select .cse1 v_subst_6)) v_subst_2 v_DerPreprocessor_16) .cse1)) (not (= (select v_arrayElimArr_9 v_subst_1) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|)) (not (= (select (select (let ((.cse2 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse4 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| v_ArrVal_175)) v_ArrVal_175 v_arrayElimArr_9))) (store .cse2 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse2 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse3 v_ArrVal_175))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|) 0)) (not (= v_DerPreprocessor_77 (select (store .cse0 v_subst_6 v_DerPreprocessor_78) v_subst_1))) (not (= v_DerPreprocessor_15 (select .cse1 v_subst_1))) (not (= (select (select (let ((.cse5 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse6 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~node~0#1.offset_16|)) v_ArrVal_175 v_arrayElimArr_4))) (store .cse5 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse5 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse3 v_prenex_5))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|) 0))))))) (forall ((v_ArrVal_175 Int)) (or (forall ((v_arrayElimArr_10 (Array Int Int)) (v_subst_6 Int) (v_subst_4 Int) (v_subst_1 Int) (v_DerPreprocessor_84 Int) (v_DerPreprocessor_41 Int)) (let ((.cse10 (store v_arrayElimArr_10 v_subst_4 v_DerPreprocessor_84))) (let ((.cse9 (store (store .cse10 v_subst_6 v_DerPreprocessor_41) v_subst_1 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|))) (or (= v_subst_4 v_subst_1) (= (select (select (let ((.cse7 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse4 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| v_ArrVal_175)) v_ArrVal_175 v_arrayElimArr_10))) (store .cse7 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse7 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse3 v_ArrVal_175))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse8) 0) (not (= v_DerPreprocessor_41 (select .cse9 v_subst_6))) (not (= v_DerPreprocessor_84 (select (store .cse10 v_subst_6 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) v_subst_4))) (not (= |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (select v_arrayElimArr_10 v_subst_4))) (not (= .cse9 (store (store v_arrayElimArr_10 v_subst_4 (select .cse9 v_subst_4)) v_subst_1 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|))))))) (= v_ArrVal_175 0) (< |c_#StackHeapBarrier| (+ v_ArrVal_175 1)))) (forall ((v_ArrVal_175 Int)) (or (= v_ArrVal_175 0) (< |c_#StackHeapBarrier| (+ v_ArrVal_175 1)) (forall ((v_arrayElimArr_7 (Array Int Int)) (v_subst_6 Int)) (or (not (= |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (select v_arrayElimArr_7 v_subst_6))) (= (select (select (let ((.cse11 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse4 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| v_ArrVal_175)) v_ArrVal_175 v_arrayElimArr_7))) (store .cse11 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse11 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse3 v_ArrVal_175))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse12) 0) (forall ((v_DerPreprocessor_50 Int) (v_subst_1 Int)) (not (= v_DerPreprocessor_50 (select (store (store v_arrayElimArr_7 v_subst_6 v_DerPreprocessor_50) v_subst_1 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) v_subst_6)))))))) (or (not (= |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base| 0)) (not (= |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset| 0))) (forall ((v_ArrVal_175 Int)) (or (forall ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_13 Int) (v_DerPreprocessor_14 Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~node~0#1.offset_16| Int) (v_prenex_3 Int) (v_subst_6 Int) (v_subst_2 Int) (v_DerPreprocessor_75 Int) (v_subst_1 Int) (v_DerPreprocessor_76 Int)) (let ((.cse14 (store (store v_arrayElimArr_6 v_subst_1 v_DerPreprocessor_13) v_subst_2 v_DerPreprocessor_14)) (.cse15 (store v_arrayElimArr_6 v_subst_1 v_DerPreprocessor_75))) (or (= (select (select (let ((.cse13 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse6 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~node~0#1.offset_16|)) v_ArrVal_175 v_arrayElimArr_6))) (store .cse13 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse13 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse3 v_prenex_3))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse8) 0) (not (= v_DerPreprocessor_13 (select .cse14 v_subst_1))) (not (= (store (store .cse15 v_subst_6 (select .cse14 v_subst_6)) v_subst_2 v_DerPreprocessor_14) .cse14)) (not (= v_DerPreprocessor_75 (select (store .cse15 v_subst_6 v_DerPreprocessor_76) v_subst_1)))))) (= v_ArrVal_175 0) (< |c_#StackHeapBarrier| (+ v_ArrVal_175 1)))) (forall ((v_ArrVal_175 Int)) (or (= v_ArrVal_175 0) (forall ((v_arrayElimArr_6 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~node~0#1.offset_16| Int) (v_prenex_3 Int) (v_subst_5 Int) (v_subst_2 Int) (v_DerPreprocessor_73 Int) (v_DerPreprocessor_74 Int)) (or (= (select (select (let ((.cse16 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse6 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~node~0#1.offset_16|)) v_ArrVal_175 v_arrayElimArr_6))) (store .cse16 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse16 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse3 v_prenex_3))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse8) 0) (not (= v_DerPreprocessor_73 (select (store (store v_arrayElimArr_6 v_subst_2 v_DerPreprocessor_73) v_subst_5 v_DerPreprocessor_74) v_subst_2))))) (< |c_#StackHeapBarrier| (+ v_ArrVal_175 1)))) (forall ((v_ArrVal_175 Int)) (or (forall ((v_DerPreprocessor_77 Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~node~0#1.offset_16| Int) (v_prenex_5 Int) (v_DerPreprocessor_78 Int) (v_arrayElimArr_4 (Array Int Int)) (v_DerPreprocessor_15 Int) (v_DerPreprocessor_16 Int) (v_subst_5 Int) (v_subst_2 Int) (v_subst_1 Int) (v_arrayElimArr_9 (Array Int Int))) (let ((.cse17 (store v_arrayElimArr_4 v_subst_1 v_DerPreprocessor_77)) (.cse18 (store (store v_arrayElimArr_4 v_subst_1 v_DerPreprocessor_15) v_subst_2 v_DerPreprocessor_16))) (or (not (= v_DerPreprocessor_77 (select (store .cse17 v_subst_5 v_DerPreprocessor_78) v_subst_1))) (not (= (store (store .cse17 v_subst_5 (select .cse18 v_subst_5)) v_subst_2 v_DerPreprocessor_16) .cse18)) (not (= (select v_arrayElimArr_9 v_subst_1) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|)) (not (= (select (select (let ((.cse19 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse4 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| v_ArrVal_175)) v_ArrVal_175 v_arrayElimArr_9))) (store .cse19 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse19 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse3 v_ArrVal_175))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|) 0)) (not (= v_DerPreprocessor_15 (select .cse18 v_subst_1))) (not (= (select (select (let ((.cse20 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse6 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~node~0#1.offset_16|)) v_ArrVal_175 v_arrayElimArr_4))) (store .cse20 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse20 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse3 v_prenex_5))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|) 0))))) (= v_ArrVal_175 0) (< |c_#StackHeapBarrier| (+ v_ArrVal_175 1)))) (forall ((v_ArrVal_175 Int)) (or (forall ((v_arrayElimArr_10 (Array Int Int)) (v_DerPreprocessor_39 Int) (v_subst_6 Int) (v_subst_5 Int) (v_DerPreprocessor_86 Int) (v_subst_1 Int)) (let ((.cse21 (store (store v_arrayElimArr_10 v_subst_5 v_DerPreprocessor_39) v_subst_1 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|)) (.cse22 (store v_arrayElimArr_10 v_subst_5 v_DerPreprocessor_86))) (or (not (= (select .cse21 v_subst_5) v_DerPreprocessor_39)) (not (= (store (store .cse22 v_subst_6 (select .cse21 v_subst_6)) v_subst_1 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse21)) (= (select (select (let ((.cse23 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse4 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| v_ArrVal_175)) v_ArrVal_175 v_arrayElimArr_10))) (store .cse23 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse23 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse3 v_ArrVal_175))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse8) 0) (not (= v_DerPreprocessor_86 (select (store .cse22 v_subst_6 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) v_subst_5))) (not (= |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (select v_arrayElimArr_10 v_subst_5)))))) (= v_ArrVal_175 0) (< |c_#StackHeapBarrier| (+ v_ArrVal_175 1)))) (forall ((v_ArrVal_175 Int)) (or (forall ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_69 Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~node~0#1.offset_16| Int) (v_prenex_3 Int) (v_DerPreprocessor_71 Int) (v_subst_5 Int) (v_DerPreprocessor_72 Int) (v_subst_3 Int) (v_DerPreprocessor_70 Int) (v_subst_2 Int) (v_subst_1 Int)) (let ((.cse25 (store (store (store (store v_arrayElimArr_6 v_subst_3 v_DerPreprocessor_69) v_subst_2 v_DerPreprocessor_70) v_subst_1 v_DerPreprocessor_71) v_subst_5 v_DerPreprocessor_72))) (or (= v_subst_3 v_subst_2) (= (select (select (let ((.cse24 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse6 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~node~0#1.offset_16|)) v_ArrVal_175 v_arrayElimArr_6))) (store .cse24 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse24 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse3 v_prenex_3))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse8) 0) (not (= .cse25 (store (store v_arrayElimArr_6 v_subst_3 (select .cse25 v_subst_3)) v_subst_5 v_DerPreprocessor_72))) (= v_subst_5 v_subst_3) (not (= (select .cse25 v_subst_1) v_DerPreprocessor_71)) (not (= v_DerPreprocessor_70 (select .cse25 v_subst_2))) (= v_subst_3 v_subst_1)))) (= v_ArrVal_175 0) (< |c_#StackHeapBarrier| (+ v_ArrVal_175 1)))) (forall ((v_ArrVal_175 Int)) (or (forall ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_13 Int) (v_DerPreprocessor_14 Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~node~0#1.offset_16| Int) (v_prenex_3 Int) (v_subst_6 Int) (v_subst_2 Int)) (or (= (select (select (let ((.cse26 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse6 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~node~0#1.offset_16|)) v_ArrVal_175 v_arrayElimArr_6))) (store .cse26 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse26 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse3 v_prenex_3))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse8) 0) (not (= v_DerPreprocessor_13 (select (store (store v_arrayElimArr_6 v_subst_6 v_DerPreprocessor_13) v_subst_2 v_DerPreprocessor_14) v_subst_6))))) (= v_ArrVal_175 0) (< |c_#StackHeapBarrier| (+ v_ArrVal_175 1)))) (forall ((v_ArrVal_175 Int)) (let ((.cse28 (+ |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset| 24))) (or (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~node~0#1.offset_16| Int) (v_arrayElimArr_3 (Array Int Int)) (v_prenex_1 Int)) (not (= (select (select (let ((.cse27 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse6 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~node~0#1.offset_16|)) v_ArrVal_175 v_arrayElimArr_3))) (store .cse27 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse27 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse3 v_prenex_1))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse28) 0))) (= v_ArrVal_175 0) (forall ((v_arrayElimArr_8 (Array Int Int)) (v_subst_5 Int)) (or (not (= |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (select v_arrayElimArr_8 v_subst_5))) (not (= (select (select (let ((.cse29 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse4 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| v_ArrVal_175)) v_ArrVal_175 v_arrayElimArr_8))) (store .cse29 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse29 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse3 v_ArrVal_175))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse28) 0)))) (< |c_#StackHeapBarrier| (+ v_ArrVal_175 1))))) (forall ((v_ArrVal_175 Int)) (or (= v_ArrVal_175 0) (< |c_#StackHeapBarrier| (+ v_ArrVal_175 1)) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_13 Int) (v_DerPreprocessor_14 Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~node~0#1.offset_16| Int) (v_prenex_3 Int) (v_subst_5 Int) (v_DerPreprocessor_75 Int) (v_subst_2 Int) (v_subst_1 Int) (v_DerPreprocessor_76 Int)) (let ((.cse31 (store v_arrayElimArr_6 v_subst_1 v_DerPreprocessor_75)) (.cse32 (store (store v_arrayElimArr_6 v_subst_1 v_DerPreprocessor_13) v_subst_2 v_DerPreprocessor_14))) (or (= (select (select (let ((.cse30 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse6 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~node~0#1.offset_16|)) v_ArrVal_175 v_arrayElimArr_6))) (store .cse30 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse30 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse3 v_prenex_3))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse8) 0) (not (= v_DerPreprocessor_75 (select (store .cse31 v_subst_5 v_DerPreprocessor_76) v_subst_1))) (not (= v_DerPreprocessor_13 (select .cse32 v_subst_1))) (not (= (store (store .cse31 v_subst_5 (select .cse32 v_subst_5)) v_subst_2 v_DerPreprocessor_14) .cse32))))))) (forall ((v_ArrVal_175 Int)) (or (= v_ArrVal_175 0) (< |c_#StackHeapBarrier| (+ v_ArrVal_175 1)) (forall ((v_arrayElimArr_6 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~node~0#1.offset_16| Int) (v_prenex_3 Int) (v_subst_6 Int) (v_subst_2 Int) (v_DerPreprocessor_73 Int) (v_DerPreprocessor_74 Int)) (or (= (select (select (let ((.cse33 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse6 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~node~0#1.offset_16|)) v_ArrVal_175 v_arrayElimArr_6))) (store .cse33 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse33 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse3 v_prenex_3))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse8) 0) (not (= (select (store (store v_arrayElimArr_6 v_subst_2 v_DerPreprocessor_73) v_subst_6 v_DerPreprocessor_74) v_subst_2) v_DerPreprocessor_73)))))) (forall ((v_ArrVal_175 Int)) (or (= v_ArrVal_175 0) (< |c_#StackHeapBarrier| (+ v_ArrVal_175 1)) (forall ((v_arrayElimArr_5 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~node~0#1.offset_16| Int) (v_ArrVal_182 Int)) (= (select (select (let ((.cse34 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse6 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~node~0#1.offset_16|)) v_ArrVal_175 v_arrayElimArr_5))) (store .cse34 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse34 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse3 v_ArrVal_182))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse12) 0)))) (forall ((v_ArrVal_175 Int)) (or (= v_ArrVal_175 0) (forall ((v_DerPreprocessor_77 Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~node~0#1.offset_16| Int) (v_prenex_5 Int) (v_DerPreprocessor_78 Int) (v_arrayElimArr_4 (Array Int Int)) (v_DerPreprocessor_15 Int) (v_DerPreprocessor_16 Int) (v_subst_6 Int) (v_subst_5 Int) (v_subst_2 Int) (v_arrayElimArr_9 (Array Int Int))) (let ((.cse36 (store v_arrayElimArr_4 v_subst_6 v_DerPreprocessor_77)) (.cse35 (store (store v_arrayElimArr_4 v_subst_6 v_DerPreprocessor_15) v_subst_2 v_DerPreprocessor_16))) (or (not (= (select .cse35 v_subst_6) v_DerPreprocessor_15)) (not (= v_DerPreprocessor_77 (select (store .cse36 v_subst_5 v_DerPreprocessor_78) v_subst_6))) (not (= (select (select (let ((.cse37 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse4 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| v_ArrVal_175)) v_ArrVal_175 v_arrayElimArr_9))) (store .cse37 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse37 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse3 v_ArrVal_175))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|) 0)) (not (= (select (select (let ((.cse38 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse6 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~node~0#1.offset_16|)) v_ArrVal_175 v_arrayElimArr_4))) (store .cse38 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse38 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse3 v_prenex_5))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|) 0)) (not (= (select v_arrayElimArr_9 v_subst_6) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|)) (not (= (store (store .cse36 v_subst_5 (select .cse35 v_subst_5)) v_subst_2 v_DerPreprocessor_16) .cse35))))) (< |c_#StackHeapBarrier| (+ v_ArrVal_175 1)))) (forall ((v_ArrVal_175 Int)) (or (forall ((v_arrayElimArr_10 (Array Int Int)) (v_DerPreprocessor_29 Int) (v_subst_5 Int) (v_subst_1 Int)) (or (not (= |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (select v_arrayElimArr_10 v_subst_1))) (= (select (select (let ((.cse39 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse4 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| v_ArrVal_175)) v_ArrVal_175 v_arrayElimArr_10))) (store .cse39 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse39 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse3 v_ArrVal_175))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse8) 0) (not (= v_DerPreprocessor_29 (select (store (store v_arrayElimArr_10 v_subst_1 v_DerPreprocessor_29) v_subst_5 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) v_subst_1))))) (= v_ArrVal_175 0) (< |c_#StackHeapBarrier| (+ v_ArrVal_175 1)))) (forall ((v_ArrVal_175 Int)) (or (= v_ArrVal_175 0) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_13 Int) (v_DerPreprocessor_14 Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~node~0#1.offset_16| Int) (v_prenex_3 Int) (v_subst_6 Int) (v_subst_5 Int) (v_DerPreprocessor_75 Int) (v_subst_2 Int) (v_DerPreprocessor_76 Int)) (let ((.cse41 (store v_arrayElimArr_6 v_subst_6 v_DerPreprocessor_75)) (.cse42 (store (store v_arrayElimArr_6 v_subst_6 v_DerPreprocessor_13) v_subst_2 v_DerPreprocessor_14))) (or (= (select (select (let ((.cse40 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse6 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~node~0#1.offset_16|)) v_ArrVal_175 v_arrayElimArr_6))) (store .cse40 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse40 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse3 v_prenex_3))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse8) 0) (not (= v_DerPreprocessor_75 (select (store .cse41 v_subst_5 v_DerPreprocessor_76) v_subst_6))) (not (= v_DerPreprocessor_13 (select .cse42 v_subst_6))) (not (= .cse42 (store (store .cse41 v_subst_5 (select .cse42 v_subst_5)) v_subst_2 v_DerPreprocessor_14)))))) (< |c_#StackHeapBarrier| (+ v_ArrVal_175 1)))) (forall ((v_ArrVal_175 Int)) (or (forall ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_69 Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~node~0#1.offset_16| Int) (v_prenex_3 Int) (v_subst_6 Int) (v_DerPreprocessor_71 Int) (v_subst_5 Int) (v_DerPreprocessor_72 Int) (v_subst_3 Int) (v_DerPreprocessor_70 Int) (v_subst_2 Int)) (let ((.cse44 (store (store (store (store v_arrayElimArr_6 v_subst_3 v_DerPreprocessor_69) v_subst_2 v_DerPreprocessor_70) v_subst_6 v_DerPreprocessor_71) v_subst_5 v_DerPreprocessor_72))) (or (= v_subst_3 v_subst_2) (= (select (select (let ((.cse43 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse6 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~node~0#1.offset_16|)) v_ArrVal_175 v_arrayElimArr_6))) (store .cse43 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse43 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse3 v_prenex_3))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse8) 0) (not (= v_DerPreprocessor_70 (select .cse44 v_subst_2))) (not (= v_DerPreprocessor_71 (select .cse44 v_subst_6))) (not (= (store (store v_arrayElimArr_6 v_subst_3 (select .cse44 v_subst_3)) v_subst_5 v_DerPreprocessor_72) .cse44)) (= v_subst_5 v_subst_3) (= v_subst_6 v_subst_3)))) (= v_ArrVal_175 0) (< |c_#StackHeapBarrier| (+ v_ArrVal_175 1)))) (forall ((v_ArrVal_175 Int)) (or (forall ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_69 Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~node~0#1.offset_16| Int) (v_prenex_3 Int) (v_DerPreprocessor_71 Int) (v_subst_6 Int) (v_DerPreprocessor_72 Int) (v_subst_3 Int) (v_DerPreprocessor_70 Int) (v_subst_2 Int) (v_subst_1 Int)) (let ((.cse46 (store (store (store (store v_arrayElimArr_6 v_subst_3 v_DerPreprocessor_69) v_subst_2 v_DerPreprocessor_70) v_subst_1 v_DerPreprocessor_71) v_subst_6 v_DerPreprocessor_72))) (or (= v_subst_3 v_subst_2) (= (select (select (let ((.cse45 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse6 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~node~0#1.offset_16|)) v_ArrVal_175 v_arrayElimArr_6))) (store .cse45 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse45 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse3 v_prenex_3))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse8) 0) (not (= (select .cse46 v_subst_2) v_DerPreprocessor_70)) (not (= (store (store v_arrayElimArr_6 v_subst_3 (select .cse46 v_subst_3)) v_subst_6 v_DerPreprocessor_72) .cse46)) (= v_subst_3 v_subst_1) (not (= v_DerPreprocessor_71 (select .cse46 v_subst_1))) (= v_subst_6 v_subst_3)))) (= v_ArrVal_175 0) (< |c_#StackHeapBarrier| (+ v_ArrVal_175 1)))) (forall ((v_ArrVal_175 Int)) (or (= v_ArrVal_175 0) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_13 Int) (v_DerPreprocessor_14 Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~node~0#1.offset_16| Int) (v_prenex_3 Int) (v_subst_5 Int) (v_subst_2 Int)) (or (= (select (select (let ((.cse47 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse6 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~node~0#1.offset_16|)) v_ArrVal_175 v_arrayElimArr_6))) (store .cse47 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse47 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse3 v_prenex_3))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse8) 0) (not (= v_DerPreprocessor_13 (select (store (store v_arrayElimArr_6 v_subst_5 v_DerPreprocessor_13) v_subst_2 v_DerPreprocessor_14) v_subst_5))))) (< |c_#StackHeapBarrier| (+ v_ArrVal_175 1)))))) is different from true [2023-12-02 13:11:29,944 INFO L349 Elim1Store]: treesize reduction 88, result has 44.7 percent of original size [2023-12-02 13:11:29,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 116 treesize of output 144 [2023-12-02 13:11:29,967 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 13:11:29,967 INFO L378 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 174 treesize of output 172 [2023-12-02 13:11:29,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 145 treesize of output 133 [2023-12-02 13:11:30,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-12-02 13:11:30,259 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 13:11:30,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 81 treesize of output 83 [2023-12-02 13:11:30,300 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 13:11:30,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:11:30,309 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2023-12-02 13:11:30,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 1 [2023-12-02 13:11:30,313 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 13:11:30,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:11:30,327 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 13:11:30,328 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 46 [2023-12-02 13:11:30,336 INFO L378 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 88 treesize of output 70 [2023-12-02 13:11:30,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:11:30,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2023-12-02 13:11:30,355 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 13:11:30,355 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 13:11:30,363 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-12-02 13:11:30,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 45 [2023-12-02 13:11:30,375 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 13:11:30,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:11:30,381 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 13:11:30,382 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 13:11:30,387 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2023-12-02 13:11:30,387 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 1 [2023-12-02 13:11:30,393 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 13:11:30,394 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 13:11:30,397 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-12-02 13:11:30,402 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 13:11:30,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:11:30,407 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 13:11:30,407 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 13:11:30,411 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2023-12-02 13:11:30,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 1 [2023-12-02 13:11:30,417 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 13:11:30,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:11:30,423 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 13:11:30,423 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 13:11:30,427 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2023-12-02 13:11:30,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 1 [2023-12-02 13:11:30,434 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 13:11:30,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:11:30,439 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 13:11:30,440 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 13:11:30,445 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2023-12-02 13:11:30,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 1 [2023-12-02 13:11:30,451 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 13:11:30,451 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 13:11:30,455 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-12-02 13:11:30,459 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 13:11:30,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:11:30,464 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 13:11:30,465 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 13:11:30,471 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2023-12-02 13:11:30,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 1 [2023-12-02 13:11:30,476 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 13:11:30,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:11:30,481 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 13:11:30,482 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 13:11:30,486 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2023-12-02 13:11:30,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 1 [2023-12-02 13:11:30,491 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 13:11:30,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:11:30,496 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 13:11:30,496 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 13:11:30,500 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2023-12-02 13:11:30,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 1 [2023-12-02 13:11:30,506 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 13:11:30,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:11:30,512 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 13:11:30,512 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 13:11:30,517 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2023-12-02 13:11:30,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 1 [2023-12-02 13:11:30,521 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 13:11:30,521 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 13:11:30,524 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-12-02 13:11:30,533 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 13:11:30,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:11:30,538 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 13:11:30,539 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 13:11:30,543 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2023-12-02 13:11:30,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 1 [2023-12-02 13:11:30,548 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 13:11:30,549 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 13:11:30,552 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-12-02 13:11:30,557 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 13:11:30,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:11:30,561 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 13:11:30,562 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 13:11:30,565 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2023-12-02 13:11:30,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 1 [2023-12-02 13:11:30,569 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 13:11:30,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:11:30,576 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 13:11:30,576 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 13:11:30,580 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2023-12-02 13:11:30,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 1 [2023-12-02 13:11:30,584 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 13:11:30,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:11:30,588 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 13:11:30,589 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 13:11:30,592 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2023-12-02 13:11:30,593 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 1 [2023-12-02 13:11:30,675 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 1 not checked. [2023-12-02 13:11:30,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1607639453] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 13:11:30,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1727588516] [2023-12-02 13:11:30,694 INFO L159 IcfgInterpreter]: Started Sifa with 26 locations of interest [2023-12-02 13:11:30,694 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 13:11:30,697 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 13:11:30,702 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 13:11:30,702 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 13:11:32,802 INFO L197 IcfgInterpreter]: Interpreting procedure aws_linked_list_is_valid with input of size 106 for LOIs [2023-12-02 13:11:32,912 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 6 for LOIs [2023-12-02 13:11:32,914 INFO L197 IcfgInterpreter]: Interpreting procedure nondet_uint64_t with input of size 95 for LOIs [2023-12-02 13:11:32,932 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 13:11:35,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [1727588516] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:11:35,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-12-02 13:11:35,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [5, 9, 8] total 28 [2023-12-02 13:11:35,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722660501] [2023-12-02 13:11:35,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:11:35,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-02 13:11:35,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:11:35,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-02 13:11:35,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=619, Unknown=3, NotChecked=50, Total=756 [2023-12-02 13:11:35,748 INFO L87 Difference]: Start difference. First operand 79 states and 104 transitions. Second operand has 12 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2023-12-02 13:11:39,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:11:39,551 INFO L93 Difference]: Finished difference Result 144 states and 188 transitions. [2023-12-02 13:11:39,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-02 13:11:39,551 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 38 [2023-12-02 13:11:39,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:11:39,554 INFO L225 Difference]: With dead ends: 144 [2023-12-02 13:11:39,554 INFO L226 Difference]: Without dead ends: 105 [2023-12-02 13:11:39,555 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 89 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=117, Invalid=875, Unknown=4, NotChecked=60, Total=1056 [2023-12-02 13:11:39,555 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 21 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2023-12-02 13:11:39,556 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 258 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 285 Invalid, 1 Unknown, 0 Unchecked, 2.1s Time] [2023-12-02 13:11:39,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2023-12-02 13:11:39,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 103. [2023-12-02 13:11:39,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 64 states have (on average 1.328125) internal successors, (85), 66 states have internal predecessors, (85), 26 states have call successors, (26), 12 states have call predecessors, (26), 12 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-12-02 13:11:39,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 135 transitions. [2023-12-02 13:11:39,584 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 135 transitions. Word has length 38 [2023-12-02 13:11:39,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:11:39,584 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 135 transitions. [2023-12-02 13:11:39,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2023-12-02 13:11:39,585 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 135 transitions. [2023-12-02 13:11:39,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-12-02 13:11:39,587 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:11:39,587 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2023-12-02 13:11:39,592 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7e573dc-ea7c-487b-91f3-c5b08a46fc9a/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-12-02 13:11:39,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7e573dc-ea7c-487b-91f3-c5b08a46fc9a/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:11:39,788 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 13:11:39,788 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:11:39,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1593721365, now seen corresponding path program 1 times [2023-12-02 13:11:39,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:11:39,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438235821] [2023-12-02 13:11:39,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:11:39,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:11:39,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:11:39,986 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-12-02 13:11:39,987 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:11:39,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438235821] [2023-12-02 13:11:39,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438235821] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:11:39,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1110468487] [2023-12-02 13:11:39,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:11:39,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:11:39,987 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7e573dc-ea7c-487b-91f3-c5b08a46fc9a/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:11:39,988 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7e573dc-ea7c-487b-91f3-c5b08a46fc9a/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:11:39,991 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7e573dc-ea7c-487b-91f3-c5b08a46fc9a/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-02 13:11:40,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:11:40,165 INFO L262 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-02 13:11:40,168 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:11:40,219 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-02 13:11:40,219 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 13:11:40,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1110468487] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:11:40,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 13:11:40,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2023-12-02 13:11:40,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093542702] [2023-12-02 13:11:40,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:11:40,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 13:11:40,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:11:40,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 13:11:40,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-12-02 13:11:40,221 INFO L87 Difference]: Start difference. First operand 103 states and 135 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-02 13:11:40,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:11:40,370 INFO L93 Difference]: Finished difference Result 183 states and 239 transitions. [2023-12-02 13:11:40,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 13:11:40,371 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 40 [2023-12-02 13:11:40,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:11:40,373 INFO L225 Difference]: With dead ends: 183 [2023-12-02 13:11:40,373 INFO L226 Difference]: Without dead ends: 109 [2023-12-02 13:11:40,374 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2023-12-02 13:11:40,375 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 29 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 151 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 [2023-12-02 13:11:40,375 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 151 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 13:11:40,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2023-12-02 13:11:40,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2023-12-02 13:11:40,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 68 states have (on average 1.2794117647058822) internal successors, (87), 72 states have internal predecessors, (87), 26 states have call successors, (26), 12 states have call predecessors, (26), 14 states have return successors, (28), 24 states have call predecessors, (28), 24 states have call successors, (28) [2023-12-02 13:11:40,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 141 transitions. [2023-12-02 13:11:40,418 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 141 transitions. Word has length 40 [2023-12-02 13:11:40,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:11:40,418 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 141 transitions. [2023-12-02 13:11:40,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-02 13:11:40,418 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 141 transitions. [2023-12-02 13:11:40,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-12-02 13:11:40,420 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:11:40,420 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2023-12-02 13:11:40,426 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7e573dc-ea7c-487b-91f3-c5b08a46fc9a/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-12-02 13:11:40,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7e573dc-ea7c-487b-91f3-c5b08a46fc9a/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:11:40,621 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 13:11:40,621 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:11:40,622 INFO L85 PathProgramCache]: Analyzing trace with hash 500315867, now seen corresponding path program 1 times [2023-12-02 13:11:40,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:11:40,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957264257] [2023-12-02 13:11:40,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:11:40,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:11:40,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:11:40,790 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-12-02 13:11:40,790 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:11:40,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957264257] [2023-12-02 13:11:40,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957264257] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:11:40,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [384397405] [2023-12-02 13:11:40,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:11:40,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:11:40,791 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7e573dc-ea7c-487b-91f3-c5b08a46fc9a/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:11:40,792 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7e573dc-ea7c-487b-91f3-c5b08a46fc9a/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:11:40,800 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7e573dc-ea7c-487b-91f3-c5b08a46fc9a/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-02 13:11:40,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:11:40,977 INFO L262 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-02 13:11:40,979 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:11:41,050 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-02 13:11:41,050 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 13:11:41,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [384397405] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:11:41,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 13:11:41,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2023-12-02 13:11:41,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213446850] [2023-12-02 13:11:41,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:11:41,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-02 13:11:41,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:11:41,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-02 13:11:41,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2023-12-02 13:11:41,053 INFO L87 Difference]: Start difference. First operand 109 states and 141 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-02 13:11:41,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:11:41,239 INFO L93 Difference]: Finished difference Result 223 states and 297 transitions. [2023-12-02 13:11:41,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-02 13:11:41,239 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 42 [2023-12-02 13:11:41,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:11:41,241 INFO L225 Difference]: With dead ends: 223 [2023-12-02 13:11:41,241 INFO L226 Difference]: Without dead ends: 141 [2023-12-02 13:11:41,242 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2023-12-02 13:11:41,243 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 53 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 13:11:41,243 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 175 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 13:11:41,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2023-12-02 13:11:41,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 115. [2023-12-02 13:11:41,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 74 states have (on average 1.2837837837837838) internal successors, (95), 78 states have internal predecessors, (95), 26 states have call successors, (26), 12 states have call predecessors, (26), 14 states have return successors, (28), 24 states have call predecessors, (28), 24 states have call successors, (28) [2023-12-02 13:11:41,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 149 transitions. [2023-12-02 13:11:41,278 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 149 transitions. Word has length 42 [2023-12-02 13:11:41,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:11:41,279 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 149 transitions. [2023-12-02 13:11:41,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-02 13:11:41,279 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 149 transitions. [2023-12-02 13:11:41,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-12-02 13:11:41,281 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:11:41,282 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2023-12-02 13:11:41,288 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7e573dc-ea7c-487b-91f3-c5b08a46fc9a/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-12-02 13:11:41,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7e573dc-ea7c-487b-91f3-c5b08a46fc9a/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:11:41,488 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 13:11:41,488 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:11:41,488 INFO L85 PathProgramCache]: Analyzing trace with hash -717766183, now seen corresponding path program 1 times [2023-12-02 13:11:41,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:11:41,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958235860] [2023-12-02 13:11:41,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:11:41,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:11:41,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:11:41,772 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-12-02 13:11:41,773 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:11:41,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958235860] [2023-12-02 13:11:41,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958235860] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:11:41,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1145342010] [2023-12-02 13:11:41,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:11:41,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:11:41,773 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7e573dc-ea7c-487b-91f3-c5b08a46fc9a/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:11:41,774 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7e573dc-ea7c-487b-91f3-c5b08a46fc9a/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:11:41,784 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7e573dc-ea7c-487b-91f3-c5b08a46fc9a/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-02 13:11:41,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:11:41,973 INFO L262 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-02 13:11:41,976 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:11:41,988 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-02 13:11:41,988 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 13:11:41,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1145342010] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:11:41,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 13:11:41,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2023-12-02 13:11:41,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435460648] [2023-12-02 13:11:41,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:11:41,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 13:11:41,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:11:41,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 13:11:41,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-12-02 13:11:41,991 INFO L87 Difference]: Start difference. First operand 115 states and 149 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-02 13:11:42,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:11:42,069 INFO L93 Difference]: Finished difference Result 219 states and 295 transitions. [2023-12-02 13:11:42,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 13:11:42,069 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 43 [2023-12-02 13:11:42,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:11:42,071 INFO L225 Difference]: With dead ends: 219 [2023-12-02 13:11:42,071 INFO L226 Difference]: Without dead ends: 133 [2023-12-02 13:11:42,072 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-12-02 13:11:42,073 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 4 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 13:11:42,073 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 86 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 13:11:42,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2023-12-02 13:11:42,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 119. [2023-12-02 13:11:42,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 78 states have (on average 1.2692307692307692) internal successors, (99), 82 states have internal predecessors, (99), 26 states have call successors, (26), 12 states have call predecessors, (26), 14 states have return successors, (28), 24 states have call predecessors, (28), 24 states have call successors, (28) [2023-12-02 13:11:42,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 153 transitions. [2023-12-02 13:11:42,106 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 153 transitions. Word has length 43 [2023-12-02 13:11:42,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:11:42,106 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 153 transitions. [2023-12-02 13:11:42,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-02 13:11:42,106 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 153 transitions. [2023-12-02 13:11:42,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-12-02 13:11:42,108 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:11:42,108 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2023-12-02 13:11:42,113 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7e573dc-ea7c-487b-91f3-c5b08a46fc9a/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-12-02 13:11:42,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7e573dc-ea7c-487b-91f3-c5b08a46fc9a/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:11:42,309 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 13:11:42,309 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:11:42,309 INFO L85 PathProgramCache]: Analyzing trace with hash 400186068, now seen corresponding path program 1 times [2023-12-02 13:11:42,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:11:42,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454035317] [2023-12-02 13:11:42,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:11:42,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:11:42,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:11:42,546 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-12-02 13:11:42,546 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:11:42,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454035317] [2023-12-02 13:11:42,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454035317] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:11:42,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [285644581] [2023-12-02 13:11:42,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:11:42,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:11:42,547 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7e573dc-ea7c-487b-91f3-c5b08a46fc9a/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:11:42,548 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7e573dc-ea7c-487b-91f3-c5b08a46fc9a/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:11:42,551 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7e573dc-ea7c-487b-91f3-c5b08a46fc9a/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-02 13:11:42,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:11:42,755 INFO L262 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 78 conjunts are in the unsatisfiable core [2023-12-02 13:11:42,760 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:11:42,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2023-12-02 13:11:42,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:11:42,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 13:11:42,933 INFO L349 Elim1Store]: treesize reduction 48, result has 23.8 percent of original size [2023-12-02 13:11:42,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 86 treesize of output 47 [2023-12-02 13:11:42,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:11:42,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 1 [2023-12-02 13:11:54,855 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 13:11:54,855 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:11:58,669 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-02 13:11:58,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [285644581] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 13:11:58,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1709116757] [2023-12-02 13:11:58,672 INFO L159 IcfgInterpreter]: Started Sifa with 34 locations of interest [2023-12-02 13:11:58,672 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 13:11:58,672 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 13:11:58,672 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 13:11:58,672 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 13:12:00,257 INFO L197 IcfgInterpreter]: Interpreting procedure aws_linked_list_is_valid with input of size 106 for LOIs [2023-12-02 13:12:00,357 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 17 for LOIs [2023-12-02 13:12:00,360 INFO L197 IcfgInterpreter]: Interpreting procedure nondet_uint64_t with input of size 95 for LOIs [2023-12-02 13:12:00,372 INFO L197 IcfgInterpreter]: Interpreting procedure aws_linked_list_node_next_is_valid with input of size 8 for LOIs [2023-12-02 13:12:00,396 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 13:12:03,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [1709116757] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:12:03,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-12-02 13:12:03,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [6, 15, 8] total 40 [2023-12-02 13:12:03,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544477860] [2023-12-02 13:12:03,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:12:03,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-12-02 13:12:03,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:12:03,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-12-02 13:12:03,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1427, Unknown=1, NotChecked=0, Total=1560 [2023-12-02 13:12:03,578 INFO L87 Difference]: Start difference. First operand 119 states and 153 transitions. Second operand has 17 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 11 states have internal predecessors, (22), 5 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2023-12-02 13:12:07,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:12:07,503 INFO L93 Difference]: Finished difference Result 233 states and 303 transitions. [2023-12-02 13:12:07,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-02 13:12:07,504 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 11 states have internal predecessors, (22), 5 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) Word has length 46 [2023-12-02 13:12:07,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:12:07,505 INFO L225 Difference]: With dead ends: 233 [2023-12-02 13:12:07,505 INFO L226 Difference]: Without dead ends: 139 [2023-12-02 13:12:07,506 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 93 SyntacticMatches, 11 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 779 ImplicationChecksByTransitivity, 14.1s TimeCoverageRelationStatistics Valid=194, Invalid=2156, Unknown=2, NotChecked=0, Total=2352 [2023-12-02 13:12:07,507 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 30 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 9 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2023-12-02 13:12:07,507 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 237 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 430 Invalid, 2 Unknown, 0 Unchecked, 2.1s Time] [2023-12-02 13:12:07,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2023-12-02 13:12:07,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 117. [2023-12-02 13:12:07,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 76 states have (on average 1.1973684210526316) internal successors, (91), 80 states have internal predecessors, (91), 26 states have call successors, (26), 12 states have call predecessors, (26), 14 states have return successors, (28), 24 states have call predecessors, (28), 24 states have call successors, (28) [2023-12-02 13:12:07,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 145 transitions. [2023-12-02 13:12:07,534 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 145 transitions. Word has length 46 [2023-12-02 13:12:07,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:12:07,534 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 145 transitions. [2023-12-02 13:12:07,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 11 states have internal predecessors, (22), 5 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2023-12-02 13:12:07,534 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 145 transitions. [2023-12-02 13:12:07,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-12-02 13:12:07,536 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:12:07,536 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2023-12-02 13:12:07,541 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7e573dc-ea7c-487b-91f3-c5b08a46fc9a/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-12-02 13:12:07,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7e573dc-ea7c-487b-91f3-c5b08a46fc9a/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-12-02 13:12:07,737 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 13:12:07,737 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:12:07,737 INFO L85 PathProgramCache]: Analyzing trace with hash 706444474, now seen corresponding path program 1 times [2023-12-02 13:12:07,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:12:07,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340783511] [2023-12-02 13:12:07,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:12:07,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:12:07,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:12:07,952 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-02 13:12:07,952 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:12:07,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340783511] [2023-12-02 13:12:07,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340783511] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:12:07,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1116355658] [2023-12-02 13:12:07,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:12:07,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:12:07,953 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7e573dc-ea7c-487b-91f3-c5b08a46fc9a/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:12:07,954 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7e573dc-ea7c-487b-91f3-c5b08a46fc9a/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:12:07,956 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7e573dc-ea7c-487b-91f3-c5b08a46fc9a/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-12-02 13:12:08,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:12:08,186 INFO L262 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 49 conjunts are in the unsatisfiable core [2023-12-02 13:12:08,190 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:12:08,286 INFO L378 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2023-12-02 13:12:08,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:12:08,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 13:12:08,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:12:08,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 11 [2023-12-02 13:12:08,521 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-02 13:12:08,521 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:12:10,759 WARN L854 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| Int) (v_ArrVal_696 Int) (v_ArrVal_695 Int)) (not (= (+ 16 |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|) |ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| v_ArrVal_696)))) (store .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) (+ |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 24) v_ArrVal_695))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|)))) is different from false [2023-12-02 13:12:10,769 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 13:12:10,769 INFO L378 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 41 [2023-12-02 13:12:10,775 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 13:12:10,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 33 [2023-12-02 13:12:10,796 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 13:12:10,796 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 171 treesize of output 185 [2023-12-02 13:12:10,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 184 treesize of output 176 [2023-12-02 13:12:10,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-12-02 13:12:10,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-12-02 13:12:10,941 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 13:12:10,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 23 treesize of output 27 [2023-12-02 13:12:10,973 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 13:12:10,974 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 83 treesize of output 83 [2023-12-02 13:12:11,128 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 1 not checked. [2023-12-02 13:12:11,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1116355658] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 13:12:11,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1153768340] [2023-12-02 13:12:11,130 INFO L159 IcfgInterpreter]: Started Sifa with 35 locations of interest [2023-12-02 13:12:11,130 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 13:12:11,130 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 13:12:11,130 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 13:12:11,130 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 13:12:14,104 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 115 for LOIs [2023-12-02 13:12:14,336 INFO L197 IcfgInterpreter]: Interpreting procedure aws_linked_list_is_valid with input of size 106 for LOIs [2023-12-02 13:12:14,481 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 6 for LOIs [2023-12-02 13:12:14,482 INFO L197 IcfgInterpreter]: Interpreting procedure nondet_uint64_t with input of size 95 for LOIs [2023-12-02 13:12:14,500 INFO L197 IcfgInterpreter]: Interpreting procedure aws_linked_list_node_next_is_valid with input of size 1 for LOIs [2023-12-02 13:12:14,531 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 13:12:26,726 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3960#(and (<= 0 |__VERIFIER_assert_#in~cond|) (= (mod __VERIFIER_assert_~cond 256) 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_17| Int) (|v_#memory_int_30| (Array Int (Array Int Int))) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_#in~list#1.offset_13| Int) (|v_#memory_$Pointer$.base_92| (Array Int (Array Int Int))) (|v_#memory_real_27| (Array Int (Array Int Real))) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~length~1#1_22| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_17| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_#in~list#1.base_13| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_#in~max_length#1_13| Int) (|v_#memory_$Pointer$.offset_95| (Array Int (Array Int Int))) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_22| Int) (|v_#memory_real_91| (Array Int (Array Int Real))) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~i~1#1_38| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base_22| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~max_length#1_16| Int) (|v_#memory_int_94| (Array Int (Array Int Int)))) (and (<= 0 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~i~1#1_38|) (<= 1 |#StackHeapBarrier|) (= |#memory_real| (store |v_#memory_real_27| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base_22| (store (select |v_#memory_real_27| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base_22|) 24 (select (select |#memory_real| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base_22|) 24)))) (<= 2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base_22|) (= |~#s_can_fail_allocator_static~0.base| 4) (= |~#s_can_fail_allocator_static~0.offset| 0) (<= 2 |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_17|) (= (store |v_#memory_real_91| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base_22|) 24) (store (select |v_#memory_real_91| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base_22|) 24)) 0 (select (select |v_#memory_real_27| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base_22|) 24)) 0))) |v_#memory_real_27|) (= |#memory_int| (store |v_#memory_int_30| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base_22| (store (select |v_#memory_int_30| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base_22|) 24 (select (select |#memory_int| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base_22|) 24)))) (<= 2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_#in~list#1.base_13|) (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_#in~list#1.offset_13| 0) (= |#memory_$Pointer$.base| (store (store |v_#memory_$Pointer$.base_92| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base_22|) 24) (store (select |v_#memory_$Pointer$.base_92| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base_22|) 24)) 0 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base_22|)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base_22| (store (select (store |v_#memory_$Pointer$.base_92| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base_22|) 24) (store (select |v_#memory_$Pointer$.base_92| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base_22|) 24)) 0 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base_22|)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base_22|) 24 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base_22|) 24)))) (= (store |v_#memory_int_94| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base_22|) 24) (store (select |v_#memory_int_94| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base_22|) 24)) 0 (select (select |v_#memory_int_30| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base_22|) 24)) 0))) |v_#memory_int_30|) (<= (mod |v_ULTIMATE.start_ensure_linked_list_is_allocated_~length~1#1_22| 18446744073709551616) (mod |v_ULTIMATE.start_ensure_linked_list_is_allocated_~i~1#1_38| 18446744073709551616)) (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_22| 0) (= ~tl_last_error~0 0) (= |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_17| 0) (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_#in~max_length#1_13| 20) (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~max_length#1_16| 20) (= |#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_95| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base_22|) 24) (store (select |v_#memory_$Pointer$.offset_95| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base_22|) 24)) 0 16)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base_22| (store (select (store |v_#memory_$Pointer$.offset_95| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base_22|) 24) (store (select |v_#memory_$Pointer$.offset_95| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base_22|) 24)) 0 16)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base_22|) 24 0))))) (<= |__VERIFIER_assert_#in~cond| 1))' at error location [2023-12-02 13:12:26,726 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 13:12:26,727 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 13:12:26,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 12, 11] total 24 [2023-12-02 13:12:26,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363546171] [2023-12-02 13:12:26,727 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 13:12:26,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-12-02 13:12:26,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:12:26,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-12-02 13:12:26,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=2013, Unknown=20, NotChecked=90, Total=2256 [2023-12-02 13:12:26,730 INFO L87 Difference]: Start difference. First operand 117 states and 145 transitions. Second operand has 24 states, 20 states have (on average 3.25) internal successors, (65), 23 states have internal predecessors, (65), 9 states have call successors, (24), 3 states have call predecessors, (24), 7 states have return successors, (23), 7 states have call predecessors, (23), 9 states have call successors, (23) [2023-12-02 13:12:29,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:12:29,080 INFO L93 Difference]: Finished difference Result 208 states and 271 transitions. [2023-12-02 13:12:29,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-02 13:12:29,081 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 20 states have (on average 3.25) internal successors, (65), 23 states have internal predecessors, (65), 9 states have call successors, (24), 3 states have call predecessors, (24), 7 states have return successors, (23), 7 states have call predecessors, (23), 9 states have call successors, (23) Word has length 49 [2023-12-02 13:12:29,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:12:29,082 INFO L225 Difference]: With dead ends: 208 [2023-12-02 13:12:29,082 INFO L226 Difference]: Without dead ends: 163 [2023-12-02 13:12:29,084 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 109 SyntacticMatches, 2 SemanticMatches, 58 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 768 ImplicationChecksByTransitivity, 15.4s TimeCoverageRelationStatistics Valid=247, Invalid=3159, Unknown=20, NotChecked=114, Total=3540 [2023-12-02 13:12:29,085 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 116 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 1225 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 1389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 134 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-12-02 13:12:29,085 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 566 Invalid, 1389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1225 Invalid, 0 Unknown, 134 Unchecked, 1.4s Time] [2023-12-02 13:12:29,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2023-12-02 13:12:29,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 128. [2023-12-02 13:12:29,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 84 states have (on average 1.2142857142857142) internal successors, (102), 89 states have internal predecessors, (102), 28 states have call successors, (28), 12 states have call predecessors, (28), 15 states have return successors, (32), 26 states have call predecessors, (32), 26 states have call successors, (32) [2023-12-02 13:12:29,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 162 transitions. [2023-12-02 13:12:29,119 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 162 transitions. Word has length 49 [2023-12-02 13:12:29,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:12:29,119 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 162 transitions. [2023-12-02 13:12:29,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 20 states have (on average 3.25) internal successors, (65), 23 states have internal predecessors, (65), 9 states have call successors, (24), 3 states have call predecessors, (24), 7 states have return successors, (23), 7 states have call predecessors, (23), 9 states have call successors, (23) [2023-12-02 13:12:29,119 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 162 transitions. [2023-12-02 13:12:29,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-12-02 13:12:29,120 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:12:29,120 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2023-12-02 13:12:29,125 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7e573dc-ea7c-487b-91f3-c5b08a46fc9a/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-12-02 13:12:29,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7e573dc-ea7c-487b-91f3-c5b08a46fc9a/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:12:29,321 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 13:12:29,321 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:12:29,321 INFO L85 PathProgramCache]: Analyzing trace with hash 846673140, now seen corresponding path program 1 times [2023-12-02 13:12:29,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:12:29,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201125867] [2023-12-02 13:12:29,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:12:29,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:12:29,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:12:29,660 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-02 13:12:29,661 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:12:29,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201125867] [2023-12-02 13:12:29,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201125867] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:12:29,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1469836142] [2023-12-02 13:12:29,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:12:29,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:12:29,662 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7e573dc-ea7c-487b-91f3-c5b08a46fc9a/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:12:29,669 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7e573dc-ea7c-487b-91f3-c5b08a46fc9a/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:12:29,671 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7e573dc-ea7c-487b-91f3-c5b08a46fc9a/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-12-02 13:12:29,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:12:29,895 INFO L262 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-02 13:12:29,897 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:12:29,993 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-02 13:12:29,993 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 13:12:29,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1469836142] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:12:29,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 13:12:29,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 16 [2023-12-02 13:12:29,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136963260] [2023-12-02 13:12:29,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:12:29,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-02 13:12:29,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:12:29,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-02 13:12:29,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2023-12-02 13:12:29,996 INFO L87 Difference]: Start difference. First operand 128 states and 162 transitions. Second operand has 7 states, 6 states have (on average 5.5) internal successors, (33), 7 states have internal predecessors, (33), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2023-12-02 13:12:30,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:12:30,212 INFO L93 Difference]: Finished difference Result 210 states and 266 transitions. [2023-12-02 13:12:30,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-02 13:12:30,212 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.5) internal successors, (33), 7 states have internal predecessors, (33), 4 states have call successors, (9), 2 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 52 [2023-12-02 13:12:30,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:12:30,214 INFO L225 Difference]: With dead ends: 210 [2023-12-02 13:12:30,214 INFO L226 Difference]: Without dead ends: 125 [2023-12-02 13:12:30,214 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2023-12-02 13:12:30,215 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 30 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 13:12:30,215 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 183 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 13:12:30,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2023-12-02 13:12:30,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2023-12-02 13:12:30,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 82 states have (on average 1.1951219512195121) internal successors, (98), 86 states have internal predecessors, (98), 28 states have call successors, (28), 12 states have call predecessors, (28), 14 states have return successors, (30), 26 states have call predecessors, (30), 26 states have call successors, (30) [2023-12-02 13:12:30,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 156 transitions. [2023-12-02 13:12:30,246 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 156 transitions. Word has length 52 [2023-12-02 13:12:30,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:12:30,246 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 156 transitions. [2023-12-02 13:12:30,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.5) internal successors, (33), 7 states have internal predecessors, (33), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2023-12-02 13:12:30,247 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 156 transitions. [2023-12-02 13:12:30,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-12-02 13:12:30,247 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:12:30,247 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 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] [2023-12-02 13:12:30,252 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7e573dc-ea7c-487b-91f3-c5b08a46fc9a/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-12-02 13:12:30,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7e573dc-ea7c-487b-91f3-c5b08a46fc9a/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:12:30,448 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 13:12:30,448 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:12:30,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1393554336, now seen corresponding path program 1 times [2023-12-02 13:12:30,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:12:30,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009947345] [2023-12-02 13:12:30,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:12:30,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:12:30,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:12:30,698 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2023-12-02 13:12:30,698 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:12:30,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009947345] [2023-12-02 13:12:30,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009947345] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:12:30,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1308234223] [2023-12-02 13:12:30,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:12:30,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:12:30,699 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7e573dc-ea7c-487b-91f3-c5b08a46fc9a/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:12:30,700 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7e573dc-ea7c-487b-91f3-c5b08a46fc9a/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:12:30,703 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7e573dc-ea7c-487b-91f3-c5b08a46fc9a/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-12-02 13:12:30,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:12:30,959 INFO L262 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 76 conjunts are in the unsatisfiable core [2023-12-02 13:12:30,964 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:12:31,065 INFO L378 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 8 treesize of output 1 [2023-12-02 13:12:31,077 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-12-02 13:12:31,077 INFO L378 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 1 case distinctions, treesize of input 14 treesize of output 15 [2023-12-02 13:12:31,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2023-12-02 13:12:31,089 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 1 [2023-12-02 13:12:31,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 19 [2023-12-02 13:12:31,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2023-12-02 13:12:42,335 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 14 proven. 24 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-02 13:12:42,335 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:12:46,082 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-12-02 13:12:46,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1308234223] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 13:12:46,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1720113752] [2023-12-02 13:12:46,085 INFO L159 IcfgInterpreter]: Started Sifa with 35 locations of interest [2023-12-02 13:12:46,085 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 13:12:46,085 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 13:12:46,085 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 13:12:46,085 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 13:12:49,272 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 114 for LOIs [2023-12-02 13:12:49,508 INFO L197 IcfgInterpreter]: Interpreting procedure aws_linked_list_is_valid with input of size 105 for LOIs [2023-12-02 13:12:49,632 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 6 for LOIs [2023-12-02 13:12:49,633 INFO L197 IcfgInterpreter]: Interpreting procedure nondet_uint64_t with input of size 95 for LOIs [2023-12-02 13:12:49,645 INFO L197 IcfgInterpreter]: Interpreting procedure aws_linked_list_node_next_is_valid with input of size 1 for LOIs [2023-12-02 13:12:49,666 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 13:13:52,875 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '5525#(and (<= 0 |__VERIFIER_assert_#in~cond|) (= (mod __VERIFIER_assert_~cond 256) 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~i~1#1_42| Int) (|v_#memory_$Pointer$.offset_105| (Array Int (Array Int Int))) (|v_#memory_int_30| (Array Int (Array Int Int))) (|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_34| Int) (|v_#memory_int_109| (Array Int (Array Int Int))) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_#in~list#1.offset_14| Int) (|v_#memory_real_27| (Array Int (Array Int Real))) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~length~1#1_23| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_#in~max_length#1_14| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_#in~list#1.base_14| Int) (|v_#memory_real_106| (Array Int (Array Int Real))) (|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_33| Int) (|v_#memory_$Pointer$.base_102| (Array Int (Array Int Int))) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base_24| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~max_length#1_17| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_24| Int)) (and (= |v_#memory_int_30| (store |v_#memory_int_109| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base_24|) 24) (store (select |v_#memory_int_109| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base_24|) 24)) 0 (select (select |v_#memory_int_30| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base_24|) 24)) 0)))) (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_#in~max_length#1_14| 20) (<= 1 |#StackHeapBarrier|) (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_24| 0) (<= 0 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~i~1#1_42|) (= |#memory_real| (store |v_#memory_real_27| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base_24| (store (select |v_#memory_real_27| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base_24|) 24 (select (select |#memory_real| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base_24|) 24)))) (= |~#s_can_fail_allocator_static~0.base| 4) (= |~#s_can_fail_allocator_static~0.offset| 0) (= (store (store |v_#memory_$Pointer$.offset_105| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base_24|) 24) (store (select |v_#memory_$Pointer$.offset_105| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base_24|) 24)) 0 16)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base_24| (store (select (store |v_#memory_$Pointer$.offset_105| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base_24|) 24) (store (select |v_#memory_$Pointer$.offset_105| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base_24|) 24)) 0 16)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base_24|) 24 0)) |#memory_$Pointer$.offset|) (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~max_length#1_17| 20) (<= (mod |v_ULTIMATE.start_ensure_linked_list_is_allocated_~length~1#1_23| 18446744073709551616) (mod |v_ULTIMATE.start_ensure_linked_list_is_allocated_~i~1#1_42| 18446744073709551616)) (= (store |v_#memory_real_106| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base_24|) 24) (store (select |v_#memory_real_106| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base_24|) 24)) 0 (select (select |v_#memory_real_27| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base_24|) 24)) 0))) |v_#memory_real_27|) (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_#in~list#1.offset_14| 0) (<= 2 |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_34|) (<= 2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_#in~list#1.base_14|) (= |#memory_int| (store |v_#memory_int_30| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base_24| (store (select |v_#memory_int_30| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base_24|) 24 (select (select |#memory_int| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base_24|) 24)))) (= ~tl_last_error~0 0) (<= 2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base_24|) (= |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_33| 0) (= (store (store |v_#memory_$Pointer$.base_102| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base_24|) 24) (store (select |v_#memory_$Pointer$.base_102| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base_24|) 24)) 0 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base_24|)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base_24| (store (select (store |v_#memory_$Pointer$.base_102| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base_24|) 24) (store (select |v_#memory_$Pointer$.base_102| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base_24|) 24)) 0 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base_24|)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base_24|) 24 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base_24|) 24))) |#memory_$Pointer$.base|))) (<= |__VERIFIER_assert_#in~cond| 1))' at error location [2023-12-02 13:13:52,875 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 13:13:52,875 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 13:13:52,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 16, 8] total 26 [2023-12-02 13:13:52,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769000262] [2023-12-02 13:13:52,875 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 13:13:52,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-12-02 13:13:52,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:13:52,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-12-02 13:13:52,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=2256, Unknown=42, NotChecked=0, Total=2450 [2023-12-02 13:13:52,878 INFO L87 Difference]: Start difference. First operand 125 states and 156 transitions. Second operand has 26 states, 23 states have (on average 3.391304347826087) internal successors, (78), 22 states have internal predecessors, (78), 13 states have call successors, (24), 5 states have call predecessors, (24), 9 states have return successors, (24), 12 states have call predecessors, (24), 13 states have call successors, (24) [2023-12-02 13:13:55,165 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 13:13:57,197 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 13:13:58,998 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 13:14:01,284 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 13:14:07,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:14:07,411 INFO L93 Difference]: Finished difference Result 211 states and 269 transitions. [2023-12-02 13:14:07,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-12-02 13:14:07,412 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 3.391304347826087) internal successors, (78), 22 states have internal predecessors, (78), 13 states have call successors, (24), 5 states have call predecessors, (24), 9 states have return successors, (24), 12 states have call predecessors, (24), 13 states have call successors, (24) Word has length 63 [2023-12-02 13:14:07,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:14:07,413 INFO L225 Difference]: With dead ends: 211 [2023-12-02 13:14:07,413 INFO L226 Difference]: Without dead ends: 139 [2023-12-02 13:14:07,414 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 137 SyntacticMatches, 11 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 918 ImplicationChecksByTransitivity, 72.1s TimeCoverageRelationStatistics Valid=289, Invalid=3701, Unknown=42, NotChecked=0, Total=4032 [2023-12-02 13:14:07,415 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 57 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 61 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.7s IncrementalHoareTripleChecker+Time [2023-12-02 13:14:07,415 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 275 Invalid, 748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 686 Invalid, 1 Unknown, 0 Unchecked, 10.7s Time] [2023-12-02 13:14:07,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2023-12-02 13:14:07,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 133. [2023-12-02 13:14:07,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 87 states have (on average 1.1724137931034482) internal successors, (102), 92 states have internal predecessors, (102), 28 states have call successors, (28), 14 states have call predecessors, (28), 17 states have return successors, (32), 26 states have call predecessors, (32), 26 states have call successors, (32) [2023-12-02 13:14:07,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 162 transitions. [2023-12-02 13:14:07,463 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 162 transitions. Word has length 63 [2023-12-02 13:14:07,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:14:07,463 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 162 transitions. [2023-12-02 13:14:07,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 3.391304347826087) internal successors, (78), 22 states have internal predecessors, (78), 13 states have call successors, (24), 5 states have call predecessors, (24), 9 states have return successors, (24), 12 states have call predecessors, (24), 13 states have call successors, (24) [2023-12-02 13:14:07,463 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 162 transitions. [2023-12-02 13:14:07,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-12-02 13:14:07,464 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:14:07,464 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-12-02 13:14:07,470 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7e573dc-ea7c-487b-91f3-c5b08a46fc9a/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-12-02 13:14:07,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7e573dc-ea7c-487b-91f3-c5b08a46fc9a/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:14:07,665 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 13:14:07,665 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:14:07,665 INFO L85 PathProgramCache]: Analyzing trace with hash -4804594, now seen corresponding path program 1 times [2023-12-02 13:14:07,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:14:07,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069356350] [2023-12-02 13:14:07,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:14:07,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:14:07,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:14:08,380 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-02 13:14:08,380 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:14:08,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069356350] [2023-12-02 13:14:08,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069356350] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:14:08,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [235776032] [2023-12-02 13:14:08,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:14:08,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:14:08,381 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7e573dc-ea7c-487b-91f3-c5b08a46fc9a/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:14:08,382 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7e573dc-ea7c-487b-91f3-c5b08a46fc9a/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:14:08,383 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7e573dc-ea7c-487b-91f3-c5b08a46fc9a/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-12-02 13:14:08,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:14:08,598 INFO L262 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 31 conjunts are in the unsatisfiable core [2023-12-02 13:14:08,600 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:14:08,771 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 37 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-02 13:14:08,771 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:14:08,986 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 14 proven. 8 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2023-12-02 13:14:08,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [235776032] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 13:14:08,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [64392654] [2023-12-02 13:14:08,989 INFO L159 IcfgInterpreter]: Started Sifa with 35 locations of interest [2023-12-02 13:14:08,989 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 13:14:08,989 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 13:14:08,989 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 13:14:08,989 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 13:14:10,411 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 186 for LOIs [2023-12-02 13:14:10,508 INFO L197 IcfgInterpreter]: Interpreting procedure aws_linked_list_is_valid with input of size 17 for LOIs [2023-12-02 13:14:10,799 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 15 for LOIs [2023-12-02 13:14:10,801 INFO L197 IcfgInterpreter]: Interpreting procedure nondet_uint64_t with input of size 95 for LOIs [2023-12-02 13:14:10,814 INFO L197 IcfgInterpreter]: Interpreting procedure aws_linked_list_node_next_is_valid with input of size 25 for LOIs [2023-12-02 13:14:10,845 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 13:14:24,147 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '6478#(and (<= 0 |__VERIFIER_assert_#in~cond|) (<= 1 |#StackHeapBarrier|) (= |~#s_can_fail_allocator_static~0.base| 4) (= (mod __VERIFIER_assert_~cond 256) 0) (= |~#s_can_fail_allocator_static~0.offset| 0) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_#t~ret334#1_33| Int)) (and (not (= (mod |v_ULTIMATE.start_aws_linked_list_rbegin_#t~ret334#1_33| 256) 0)) (<= |v_ULTIMATE.start_aws_linked_list_rbegin_#t~ret334#1_33| 1) (<= 0 |v_ULTIMATE.start_aws_linked_list_rbegin_#t~ret334#1_33|))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~length~1#1_24| Int)) (<= (mod |v_ULTIMATE.start_ensure_linked_list_is_allocated_~length~1#1_24| 18446744073709551616) 0)) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_#t~ret683#1_33| Int)) (and (<= 0 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_#t~ret683#1_33|) (<= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_#t~ret683#1_33| 1) (not (= (mod |v_ULTIMATE.start_aws_linked_list_rbegin_harness_#t~ret683#1_33| 256) 0)))) (= ~tl_last_error~0 0) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_44| Int) (|v_#memory_int_30| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_106| (Array Int (Array Int Int))) (|v_#memory_real_4| (Array Int (Array Int Real))) (|v_#memory_int_114| (Array Int (Array Int Int))) (|v_#memory_int_115| (Array Int (Array Int Int))) (|v_#memory_real_27| (Array Int (Array Int Real))) (|v_#length_32| (Array Int Int)) (|v_#memory_int_5| (Array Int (Array Int Int))) (|v_#memory_real_111| (Array Int (Array Int Real))) (|v_#memory_real_112| (Array Int (Array Int Real))) (|v_#memory_$Pointer$.base_103| (Array Int (Array Int Int))) (|v_#valid_38| (Array Int Int))) (and (= (select (select |v_#memory_$Pointer$.base_103| 4) 32) 0) (= (select |v_#length_32| 1) 2) (= |#memory_real| (store |v_#memory_real_27| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_44| (store (select |v_#memory_real_27| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_44|) 24 (select (select |#memory_real| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_44|) 24)))) (= |v_#memory_int_30| (store |v_#memory_int_115| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_44| (store (select |v_#memory_int_115| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_44|) 0 (select (select |v_#memory_int_30| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_44|) 0)))) (= |v_#memory_real_112| (store |v_#memory_real_4| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_44| (store (select |v_#memory_real_4| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_44|) 16 (select (select |v_#memory_real_112| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_44|) 16)))) (= (select |v_#valid_38| 0) 0) (= (select |v_#length_32| 3) 12) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_106| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_44| (store (store (store (store (select |v_#memory_$Pointer$.offset_106| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_44|) 8 0) 16 0) 0 16) 24 0))) (= (select |v_#valid_38| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_44|) 0) (= (select |v_#valid_38| 3) 1) (= (store |v_#valid_38| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_44| 1) |#valid|) (= (select |v_#valid_38| 2) 1) (= (select |v_#valid_38| 1) 1) (= (store |v_#length_32| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_44| 32) |#length|) (= (select (select |v_#memory_$Pointer$.base_103| 4) 24) |#funAddr~s_can_fail_calloc_allocator.base|) (= |#funAddr~s_can_fail_free_allocator.base| (select (select |v_#memory_$Pointer$.base_103| 4) 8)) (= (select |v_#valid_38| 4) 1) (= (select (select |v_#memory_int_114| 1) 1) 0) (= (select (select |v_#memory_$Pointer$.offset_106| 4) 0) |#funAddr~s_can_fail_malloc_allocator.offset|) (= (select (select |v_#memory_$Pointer$.offset_106| 4) 8) |#funAddr~s_can_fail_free_allocator.offset|) (= |#funAddr~s_can_fail_calloc_allocator.offset| (select (select |v_#memory_$Pointer$.offset_106| 4) 24)) (= (store |v_#memory_real_111| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_44| (store (select |v_#memory_real_111| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_44|) 8 (select (select |v_#memory_real_4| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_44|) 8))) |v_#memory_real_4|) (= |#funAddr~s_can_fail_realloc_allocator.offset| (select (select |v_#memory_$Pointer$.offset_106| 4) 16)) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_103| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_44| (store (store (store (store (select |v_#memory_$Pointer$.base_103| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_44|) 8 0) 16 0) 0 |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_44|) 24 |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_44|))) (= (select (select |v_#memory_$Pointer$.base_103| 4) 16) |#funAddr~s_can_fail_realloc_allocator.base|) (<= (+ |#StackHeapBarrier| 1) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_44|) (= 48 (select (select |v_#memory_int_114| 1) 0)) (= (select (select |v_#memory_$Pointer$.base_103| 4) 0) |#funAddr~s_can_fail_malloc_allocator.base|) (= (store |v_#memory_real_112| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_44| (store (select |v_#memory_real_112| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_44|) 0 (select (select |v_#memory_real_27| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_44|) 0))) |v_#memory_real_27|) (= (store |v_#memory_int_114| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_44| (store (select |v_#memory_int_114| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_44|) 8 (select (select |v_#memory_int_5| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_44|) 8))) |v_#memory_int_5|) (= 40 (select |v_#length_32| 4)) (= |#memory_int| (store |v_#memory_int_30| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_44| (store (select |v_#memory_int_30| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_44|) 24 (select (select |#memory_int| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_44|) 24)))) (= (select |v_#length_32| 2) 33) (= (select (select |v_#memory_$Pointer$.offset_106| 4) 32) 0) (= (store |v_#memory_int_5| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_44| (store (select |v_#memory_int_5| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_44|) 16 (select (select |v_#memory_int_115| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_44|) 16))) |v_#memory_int_115|))) (<= |__VERIFIER_assert_#in~cond| 1))' at error location [2023-12-02 13:14:24,147 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 13:14:24,147 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 13:14:24,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 7] total 26 [2023-12-02 13:14:24,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318585956] [2023-12-02 13:14:24,147 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 13:14:24,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-12-02 13:14:24,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:14:24,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-12-02 13:14:24,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=2614, Unknown=8, NotChecked=0, Total=2862 [2023-12-02 13:14:24,151 INFO L87 Difference]: Start difference. First operand 133 states and 162 transitions. Second operand has 26 states, 21 states have (on average 3.6666666666666665) internal successors, (77), 22 states have internal predecessors, (77), 12 states have call successors, (23), 2 states have call predecessors, (23), 8 states have return successors, (24), 11 states have call predecessors, (24), 12 states have call successors, (24) [2023-12-02 13:14:26,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:14:26,535 INFO L93 Difference]: Finished difference Result 303 states and 399 transitions. [2023-12-02 13:14:26,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2023-12-02 13:14:26,535 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 21 states have (on average 3.6666666666666665) internal successors, (77), 22 states have internal predecessors, (77), 12 states have call successors, (23), 2 states have call predecessors, (23), 8 states have return successors, (24), 11 states have call predecessors, (24), 12 states have call successors, (24) Word has length 66 [2023-12-02 13:14:26,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:14:26,537 INFO L225 Difference]: With dead ends: 303 [2023-12-02 13:14:26,537 INFO L226 Difference]: Without dead ends: 219 [2023-12-02 13:14:26,540 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 160 SyntacticMatches, 2 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 1904 ImplicationChecksByTransitivity, 15.1s TimeCoverageRelationStatistics Valid=665, Invalid=7517, Unknown=8, NotChecked=0, Total=8190 [2023-12-02 13:14:26,541 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 169 mSDsluCounter, 686 mSDsCounter, 0 mSdLazyCounter, 1201 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 725 SdHoareTripleChecker+Invalid, 1266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 1201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-02 13:14:26,541 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 725 Invalid, 1266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 1201 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-02 13:14:26,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2023-12-02 13:14:26,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 180. [2023-12-02 13:14:26,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 119 states have (on average 1.1932773109243697) internal successors, (142), 126 states have internal predecessors, (142), 40 states have call successors, (40), 15 states have call predecessors, (40), 20 states have return successors, (50), 38 states have call predecessors, (50), 38 states have call successors, (50) [2023-12-02 13:14:26,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 232 transitions. [2023-12-02 13:14:26,622 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 232 transitions. Word has length 66 [2023-12-02 13:14:26,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:14:26,623 INFO L495 AbstractCegarLoop]: Abstraction has 180 states and 232 transitions. [2023-12-02 13:14:26,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 21 states have (on average 3.6666666666666665) internal successors, (77), 22 states have internal predecessors, (77), 12 states have call successors, (23), 2 states have call predecessors, (23), 8 states have return successors, (24), 11 states have call predecessors, (24), 12 states have call successors, (24) [2023-12-02 13:14:26,623 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 232 transitions. [2023-12-02 13:14:26,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-12-02 13:14:26,624 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:14:26,625 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-12-02 13:14:26,630 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7e573dc-ea7c-487b-91f3-c5b08a46fc9a/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-12-02 13:14:26,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7e573dc-ea7c-487b-91f3-c5b08a46fc9a/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-12-02 13:14:26,825 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 13:14:26,825 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:14:26,826 INFO L85 PathProgramCache]: Analyzing trace with hash -1168071950, now seen corresponding path program 1 times [2023-12-02 13:14:26,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:14:26,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213461163] [2023-12-02 13:14:26,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:14:26,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:14:26,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:14:29,042 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 13 proven. 27 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-02 13:14:29,042 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:14:29,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213461163] [2023-12-02 13:14:29,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213461163] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:14:29,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [416684695] [2023-12-02 13:14:29,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:14:29,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:14:29,042 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7e573dc-ea7c-487b-91f3-c5b08a46fc9a/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:14:29,043 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7e573dc-ea7c-487b-91f3-c5b08a46fc9a/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:14:29,044 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7e573dc-ea7c-487b-91f3-c5b08a46fc9a/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-12-02 13:14:29,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:14:29,252 INFO L262 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 109 conjunts are in the unsatisfiable core [2023-12-02 13:14:29,258 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:14:29,315 INFO L378 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 8 treesize of output 1 [2023-12-02 13:14:29,319 INFO L378 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 8 treesize of output 1 [2023-12-02 13:14:32,602 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 23 proven. 29 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-02 13:14:32,602 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:14:39,050 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse12 (select (select |c_#memory_$Pointer$.offset| |c_aws_linked_list_node_next_is_valid_#in~node.base|) |c_aws_linked_list_node_next_is_valid_#in~node.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_aws_linked_list_node_next_is_valid_#in~node.base|) |c_aws_linked_list_node_next_is_valid_#in~node.offset|)) (.cse1 (+ 8 .cse12))) (or (not (= |c_aws_linked_list_node_next_is_valid_#in~node.offset| (select (select |c_#memory_$Pointer$.offset| .cse0) .cse1))) (< 0 (mod |c_aws_linked_list_node_next_is_valid_#res| 256)) (and (= 0 |c_aws_linked_list_node_next_is_valid_#in~node.base|) (= |c_aws_linked_list_node_next_is_valid_#in~node.offset| 0)) (and (forall ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_18| Int)) (or (forall ((|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_18| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$.offset| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_18|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_18|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_18|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_18|)) (.cse3 (+ .cse4 8))) (or (not (= (select (select |c_#memory_$Pointer$.offset| .cse2) .cse3) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_18|)) (= .cse4 0) (not (= (select (select |c_#memory_$Pointer$.base| .cse2) .cse3) |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_18|)))))) (= |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_18| 0))) (forall ((|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_18| Int)) (or (= |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_18| 0) (forall ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_18| Int)) (let ((.cse7 (select (select |c_#memory_$Pointer$.offset| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_18|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_18|))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_18|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_18|)) (.cse6 (+ .cse7 8))) (or (not (= (select (select |c_#memory_$Pointer$.offset| .cse5) .cse6) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_18|)) (= .cse7 0) (not (= (select (select |c_#memory_$Pointer$.base| .cse5) .cse6) |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_18|)))))))) (forall ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_18| Int)) (or (forall ((|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_18| Int)) (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_18|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_18|)) (.cse9 (+ (select (select |c_#memory_$Pointer$.offset| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_18|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_18|) 8))) (or (not (= (select (select |c_#memory_$Pointer$.offset| .cse8) .cse9) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_18|)) (= .cse8 0) (not (= (select (select |c_#memory_$Pointer$.base| .cse8) .cse9) |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_18|))))) (= |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_18| 0))) (forall ((|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_18| Int)) (or (= |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_18| 0) (forall ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_18| Int)) (let ((.cse10 (select (select |c_#memory_$Pointer$.base| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_18|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_18|)) (.cse11 (+ (select (select |c_#memory_$Pointer$.offset| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_18|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_18|) 8))) (or (not (= (select (select |c_#memory_$Pointer$.offset| .cse10) .cse11) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_18|)) (= .cse10 0) (not (= (select (select |c_#memory_$Pointer$.base| .cse10) .cse11) |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_18|)))))))) (and (= .cse12 0) (= .cse0 0)) (not (= (select (select |c_#memory_$Pointer$.base| .cse0) .cse1) |c_aws_linked_list_node_next_is_valid_#in~node.base|))))) is different from false [2023-12-02 13:14:49,810 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 13 proven. 31 refuted. 0 times theorem prover too weak. 12 trivial. 1 not checked. [2023-12-02 13:14:49,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [416684695] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 13:14:49,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1922619438] [2023-12-02 13:14:49,812 INFO L159 IcfgInterpreter]: Started Sifa with 35 locations of interest [2023-12-02 13:14:49,812 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 13:14:49,813 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 13:14:49,813 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 13:14:49,813 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 13:14:52,869 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 277 for LOIs [2023-12-02 13:14:53,381 INFO L197 IcfgInterpreter]: Interpreting procedure aws_linked_list_is_valid with input of size 17 for LOIs [2023-12-02 13:14:53,701 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 12 for LOIs [2023-12-02 13:14:53,704 INFO L197 IcfgInterpreter]: Interpreting procedure nondet_uint64_t with input of size 95 for LOIs [2023-12-02 13:14:53,718 INFO L197 IcfgInterpreter]: Interpreting procedure aws_linked_list_node_next_is_valid with input of size 25 for LOIs [2023-12-02 13:14:53,752 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 13:15:46,109 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '7701#(and (<= 1 |#StackHeapBarrier|) (= |~#s_can_fail_allocator_static~0.base| 4) (= |~#s_can_fail_allocator_static~0.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (= ~tl_last_error~0 0) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~rval~2#1.base_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_#in~list#1.base_BEFORE_CALL_37| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_~rval~2#1.offset_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_60| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_149| Int)) (or (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~length~1#1_25| Int)) (<= (mod |v_ULTIMATE.start_ensure_linked_list_is_allocated_~length~1#1_25| 18446744073709551616) 0)) (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_60|) 24) |v_ULTIMATE.start_aws_linked_list_rbegin_~rval~2#1.base_BEFORE_CALL_15|) (exists ((|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_118| Int) (|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~head_reaches_tail~0#1_97| Int) (|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset_65| Int) (|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_122| Int) (|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.base_65| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_#t~ret334#1_38| Int)) (and (= |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~head_reaches_tail~0#1_97| 1) (= |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.base_65| |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_118|) (= |v_ULTIMATE.start_aws_linked_list_rbegin_#t~ret334#1_38| 1) (= |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_122| (+ |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset_65| 16)))) (exists ((|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~head_reaches_tail~0#1_96| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_#t~ret683#1_39| Int) (|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset_64| Int) (|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_121| Int) (|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.base_64| Int) (|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_117| Int)) (and (= |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.base_64| |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_117|) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_#t~ret683#1_39| 1) (= |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_121| (+ |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset_64| 16)) (= |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~head_reaches_tail~0#1_96| 1))) (exists ((|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~head_reaches_tail~0#1_96| Int)) (and (exists ((|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_#t~ret324#1_123| Int)) (= (mod |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_#t~ret324#1_123| 256) 0)) (= |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~head_reaches_tail~0#1_96| 0) (= |__VERIFIER_assert_#in~cond| 0))) (exists ((|v_#memory_$Pointer$.base_118| (Array Int (Array Int Int)))) (and (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_118| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_149| (store (store (store (store (select |v_#memory_$Pointer$.base_118| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_149|) 8 0) 16 0) 0 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_149|) 24 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_149|))) (= (select (select |v_#memory_$Pointer$.base_118| 4) 16) |#funAddr~s_can_fail_realloc_allocator.base|) (= (select (select |v_#memory_$Pointer$.base_118| 4) 8) |#funAddr~s_can_fail_free_allocator.base|) (= (select (select |v_#memory_$Pointer$.base_118| 4) 32) 0) (= |#funAddr~s_can_fail_malloc_allocator.base| (select (select |v_#memory_$Pointer$.base_118| 4) 0)) (= |#funAddr~s_can_fail_calloc_allocator.base| (select (select |v_#memory_$Pointer$.base_118| 4) 24)))) (exists ((|v_#memory_real_4| (Array Int (Array Int Real))) (|v_#memory_real_27| (Array Int (Array Int Real))) (|v_#memory_real_117| (Array Int (Array Int Real))) (|v_#memory_real_118| (Array Int (Array Int Real)))) (and (= (store |v_#memory_real_118| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_149| (store (select |v_#memory_real_118| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_149|) 0 (select (select |v_#memory_real_27| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_149|) 0))) |v_#memory_real_27|) (= (store |v_#memory_real_117| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_149| (store (select |v_#memory_real_117| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_149|) 8 (select (select |v_#memory_real_4| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_149|) 8))) |v_#memory_real_4|) (= (store |v_#memory_real_27| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_149| (store (select |v_#memory_real_27| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_149|) 24 (select (select |#memory_real| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_149|) 24))) |#memory_real|) (= |v_#memory_real_118| (store |v_#memory_real_4| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_149| (store (select |v_#memory_real_4| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_149|) 16 (select (select |v_#memory_real_118| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_149|) 16)))))) (= |v_ULTIMATE.start_aws_linked_list_rbegin_#in~list#1.base_BEFORE_CALL_37| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_60|) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_60|) 24) |v_ULTIMATE.start_aws_linked_list_rbegin_~rval~2#1.offset_BEFORE_CALL_15|) (exists ((|v_#memory_$Pointer$.offset_121| (Array Int (Array Int Int)))) (and (= |#funAddr~s_can_fail_realloc_allocator.offset| (select (select |v_#memory_$Pointer$.offset_121| 4) 16)) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_121| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_149| (store (store (store (store (select |v_#memory_$Pointer$.offset_121| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_149|) 8 0) 16 0) 0 16) 24 0))) (= (select (select |v_#memory_$Pointer$.offset_121| 4) 8) |#funAddr~s_can_fail_free_allocator.offset|) (= (select (select |v_#memory_$Pointer$.offset_121| 4) 0) |#funAddr~s_can_fail_malloc_allocator.offset|) (= (select (select |v_#memory_$Pointer$.offset_121| 4) 32) 0) (= |#funAddr~s_can_fail_calloc_allocator.offset| (select (select |v_#memory_$Pointer$.offset_121| 4) 24)))) (exists ((|v_#length_33| (Array Int Int))) (and (= 2 (select |v_#length_33| 1)) (= (select |v_#length_33| 2) 33) (= |#length| (store |v_#length_33| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_149| 32)) (= (select |v_#length_33| 3) 12) (= 40 (select |v_#length_33| 4)))) (= |v_ULTIMATE.start_aws_linked_list_rbegin_#in~list#1.base_BEFORE_CALL_37| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_149|) (<= (+ |#StackHeapBarrier| 1) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_149|) (exists ((|v_#memory_int_30| (Array Int (Array Int Int))) (|v_#memory_int_5| (Array Int (Array Int Int))) (|v_#memory_int_121| (Array Int (Array Int Int))) (|v_#memory_int_120| (Array Int (Array Int Int)))) (and (= |v_#memory_int_121| (store |v_#memory_int_5| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_149| (store (select |v_#memory_int_5| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_149|) 16 (select (select |v_#memory_int_121| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_149|) 16)))) (= (select (select |v_#memory_int_120| 1) 1) 0) (= |#memory_int| (store |v_#memory_int_30| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_149| (store (select |v_#memory_int_30| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_149|) 24 (select (select |#memory_int| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_149|) 24)))) (= |v_#memory_int_30| (store |v_#memory_int_121| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_149| (store (select |v_#memory_int_121| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_149|) 0 (select (select |v_#memory_int_30| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_149|) 0)))) (= (store |v_#memory_int_120| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_149| (store (select |v_#memory_int_120| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_149|) 8 (select (select |v_#memory_int_5| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_149|) 8))) |v_#memory_int_5|) (= (select (select |v_#memory_int_120| 1) 0) 48))) (exists ((|v_#valid_39| (Array Int Int))) (and (= (select |v_#valid_39| 0) 0) (= (select |v_#valid_39| 2) 1) (= (select |v_#valid_39| 4) 1) (= (select |v_#valid_39| 3) 1) (= (select |v_#valid_39| 1) 1) (= (store |v_#valid_39| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_149| 1) |#valid|) (= (select |v_#valid_39| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_149|) 0)))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~length~1#1_25| Int)) (<= (mod |v_ULTIMATE.start_ensure_linked_list_is_allocated_~length~1#1_25| 18446744073709551616) 0)) (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_60|) 24) |v_ULTIMATE.start_aws_linked_list_rbegin_~rval~2#1.base_BEFORE_CALL_15|) (exists ((|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~head_reaches_tail~0#1_96| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_#t~ret683#1_39| Int) (|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset_64| Int) (|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_121| Int) (|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.base_64| Int) (|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_117| Int)) (and (= |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.base_64| |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_117|) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_#t~ret683#1_39| 1) (= |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_121| (+ |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset_64| 16)) (= |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~head_reaches_tail~0#1_96| 1))) (exists ((|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~head_reaches_tail~0#1_96| Int)) (and (exists ((|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_#t~ret324#1_123| Int)) (= (mod |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_#t~ret324#1_123| 256) 0)) (= |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~head_reaches_tail~0#1_96| 0) (= |__VERIFIER_assert_#in~cond| 0))) (exists ((|v_#memory_$Pointer$.base_118| (Array Int (Array Int Int)))) (and (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_118| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_149| (store (store (store (store (select |v_#memory_$Pointer$.base_118| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_149|) 8 0) 16 0) 0 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_149|) 24 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_149|))) (= (select (select |v_#memory_$Pointer$.base_118| 4) 16) |#funAddr~s_can_fail_realloc_allocator.base|) (= (select (select |v_#memory_$Pointer$.base_118| 4) 8) |#funAddr~s_can_fail_free_allocator.base|) (= (select (select |v_#memory_$Pointer$.base_118| 4) 32) 0) (= |#funAddr~s_can_fail_malloc_allocator.base| (select (select |v_#memory_$Pointer$.base_118| 4) 0)) (= |#funAddr~s_can_fail_calloc_allocator.base| (select (select |v_#memory_$Pointer$.base_118| 4) 24)))) (exists ((|v_#memory_real_4| (Array Int (Array Int Real))) (|v_#memory_real_27| (Array Int (Array Int Real))) (|v_#memory_real_117| (Array Int (Array Int Real))) (|v_#memory_real_118| (Array Int (Array Int Real)))) (and (= (store |v_#memory_real_118| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_149| (store (select |v_#memory_real_118| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_149|) 0 (select (select |v_#memory_real_27| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_149|) 0))) |v_#memory_real_27|) (= (store |v_#memory_real_117| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_149| (store (select |v_#memory_real_117| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_149|) 8 (select (select |v_#memory_real_4| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_149|) 8))) |v_#memory_real_4|) (= (store |v_#memory_real_27| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_149| (store (select |v_#memory_real_27| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_149|) 24 (select (select |#memory_real| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_149|) 24))) |#memory_real|) (= |v_#memory_real_118| (store |v_#memory_real_4| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_149| (store (select |v_#memory_real_4| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_149|) 16 (select (select |v_#memory_real_118| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_149|) 16)))))) (= |v_ULTIMATE.start_aws_linked_list_rbegin_#in~list#1.base_BEFORE_CALL_37| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_60|) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_60|) 24) |v_ULTIMATE.start_aws_linked_list_rbegin_~rval~2#1.offset_BEFORE_CALL_15|) (exists ((|v_#memory_$Pointer$.offset_121| (Array Int (Array Int Int)))) (and (= |#funAddr~s_can_fail_realloc_allocator.offset| (select (select |v_#memory_$Pointer$.offset_121| 4) 16)) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_121| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_149| (store (store (store (store (select |v_#memory_$Pointer$.offset_121| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_149|) 8 0) 16 0) 0 16) 24 0))) (= (select (select |v_#memory_$Pointer$.offset_121| 4) 8) |#funAddr~s_can_fail_free_allocator.offset|) (= (select (select |v_#memory_$Pointer$.offset_121| 4) 0) |#funAddr~s_can_fail_malloc_allocator.offset|) (= (select (select |v_#memory_$Pointer$.offset_121| 4) 32) 0) (= |#funAddr~s_can_fail_calloc_allocator.offset| (select (select |v_#memory_$Pointer$.offset_121| 4) 24)))) (exists ((|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.base_66| Int) (|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_119| Int) (|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~head_reaches_tail~0#1_98| Int) (|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset_66| Int) (|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_123| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_#t~ret334#1_38| Int)) (and (= |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.base_66| |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_119|) (= |v_ULTIMATE.start_aws_linked_list_rbegin_#t~ret334#1_38| 1) (= |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~head_reaches_tail~0#1_98| 1) (= |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_123| (+ |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset_66| 16)))) (exists ((|v_#length_33| (Array Int Int))) (and (= 2 (select |v_#length_33| 1)) (= (select |v_#length_33| 2) 33) (= |#length| (store |v_#length_33| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_149| 32)) (= (select |v_#length_33| 3) 12) (= 40 (select |v_#length_33| 4)))) (= |v_ULTIMATE.start_aws_linked_list_rbegin_#in~list#1.base_BEFORE_CALL_37| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_149|) (<= (+ |#StackHeapBarrier| 1) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_149|) (exists ((|v_#memory_int_30| (Array Int (Array Int Int))) (|v_#memory_int_5| (Array Int (Array Int Int))) (|v_#memory_int_121| (Array Int (Array Int Int))) (|v_#memory_int_120| (Array Int (Array Int Int)))) (and (= |v_#memory_int_121| (store |v_#memory_int_5| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_149| (store (select |v_#memory_int_5| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_149|) 16 (select (select |v_#memory_int_121| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_149|) 16)))) (= (select (select |v_#memory_int_120| 1) 1) 0) (= |#memory_int| (store |v_#memory_int_30| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_149| (store (select |v_#memory_int_30| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_149|) 24 (select (select |#memory_int| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_149|) 24)))) (= |v_#memory_int_30| (store |v_#memory_int_121| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_149| (store (select |v_#memory_int_121| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_149|) 0 (select (select |v_#memory_int_30| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_149|) 0)))) (= (store |v_#memory_int_120| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_149| (store (select |v_#memory_int_120| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_149|) 8 (select (select |v_#memory_int_5| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_149|) 8))) |v_#memory_int_5|) (= (select (select |v_#memory_int_120| 1) 0) 48))) (exists ((|v_#valid_39| (Array Int Int))) (and (= (select |v_#valid_39| 0) 0) (= (select |v_#valid_39| 2) 1) (= (select |v_#valid_39| 4) 1) (= (select |v_#valid_39| 3) 1) (= (select |v_#valid_39| 1) 1) (= (store |v_#valid_39| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_149| 1) |#valid|) (= (select |v_#valid_39| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_149|) 0)))))))' at error location [2023-12-02 13:15:46,110 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 13:15:46,110 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 13:15:46,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 24, 21] total 56 [2023-12-02 13:15:46,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77268880] [2023-12-02 13:15:46,110 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 13:15:46,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2023-12-02 13:15:46,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:15:46,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2023-12-02 13:15:46,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=436, Invalid=6038, Unknown=10, NotChecked=158, Total=6642 [2023-12-02 13:15:46,113 INFO L87 Difference]: Start difference. First operand 180 states and 232 transitions. Second operand has 56 states, 45 states have (on average 2.3555555555555556) internal successors, (106), 46 states have internal predecessors, (106), 19 states have call successors, (30), 3 states have call predecessors, (30), 15 states have return successors, (29), 19 states have call predecessors, (29), 18 states have call successors, (29) [2023-12-02 13:16:09,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:16:09,983 INFO L93 Difference]: Finished difference Result 427 states and 599 transitions. [2023-12-02 13:16:09,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2023-12-02 13:16:09,984 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 45 states have (on average 2.3555555555555556) internal successors, (106), 46 states have internal predecessors, (106), 19 states have call successors, (30), 3 states have call predecessors, (30), 15 states have return successors, (29), 19 states have call predecessors, (29), 18 states have call successors, (29) Word has length 67 [2023-12-02 13:16:09,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:16:09,988 INFO L225 Difference]: With dead ends: 427 [2023-12-02 13:16:09,988 INFO L226 Difference]: Without dead ends: 317 [2023-12-02 13:16:09,996 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 146 SyntacticMatches, 9 SemanticMatches, 131 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 5630 ImplicationChecksByTransitivity, 77.2s TimeCoverageRelationStatistics Valid=1499, Invalid=15787, Unknown=10, NotChecked=260, Total=17556 [2023-12-02 13:16:09,997 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 657 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 1845 mSolverCounterSat, 300 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 676 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 2393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 300 IncrementalHoareTripleChecker+Valid, 1845 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 248 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2023-12-02 13:16:09,997 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [676 Valid, 530 Invalid, 2393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [300 Valid, 1845 Invalid, 0 Unknown, 248 Unchecked, 7.2s Time] [2023-12-02 13:16:09,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2023-12-02 13:16:10,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 176. [2023-12-02 13:16:10,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 114 states have (on average 1.1403508771929824) internal successors, (130), 120 states have internal predecessors, (130), 42 states have call successors, (42), 15 states have call predecessors, (42), 19 states have return successors, (55), 40 states have call predecessors, (55), 40 states have call successors, (55) [2023-12-02 13:16:10,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 227 transitions. [2023-12-02 13:16:10,099 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 227 transitions. Word has length 67 [2023-12-02 13:16:10,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:16:10,100 INFO L495 AbstractCegarLoop]: Abstraction has 176 states and 227 transitions. [2023-12-02 13:16:10,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 45 states have (on average 2.3555555555555556) internal successors, (106), 46 states have internal predecessors, (106), 19 states have call successors, (30), 3 states have call predecessors, (30), 15 states have return successors, (29), 19 states have call predecessors, (29), 18 states have call successors, (29) [2023-12-02 13:16:10,100 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 227 transitions. [2023-12-02 13:16:10,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-12-02 13:16:10,101 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:16:10,101 INFO L195 NwaCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-12-02 13:16:10,108 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7e573dc-ea7c-487b-91f3-c5b08a46fc9a/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-12-02 13:16:10,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7e573dc-ea7c-487b-91f3-c5b08a46fc9a/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:16:10,302 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 13:16:10,302 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:16:10,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1351466418, now seen corresponding path program 1 times [2023-12-02 13:16:10,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:16:10,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696180421] [2023-12-02 13:16:10,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:16:10,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:16:10,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:16:10,698 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2023-12-02 13:16:10,699 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:16:10,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696180421] [2023-12-02 13:16:10,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696180421] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:16:10,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:16:10,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-02 13:16:10,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066114906] [2023-12-02 13:16:10,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:16:10,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-02 13:16:10,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:16:10,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-02 13:16:10,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-12-02 13:16:10,701 INFO L87 Difference]: Start difference. First operand 176 states and 227 transitions. Second operand has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 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) [2023-12-02 13:16:11,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:16:11,219 INFO L93 Difference]: Finished difference Result 192 states and 245 transitions. [2023-12-02 13:16:11,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-02 13:16:11,220 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 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 70 [2023-12-02 13:16:11,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:16:11,221 INFO L225 Difference]: With dead ends: 192 [2023-12-02 13:16:11,221 INFO L226 Difference]: Without dead ends: 190 [2023-12-02 13:16:11,222 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2023-12-02 13:16:11,222 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 8 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-02 13:16:11,223 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 277 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-02 13:16:11,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2023-12-02 13:16:11,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 187. [2023-12-02 13:16:11,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 120 states have (on average 1.1333333333333333) internal successors, (136), 126 states have internal predecessors, (136), 45 states have call successors, (45), 17 states have call predecessors, (45), 21 states have return successors, (58), 43 states have call predecessors, (58), 43 states have call successors, (58) [2023-12-02 13:16:11,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 239 transitions. [2023-12-02 13:16:11,313 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 239 transitions. Word has length 70 [2023-12-02 13:16:11,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:16:11,314 INFO L495 AbstractCegarLoop]: Abstraction has 187 states and 239 transitions. [2023-12-02 13:16:11,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 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) [2023-12-02 13:16:11,314 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 239 transitions. [2023-12-02 13:16:11,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2023-12-02 13:16:11,316 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:16:11,316 INFO L195 NwaCegarLoop]: trace histogram [6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2023-12-02 13:16:11,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-02 13:16:11,316 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 13:16:11,316 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:16:11,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1072059407, now seen corresponding path program 2 times [2023-12-02 13:16:11,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:16:11,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449918280] [2023-12-02 13:16:11,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:16:11,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:16:11,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:16:13,452 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 17 proven. 38 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-12-02 13:16:13,452 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:16:13,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449918280] [2023-12-02 13:16:13,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449918280] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:16:13,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [282869930] [2023-12-02 13:16:13,453 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 13:16:13,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:16:13,453 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7e573dc-ea7c-487b-91f3-c5b08a46fc9a/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:16:13,454 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7e573dc-ea7c-487b-91f3-c5b08a46fc9a/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:16:13,455 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7e573dc-ea7c-487b-91f3-c5b08a46fc9a/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-12-02 13:16:13,706 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-12-02 13:16:13,706 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 13:16:13,709 INFO L262 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 71 conjunts are in the unsatisfiable core [2023-12-02 13:16:13,712 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:16:30,659 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 57 proven. 15 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-02 13:16:30,659 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:16:32,687 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 13:16:32,687 INFO L378 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 26 treesize of output 29 [2023-12-02 13:16:32,727 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 13:16:32,727 INFO L378 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 24 treesize of output 27 [2023-12-02 13:16:32,985 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 35 proven. 21 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2023-12-02 13:16:32,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [282869930] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 13:16:32,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [996071201] [2023-12-02 13:16:32,988 INFO L159 IcfgInterpreter]: Started Sifa with 35 locations of interest [2023-12-02 13:16:32,988 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 13:16:32,988 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 13:16:32,989 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 13:16:32,989 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 13:16:36,121 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 285 for LOIs [2023-12-02 13:16:36,688 INFO L197 IcfgInterpreter]: Interpreting procedure aws_linked_list_is_valid with input of size 17 for LOIs [2023-12-02 13:16:37,050 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 12 for LOIs [2023-12-02 13:16:37,054 INFO L197 IcfgInterpreter]: Interpreting procedure nondet_uint64_t with input of size 95 for LOIs [2023-12-02 13:16:37,068 INFO L197 IcfgInterpreter]: Interpreting procedure aws_linked_list_node_next_is_valid with input of size 25 for LOIs [2023-12-02 13:16:37,102 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 13:17:24,255 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '9690#(and (<= 1 |#StackHeapBarrier|) (= |~#s_can_fail_allocator_static~0.base| 4) (= |~#s_can_fail_allocator_static~0.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (= ~tl_last_error~0 0) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_#in~list#1.base_BEFORE_CALL_47| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_~rval~2#1.base_BEFORE_CALL_19| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_171| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_~rval~2#1.offset_BEFORE_CALL_19| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_75| Int)) (or (and (<= (+ |#StackHeapBarrier| 1) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_171|) (exists ((|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~head_reaches_tail~0#1_126| Int)) (and (= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_#t~ret324#1_161| Int)) (= (mod |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_#t~ret324#1_161| 256) 0)) (= |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~head_reaches_tail~0#1_126| 0))) (exists ((|v_#memory_$Pointer$.offset_127| (Array Int (Array Int Int)))) (and (= |#funAddr~s_can_fail_calloc_allocator.offset| (select (select |v_#memory_$Pointer$.offset_127| 4) 24)) (= (select (select |v_#memory_$Pointer$.offset_127| 4) 8) |#funAddr~s_can_fail_free_allocator.offset|) (= (select (select |v_#memory_$Pointer$.offset_127| 4) 32) 0) (= |#funAddr~s_can_fail_realloc_allocator.offset| (select (select |v_#memory_$Pointer$.offset_127| 4) 16)) (= (select (select |v_#memory_$Pointer$.offset_127| 4) 0) |#funAddr~s_can_fail_malloc_allocator.offset|) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_127| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_171| (store (store (store (store (select |v_#memory_$Pointer$.offset_127| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_171|) 8 0) 16 0) 0 16) 24 0))))) (exists ((|v_#valid_40| (Array Int Int))) (and (= (select |v_#valid_40| 3) 1) (= (select |v_#valid_40| 4) 1) (= (select |v_#valid_40| 1) 1) (= (select |v_#valid_40| 2) 1) (= (store |v_#valid_40| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_171| 1) |#valid|) (= (select |v_#valid_40| 0) 0) (= (select |v_#valid_40| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_171|) 0))) (exists ((|v_#memory_$Pointer$.base_124| (Array Int (Array Int Int)))) (and (= |#funAddr~s_can_fail_malloc_allocator.base| (select (select |v_#memory_$Pointer$.base_124| 4) 0)) (= (select (select |v_#memory_$Pointer$.base_124| 4) 32) 0) (= (store |v_#memory_$Pointer$.base_124| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_171| (store (store (store (store (select |v_#memory_$Pointer$.base_124| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_171|) 8 0) 16 0) 0 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_171|) 24 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_171|)) |#memory_$Pointer$.base|) (= |#funAddr~s_can_fail_realloc_allocator.base| (select (select |v_#memory_$Pointer$.base_124| 4) 16)) (= (select (select |v_#memory_$Pointer$.base_124| 4) 24) |#funAddr~s_can_fail_calloc_allocator.base|) (= (select (select |v_#memory_$Pointer$.base_124| 4) 8) |#funAddr~s_can_fail_free_allocator.base|))) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~length~1#1_26| Int)) (<= (mod |v_ULTIMATE.start_ensure_linked_list_is_allocated_~length~1#1_26| 18446744073709551616) 0)) (= |v_ULTIMATE.start_aws_linked_list_rbegin_#in~list#1.base_BEFORE_CALL_47| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_75|) (exists ((|v_#length_34| (Array Int Int))) (and (= (select |v_#length_34| 2) 33) (= |#length| (store |v_#length_34| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_171| 32)) (= (select |v_#length_34| 3) 12) (= 40 (select |v_#length_34| 4)) (= 2 (select |v_#length_34| 1)))) (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_75|) 24) |v_ULTIMATE.start_aws_linked_list_rbegin_~rval~2#1.base_BEFORE_CALL_19|) (= |v_ULTIMATE.start_aws_linked_list_rbegin_#in~list#1.base_BEFORE_CALL_47| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_171|) (exists ((|v_#memory_int_129| (Array Int (Array Int Int))) (|v_#memory_int_30| (Array Int (Array Int Int))) (|v_#memory_int_5| (Array Int (Array Int Int))) (|v_#memory_int_128| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_30| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_171| (store (select |v_#memory_int_30| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_171|) 24 (select (select |#memory_int| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_171|) 24))) |#memory_int|) (= (select (select |v_#memory_int_128| 1) 0) 48) (= (store |v_#memory_int_128| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_171| (store (select |v_#memory_int_128| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_171|) 8 (select (select |v_#memory_int_5| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_171|) 8))) |v_#memory_int_5|) (= (store |v_#memory_int_5| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_171| (store (select |v_#memory_int_5| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_171|) 16 (select (select |v_#memory_int_129| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_171|) 16))) |v_#memory_int_129|) (= (select (select |v_#memory_int_128| 1) 1) 0) (= (store |v_#memory_int_129| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_171| (store (select |v_#memory_int_129| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_171|) 0 (select (select |v_#memory_int_30| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_171|) 0))) |v_#memory_int_30|))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_#t~ret334#1_42| Int) (|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~head_reaches_tail~0#1_127| Int) (|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.base_85| Int) (|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_159| Int) (|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_163| Int) (|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset_85| Int)) (and (= |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~head_reaches_tail~0#1_127| 1) (= |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_163| (+ |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset_85| 16)) (= |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.base_85| |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_159|) (= |v_ULTIMATE.start_aws_linked_list_rbegin_#t~ret334#1_42| 1))) (exists ((|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_162| Int) (|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~head_reaches_tail~0#1_126| Int) (|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.base_84| Int) (|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_158| Int) (|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset_84| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_#t~ret683#1_41| Int)) (and (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_#t~ret683#1_41| 1) (= |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.base_84| |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_158|) (= |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~head_reaches_tail~0#1_126| 1) (= |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_162| (+ |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset_84| 16)))) (= |v_ULTIMATE.start_aws_linked_list_rbegin_~rval~2#1.offset_BEFORE_CALL_19| (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_75|) 24)) (exists ((|v_#memory_real_4| (Array Int (Array Int Real))) (|v_#memory_real_126| (Array Int (Array Int Real))) (|v_#memory_real_27| (Array Int (Array Int Real))) (|v_#memory_real_125| (Array Int (Array Int Real)))) (and (= |v_#memory_real_126| (store |v_#memory_real_4| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_171| (store (select |v_#memory_real_4| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_171|) 16 (select (select |v_#memory_real_126| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_171|) 16)))) (= |v_#memory_real_27| (store |v_#memory_real_126| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_171| (store (select |v_#memory_real_126| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_171|) 0 (select (select |v_#memory_real_27| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_171|) 0)))) (= (store |v_#memory_real_125| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_171| (store (select |v_#memory_real_125| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_171|) 8 (select (select |v_#memory_real_4| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_171|) 8))) |v_#memory_real_4|) (= |#memory_real| (store |v_#memory_real_27| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_171| (store (select |v_#memory_real_27| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_171|) 24 (select (select |#memory_real| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_171|) 24))))))) (and (exists ((|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_162| Int) (|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~head_reaches_tail~0#1_126| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_#t~ret334#1_42| Int) (|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.base_84| Int) (|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_158| Int) (|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset_84| Int)) (and (= |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.base_84| |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_158|) (= |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~head_reaches_tail~0#1_126| 1) (= |v_ULTIMATE.start_aws_linked_list_rbegin_#t~ret334#1_42| 1) (= |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_162| (+ |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset_84| 16)))) (<= (+ |#StackHeapBarrier| 1) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_171|) (exists ((|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~head_reaches_tail~0#1_126| Int)) (and (= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_#t~ret324#1_161| Int)) (= (mod |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_#t~ret324#1_161| 256) 0)) (= |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~head_reaches_tail~0#1_126| 0))) (exists ((|v_#memory_$Pointer$.offset_127| (Array Int (Array Int Int)))) (and (= |#funAddr~s_can_fail_calloc_allocator.offset| (select (select |v_#memory_$Pointer$.offset_127| 4) 24)) (= (select (select |v_#memory_$Pointer$.offset_127| 4) 8) |#funAddr~s_can_fail_free_allocator.offset|) (= (select (select |v_#memory_$Pointer$.offset_127| 4) 32) 0) (= |#funAddr~s_can_fail_realloc_allocator.offset| (select (select |v_#memory_$Pointer$.offset_127| 4) 16)) (= (select (select |v_#memory_$Pointer$.offset_127| 4) 0) |#funAddr~s_can_fail_malloc_allocator.offset|) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_127| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_171| (store (store (store (store (select |v_#memory_$Pointer$.offset_127| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_171|) 8 0) 16 0) 0 16) 24 0))))) (exists ((|v_#valid_40| (Array Int Int))) (and (= (select |v_#valid_40| 3) 1) (= (select |v_#valid_40| 4) 1) (= (select |v_#valid_40| 1) 1) (= (select |v_#valid_40| 2) 1) (= (store |v_#valid_40| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_171| 1) |#valid|) (= (select |v_#valid_40| 0) 0) (= (select |v_#valid_40| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_171|) 0))) (exists ((|v_#memory_$Pointer$.base_124| (Array Int (Array Int Int)))) (and (= |#funAddr~s_can_fail_malloc_allocator.base| (select (select |v_#memory_$Pointer$.base_124| 4) 0)) (= (select (select |v_#memory_$Pointer$.base_124| 4) 32) 0) (= (store |v_#memory_$Pointer$.base_124| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_171| (store (store (store (store (select |v_#memory_$Pointer$.base_124| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_171|) 8 0) 16 0) 0 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_171|) 24 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_171|)) |#memory_$Pointer$.base|) (= |#funAddr~s_can_fail_realloc_allocator.base| (select (select |v_#memory_$Pointer$.base_124| 4) 16)) (= (select (select |v_#memory_$Pointer$.base_124| 4) 24) |#funAddr~s_can_fail_calloc_allocator.base|) (= (select (select |v_#memory_$Pointer$.base_124| 4) 8) |#funAddr~s_can_fail_free_allocator.base|))) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~length~1#1_26| Int)) (<= (mod |v_ULTIMATE.start_ensure_linked_list_is_allocated_~length~1#1_26| 18446744073709551616) 0)) (= |v_ULTIMATE.start_aws_linked_list_rbegin_#in~list#1.base_BEFORE_CALL_47| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_75|) (exists ((|v_#length_34| (Array Int Int))) (and (= (select |v_#length_34| 2) 33) (= |#length| (store |v_#length_34| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_171| 32)) (= (select |v_#length_34| 3) 12) (= 40 (select |v_#length_34| 4)) (= 2 (select |v_#length_34| 1)))) (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_75|) 24) |v_ULTIMATE.start_aws_linked_list_rbegin_~rval~2#1.base_BEFORE_CALL_19|) (= |v_ULTIMATE.start_aws_linked_list_rbegin_#in~list#1.base_BEFORE_CALL_47| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_171|) (exists ((|v_#memory_int_129| (Array Int (Array Int Int))) (|v_#memory_int_30| (Array Int (Array Int Int))) (|v_#memory_int_5| (Array Int (Array Int Int))) (|v_#memory_int_128| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_30| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_171| (store (select |v_#memory_int_30| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_171|) 24 (select (select |#memory_int| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_171|) 24))) |#memory_int|) (= (select (select |v_#memory_int_128| 1) 0) 48) (= (store |v_#memory_int_128| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_171| (store (select |v_#memory_int_128| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_171|) 8 (select (select |v_#memory_int_5| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_171|) 8))) |v_#memory_int_5|) (= (store |v_#memory_int_5| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_171| (store (select |v_#memory_int_5| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_171|) 16 (select (select |v_#memory_int_129| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_171|) 16))) |v_#memory_int_129|) (= (select (select |v_#memory_int_128| 1) 1) 0) (= (store |v_#memory_int_129| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_171| (store (select |v_#memory_int_129| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_171|) 0 (select (select |v_#memory_int_30| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_171|) 0))) |v_#memory_int_30|))) (exists ((|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_160| Int) (|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset_86| Int) (|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~head_reaches_tail~0#1_128| Int) (|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_164| Int) (|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.base_86| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_#t~ret683#1_41| Int)) (and (= |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_164| (+ |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset_86| 16)) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_#t~ret683#1_41| 1) (= |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~head_reaches_tail~0#1_128| 1) (= |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.base_86| |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_160|))) (= |v_ULTIMATE.start_aws_linked_list_rbegin_~rval~2#1.offset_BEFORE_CALL_19| (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_75|) 24)) (exists ((|v_#memory_real_4| (Array Int (Array Int Real))) (|v_#memory_real_126| (Array Int (Array Int Real))) (|v_#memory_real_27| (Array Int (Array Int Real))) (|v_#memory_real_125| (Array Int (Array Int Real)))) (and (= |v_#memory_real_126| (store |v_#memory_real_4| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_171| (store (select |v_#memory_real_4| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_171|) 16 (select (select |v_#memory_real_126| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_171|) 16)))) (= |v_#memory_real_27| (store |v_#memory_real_126| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_171| (store (select |v_#memory_real_126| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_171|) 0 (select (select |v_#memory_real_27| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_171|) 0)))) (= (store |v_#memory_real_125| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_171| (store (select |v_#memory_real_125| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_171|) 8 (select (select |v_#memory_real_4| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_171|) 8))) |v_#memory_real_4|) (= |#memory_real| (store |v_#memory_real_27| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_171| (store (select |v_#memory_real_27| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_171|) 24 (select (select |#memory_real| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_171|) 24))))))))))' at error location [2023-12-02 13:17:24,255 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 13:17:24,255 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 13:17:24,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18, 13] total 36 [2023-12-02 13:17:24,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560860312] [2023-12-02 13:17:24,256 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 13:17:24,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-12-02 13:17:24,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:17:24,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-12-02 13:17:24,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=339, Invalid=3429, Unknown=14, NotChecked=0, Total=3782 [2023-12-02 13:17:24,259 INFO L87 Difference]: Start difference. First operand 187 states and 239 transitions. Second operand has 36 states, 33 states have (on average 2.757575757575758) internal successors, (91), 35 states have internal predecessors, (91), 17 states have call successors, (31), 4 states have call predecessors, (31), 8 states have return successors, (30), 15 states have call predecessors, (30), 16 states have call successors, (30) [2023-12-02 13:17:30,188 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 13:17:34,290 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 13:17:36,297 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 13:17:38,320 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 13:17:40,370 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 13:17:42,415 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 13:17:48,550 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 13:17:56,668 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 13:18:06,794 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 13:18:18,935 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 13:18:20,941 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 13:18:22,947 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 13:18:24,952 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 13:18:26,957 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 13:18:28,963 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 13:18:41,108 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 13:18:43,112 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 13:18:45,118 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 13:18:47,122 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 13:18:49,126 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 13:18:51,151 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 13:18:53,199 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 13:18:55,225 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 13:18:57,229 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 13:18:59,232 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 13:19:01,252 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 13:19:03,301 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 13:19:05,347 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 13:19:07,371 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 13:19:09,376 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 13:19:11,397 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 13:19:13,447 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 13:19:17,585 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 13:19:19,966 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 13:19:22,012 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 13:19:24,031 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 13:19:26,071 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 13:19:28,081 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 13:19:32,189 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 13:19:36,302 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 13:19:38,310 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 13:19:40,322 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 13:19:42,332 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 13:19:44,341 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 13:19:48,462 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 13:19:50,471 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 13:19:58,054 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 13:20:00,405 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 13:20:02,424 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 13:20:04,449 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 13:20:06,456 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 13:20:08,465 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 13:20:08,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:20:08,467 INFO L93 Difference]: Finished difference Result 393 states and 490 transitions. [2023-12-02 13:20:08,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2023-12-02 13:20:08,468 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 33 states have (on average 2.757575757575758) internal successors, (91), 35 states have internal predecessors, (91), 17 states have call successors, (31), 4 states have call predecessors, (31), 8 states have return successors, (30), 15 states have call predecessors, (30), 16 states have call successors, (30) Word has length 73 [2023-12-02 13:20:08,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:20:08,469 INFO L225 Difference]: With dead ends: 393 [2023-12-02 13:20:08,469 INFO L226 Difference]: Without dead ends: 270 [2023-12-02 13:20:08,472 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 179 SyntacticMatches, 9 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3061 ImplicationChecksByTransitivity, 120.8s TimeCoverageRelationStatistics Valid=878, Invalid=7824, Unknown=40, NotChecked=0, Total=8742 [2023-12-02 13:20:08,472 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 291 mSDsluCounter, 601 mSDsCounter, 0 mSdLazyCounter, 1221 mSolverCounterSat, 111 mSolverCounterUnsat, 52 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 108.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 656 SdHoareTripleChecker+Invalid, 1384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 1221 IncrementalHoareTripleChecker+Invalid, 52 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 108.2s IncrementalHoareTripleChecker+Time [2023-12-02 13:20:08,472 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 656 Invalid, 1384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 1221 Invalid, 52 Unknown, 0 Unchecked, 108.2s Time] [2023-12-02 13:20:08,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2023-12-02 13:20:08,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 254. [2023-12-02 13:20:08,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 166 states have (on average 1.108433734939759) internal successors, (184), 170 states have internal predecessors, (184), 59 states have call successors, (59), 26 states have call predecessors, (59), 28 states have return successors, (67), 57 states have call predecessors, (67), 55 states have call successors, (67) [2023-12-02 13:20:08,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 310 transitions. [2023-12-02 13:20:08,582 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 310 transitions. Word has length 73 [2023-12-02 13:20:08,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:20:08,582 INFO L495 AbstractCegarLoop]: Abstraction has 254 states and 310 transitions. [2023-12-02 13:20:08,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 33 states have (on average 2.757575757575758) internal successors, (91), 35 states have internal predecessors, (91), 17 states have call successors, (31), 4 states have call predecessors, (31), 8 states have return successors, (30), 15 states have call predecessors, (30), 16 states have call successors, (30) [2023-12-02 13:20:08,582 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 310 transitions. [2023-12-02 13:20:08,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2023-12-02 13:20:08,583 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:20:08,583 INFO L195 NwaCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-12-02 13:20:08,589 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7e573dc-ea7c-487b-91f3-c5b08a46fc9a/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2023-12-02 13:20:08,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7e573dc-ea7c-487b-91f3-c5b08a46fc9a/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:20:08,784 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 13:20:08,784 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:20:08,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1926184818, now seen corresponding path program 1 times [2023-12-02 13:20:08,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:20:08,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938399814] [2023-12-02 13:20:08,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:20:08,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:20:08,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:20:09,245 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2023-12-02 13:20:09,245 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:20:09,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938399814] [2023-12-02 13:20:09,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938399814] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:20:09,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:20:09,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-02 13:20:09,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839398490] [2023-12-02 13:20:09,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:20:09,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 13:20:09,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:20:09,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 13:20:09,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-02 13:20:09,247 INFO L87 Difference]: Start difference. First operand 254 states and 310 transitions. Second operand has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2023-12-02 13:20:09,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:20:09,693 INFO L93 Difference]: Finished difference Result 268 states and 323 transitions. [2023-12-02 13:20:09,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 13:20:09,694 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 76 [2023-12-02 13:20:09,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:20:09,696 INFO L225 Difference]: With dead ends: 268 [2023-12-02 13:20:09,696 INFO L226 Difference]: Without dead ends: 266 [2023-12-02 13:20:09,697 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-02 13:20:09,697 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 6 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-02 13:20:09,698 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 202 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-02 13:20:09,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2023-12-02 13:20:09,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2023-12-02 13:20:09,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 175 states have (on average 1.1028571428571428) internal successors, (193), 179 states have internal predecessors, (193), 59 states have call successors, (59), 29 states have call predecessors, (59), 31 states have return successors, (67), 57 states have call predecessors, (67), 55 states have call successors, (67) [2023-12-02 13:20:09,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 319 transitions. [2023-12-02 13:20:09,832 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 319 transitions. Word has length 76 [2023-12-02 13:20:09,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:20:09,832 INFO L495 AbstractCegarLoop]: Abstraction has 266 states and 319 transitions. [2023-12-02 13:20:09,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2023-12-02 13:20:09,833 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 319 transitions. [2023-12-02 13:20:09,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2023-12-02 13:20:09,834 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:20:09,834 INFO L195 NwaCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-12-02 13:20:09,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-02 13:20:09,835 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 13:20:09,835 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:20:09,835 INFO L85 PathProgramCache]: Analyzing trace with hash -625751773, now seen corresponding path program 1 times [2023-12-02 13:20:09,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:20:09,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456025682] [2023-12-02 13:20:09,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:20:09,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:20:09,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:20:10,937 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2023-12-02 13:20:10,937 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:20:10,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456025682] [2023-12-02 13:20:10,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456025682] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:20:10,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:20:10,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-02 13:20:10,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37296741] [2023-12-02 13:20:10,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:20:10,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-02 13:20:10,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:20:10,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-02 13:20:10,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-12-02 13:20:10,939 INFO L87 Difference]: Start difference. First operand 266 states and 319 transitions. Second operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 6 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2023-12-02 13:20:11,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:20:11,480 INFO L93 Difference]: Finished difference Result 280 states and 332 transitions. [2023-12-02 13:20:11,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-02 13:20:11,481 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 6 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 82 [2023-12-02 13:20:11,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:20:11,483 INFO L225 Difference]: With dead ends: 280 [2023-12-02 13:20:11,483 INFO L226 Difference]: Without dead ends: 274 [2023-12-02 13:20:11,483 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-12-02 13:20:11,484 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 10 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-02 13:20:11,484 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 252 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-02 13:20:11,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2023-12-02 13:20:11,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 268. [2023-12-02 13:20:11,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 178 states have (on average 1.0898876404494382) internal successors, (194), 182 states have internal predecessors, (194), 57 states have call successors, (57), 30 states have call predecessors, (57), 32 states have return successors, (67), 55 states have call predecessors, (67), 55 states have call successors, (67) [2023-12-02 13:20:11,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 318 transitions. [2023-12-02 13:20:11,617 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 318 transitions. Word has length 82 [2023-12-02 13:20:11,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:20:11,617 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 318 transitions. [2023-12-02 13:20:11,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 6 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2023-12-02 13:20:11,617 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 318 transitions. [2023-12-02 13:20:11,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-12-02 13:20:11,619 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:20:11,619 INFO L195 NwaCegarLoop]: trace histogram [8, 6, 6, 6, 6, 5, 3, 3, 3, 3, 3, 3, 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] [2023-12-02 13:20:11,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-02 13:20:11,619 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 13:20:11,619 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:20:11,619 INFO L85 PathProgramCache]: Analyzing trace with hash 600944425, now seen corresponding path program 1 times [2023-12-02 13:20:11,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:20:11,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183610866] [2023-12-02 13:20:11,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:20:11,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:20:11,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:20:19,660 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 11 proven. 100 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2023-12-02 13:20:19,660 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:20:19,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183610866] [2023-12-02 13:20:19,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183610866] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:20:19,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [878524998] [2023-12-02 13:20:19,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:20:19,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:20:19,660 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7e573dc-ea7c-487b-91f3-c5b08a46fc9a/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:20:19,661 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7e573dc-ea7c-487b-91f3-c5b08a46fc9a/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:20:19,662 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7e573dc-ea7c-487b-91f3-c5b08a46fc9a/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-12-02 13:20:19,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:20:19,915 INFO L262 TraceCheckSpWp]: Trace formula consists of 526 conjuncts, 127 conjunts are in the unsatisfiable core [2023-12-02 13:20:19,920 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:20:20,456 INFO L378 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2023-12-02 13:20:20,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:20:20,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 13:20:20,495 INFO L378 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2023-12-02 13:20:20,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:20:20,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 13:20:20,780 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-12-02 13:20:20,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 116 treesize of output 65 [2023-12-02 13:20:20,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:20:20,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 18 [2023-12-02 13:20:36,364 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 52 proven. 69 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-12-02 13:20:36,364 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:20:55,037 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 13:20:55,037 INFO L378 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 2613 treesize of output 2190 [2023-12-02 13:20:55,101 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 13:20:55,102 INFO L378 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 2769 treesize of output 2250 [2023-12-02 13:21:25,133 WARN L293 SmtUtils]: Spent 29.86s on a formula simplification. DAG size of input: 1256 DAG size of output: 664 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-12-02 13:21:25,134 INFO L349 Elim1Store]: treesize reduction 1255, result has 51.1 percent of original size [2023-12-02 13:21:25,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 25 select indices, 25 select index equivalence classes, 0 disjoint index pairs (out of 300 index pairs), introduced 45 new quantified variables, introduced 300 case distinctions, treesize of input 277205 treesize of output 221934 [2023-12-02 13:21:39,688 INFO L224 Elim1Store]: Index analysis took 331 ms