./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/aws-c-common/aws_linked_list_prev_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b5237d83 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_ad16af83-4651-44ec-9153-bdb42fc5a11a/bin/utaipan-g80aRyZoba/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad16af83-4651-44ec-9153-bdb42fc5a11a/bin/utaipan-g80aRyZoba/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad16af83-4651-44ec-9153-bdb42fc5a11a/bin/utaipan-g80aRyZoba/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad16af83-4651-44ec-9153-bdb42fc5a11a/bin/utaipan-g80aRyZoba/config/TaipanReach.xml -i ../../sv-benchmarks/c/aws-c-common/aws_linked_list_prev_harness.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad16af83-4651-44ec-9153-bdb42fc5a11a/bin/utaipan-g80aRyZoba/config/svcomp-Reach-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad16af83-4651-44ec-9153-bdb42fc5a11a/bin/utaipan-g80aRyZoba --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 0aec0bb8b8715e014581c4eef5e1e25c7e0452a528f8abdf2f2a721d17b0fa7f --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-b5237d8 [2022-11-22 01:58:52,736 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-22 01:58:52,738 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-22 01:58:52,774 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-22 01:58:52,774 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-22 01:58:52,775 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-22 01:58:52,777 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-22 01:58:52,782 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-22 01:58:52,786 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-22 01:58:52,792 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-22 01:58:52,794 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-22 01:58:52,797 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-22 01:58:52,798 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-22 01:58:52,802 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-22 01:58:52,805 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-22 01:58:52,807 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-22 01:58:52,809 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-22 01:58:52,810 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-22 01:58:52,811 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-22 01:58:52,818 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-22 01:58:52,819 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-22 01:58:52,822 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-22 01:58:52,824 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-22 01:58:52,824 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-22 01:58:52,834 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-22 01:58:52,835 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-22 01:58:52,835 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-22 01:58:52,837 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-22 01:58:52,837 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-22 01:58:52,838 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-22 01:58:52,838 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-22 01:58:52,839 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-22 01:58:52,841 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-22 01:58:52,841 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-22 01:58:52,842 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-22 01:58:52,843 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-22 01:58:52,843 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-22 01:58:52,843 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-22 01:58:52,844 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-22 01:58:52,845 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-22 01:58:52,846 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-22 01:58:52,847 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad16af83-4651-44ec-9153-bdb42fc5a11a/bin/utaipan-g80aRyZoba/config/svcomp-Reach-64bit-Taipan_Default.epf [2022-11-22 01:58:52,892 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-22 01:58:52,892 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-22 01:58:52,893 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-22 01:58:52,893 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-22 01:58:52,894 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-22 01:58:52,894 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-22 01:58:52,894 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-22 01:58:52,894 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-22 01:58:52,895 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-22 01:58:52,895 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-22 01:58:52,896 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-22 01:58:52,896 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-22 01:58:52,896 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-22 01:58:52,896 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-22 01:58:52,897 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-22 01:58:52,897 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-22 01:58:52,897 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-22 01:58:52,897 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-22 01:58:52,898 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-22 01:58:52,899 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-22 01:58:52,899 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-22 01:58:52,899 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-22 01:58:52,899 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-22 01:58:52,899 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-22 01:58:52,899 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-22 01:58:52,900 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-22 01:58:52,900 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-22 01:58:52,901 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-22 01:58:52,901 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-22 01:58:52,901 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 01:58:52,901 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-22 01:58:52,902 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-22 01:58:52,902 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-22 01:58:52,902 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-22 01:58:52,902 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-22 01:58:52,902 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-22 01:58:52,902 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-22 01:58:52,903 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-22 01:58:52,903 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad16af83-4651-44ec-9153-bdb42fc5a11a/bin/utaipan-g80aRyZoba/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_ad16af83-4651-44ec-9153-bdb42fc5a11a/bin/utaipan-g80aRyZoba Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> 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 -> 0aec0bb8b8715e014581c4eef5e1e25c7e0452a528f8abdf2f2a721d17b0fa7f [2022-11-22 01:58:53,201 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-22 01:58:53,233 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-22 01:58:53,236 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-22 01:58:53,237 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-22 01:58:53,238 INFO L275 PluginConnector]: CDTParser initialized [2022-11-22 01:58:53,239 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad16af83-4651-44ec-9153-bdb42fc5a11a/bin/utaipan-g80aRyZoba/../../sv-benchmarks/c/aws-c-common/aws_linked_list_prev_harness.i [2022-11-22 01:58:56,271 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-22 01:58:56,768 INFO L351 CDTParser]: Found 1 translation units. [2022-11-22 01:58:56,769 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad16af83-4651-44ec-9153-bdb42fc5a11a/sv-benchmarks/c/aws-c-common/aws_linked_list_prev_harness.i [2022-11-22 01:58:56,803 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad16af83-4651-44ec-9153-bdb42fc5a11a/bin/utaipan-g80aRyZoba/data/fbc0e5e8f/df407635edba42a39e1337817e5d452e/FLAG65191595b [2022-11-22 01:58:56,819 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad16af83-4651-44ec-9153-bdb42fc5a11a/bin/utaipan-g80aRyZoba/data/fbc0e5e8f/df407635edba42a39e1337817e5d452e [2022-11-22 01:58:56,821 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-22 01:58:56,824 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-22 01:58:56,827 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-22 01:58:56,827 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-22 01:58:56,831 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-22 01:58:56,832 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:58:56" (1/1) ... [2022-11-22 01:58:56,834 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@184b086f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:58:56, skipping insertion in model container [2022-11-22 01:58:56,834 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:58:56" (1/1) ... [2022-11-22 01:58:56,842 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-22 01:58:56,933 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-22 01:58:57,264 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad16af83-4651-44ec-9153-bdb42fc5a11a/sv-benchmarks/c/aws-c-common/aws_linked_list_prev_harness.i[4494,4507] [2022-11-22 01:58:57,275 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad16af83-4651-44ec-9153-bdb42fc5a11a/sv-benchmarks/c/aws-c-common/aws_linked_list_prev_harness.i[4554,4567] [2022-11-22 01:58:58,220 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-22 01:58:58,221 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-22 01:58:58,222 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-22 01:58:58,222 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-22 01:58:58,224 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-22 01:58:58,246 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-22 01:58:58,246 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-22 01:58:58,248 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-22 01:58:58,251 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-22 01:58:58,261 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-22 01:58:58,263 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-22 01:58:58,263 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-22 01:58:58,264 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-22 01:58:58,671 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-11-22 01:58:58,673 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-11-22 01:58:58,674 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-11-22 01:58:58,675 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-11-22 01:58:58,677 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-11-22 01:58:58,677 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-11-22 01:58:58,678 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-11-22 01:58:58,682 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-11-22 01:58:58,684 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-11-22 01:58:58,685 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-11-22 01:58:58,904 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-11-22 01:58:58,927 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 01:58:58,942 INFO L203 MainTranslator]: Completed pre-run [2022-11-22 01:58:58,956 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad16af83-4651-44ec-9153-bdb42fc5a11a/sv-benchmarks/c/aws-c-common/aws_linked_list_prev_harness.i[4494,4507] [2022-11-22 01:58:58,956 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad16af83-4651-44ec-9153-bdb42fc5a11a/sv-benchmarks/c/aws-c-common/aws_linked_list_prev_harness.i[4554,4567] [2022-11-22 01:58:58,994 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-22 01:58:58,995 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-22 01:58:58,995 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-22 01:58:58,996 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-22 01:58:58,997 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-22 01:58:59,004 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-22 01:58:59,005 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-22 01:58:59,006 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-22 01:58:59,006 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-22 01:58:59,008 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-22 01:58:59,008 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-22 01:58:59,009 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-22 01:58:59,009 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-22 01:58:59,050 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-11-22 01:58:59,052 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-11-22 01:58:59,053 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-11-22 01:58:59,054 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-11-22 01:58:59,060 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-11-22 01:58:59,061 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-11-22 01:58:59,061 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-11-22 01:58:59,062 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-11-22 01:58:59,063 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-11-22 01:58:59,063 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-11-22 01:58:59,111 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-11-22 01:58:59,137 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 01:58:59,310 INFO L208 MainTranslator]: Completed translation [2022-11-22 01:58:59,311 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:58:59 WrapperNode [2022-11-22 01:58:59,311 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-22 01:58:59,312 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-22 01:58:59,312 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-22 01:58:59,312 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-22 01:58:59,318 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:58:59" (1/1) ... [2022-11-22 01:58:59,397 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:58:59" (1/1) ... [2022-11-22 01:58:59,446 INFO L138 Inliner]: procedures = 679, calls = 1038, calls flagged for inlining = 50, calls inlined = 4, statements flattened = 57 [2022-11-22 01:58:59,446 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-22 01:58:59,447 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-22 01:58:59,448 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-22 01:58:59,448 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-22 01:58:59,458 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:58:59" (1/1) ... [2022-11-22 01:58:59,459 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:58:59" (1/1) ... [2022-11-22 01:58:59,470 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:58:59" (1/1) ... [2022-11-22 01:58:59,471 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:58:59" (1/1) ... [2022-11-22 01:58:59,487 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:58:59" (1/1) ... [2022-11-22 01:58:59,504 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:58:59" (1/1) ... [2022-11-22 01:58:59,506 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:58:59" (1/1) ... [2022-11-22 01:58:59,508 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:58:59" (1/1) ... [2022-11-22 01:58:59,512 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-22 01:58:59,527 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-22 01:58:59,527 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-22 01:58:59,527 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-22 01:58:59,528 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:58:59" (1/1) ... [2022-11-22 01:58:59,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 01:58:59,546 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad16af83-4651-44ec-9153-bdb42fc5a11a/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:58:59,563 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad16af83-4651-44ec-9153-bdb42fc5a11a/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-22 01:58:59,572 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad16af83-4651-44ec-9153-bdb42fc5a11a/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-22 01:58:59,603 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-22 01:58:59,603 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-22 01:58:59,603 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-22 01:58:59,604 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2022-11-22 01:58:59,604 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2022-11-22 01:58:59,604 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-22 01:58:59,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-22 01:58:59,605 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-22 01:58:59,605 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-22 01:58:59,605 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-22 01:58:59,605 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-22 01:58:59,606 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-22 01:58:59,606 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-22 01:58:59,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-22 01:58:59,606 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_prev_is_valid [2022-11-22 01:58:59,607 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_prev_is_valid [2022-11-22 01:58:59,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-22 01:58:59,916 INFO L235 CfgBuilder]: Building ICFG [2022-11-22 01:58:59,919 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-22 01:59:00,105 INFO L276 CfgBuilder]: Performing block encoding [2022-11-22 01:59:00,247 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-22 01:59:00,253 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-22 01:59:00,256 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:59:00 BoogieIcfgContainer [2022-11-22 01:59:00,257 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-22 01:59:00,260 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-22 01:59:00,260 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-22 01:59:00,264 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-22 01:59:00,264 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 01:58:56" (1/3) ... [2022-11-22 01:59:00,266 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ac54ade and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:59:00, skipping insertion in model container [2022-11-22 01:59:00,267 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:58:59" (2/3) ... [2022-11-22 01:59:00,270 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ac54ade and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:59:00, skipping insertion in model container [2022-11-22 01:59:00,270 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:59:00" (3/3) ... [2022-11-22 01:59:00,272 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_linked_list_prev_harness.i [2022-11-22 01:59:00,291 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-22 01:59:00,292 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-22 01:59:00,347 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-22 01:59:00,353 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=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7622f710, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-22 01:59:00,354 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-22 01:59:00,358 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-11-22 01:59:00,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-22 01:59:00,366 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:59:00,367 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:59:00,367 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 01:59:00,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:59:00,373 INFO L85 PathProgramCache]: Analyzing trace with hash 846701445, now seen corresponding path program 1 times [2022-11-22 01:59:00,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:59:00,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424099528] [2022-11-22 01:59:00,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:59:00,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:59:00,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:59:03,093 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-22 01:59:03,093 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:59:03,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424099528] [2022-11-22 01:59:03,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424099528] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:59:03,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2131628437] [2022-11-22 01:59:03,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:59:03,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:59:03,096 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad16af83-4651-44ec-9153-bdb42fc5a11a/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:59:03,099 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad16af83-4651-44ec-9153-bdb42fc5a11a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:59:03,118 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad16af83-4651-44ec-9153-bdb42fc5a11a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-22 01:59:03,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:59:03,290 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 66 conjunts are in the unsatisfiable core [2022-11-22 01:59:03,300 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:59:03,395 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-11-22 01:59:03,405 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-11-22 01:59:03,413 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-22 01:59:03,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:59:03,426 INFO L350 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 14 treesize of output 16 [2022-11-22 01:59:03,433 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-22 01:59:05,265 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:59:05,266 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 01:59:05,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2131628437] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:59:05,267 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-22 01:59:05,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [11] total 20 [2022-11-22 01:59:05,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877556316] [2022-11-22 01:59:05,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:59:05,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-22 01:59:05,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:59:05,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-22 01:59:05,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380 [2022-11-22 01:59:05,305 INFO L87 Difference]: Start difference. First operand has 33 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 13 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-22 01:59:06,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:59:06,064 INFO L93 Difference]: Finished difference Result 62 states and 81 transitions. [2022-11-22 01:59:06,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-22 01:59:06,067 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 15 [2022-11-22 01:59:06,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:59:06,074 INFO L225 Difference]: With dead ends: 62 [2022-11-22 01:59:06,074 INFO L226 Difference]: Without dead ends: 35 [2022-11-22 01:59:06,078 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=100, Invalid=500, Unknown=0, NotChecked=0, Total=600 [2022-11-22 01:59:06,081 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 24 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-22 01:59:06,082 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 81 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-22 01:59:06,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-11-22 01:59:06,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-11-22 01:59:06,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 18 states have internal predecessors, (18), 12 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-22 01:59:06,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2022-11-22 01:59:06,124 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 15 [2022-11-22 01:59:06,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:59:06,125 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2022-11-22 01:59:06,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-22 01:59:06,125 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2022-11-22 01:59:06,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-22 01:59:06,127 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:59:06,127 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:59:06,138 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad16af83-4651-44ec-9153-bdb42fc5a11a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-22 01:59:06,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad16af83-4651-44ec-9153-bdb42fc5a11a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2022-11-22 01:59:06,333 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 01:59:06,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:59:06,334 INFO L85 PathProgramCache]: Analyzing trace with hash 1013014958, now seen corresponding path program 1 times [2022-11-22 01:59:06,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:59:06,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787704821] [2022-11-22 01:59:06,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:59:06,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:59:06,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:59:08,141 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-22 01:59:08,141 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:59:08,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787704821] [2022-11-22 01:59:08,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787704821] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:59:08,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1621019610] [2022-11-22 01:59:08,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:59:08,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:59:08,142 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad16af83-4651-44ec-9153-bdb42fc5a11a/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:59:08,144 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad16af83-4651-44ec-9153-bdb42fc5a11a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:59:08,170 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad16af83-4651-44ec-9153-bdb42fc5a11a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-22 01:59:08,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:59:08,305 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 90 conjunts are in the unsatisfiable core [2022-11-22 01:59:08,313 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:59:08,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:59:08,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:59:08,341 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-11-22 01:59:08,351 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2022-11-22 01:59:08,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:59:08,362 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 20 [2022-11-22 01:59:08,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:59:08,373 INFO L350 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 27 treesize of output 15 [2022-11-22 01:59:08,383 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-11-22 01:59:08,395 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-11-22 01:59:10,666 INFO L321 Elim1Store]: treesize reduction 69, result has 25.0 percent of original size [2022-11-22 01:59:10,668 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 10 new quantified variables, introduced 15 case distinctions, treesize of input 304 treesize of output 176 [2022-11-22 01:59:10,719 INFO L321 Elim1Store]: treesize reduction 74, result has 8.6 percent of original size [2022-11-22 01:59:10,719 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 118 treesize of output 64 [2022-11-22 01:59:10,800 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-22 01:59:10,801 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:59:21,862 WARN L233 SmtUtils]: Spent 8.04s on a formula simplification that was a NOOP. DAG size: 43 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 01:59:23,882 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-22 01:59:23,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1621019610] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:59:23,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1075378910] [2022-11-22 01:59:23,908 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2022-11-22 01:59:23,908 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 01:59:23,914 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 01:59:23,920 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 01:59:23,920 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 01:59:23,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:59:23,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:59:23,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:59:24,001 INFO L350 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 50 treesize of output 30 [2022-11-22 01:59:24,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:59:24,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:59:24,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:59:24,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:59:24,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:59:24,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:59:24,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:59:24,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:59:24,026 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:59:24,055 INFO L321 Elim1Store]: treesize reduction 26, result has 49.0 percent of original size [2022-11-22 01:59:24,056 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 75 treesize of output 83 [2022-11-22 01:59:24,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:59:24,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:59:24,197 INFO L321 Elim1Store]: treesize reduction 136, result has 24.9 percent of original size [2022-11-22 01:59:24,197 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 14 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 12 case distinctions, treesize of input 49 treesize of output 85 [2022-11-22 01:59:24,225 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 9 [2022-11-22 01:59:24,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:59:24,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:59:24,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:59:24,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:59:24,245 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 19 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 75 [2022-11-22 01:59:24,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:59:24,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:59:24,268 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 17 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 43 [2022-11-22 01:59:25,151 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 19 for LOIs [2022-11-22 01:59:25,158 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 19 for LOIs [2022-11-22 01:59:25,161 INFO L197 IcfgInterpreter]: Interpreting procedure aws_linked_list_node_prev_is_valid with input of size 34 for LOIs [2022-11-22 01:59:25,248 INFO L197 IcfgInterpreter]: Interpreting procedure aws_linked_list_node_next_is_valid with input of size 15 for LOIs [2022-11-22 01:59:25,314 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 01:59:27,626 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '424#(and (<= 0 |__VERIFIER_assert_#in~cond|) (= |~#s_can_fail_allocator_static~0.base| 4) (= (mod __VERIFIER_assert_~cond 256) 0) (= |~#s_can_fail_allocator_static~0.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (= ~tl_last_error~0 0) (= |#NULL.offset| 0) (<= |__VERIFIER_assert_#in~cond| 1) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-11-22 01:59:27,626 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-22 01:59:27,626 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:59:27,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 11] total 31 [2022-11-22 01:59:27,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337588349] [2022-11-22 01:59:27,629 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 01:59:27,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-22 01:59:27,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:59:27,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-22 01:59:27,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=2151, Unknown=0, NotChecked=0, Total=2352 [2022-11-22 01:59:27,632 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand has 31 states, 14 states have (on average 2.357142857142857) internal successors, (33), 22 states have internal predecessors, (33), 13 states have call successors, (17), 4 states have call predecessors, (17), 11 states have return successors, (15), 11 states have call predecessors, (15), 11 states have call successors, (15) [2022-11-22 01:59:28,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:59:28,620 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2022-11-22 01:59:28,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-22 01:59:28,622 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 14 states have (on average 2.357142857142857) internal successors, (33), 22 states have internal predecessors, (33), 13 states have call successors, (17), 4 states have call predecessors, (17), 11 states have return successors, (15), 11 states have call predecessors, (15), 11 states have call successors, (15) Word has length 24 [2022-11-22 01:59:28,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:59:28,623 INFO L225 Difference]: With dead ends: 42 [2022-11-22 01:59:28,624 INFO L226 Difference]: Without dead ends: 40 [2022-11-22 01:59:28,625 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 30 SyntacticMatches, 6 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 871 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=242, Invalid=2620, Unknown=0, NotChecked=0, Total=2862 [2022-11-22 01:59:28,626 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 42 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 419 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-22 01:59:28,627 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 167 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 419 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-22 01:59:28,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-11-22 01:59:28,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2022-11-22 01:59:28,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 20 states have (on average 1.05) internal successors, (21), 21 states have internal predecessors, (21), 12 states have call successors, (12), 6 states have call predecessors, (12), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-22 01:59:28,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2022-11-22 01:59:28,640 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 24 [2022-11-22 01:59:28,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:59:28,641 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2022-11-22 01:59:28,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 14 states have (on average 2.357142857142857) internal successors, (33), 22 states have internal predecessors, (33), 13 states have call successors, (17), 4 states have call predecessors, (17), 11 states have return successors, (15), 11 states have call predecessors, (15), 11 states have call successors, (15) [2022-11-22 01:59:28,641 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2022-11-22 01:59:28,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-22 01:59:28,642 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:59:28,642 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-22 01:59:28,651 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad16af83-4651-44ec-9153-bdb42fc5a11a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-11-22 01:59:28,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad16af83-4651-44ec-9153-bdb42fc5a11a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:59:28,848 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 01:59:28,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:59:28,849 INFO L85 PathProgramCache]: Analyzing trace with hash 615597899, now seen corresponding path program 1 times [2022-11-22 01:59:28,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:59:28,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999876349] [2022-11-22 01:59:28,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:59:28,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:59:28,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:59:29,115 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-22 01:59:29,116 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:59:29,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999876349] [2022-11-22 01:59:29,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999876349] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:59:29,116 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:59:29,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-22 01:59:29,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576114016] [2022-11-22 01:59:29,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:59:29,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-22 01:59:29,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:59:29,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-22 01:59:29,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-22 01:59:29,118 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-22 01:59:29,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:59:29,249 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2022-11-22 01:59:29,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-22 01:59:29,249 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 30 [2022-11-22 01:59:29,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:59:29,251 INFO L225 Difference]: With dead ends: 45 [2022-11-22 01:59:29,251 INFO L226 Difference]: Without dead ends: 43 [2022-11-22 01:59:29,251 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-22 01:59:29,252 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 9 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:59:29,252 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 108 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:59:29,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-11-22 01:59:29,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-11-22 01:59:29,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 24 states have internal predecessors, (24), 12 states have call successors, (12), 7 states have call predecessors, (12), 7 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-22 01:59:29,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2022-11-22 01:59:29,266 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 30 [2022-11-22 01:59:29,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:59:29,267 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2022-11-22 01:59:29,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-22 01:59:29,267 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2022-11-22 01:59:29,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-22 01:59:29,268 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:59:29,268 INFO L195 NwaCegarLoop]: trace histogram [4, 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] [2022-11-22 01:59:29,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-22 01:59:29,269 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 01:59:29,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:59:29,269 INFO L85 PathProgramCache]: Analyzing trace with hash 584950545, now seen corresponding path program 1 times [2022-11-22 01:59:29,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:59:29,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774917769] [2022-11-22 01:59:29,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:59:29,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:59:29,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:59:30,570 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-22 01:59:30,571 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:59:30,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774917769] [2022-11-22 01:59:30,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774917769] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:59:30,571 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:59:30,571 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-22 01:59:30,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277900714] [2022-11-22 01:59:30,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:59:30,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-22 01:59:30,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:59:30,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-22 01:59:30,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-22 01:59:30,573 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand has 8 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-22 01:59:30,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:59:30,784 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2022-11-22 01:59:30,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-22 01:59:30,785 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 39 [2022-11-22 01:59:30,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:59:30,786 INFO L225 Difference]: With dead ends: 49 [2022-11-22 01:59:30,786 INFO L226 Difference]: Without dead ends: 47 [2022-11-22 01:59:30,786 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-11-22 01:59:30,787 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 11 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 01:59:30,787 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 109 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 01:59:30,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-11-22 01:59:30,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-11-22 01:59:30,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 27 states have internal predecessors, (27), 12 states have call successors, (12), 8 states have call predecessors, (12), 8 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-22 01:59:30,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2022-11-22 01:59:30,803 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 39 [2022-11-22 01:59:30,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:59:30,803 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2022-11-22 01:59:30,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-22 01:59:30,804 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2022-11-22 01:59:30,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-22 01:59:30,805 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:59:30,805 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 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] [2022-11-22 01:59:30,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-22 01:59:30,806 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 01:59:30,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:59:30,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1736704596, now seen corresponding path program 1 times [2022-11-22 01:59:30,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:59:30,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187966946] [2022-11-22 01:59:30,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:59:30,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:59:30,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:59:32,457 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-11-22 01:59:32,457 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:59:32,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187966946] [2022-11-22 01:59:32,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187966946] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:59:32,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1641509951] [2022-11-22 01:59:32,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:59:32,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:59:32,458 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad16af83-4651-44ec-9153-bdb42fc5a11a/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:59:32,463 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad16af83-4651-44ec-9153-bdb42fc5a11a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:59:32,508 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad16af83-4651-44ec-9153-bdb42fc5a11a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-22 01:59:32,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:59:32,670 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 63 conjunts are in the unsatisfiable core [2022-11-22 01:59:32,680 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:59:35,717 WARN L859 $PredicateComparison]: unable to prove that (or (exists ((|ULTIMATE.start_aws_linked_list_prev_~node#1.base| Int) (|ULTIMATE.start_aws_linked_list_prev_~node#1.offset| Int)) (let ((.cse5 (+ |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 8))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) .cse5)) (.cse0 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) .cse5))) (let ((.cse1 (select (select |c_#memory_$Pointer$.offset| .cse4) .cse0))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse4) .cse0)) (.cse3 (+ .cse1 8))) (and (not (= .cse0 0)) (not (= .cse1 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse2) .cse3) .cse0) (= (select (select |c_#memory_$Pointer$.base| .cse2) .cse3) .cse4))))))) (exists ((|ULTIMATE.start_aws_linked_list_prev_~node#1.base| Int) (|ULTIMATE.start_aws_linked_list_prev_~node#1.offset| Int)) (let ((.cse10 (+ |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 8))) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) .cse10)) (.cse9 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) .cse10))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| .cse7) .cse9)) (.cse8 (+ (select (select |c_#memory_$Pointer$.offset| .cse7) .cse9) 8))) (and (not (= .cse6 0)) (not (= .cse7 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse6) .cse8) .cse9) (= (select (select |c_#memory_$Pointer$.base| .cse6) .cse8) .cse7)))))) (exists ((|ULTIMATE.start_aws_linked_list_prev_~node#1.base| Int) (|ULTIMATE.start_aws_linked_list_prev_~node#1.offset| Int)) (let ((.cse15 (+ |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 8))) (let ((.cse14 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) .cse15)) (.cse11 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) .cse15))) (let ((.cse12 (select (select |c_#memory_$Pointer$.base| .cse14) .cse11)) (.cse13 (+ (select (select |c_#memory_$Pointer$.offset| .cse14) .cse11) 8))) (and (not (= .cse11 0)) (not (= .cse12 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse12) .cse13) .cse11) (= (select (select |c_#memory_$Pointer$.base| .cse12) .cse13) .cse14)))))) (exists ((|ULTIMATE.start_aws_linked_list_prev_~node#1.base| Int) (|ULTIMATE.start_aws_linked_list_prev_~node#1.offset| Int)) (let ((.cse21 (+ |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 8))) (let ((.cse16 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) .cse21)) (.cse20 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) .cse21))) (let ((.cse17 (select (select |c_#memory_$Pointer$.offset| .cse16) .cse20))) (let ((.cse18 (select (select |c_#memory_$Pointer$.base| .cse16) .cse20)) (.cse19 (+ .cse17 8))) (and (not (= .cse16 0)) (not (= .cse17 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse18) .cse19) .cse20) (= (select (select |c_#memory_$Pointer$.base| .cse18) .cse19) .cse16)))))))) is different from true [2022-11-22 01:59:55,917 WARN L233 SmtUtils]: Spent 18.06s on a formula simplification that was a NOOP. DAG size: 43 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 02:00:18,962 WARN L233 SmtUtils]: Spent 18.48s on a formula simplification that was a NOOP. DAG size: 45 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 02:00:25,048 WARN L859 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_1| Int)) (and (not (= |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_1| 0)) (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_1| Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_1|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_1|)) (.cse1 (+ .cse2 8))) (and (= (select (select |c_#memory_$Pointer$.base| .cse0) .cse1) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_1|) (not (= .cse2 0)) (= |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_1| (select (select |c_#memory_$Pointer$.offset| .cse0) .cse1)))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_1| Int)) (and (not (= |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_1| 0)) (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_1| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_1|)) (.cse4 (+ (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_1|) 8))) (and (= (select (select |c_#memory_$Pointer$.base| .cse3) .cse4) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_1|) (not (= .cse3 0)) (= |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_1| (select (select |c_#memory_$Pointer$.offset| .cse3) .cse4))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_1| Int)) (and (not (= |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_1| 0)) (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_1| Int)) (let ((.cse7 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_1|))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_1|)) (.cse6 (+ .cse7 8))) (and (= (select (select |c_#memory_$Pointer$.base| .cse5) .cse6) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_1|) (not (= .cse7 0)) (= |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_1| (select (select |c_#memory_$Pointer$.offset| .cse5) .cse6)))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_1| Int)) (and (not (= |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_1| 0)) (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_1| Int)) (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_1|)) (.cse9 (+ (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_1|) 8))) (and (= (select (select |c_#memory_$Pointer$.base| .cse8) .cse9) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_1|) (not (= .cse8 0)) (= |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_1| (select (select |c_#memory_$Pointer$.offset| .cse8) .cse9)))))))) is different from true [2022-11-22 02:00:28,022 WARN L859 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_2| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_2| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_2|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_2|)) (.cse2 (+ .cse0 8))) (and (not (= .cse0 0)) (= (select (select |c_#memory_$Pointer$.base| .cse1) .cse2) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_2|) (= (select (select |c_#memory_$Pointer$.offset| .cse1) .cse2) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_2|))))) (not (= |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_2| 0)))) (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_2| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_2| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_2|)) (.cse4 (+ (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_2|) 8))) (and (= (select (select |c_#memory_$Pointer$.base| .cse3) .cse4) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_2|) (not (= .cse3 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse3) .cse4) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_2|)))) (not (= |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_2| 0)))) (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_2| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_2| Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_2|)) (.cse6 (+ (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_2|) 8))) (and (= (select (select |c_#memory_$Pointer$.base| .cse5) .cse6) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_2|) (not (= .cse5 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse5) .cse6) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_2|)))) (not (= |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_2| 0)))) (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_2| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_2| Int)) (let ((.cse7 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_2|))) (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_2|)) (.cse9 (+ .cse7 8))) (and (not (= .cse7 0)) (= (select (select |c_#memory_$Pointer$.base| .cse8) .cse9) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_2|) (= (select (select |c_#memory_$Pointer$.offset| .cse8) .cse9) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_2|))))) (not (= |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_2| 0))))) is different from true [2022-11-22 02:00:33,859 WARN L859 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_3| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_3| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_3|) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_3|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_3|) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_3|)) (.cse2 (+ .cse0 8))) (and (not (= .cse0 0)) (= |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_3| (select (select |c_#memory_$Pointer$.offset| .cse1) .cse2)) (= (select (select |c_#memory_$Pointer$.base| .cse1) .cse2) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_3|))))) (not (= |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_3| 0)))) (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_3| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_3| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_3|) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_3|)) (.cse4 (+ (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_3|) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_3|) 8))) (and (not (= .cse3 0)) (= |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_3| (select (select |c_#memory_$Pointer$.offset| .cse3) .cse4)) (= (select (select |c_#memory_$Pointer$.base| .cse3) .cse4) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_3|)))) (not (= |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_3| 0)))) (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_3| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_3| Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_3|) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_3|))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_3|) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_3|)) (.cse7 (+ .cse5 8))) (and (not (= .cse5 0)) (= |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_3| (select (select |c_#memory_$Pointer$.offset| .cse6) .cse7)) (= (select (select |c_#memory_$Pointer$.base| .cse6) .cse7) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_3|))))) (not (= |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_3| 0)))) (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_3| Int)) (and (not (= |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_3| 0)) (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_3| Int)) (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_3|) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_3|)) (.cse9 (+ (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_3|) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_3|) 8))) (and (not (= .cse8 0)) (= |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_3| (select (select |c_#memory_$Pointer$.offset| .cse8) .cse9)) (= (select (select |c_#memory_$Pointer$.base| .cse8) .cse9) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_3|))))))) is different from true [2022-11-22 02:00:37,216 WARN L859 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_3| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_3| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_3|) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_3|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_3|) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_3|)) (.cse2 (+ .cse0 8))) (and (not (= .cse0 0)) (= |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_3| (select (select |c_#memory_$Pointer$.offset| .cse1) .cse2)) (= (select (select |c_#memory_$Pointer$.base| .cse1) .cse2) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_3|))))) (not (= |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_3| 0)))) (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_3| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_3| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_3|) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_3|)) (.cse4 (+ (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_3|) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_3|) 8))) (and (not (= .cse3 0)) (= |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_3| (select (select |c_#memory_$Pointer$.offset| .cse3) .cse4)) (= (select (select |c_#memory_$Pointer$.base| .cse3) .cse4) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_3|)))) (not (= |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_3| 0)))) (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_3| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_3| Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_3|) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_3|))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_3|) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_3|)) (.cse7 (+ .cse5 8))) (and (not (= .cse5 0)) (= |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_3| (select (select |c_#memory_$Pointer$.offset| .cse6) .cse7)) (= (select (select |c_#memory_$Pointer$.base| .cse6) .cse7) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_3|))))) (not (= |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_3| 0)))) (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_3| Int)) (and (not (= |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_3| 0)) (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_3| Int)) (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_3|) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_3|)) (.cse9 (+ (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_3|) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_3|) 8))) (and (not (= .cse8 0)) (= |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_3| (select (select |c_#memory_$Pointer$.offset| .cse8) .cse9)) (= (select (select |c_#memory_$Pointer$.base| .cse8) .cse9) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_3|))))))) (let ((.cse12 (= |c_aws_linked_list_node_next_is_valid_#res| 0)) (.cse11 (= |c_aws_linked_list_node_next_is_valid_#in~node.offset| 0)) (.cse10 (= 0 |c_aws_linked_list_node_next_is_valid_#in~node.base|))) (or (and .cse10 .cse11 .cse12) (and (let ((.cse19 (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 ((.cse17 (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|)) (.cse18 (+ 8 .cse19))) (let ((.cse13 (= |c_aws_linked_list_node_next_is_valid_#in~node.offset| (select (select |c_#memory_$Pointer$.offset| .cse17) .cse18))) (.cse14 (= .cse19 0)) (.cse15 (= .cse17 0)) (.cse16 (= (select (select |c_#memory_$Pointer$.base| .cse17) .cse18) |c_aws_linked_list_node_next_is_valid_#in~node.base|))) (or (and (or (not .cse13) (and .cse14 .cse15) (not .cse16)) .cse12) (and .cse13 (or (not .cse14) (not .cse15)) .cse16 (= |c_aws_linked_list_node_next_is_valid_#res| 1)))))) (or (not .cse11) (not .cse10)))))) is different from true [2022-11-22 02:00:41,429 INFO L321 Elim1Store]: treesize reduction 18, result has 97.7 percent of original size [2022-11-22 02:00:41,430 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 15 new quantified variables, introduced 45 case distinctions, treesize of input 273 treesize of output 934 [2022-11-22 02:00:41,886 INFO L217 Elim1Store]: Index analysis took 376 ms [2022-11-22 02:00:46,601 INFO L321 Elim1Store]: treesize reduction 3, result has 99.4 percent of original size [2022-11-22 02:00:46,602 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 15 new quantified variables, introduced 45 case distinctions, treesize of input 796 treesize of output 1116