./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/aws-c-common/aws_linked_list_pop_back_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94242371-04b9-4a99-bf94-885615788746/bin/utaipan-ByfvJB40ur/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94242371-04b9-4a99-bf94-885615788746/bin/utaipan-ByfvJB40ur/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94242371-04b9-4a99-bf94-885615788746/bin/utaipan-ByfvJB40ur/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94242371-04b9-4a99-bf94-885615788746/bin/utaipan-ByfvJB40ur/config/TaipanReach.xml -i ../../sv-benchmarks/c/aws-c-common/aws_linked_list_pop_back_harness.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94242371-04b9-4a99-bf94-885615788746/bin/utaipan-ByfvJB40ur/config/svcomp-Reach-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94242371-04b9-4a99-bf94-885615788746/bin/utaipan-ByfvJB40ur --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 bcbdd24aa3539f554995115754c17957131f4a70e9c01f3bd768b3e606eed4d4 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-25 23:35:31,911 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 23:35:31,913 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 23:35:31,933 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 23:35:31,933 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 23:35:31,934 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 23:35:31,936 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 23:35:31,938 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 23:35:31,939 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 23:35:31,940 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 23:35:31,942 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 23:35:31,943 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 23:35:31,944 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 23:35:31,945 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 23:35:31,946 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 23:35:31,948 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 23:35:31,949 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 23:35:31,951 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 23:35:31,953 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 23:35:31,955 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 23:35:31,957 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 23:35:31,959 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 23:35:31,960 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 23:35:31,962 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 23:35:31,966 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 23:35:31,967 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 23:35:31,967 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 23:35:31,968 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 23:35:31,969 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 23:35:31,971 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 23:35:31,971 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 23:35:31,972 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 23:35:31,973 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 23:35:31,975 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 23:35:31,976 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 23:35:31,977 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 23:35:31,978 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 23:35:31,978 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 23:35:31,979 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 23:35:31,980 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 23:35:31,981 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 23:35:31,982 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94242371-04b9-4a99-bf94-885615788746/bin/utaipan-ByfvJB40ur/config/svcomp-Reach-64bit-Taipan_Default.epf [2022-11-25 23:35:32,009 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 23:35:32,009 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 23:35:32,010 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 23:35:32,010 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 23:35:32,011 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 23:35:32,012 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 23:35:32,012 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-25 23:35:32,012 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-25 23:35:32,013 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-25 23:35:32,013 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-25 23:35:32,014 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-25 23:35:32,014 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-25 23:35:32,014 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-25 23:35:32,015 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-25 23:35:32,015 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-25 23:35:32,016 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-25 23:35:32,016 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-25 23:35:32,017 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-25 23:35:32,018 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 23:35:32,018 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 23:35:32,019 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 23:35:32,019 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 23:35:32,019 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 23:35:32,020 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 23:35:32,020 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 23:35:32,020 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 23:35:32,021 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 23:35:32,021 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 23:35:32,022 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 23:35:32,022 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 23:35:32,022 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 23:35:32,023 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-25 23:35:32,023 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 23:35:32,023 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 23:35:32,024 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-25 23:35:32,024 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 23:35:32,024 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 23:35:32,025 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-25 23:35:32,025 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_94242371-04b9-4a99-bf94-885615788746/bin/utaipan-ByfvJB40ur/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_94242371-04b9-4a99-bf94-885615788746/bin/utaipan-ByfvJB40ur 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 -> bcbdd24aa3539f554995115754c17957131f4a70e9c01f3bd768b3e606eed4d4 [2022-11-25 23:35:32,311 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 23:35:32,337 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 23:35:32,340 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 23:35:32,342 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 23:35:32,343 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 23:35:32,344 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94242371-04b9-4a99-bf94-885615788746/bin/utaipan-ByfvJB40ur/../../sv-benchmarks/c/aws-c-common/aws_linked_list_pop_back_harness.i [2022-11-25 23:35:35,560 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 23:35:36,209 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 23:35:36,210 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94242371-04b9-4a99-bf94-885615788746/sv-benchmarks/c/aws-c-common/aws_linked_list_pop_back_harness.i [2022-11-25 23:35:36,250 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94242371-04b9-4a99-bf94-885615788746/bin/utaipan-ByfvJB40ur/data/7bb168a73/b6dad378d99f4ee6ab61e7e18d089e7b/FLAGc0a0fe3a5 [2022-11-25 23:35:36,277 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94242371-04b9-4a99-bf94-885615788746/bin/utaipan-ByfvJB40ur/data/7bb168a73/b6dad378d99f4ee6ab61e7e18d089e7b [2022-11-25 23:35:36,284 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 23:35:36,287 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 23:35:36,292 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 23:35:36,292 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 23:35:36,297 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 23:35:36,298 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 11:35:36" (1/1) ... [2022-11-25 23:35:36,300 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4be2e1b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:35:36, skipping insertion in model container [2022-11-25 23:35:36,300 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 11:35:36" (1/1) ... [2022-11-25 23:35:36,310 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 23:35:36,422 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 23:35:36,779 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_94242371-04b9-4a99-bf94-885615788746/sv-benchmarks/c/aws-c-common/aws_linked_list_pop_back_harness.i[4498,4511] [2022-11-25 23:35:36,793 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_94242371-04b9-4a99-bf94-885615788746/sv-benchmarks/c/aws-c-common/aws_linked_list_pop_back_harness.i[4558,4571] [2022-11-25 23:35:37,984 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-11-25 23:35:37,991 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 23:35:37,992 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 23:35:37,992 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 23:35:37,993 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 23:35:38,007 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 23:35:38,036 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 23:35:38,039 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 23:35:38,045 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 23:35:38,048 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 23:35:38,056 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 23:35:38,059 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 23:35:38,060 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 23:35:38,061 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 23:35:38,164 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-11-25 23:35:38,164 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-11-25 23:35:38,165 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-11-25 23:35:38,172 WARN L623 FunctionHandler]: Unknown extern function ntohl [2022-11-25 23:35:38,175 WARN L623 FunctionHandler]: Unknown extern function htons [2022-11-25 23:35:38,176 WARN L623 FunctionHandler]: Unknown extern function ntohs [2022-11-25 23:35:38,613 WARN L623 FunctionHandler]: Unknown extern function my_abort [2022-11-25 23:35:38,614 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-11-25 23:35:38,616 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-11-25 23:35:38,618 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-11-25 23:35:38,619 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-11-25 23:35:38,622 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-11-25 23:35:38,623 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-11-25 23:35:38,624 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-11-25 23:35:38,625 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-11-25 23:35:38,627 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-11-25 23:35:38,628 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-11-25 23:35:38,889 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-11-25 23:35:38,932 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 23:35:38,953 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 23:35:38,972 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_94242371-04b9-4a99-bf94-885615788746/sv-benchmarks/c/aws-c-common/aws_linked_list_pop_back_harness.i[4498,4511] [2022-11-25 23:35:38,973 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_94242371-04b9-4a99-bf94-885615788746/sv-benchmarks/c/aws-c-common/aws_linked_list_pop_back_harness.i[4558,4571] [2022-11-25 23:35:39,027 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-11-25 23:35:39,032 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 23:35:39,033 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 23:35:39,033 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 23:35:39,034 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 23:35:39,035 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 23:35:39,046 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 23:35:39,047 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 23:35:39,049 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 23:35:39,049 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 23:35:39,051 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 23:35:39,052 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 23:35:39,053 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 23:35:39,054 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 23:35:39,064 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-11-25 23:35:39,065 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-11-25 23:35:39,065 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-11-25 23:35:39,070 WARN L623 FunctionHandler]: Unknown extern function ntohl [2022-11-25 23:35:39,072 WARN L623 FunctionHandler]: Unknown extern function htons [2022-11-25 23:35:39,073 WARN L623 FunctionHandler]: Unknown extern function ntohs [2022-11-25 23:35:39,116 WARN L623 FunctionHandler]: Unknown extern function my_abort [2022-11-25 23:35:39,117 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-11-25 23:35:39,118 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-11-25 23:35:39,119 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-11-25 23:35:39,120 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-11-25 23:35:39,130 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-11-25 23:35:39,131 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-11-25 23:35:39,132 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-11-25 23:35:39,134 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-11-25 23:35:39,135 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-11-25 23:35:39,136 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-11-25 23:35:39,200 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-11-25 23:35:39,223 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 23:35:39,565 INFO L208 MainTranslator]: Completed translation [2022-11-25 23:35:39,566 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:35:39 WrapperNode [2022-11-25 23:35:39,566 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 23:35:39,567 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 23:35:39,568 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 23:35:39,568 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 23:35:39,576 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:35:39" (1/1) ... [2022-11-25 23:35:39,682 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:35:39" (1/1) ... [2022-11-25 23:35:39,755 INFO L138 Inliner]: procedures = 679, calls = 1045, calls flagged for inlining = 52, calls inlined = 8, statements flattened = 224 [2022-11-25 23:35:39,756 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 23:35:39,757 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 23:35:39,757 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 23:35:39,758 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 23:35:39,771 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:35:39" (1/1) ... [2022-11-25 23:35:39,771 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:35:39" (1/1) ... [2022-11-25 23:35:39,791 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:35:39" (1/1) ... [2022-11-25 23:35:39,793 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:35:39" (1/1) ... [2022-11-25 23:35:39,826 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:35:39" (1/1) ... [2022-11-25 23:35:39,843 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:35:39" (1/1) ... [2022-11-25 23:35:39,848 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:35:39" (1/1) ... [2022-11-25 23:35:39,851 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:35:39" (1/1) ... [2022-11-25 23:35:39,856 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 23:35:39,858 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 23:35:39,858 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 23:35:39,858 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 23:35:39,859 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:35:39" (1/1) ... [2022-11-25 23:35:39,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 23:35:39,894 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94242371-04b9-4a99-bf94-885615788746/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:35:39,915 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94242371-04b9-4a99-bf94-885615788746/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 23:35:39,934 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94242371-04b9-4a99-bf94-885615788746/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 23:35:39,973 INFO L130 BoogieDeclarations]: Found specification of procedure aws_is_mem_zeroed [2022-11-25 23:35:39,973 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_is_mem_zeroed [2022-11-25 23:35:39,974 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_remove [2022-11-25 23:35:39,974 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_remove [2022-11-25 23:35:39,974 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 23:35:39,974 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-25 23:35:39,975 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-25 23:35:39,975 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-25 23:35:39,976 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2022-11-25 23:35:39,976 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2022-11-25 23:35:39,976 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-25 23:35:39,977 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_is_valid [2022-11-25 23:35:39,977 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_is_valid [2022-11-25 23:35:39,977 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 23:35:39,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-25 23:35:39,977 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 23:35:39,978 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 23:35:39,978 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_empty [2022-11-25 23:35:39,980 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_empty [2022-11-25 23:35:39,980 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-11-25 23:35:39,980 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-11-25 23:35:39,981 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-25 23:35:39,981 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-25 23:35:39,981 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 23:35:39,981 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-25 23:35:39,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-25 23:35:39,983 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2022-11-25 23:35:39,983 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2022-11-25 23:35:39,983 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_prev_is_valid [2022-11-25 23:35:39,984 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_prev_is_valid [2022-11-25 23:35:39,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 23:35:40,433 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 23:35:40,436 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 23:35:40,929 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 23:35:41,111 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 23:35:41,112 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2022-11-25 23:35:41,117 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 11:35:41 BoogieIcfgContainer [2022-11-25 23:35:41,117 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 23:35:41,124 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 23:35:41,124 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 23:35:41,128 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 23:35:41,129 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 11:35:36" (1/3) ... [2022-11-25 23:35:41,130 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2611fed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 11:35:41, skipping insertion in model container [2022-11-25 23:35:41,131 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:35:39" (2/3) ... [2022-11-25 23:35:41,135 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2611fed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 11:35:41, skipping insertion in model container [2022-11-25 23:35:41,139 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 11:35:41" (3/3) ... [2022-11-25 23:35:41,141 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_linked_list_pop_back_harness.i [2022-11-25 23:35:41,166 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 23:35:41,167 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-25 23:35:41,250 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 23:35:41,265 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;@3881f09e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 23:35:41,267 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-25 23:35:41,274 INFO L276 IsEmpty]: Start isEmpty. Operand has 99 states, 51 states have (on average 1.2352941176470589) internal successors, (63), 52 states have internal predecessors, (63), 37 states have call successors, (37), 10 states have call predecessors, (37), 10 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-11-25 23:35:41,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-11-25 23:35:41,296 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:35:41,298 INFO L195 NwaCegarLoop]: trace histogram [9, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:35:41,298 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:35:41,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:35:41,310 INFO L85 PathProgramCache]: Analyzing trace with hash -53848961, now seen corresponding path program 1 times [2022-11-25 23:35:41,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:35:41,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372963569] [2022-11-25 23:35:41,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:35:41,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:35:41,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:35:42,546 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-11-25 23:35:42,547 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:35:42,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372963569] [2022-11-25 23:35:42,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372963569] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:35:42,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1021127525] [2022-11-25 23:35:42,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:35:42,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:35:42,550 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94242371-04b9-4a99-bf94-885615788746/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:35:42,554 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94242371-04b9-4a99-bf94-885615788746/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:35:42,567 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94242371-04b9-4a99-bf94-885615788746/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-25 23:35:42,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:35:42,937 INFO L263 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 97 conjunts are in the unsatisfiable core [2022-11-25 23:35:42,965 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:35:43,236 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 18 treesize of output 19 [2022-11-25 23:35:43,268 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 18 treesize of output 19 [2022-11-25 23:35:43,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:35:43,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:35:43,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:35:43,404 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 35 treesize of output 41 [2022-11-25 23:35:43,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:35:43,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:35:43,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:35:43,438 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 35 treesize of output 41 [2022-11-25 23:35:46,557 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-11-25 23:35:46,557 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 23:35:46,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1021127525] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:35:46,557 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 23:35:46,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [5] total 12 [2022-11-25 23:35:46,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111531507] [2022-11-25 23:35:46,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:35:46,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 23:35:46,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:35:46,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 23:35:46,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-11-25 23:35:46,606 INFO L87 Difference]: Start difference. First operand has 99 states, 51 states have (on average 1.2352941176470589) internal successors, (63), 52 states have internal predecessors, (63), 37 states have call successors, (37), 10 states have call predecessors, (37), 10 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 5 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2022-11-25 23:35:48,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:35:48,640 INFO L93 Difference]: Finished difference Result 245 states and 355 transitions. [2022-11-25 23:35:48,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 23:35:48,643 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 5 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) Word has length 70 [2022-11-25 23:35:48,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:35:48,659 INFO L225 Difference]: With dead ends: 245 [2022-11-25 23:35:48,659 INFO L226 Difference]: Without dead ends: 159 [2022-11-25 23:35:48,667 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 56 SyntacticMatches, 8 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-11-25 23:35:48,675 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 80 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 398 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-25 23:35:48,680 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 473 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 398 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-11-25 23:35:48,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2022-11-25 23:35:48,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 156. [2022-11-25 23:35:48,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 78 states have (on average 1.2179487179487178) internal successors, (95), 81 states have internal predecessors, (95), 60 states have call successors, (60), 17 states have call predecessors, (60), 17 states have return successors, (61), 57 states have call predecessors, (61), 59 states have call successors, (61) [2022-11-25 23:35:48,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 216 transitions. [2022-11-25 23:35:48,840 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 216 transitions. Word has length 70 [2022-11-25 23:35:48,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:35:48,846 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 216 transitions. [2022-11-25 23:35:48,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 5 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2022-11-25 23:35:48,847 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 216 transitions. [2022-11-25 23:35:48,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-11-25 23:35:48,851 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:35:48,851 INFO L195 NwaCegarLoop]: trace histogram [9, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:35:48,866 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94242371-04b9-4a99-bf94-885615788746/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-25 23:35:49,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94242371-04b9-4a99-bf94-885615788746/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2022-11-25 23:35:49,060 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:35:49,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:35:49,061 INFO L85 PathProgramCache]: Analyzing trace with hash -1869393802, now seen corresponding path program 1 times [2022-11-25 23:35:49,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:35:49,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183537926] [2022-11-25 23:35:49,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:35:49,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:35:49,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:35:49,669 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2022-11-25 23:35:49,669 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:35:49,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183537926] [2022-11-25 23:35:49,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183537926] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:35:49,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1126606815] [2022-11-25 23:35:49,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:35:49,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:35:49,671 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94242371-04b9-4a99-bf94-885615788746/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:35:49,672 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94242371-04b9-4a99-bf94-885615788746/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:35:49,714 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94242371-04b9-4a99-bf94-885615788746/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-25 23:35:49,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:35:49,970 INFO L263 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 114 conjunts are in the unsatisfiable core [2022-11-25 23:35:49,980 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:35:49,998 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 23:35:50,184 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 18 treesize of output 19 [2022-11-25 23:35:50,216 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 18 treesize of output 19 [2022-11-25 23:35:50,373 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 23:35:50,373 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-25 23:35:50,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:35:50,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:35:50,386 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2022-11-25 23:35:50,393 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2022-11-25 23:35:50,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:35:50,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:35:50,417 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2022-11-25 23:35:50,425 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2022-11-25 23:35:50,556 INFO L321 Elim1Store]: treesize reduction 42, result has 20.8 percent of original size [2022-11-25 23:35:50,557 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 126 treesize of output 140 [2022-11-25 23:35:50,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:35:50,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:35:50,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:35:50,579 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 124 [2022-11-25 23:35:50,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:35:50,594 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 41 [2022-11-25 23:35:50,606 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2022-11-25 23:35:50,644 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 25 [2022-11-25 23:35:50,650 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 13 treesize of output 9 [2022-11-25 23:35:50,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:35:50,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:35:50,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:35:50,674 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 44 [2022-11-25 23:35:54,361 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 55 proven. 11 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-11-25 23:35:54,361 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:36:00,449 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset| 8)) (.cse0 (+ |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 24)) (.cse1 (+ 16 |c_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset|))) (and (forall ((v_ArrVal_221 (Array Int Int)) (v_ArrVal_225 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_225) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_221) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|)) |c_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base|) .cse1) 0)) (or (forall ((v_ArrVal_226 (Array Int Int)) (v_ArrVal_224 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_224) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_226) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset|)) |c_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base|) |c_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset|) 0))) (forall ((v_ArrVal_221 (Array Int Int)) (v_ArrVal_225 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_225) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_221) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|)) |c_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base|) |c_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset|) 0)))) (or (not (= |c_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset| 0)) (not (= |c_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base| 0))) (let ((.cse2 (+ |c_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset| 24))) (or (forall ((v_ArrVal_221 (Array Int Int)) (v_ArrVal_225 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_225) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_221) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|)) |c_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base|) .cse2) 0))) (forall ((v_ArrVal_226 (Array Int Int)) (v_ArrVal_224 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_224) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_226) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset|)) |c_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base|) .cse2) 0))))) (forall ((v_ArrVal_221 (Array Int Int)) (v_ArrVal_225 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_225) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_221) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|)) |c_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_226 (Array Int Int)) (v_ArrVal_224 (Array Int Int))) (= 0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_224) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_226) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset|)) |c_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base|) .cse3))) (forall ((v_ArrVal_226 (Array Int Int)) (v_ArrVal_224 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_224) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_226) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset|)) |c_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base|) .cse1) 0)))) is different from false [2022-11-25 23:36:01,238 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:36:01,239 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 55 [2022-11-25 23:36:01,263 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:36:01,263 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 55 [2022-11-25 23:36:01,286 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:36:01,287 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 426 treesize of output 362 [2022-11-25 23:36:01,331 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:36:01,331 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 319 treesize of output 309 [2022-11-25 23:36:01,356 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 294 treesize of output 278 [2022-11-25 23:36:01,393 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 262 treesize of output 254 [2022-11-25 23:36:01,415 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 294 treesize of output 286 [2022-11-25 23:36:01,445 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 322 treesize of output 306 [2022-11-25 23:36:01,629 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 8 treesize of output 4 [2022-11-25 23:36:01,647 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 8 treesize of output 4 [2022-11-25 23:36:01,700 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:36:01,700 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 69 [2022-11-25 23:36:01,747 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:36:01,748 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 67 treesize of output 77 [2022-11-25 23:36:01,853 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:36:01,853 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 54 [2022-11-25 23:36:01,872 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:36:01,872 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 274 treesize of output 264 [2022-11-25 23:36:01,915 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 266 treesize of output 250 [2022-11-25 23:36:01,937 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 87 treesize of output 79 [2022-11-25 23:36:02,105 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 7 treesize of output 3 [2022-11-25 23:36:02,137 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:36:02,138 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 65 [2022-11-25 23:36:02,293 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:36:02,294 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 54 [2022-11-25 23:36:02,314 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:36:02,315 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 379 treesize of output 319 [2022-11-25 23:36:02,327 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 282 treesize of output 274 [2022-11-25 23:36:02,341 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 322 treesize of output 306 [2022-11-25 23:36:02,490 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 7 treesize of output 3 [2022-11-25 23:36:02,534 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:36:02,535 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 70 [2022-11-25 23:36:02,615 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:36:02,616 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 54 [2022-11-25 23:36:02,629 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:36:02,642 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:36:02,643 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 102 treesize of output 98 [2022-11-25 23:36:02,654 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 33 treesize of output 29 [2022-11-25 23:36:02,691 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 7 treesize of output 3 [2022-11-25 23:36:02,742 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:36:02,742 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 61 [2022-11-25 23:36:02,799 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:36:02,799 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 54 [2022-11-25 23:36:02,824 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:36:02,824 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 379 treesize of output 319 [2022-11-25 23:36:02,836 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 282 treesize of output 274 [2022-11-25 23:36:02,851 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 322 treesize of output 306 [2022-11-25 23:36:02,994 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 7 treesize of output 3 [2022-11-25 23:36:03,028 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:36:03,029 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 70 [2022-11-25 23:36:03,129 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:36:03,130 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 53 [2022-11-25 23:36:03,158 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:36:03,159 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 61 [2022-11-25 23:36:03,183 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:36:03,184 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 222 treesize of output 192 [2022-11-25 23:36:03,202 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 152 treesize of output 148 [2022-11-25 23:36:03,217 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 148 treesize of output 146 [2022-11-25 23:36:03,230 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:36:03,246 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:36:03,247 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 103 treesize of output 99 [2022-11-25 23:36:03,265 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 68 treesize of output 66 [2022-11-25 23:36:03,378 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2022-11-25 23:36:03,416 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 6 treesize of output 4 [2022-11-25 23:36:03,449 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:36:03,449 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 57 [2022-11-25 23:36:03,577 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:36:03,577 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 75 [2022-11-25 23:36:04,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1126606815] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:36:04,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [525235723] [2022-11-25 23:36:04,097 INFO L159 IcfgInterpreter]: Started Sifa with 39 locations of interest [2022-11-25 23:36:04,098 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:36:04,102 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:36:04,109 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:36:04,109 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:36:04,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:04,283 INFO L321 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2022-11-25 23:36:04,283 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 12 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 37 treesize of output 61 [2022-11-25 23:36:04,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:04,307 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2022-11-25 23:36:04,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:04,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:04,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:04,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:04,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:04,657 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 0 case distinctions, treesize of input 62 treesize of output 77 [2022-11-25 23:36:04,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:04,692 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2022-11-25 23:36:04,718 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 24 treesize of output 9 [2022-11-25 23:36:04,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:04,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:04,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:04,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:04,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:04,744 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 0 case distinctions, treesize of input 62 treesize of output 77 [2022-11-25 23:36:04,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:04,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:04,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:04,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:04,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:04,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:04,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:04,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:04,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:04,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:04,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:04,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:04,850 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:36:04,874 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-25 23:36:04,875 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 16 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 103 [2022-11-25 23:36:04,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:04,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:04,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:04,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:04,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:04,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:04,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:04,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:04,925 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:36:04,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:04,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:04,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:04,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:04,933 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:36:04,954 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-25 23:36:04,958 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 16 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 103 [2022-11-25 23:36:05,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:05,026 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 7 [2022-11-25 23:36:05,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:05,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:05,136 INFO L321 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-11-25 23:36:05,139 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 8 case distinctions, treesize of input 42 treesize of output 73 [2022-11-25 23:36:05,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:05,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:05,196 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 28 [2022-11-25 23:36:05,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:05,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:05,228 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 17 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 46 [2022-11-25 23:36:05,358 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 9 [2022-11-25 23:36:05,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:05,384 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2022-11-25 23:36:05,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:05,417 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 13 [2022-11-25 23:36:05,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:05,447 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 13 [2022-11-25 23:36:05,464 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:36:05,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:05,467 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 23 [2022-11-25 23:36:05,487 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-11-25 23:36:05,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:05,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:05,531 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 19 [2022-11-25 23:36:05,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:05,552 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 35 treesize of output 7 [2022-11-25 23:36:05,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:05,573 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 29 treesize of output 17 [2022-11-25 23:36:05,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:05,597 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 35 treesize of output 7 [2022-11-25 23:36:09,735 INFO L197 IcfgInterpreter]: Interpreting procedure aws_linked_list_empty with input of size 109 for LOIs [2022-11-25 23:36:10,137 INFO L197 IcfgInterpreter]: Interpreting procedure aws_linked_list_is_valid with input of size 73 for LOIs [2022-11-25 23:36:10,404 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 15 for LOIs [2022-11-25 23:36:10,406 INFO L197 IcfgInterpreter]: Interpreting procedure nondet_uint64_t with input of size 104 for LOIs [2022-11-25 23:36:10,429 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:36:18,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [525235723] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:36:18,494 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-25 23:36:18,494 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [5, 11] total 34 [2022-11-25 23:36:18,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404836015] [2022-11-25 23:36:18,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:36:18,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-25 23:36:18,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:36:18,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-25 23:36:18,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=1490, Unknown=1, NotChecked=78, Total=1722 [2022-11-25 23:36:18,502 INFO L87 Difference]: Start difference. First operand 156 states and 216 transitions. Second operand has 21 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 11 states have internal predecessors, (20), 8 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (14), 8 states have call predecessors, (14), 8 states have call successors, (14) [2022-11-25 23:36:23,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:36:23,731 INFO L93 Difference]: Finished difference Result 274 states and 370 transitions. [2022-11-25 23:36:23,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-25 23:36:23,732 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 11 states have internal predecessors, (20), 8 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (14), 8 states have call predecessors, (14), 8 states have call successors, (14) Word has length 71 [2022-11-25 23:36:23,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:36:23,734 INFO L225 Difference]: With dead ends: 274 [2022-11-25 23:36:23,735 INFO L226 Difference]: Without dead ends: 188 [2022-11-25 23:36:23,737 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 151 SyntacticMatches, 19 SemanticMatches, 43 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 673 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=178, Invalid=1717, Unknown=1, NotChecked=84, Total=1980 [2022-11-25 23:36:23,738 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 93 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 1020 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 1068 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 1020 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-11-25 23:36:23,738 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 334 Invalid, 1068 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 1020 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2022-11-25 23:36:23,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2022-11-25 23:36:23,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 186. [2022-11-25 23:36:23,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 100 states have (on average 1.25) internal successors, (125), 102 states have internal predecessors, (125), 64 states have call successors, (64), 22 states have call predecessors, (64), 21 states have return successors, (63), 61 states have call predecessors, (63), 63 states have call successors, (63) [2022-11-25 23:36:23,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 252 transitions. [2022-11-25 23:36:23,826 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 252 transitions. Word has length 71 [2022-11-25 23:36:23,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:36:23,827 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 252 transitions. [2022-11-25 23:36:23,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 11 states have internal predecessors, (20), 8 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (14), 8 states have call predecessors, (14), 8 states have call successors, (14) [2022-11-25 23:36:23,828 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 252 transitions. [2022-11-25 23:36:23,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-11-25 23:36:23,830 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:36:23,831 INFO L195 NwaCegarLoop]: trace histogram [9, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:36:23,843 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94242371-04b9-4a99-bf94-885615788746/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-25 23:36:24,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94242371-04b9-4a99-bf94-885615788746/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:36:24,044 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:36:24,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:36:24,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1341664707, now seen corresponding path program 1 times [2022-11-25 23:36:24,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:36:24,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704574304] [2022-11-25 23:36:24,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:36:24,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:36:24,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:36:24,339 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2022-11-25 23:36:24,339 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:36:24,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704574304] [2022-11-25 23:36:24,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704574304] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:36:24,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1340007336] [2022-11-25 23:36:24,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:36:24,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:36:24,340 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94242371-04b9-4a99-bf94-885615788746/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:36:24,342 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94242371-04b9-4a99-bf94-885615788746/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:36:24,381 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94242371-04b9-4a99-bf94-885615788746/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-25 23:36:24,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:36:24,618 INFO L263 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-25 23:36:24,622 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:36:24,724 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-11-25 23:36:24,724 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 23:36:24,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1340007336] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:36:24,725 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 23:36:24,725 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2022-11-25 23:36:24,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100384521] [2022-11-25 23:36:24,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:36:24,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 23:36:24,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:36:24,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 23:36:24,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-11-25 23:36:24,728 INFO L87 Difference]: Start difference. First operand 186 states and 252 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2022-11-25 23:36:25,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:36:25,136 INFO L93 Difference]: Finished difference Result 333 states and 453 transitions. [2022-11-25 23:36:25,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 23:36:25,137 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) Word has length 72 [2022-11-25 23:36:25,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:36:25,140 INFO L225 Difference]: With dead ends: 333 [2022-11-25 23:36:25,140 INFO L226 Difference]: Without dead ends: 196 [2022-11-25 23:36:25,142 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2022-11-25 23:36:25,143 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 54 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 23:36:25,143 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 504 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 23:36:25,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2022-11-25 23:36:25,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 189. [2022-11-25 23:36:25,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 102 states have (on average 1.2254901960784315) internal successors, (125), 105 states have internal predecessors, (125), 64 states have call successors, (64), 22 states have call predecessors, (64), 22 states have return successors, (65), 61 states have call predecessors, (65), 63 states have call successors, (65) [2022-11-25 23:36:25,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 254 transitions. [2022-11-25 23:36:25,232 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 254 transitions. Word has length 72 [2022-11-25 23:36:25,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:36:25,233 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 254 transitions. [2022-11-25 23:36:25,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2022-11-25 23:36:25,234 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 254 transitions. [2022-11-25 23:36:25,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-11-25 23:36:25,236 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:36:25,236 INFO L195 NwaCegarLoop]: trace histogram [9, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:36:25,253 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94242371-04b9-4a99-bf94-885615788746/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-25 23:36:25,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94242371-04b9-4a99-bf94-885615788746/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:36:25,444 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:36:25,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:36:25,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1924319100, now seen corresponding path program 1 times [2022-11-25 23:36:25,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:36:25,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910121630] [2022-11-25 23:36:25,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:36:25,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:36:25,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:36:25,781 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2022-11-25 23:36:25,782 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:36:25,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910121630] [2022-11-25 23:36:25,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910121630] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:36:25,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [302827909] [2022-11-25 23:36:25,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:36:25,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:36:25,783 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94242371-04b9-4a99-bf94-885615788746/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:36:25,784 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94242371-04b9-4a99-bf94-885615788746/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:36:25,794 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94242371-04b9-4a99-bf94-885615788746/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-25 23:36:26,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:36:26,057 INFO L263 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-25 23:36:26,061 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:36:26,170 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-11-25 23:36:26,171 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 23:36:26,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [302827909] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:36:26,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 23:36:26,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 14 [2022-11-25 23:36:26,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366483319] [2022-11-25 23:36:26,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:36:26,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 23:36:26,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:36:26,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 23:36:26,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2022-11-25 23:36:26,174 INFO L87 Difference]: Start difference. First operand 189 states and 254 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2022-11-25 23:36:26,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:36:26,681 INFO L93 Difference]: Finished difference Result 378 states and 519 transitions. [2022-11-25 23:36:26,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 23:36:26,682 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) Word has length 74 [2022-11-25 23:36:26,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:36:26,685 INFO L225 Difference]: With dead ends: 378 [2022-11-25 23:36:26,685 INFO L226 Difference]: Without dead ends: 236 [2022-11-25 23:36:26,687 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2022-11-25 23:36:26,688 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 85 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 23:36:26,688 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 585 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 23:36:26,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2022-11-25 23:36:26,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 193. [2022-11-25 23:36:26,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 106 states have (on average 1.2264150943396226) internal successors, (130), 109 states have internal predecessors, (130), 64 states have call successors, (64), 22 states have call predecessors, (64), 22 states have return successors, (65), 61 states have call predecessors, (65), 63 states have call successors, (65) [2022-11-25 23:36:26,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 259 transitions. [2022-11-25 23:36:26,802 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 259 transitions. Word has length 74 [2022-11-25 23:36:26,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:36:26,802 INFO L495 AbstractCegarLoop]: Abstraction has 193 states and 259 transitions. [2022-11-25 23:36:26,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2022-11-25 23:36:26,803 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 259 transitions. [2022-11-25 23:36:26,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-11-25 23:36:26,805 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:36:26,805 INFO L195 NwaCegarLoop]: trace histogram [9, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:36:26,815 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94242371-04b9-4a99-bf94-885615788746/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-25 23:36:27,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94242371-04b9-4a99-bf94-885615788746/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-11-25 23:36:27,013 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:36:27,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:36:27,014 INFO L85 PathProgramCache]: Analyzing trace with hash -915652434, now seen corresponding path program 1 times [2022-11-25 23:36:27,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:36:27,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432301186] [2022-11-25 23:36:27,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:36:27,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:36:27,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:36:27,506 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2022-11-25 23:36:27,507 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:36:27,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432301186] [2022-11-25 23:36:27,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432301186] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:36:27,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1493160367] [2022-11-25 23:36:27,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:36:27,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:36:27,508 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94242371-04b9-4a99-bf94-885615788746/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:36:27,509 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94242371-04b9-4a99-bf94-885615788746/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:36:27,540 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94242371-04b9-4a99-bf94-885615788746/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-25 23:36:27,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:36:27,805 INFO L263 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-25 23:36:27,809 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:36:27,831 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-11-25 23:36:27,831 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 23:36:27,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1493160367] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:36:27,832 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 23:36:27,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2022-11-25 23:36:27,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183479528] [2022-11-25 23:36:27,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:36:27,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:36:27,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:36:27,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:36:27,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-25 23:36:27,835 INFO L87 Difference]: Start difference. First operand 193 states and 259 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-11-25 23:36:27,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:36:27,998 INFO L93 Difference]: Finished difference Result 366 states and 504 transitions. [2022-11-25 23:36:27,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:36:27,999 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 75 [2022-11-25 23:36:28,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:36:28,002 INFO L225 Difference]: With dead ends: 366 [2022-11-25 23:36:28,002 INFO L226 Difference]: Without dead ends: 222 [2022-11-25 23:36:28,003 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-25 23:36:28,004 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 6 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:36:28,004 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 225 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:36:28,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2022-11-25 23:36:28,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 198. [2022-11-25 23:36:28,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 111 states have (on average 1.2252252252252251) internal successors, (136), 114 states have internal predecessors, (136), 64 states have call successors, (64), 22 states have call predecessors, (64), 22 states have return successors, (65), 61 states have call predecessors, (65), 63 states have call successors, (65) [2022-11-25 23:36:28,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 265 transitions. [2022-11-25 23:36:28,086 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 265 transitions. Word has length 75 [2022-11-25 23:36:28,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:36:28,087 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 265 transitions. [2022-11-25 23:36:28,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-11-25 23:36:28,088 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 265 transitions. [2022-11-25 23:36:28,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-11-25 23:36:28,090 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:36:28,090 INFO L195 NwaCegarLoop]: trace histogram [9, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:36:28,107 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94242371-04b9-4a99-bf94-885615788746/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-25 23:36:28,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94242371-04b9-4a99-bf94-885615788746/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:36:28,298 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:36:28,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:36:28,299 INFO L85 PathProgramCache]: Analyzing trace with hash -1617287136, now seen corresponding path program 1 times [2022-11-25 23:36:28,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:36:28,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920558289] [2022-11-25 23:36:28,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:36:28,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:36:28,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:36:28,678 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-11-25 23:36:28,679 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:36:28,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920558289] [2022-11-25 23:36:28,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920558289] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:36:28,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1806875963] [2022-11-25 23:36:28,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:36:28,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:36:28,680 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94242371-04b9-4a99-bf94-885615788746/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:36:28,687 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94242371-04b9-4a99-bf94-885615788746/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:36:28,742 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94242371-04b9-4a99-bf94-885615788746/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-25 23:36:29,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:36:29,015 INFO L263 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 75 conjunts are in the unsatisfiable core [2022-11-25 23:36:29,025 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:36:29,175 INFO L321 Elim1Store]: treesize reduction 30, result has 38.8 percent of original size [2022-11-25 23:36:29,176 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 78 [2022-11-25 23:36:29,202 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 23:36:29,202 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 1 case distinctions, treesize of input 9 treesize of output 15 [2022-11-25 23:36:29,213 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 10 treesize of output 9 [2022-11-25 23:36:29,225 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 16 treesize of output 15 [2022-11-25 23:36:29,266 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 46 treesize of output 19 [2022-11-25 23:36:29,272 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 13 treesize of output 9 [2022-11-25 23:36:46,478 WARN L233 SmtUtils]: Spent 10.86s on a formula simplification that was a NOOP. DAG size: 75 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 23:36:53,311 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 62 proven. 5 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-11-25 23:36:53,311 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:36:58,532 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2022-11-25 23:36:58,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1806875963] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:36:58,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1652275320] [2022-11-25 23:36:58,537 INFO L159 IcfgInterpreter]: Started Sifa with 47 locations of interest [2022-11-25 23:36:58,537 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:36:58,537 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:36:58,538 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:36:58,538 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:36:58,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:58,634 INFO L321 Elim1Store]: treesize reduction 30, result has 48.3 percent of original size [2022-11-25 23:36:58,634 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 50 [2022-11-25 23:36:58,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:58,715 INFO L321 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2022-11-25 23:36:58,715 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 12 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 37 treesize of output 61 [2022-11-25 23:36:58,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:58,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:58,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:58,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:58,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:58,987 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 0 case distinctions, treesize of input 62 treesize of output 77 [2022-11-25 23:36:59,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:59,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:59,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:59,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:59,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:59,021 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 0 case distinctions, treesize of input 62 treesize of output 77 [2022-11-25 23:36:59,053 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 24 treesize of output 9 [2022-11-25 23:36:59,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:59,086 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2022-11-25 23:36:59,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:59,157 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 28 [2022-11-25 23:36:59,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:59,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:59,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:59,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:59,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:59,185 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 101 [2022-11-25 23:36:59,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:59,219 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 35 treesize of output 7 [2022-11-25 23:36:59,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:59,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:59,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:59,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:59,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:59,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:59,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:59,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:59,252 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 99 [2022-11-25 23:36:59,793 INFO L197 IcfgInterpreter]: Interpreting procedure aws_linked_list_empty with input of size 130 for LOIs [2022-11-25 23:37:00,038 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 15 for LOIs [2022-11-25 23:37:00,040 INFO L197 IcfgInterpreter]: Interpreting procedure nondet_uint64_t with input of size 104 for LOIs [2022-11-25 23:37:00,065 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:37:06,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1652275320] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:37:06,058 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:37:06,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [6, 15, 8] total 36 [2022-11-25 23:37:06,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120624679] [2022-11-25 23:37:06,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:37:06,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-25 23:37:06,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:37:06,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-25 23:37:06,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=1098, Unknown=1, NotChecked=0, Total=1260 [2022-11-25 23:37:06,061 INFO L87 Difference]: Start difference. First operand 198 states and 265 transitions. Second operand has 13 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 5 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2022-11-25 23:37:09,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:37:09,454 INFO L93 Difference]: Finished difference Result 263 states and 343 transitions. [2022-11-25 23:37:09,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-25 23:37:09,454 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 5 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) Word has length 78 [2022-11-25 23:37:09,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:37:09,456 INFO L225 Difference]: With dead ends: 263 [2022-11-25 23:37:09,456 INFO L226 Difference]: Without dead ends: 124 [2022-11-25 23:37:09,457 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 180 SyntacticMatches, 24 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 531 ImplicationChecksByTransitivity, 25.9s TimeCoverageRelationStatistics Valid=167, Invalid=1164, Unknown=1, NotChecked=0, Total=1332 [2022-11-25 23:37:09,458 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 117 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 733 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 737 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:37:09,458 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 321 Invalid, 737 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 733 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-11-25 23:37:09,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-11-25 23:37:09,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 123. [2022-11-25 23:37:09,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 69 states have (on average 1.2028985507246377) internal successors, (83), 71 states have internal predecessors, (83), 39 states have call successors, (39), 13 states have call predecessors, (39), 14 states have return successors, (40), 38 states have call predecessors, (40), 38 states have call successors, (40) [2022-11-25 23:37:09,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 162 transitions. [2022-11-25 23:37:09,502 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 162 transitions. Word has length 78 [2022-11-25 23:37:09,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:37:09,503 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 162 transitions. [2022-11-25 23:37:09,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 5 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2022-11-25 23:37:09,503 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 162 transitions. [2022-11-25 23:37:09,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-11-25 23:37:09,505 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:37:09,505 INFO L195 NwaCegarLoop]: trace histogram [9, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:37:09,515 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94242371-04b9-4a99-bf94-885615788746/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-11-25 23:37:09,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94242371-04b9-4a99-bf94-885615788746/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:37:09,713 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:37:09,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:37:09,713 INFO L85 PathProgramCache]: Analyzing trace with hash 306134295, now seen corresponding path program 1 times [2022-11-25 23:37:09,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:37:09,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591912615] [2022-11-25 23:37:09,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:37:09,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:37:09,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:37:10,137 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2022-11-25 23:37:10,137 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:37:10,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591912615] [2022-11-25 23:37:10,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591912615] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:37:10,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1762039109] [2022-11-25 23:37:10,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:37:10,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:37:10,139 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94242371-04b9-4a99-bf94-885615788746/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:37:10,140 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94242371-04b9-4a99-bf94-885615788746/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:37:10,148 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94242371-04b9-4a99-bf94-885615788746/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-25 23:37:10,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:37:10,484 INFO L263 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 114 conjunts are in the unsatisfiable core [2022-11-25 23:37:10,493 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:37:10,508 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 23:37:10,743 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-11-25 23:37:10,794 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 23:37:10,795 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 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-25 23:37:10,803 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-25 23:37:10,819 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 23:37:10,819 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-25 23:37:10,903 INFO L321 Elim1Store]: treesize reduction 42, result has 20.8 percent of original size [2022-11-25 23:37:10,904 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 94 treesize of output 114 [2022-11-25 23:37:10,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:10,911 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 110 treesize of output 90 [2022-11-25 23:37:10,918 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-25 23:37:10,928 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2022-11-25 23:37:10,939 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 25 [2022-11-25 23:37:10,944 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 13 treesize of output 9 [2022-11-25 23:37:26,108 WARN L233 SmtUtils]: Spent 10.30s on a formula simplification that was a NOOP. DAG size: 80 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 23:37:34,588 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 45 proven. 23 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-11-25 23:37:34,588 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:37:39,780 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2022-11-25 23:37:39,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1762039109] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:37:39,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1113113470] [2022-11-25 23:37:39,784 INFO L159 IcfgInterpreter]: Started Sifa with 47 locations of interest [2022-11-25 23:37:39,784 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:37:39,787 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:37:39,788 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:37:39,790 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:37:39,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:39,888 INFO L321 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2022-11-25 23:37:39,890 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 12 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 37 treesize of output 61 [2022-11-25 23:37:39,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:39,918 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2022-11-25 23:37:40,208 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 24 treesize of output 9 [2022-11-25 23:37:40,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:40,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:40,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:40,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:40,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:40,239 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 0 case distinctions, treesize of input 62 treesize of output 77 [2022-11-25 23:37:40,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:40,273 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2022-11-25 23:37:40,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:40,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:40,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:40,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:40,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:40,301 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 0 case distinctions, treesize of input 62 treesize of output 77 [2022-11-25 23:37:40,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:40,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:40,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:40,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:40,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:40,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:40,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:40,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:40,381 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:37:40,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:40,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:40,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:40,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:40,389 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:37:40,409 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-25 23:37:40,409 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 16 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 103 [2022-11-25 23:37:40,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:40,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:40,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:40,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:40,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:40,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:40,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:40,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:40,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:40,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:40,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:40,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:40,454 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:37:40,478 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-25 23:37:40,478 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 16 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 103 [2022-11-25 23:37:40,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:40,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:40,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:40,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:40,528 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 28 [2022-11-25 23:37:40,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:40,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:40,655 INFO L321 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-11-25 23:37:40,656 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 8 case distinctions, treesize of input 42 treesize of output 73 [2022-11-25 23:37:40,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:40,697 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 7 [2022-11-25 23:37:40,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:40,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:40,723 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 17 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 46 [2022-11-25 23:37:40,795 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-11-25 23:37:40,816 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 9 [2022-11-25 23:37:40,844 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:37:40,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:40,847 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2022-11-25 23:37:40,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:40,878 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 13 [2022-11-25 23:37:40,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:40,902 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 23 [2022-11-25 23:37:40,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:40,928 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 19 [2022-11-25 23:37:40,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:40,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:40,978 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 19 [2022-11-25 23:37:40,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:40,997 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 29 treesize of output 17 [2022-11-25 23:37:41,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:41,024 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 35 treesize of output 7 [2022-11-25 23:37:41,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:41,049 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 35 treesize of output 7 [2022-11-25 23:37:45,304 INFO L197 IcfgInterpreter]: Interpreting procedure aws_linked_list_empty with input of size 109 for LOIs [2022-11-25 23:37:45,648 INFO L197 IcfgInterpreter]: Interpreting procedure aws_linked_list_is_valid with input of size 73 for LOIs [2022-11-25 23:37:46,125 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 15 for LOIs [2022-11-25 23:37:46,129 INFO L197 IcfgInterpreter]: Interpreting procedure nondet_uint64_t with input of size 104 for LOIs [2022-11-25 23:37:46,148 INFO L197 IcfgInterpreter]: Interpreting procedure aws_linked_list_node_next_is_valid with input of size 25 for LOIs [2022-11-25 23:37:46,216 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:37:58,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1113113470] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:37:58,313 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:37:58,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [6, 18, 8] total 55 [2022-11-25 23:37:58,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783340062] [2022-11-25 23:37:58,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:37:58,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-25 23:37:58,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:37:58,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-25 23:37:58,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=2740, Unknown=3, NotChecked=0, Total=2970 [2022-11-25 23:37:58,317 INFO L87 Difference]: Start difference. First operand 123 states and 162 transitions. Second operand has 28 states, 20 states have (on average 1.35) internal successors, (27), 16 states have internal predecessors, (27), 9 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (15), 9 states have call predecessors, (15), 9 states have call successors, (15) [2022-11-25 23:38:04,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:38:04,592 INFO L93 Difference]: Finished difference Result 218 states and 288 transitions. [2022-11-25 23:38:04,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-25 23:38:04,592 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 20 states have (on average 1.35) internal successors, (27), 16 states have internal predecessors, (27), 9 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (15), 9 states have call predecessors, (15), 9 states have call successors, (15) Word has length 79 [2022-11-25 23:38:04,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:38:04,594 INFO L225 Difference]: With dead ends: 218 [2022-11-25 23:38:04,594 INFO L226 Difference]: Without dead ends: 127 [2022-11-25 23:38:04,596 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 162 SyntacticMatches, 26 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1409 ImplicationChecksByTransitivity, 34.9s TimeCoverageRelationStatistics Valid=280, Invalid=3257, Unknown=3, NotChecked=0, Total=3540 [2022-11-25 23:38:04,597 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 107 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 1312 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 1351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-11-25 23:38:04,597 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 352 Invalid, 1351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1312 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2022-11-25 23:38:04,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-11-25 23:38:04,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2022-11-25 23:38:04,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 71 states have (on average 1.1971830985915493) internal successors, (85), 73 states have internal predecessors, (85), 40 states have call successors, (40), 14 states have call predecessors, (40), 15 states have return successors, (41), 39 states have call predecessors, (41), 39 states have call successors, (41) [2022-11-25 23:38:04,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 166 transitions. [2022-11-25 23:38:04,643 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 166 transitions. Word has length 79 [2022-11-25 23:38:04,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:38:04,644 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 166 transitions. [2022-11-25 23:38:04,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 20 states have (on average 1.35) internal successors, (27), 16 states have internal predecessors, (27), 9 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (15), 9 states have call predecessors, (15), 9 states have call successors, (15) [2022-11-25 23:38:04,644 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 166 transitions. [2022-11-25 23:38:04,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-11-25 23:38:04,646 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:38:04,646 INFO L195 NwaCegarLoop]: trace histogram [9, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:38:04,663 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94242371-04b9-4a99-bf94-885615788746/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-25 23:38:04,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94242371-04b9-4a99-bf94-885615788746/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:38:04,854 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:38:04,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:38:04,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1082961456, now seen corresponding path program 1 times [2022-11-25 23:38:04,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:38:04,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029506061] [2022-11-25 23:38:04,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:38:04,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:38:04,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:38:05,277 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-11-25 23:38:05,277 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:38:05,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029506061] [2022-11-25 23:38:05,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029506061] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:38:05,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1836493744] [2022-11-25 23:38:05,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:38:05,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:38:05,278 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94242371-04b9-4a99-bf94-885615788746/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:38:05,279 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94242371-04b9-4a99-bf94-885615788746/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:38:05,302 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94242371-04b9-4a99-bf94-885615788746/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-25 23:38:05,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:38:05,642 INFO L263 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 87 conjunts are in the unsatisfiable core [2022-11-25 23:38:05,648 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:38:05,659 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 23:38:05,842 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-11-25 23:38:05,859 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 23:38:05,860 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 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-25 23:38:05,870 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-25 23:38:05,887 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 23:38:05,887 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-25 23:38:05,959 INFO L321 Elim1Store]: treesize reduction 38, result has 22.4 percent of original size [2022-11-25 23:38:05,959 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 73 treesize of output 99 [2022-11-25 23:38:05,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:38:05,966 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 85 treesize of output 71 [2022-11-25 23:38:05,973 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 16 treesize of output 15 [2022-11-25 23:38:05,981 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 23 [2022-11-25 23:38:05,986 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 13 treesize of output 9 [2022-11-25 23:38:27,022 INFO L321 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2022-11-25 23:38:27,023 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 1 [2022-11-25 23:38:27,026 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 56 proven. 10 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-11-25 23:38:27,027 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:38:28,330 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_775 Int) (v_ArrVal_776 (Array Int Int)) (v_ArrVal_773 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_776) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_773) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) (+ |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 24) v_ArrVal_775)) |c_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base|) |c_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset|) 0))) is different from false [2022-11-25 23:38:28,344 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:38:28,344 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 33 [2022-11-25 23:38:28,365 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:38:28,366 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 154 treesize of output 156 [2022-11-25 23:38:28,374 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 144 treesize of output 140 [2022-11-25 23:38:28,382 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 140 treesize of output 138 [2022-11-25 23:38:28,503 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 6 treesize of output 4 [2022-11-25 23:38:28,508 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 24 treesize of output 22 [2022-11-25 23:38:28,547 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:38:28,547 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 61 [2022-11-25 23:38:30,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1836493744] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:38:30,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [709227510] [2022-11-25 23:38:30,971 INFO L159 IcfgInterpreter]: Started Sifa with 48 locations of interest [2022-11-25 23:38:30,972 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:38:30,972 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:38:30,972 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:38:30,973 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:38:31,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:38:31,082 INFO L321 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2022-11-25 23:38:31,082 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 12 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 37 treesize of output 61 [2022-11-25 23:38:31,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:38:31,109 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2022-11-25 23:38:31,382 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 24 treesize of output 9 [2022-11-25 23:38:31,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:38:31,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:38:31,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:38:31,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:38:31,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:38:31,410 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 0 case distinctions, treesize of input 62 treesize of output 77 [2022-11-25 23:38:31,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:38:31,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:38:31,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:38:31,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:38:31,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:38:31,439 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 0 case distinctions, treesize of input 62 treesize of output 77 [2022-11-25 23:38:31,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:38:31,474 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2022-11-25 23:38:31,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:38:31,528 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 7 [2022-11-25 23:38:31,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:38:31,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:38:31,611 INFO L321 Elim1Store]: treesize reduction 40, result has 48.1 percent of original size [2022-11-25 23:38:31,612 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 32 treesize of output 62 [2022-11-25 23:38:31,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:38:31,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:38:31,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:38:31,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:38:31,651 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 28 [2022-11-25 23:38:31,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:38:31,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:38:31,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:38:31,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:38:31,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:38:31,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:38:31,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:38:31,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:38:31,685 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:38:31,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:38:31,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:38:31,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:38:31,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:38:31,691 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:38:31,713 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-25 23:38:31,713 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 16 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 103 [2022-11-25 23:38:31,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:38:31,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:38:31,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:38:31,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:38:31,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:38:31,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:38:31,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:38:31,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:38:31,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:38:31,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:38:31,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:38:31,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:38:31,765 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:38:31,787 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-25 23:38:31,788 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 16 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 103 [2022-11-25 23:38:31,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:38:31,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:38:31,911 INFO L321 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-11-25 23:38:31,912 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 8 case distinctions, treesize of input 42 treesize of output 73 [2022-11-25 23:38:31,979 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-11-25 23:38:31,992 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 9 [2022-11-25 23:38:32,028 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:38:32,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:38:32,031 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2022-11-25 23:38:32,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:38:32,066 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 13 [2022-11-25 23:38:32,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:38:32,096 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 13 [2022-11-25 23:38:32,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:38:32,114 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 23 [2022-11-25 23:38:32,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:38:32,168 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 29 treesize of output 17 [2022-11-25 23:38:32,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:38:32,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:38:32,184 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 19 [2022-11-25 23:38:32,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:38:32,214 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 35 treesize of output 7 [2022-11-25 23:38:32,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:38:32,237 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 35 treesize of output 7 [2022-11-25 23:38:36,820 INFO L197 IcfgInterpreter]: Interpreting procedure aws_linked_list_empty with input of size 109 for LOIs [2022-11-25 23:38:37,142 INFO L197 IcfgInterpreter]: Interpreting procedure aws_linked_list_is_valid with input of size 96 for LOIs [2022-11-25 23:38:38,141 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 15 for LOIs [2022-11-25 23:38:38,143 INFO L197 IcfgInterpreter]: Interpreting procedure nondet_uint64_t with input of size 104 for LOIs [2022-11-25 23:38:38,165 INFO L197 IcfgInterpreter]: Interpreting procedure aws_linked_list_node_next_is_valid with input of size 20 for LOIs [2022-11-25 23:38:38,240 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:38:54,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [709227510] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:38:54,712 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-25 23:38:54,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [7, 13] total 45 [2022-11-25 23:38:54,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029921410] [2022-11-25 23:38:54,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:38:54,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-25 23:38:54,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:38:54,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-25 23:38:54,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=2644, Unknown=5, NotChecked=104, Total=2970 [2022-11-25 23:38:54,716 INFO L87 Difference]: Start difference. First operand 127 states and 166 transitions. Second operand has 28 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 17 states have internal predecessors, (29), 9 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (15), 9 states have call predecessors, (15), 9 states have call successors, (15) [2022-11-25 23:39:03,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:39:03,625 INFO L93 Difference]: Finished difference Result 222 states and 291 transitions. [2022-11-25 23:39:03,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-25 23:39:03,626 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 17 states have internal predecessors, (29), 9 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (15), 9 states have call predecessors, (15), 9 states have call successors, (15) Word has length 81 [2022-11-25 23:39:03,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:39:03,627 INFO L225 Difference]: With dead ends: 222 [2022-11-25 23:39:03,628 INFO L226 Difference]: Without dead ends: 130 [2022-11-25 23:39:03,629 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 173 SyntacticMatches, 16 SemanticMatches, 61 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1232 ImplicationChecksByTransitivity, 44.5s TimeCoverageRelationStatistics Valid=317, Invalid=3464, Unknown=5, NotChecked=120, Total=3906 [2022-11-25 23:39:03,630 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 100 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 1510 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 1549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:39:03,630 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 388 Invalid, 1549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1510 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2022-11-25 23:39:03,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-11-25 23:39:03,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 127. [2022-11-25 23:39:03,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 71 states have (on average 1.1830985915492958) internal successors, (84), 73 states have internal predecessors, (84), 40 states have call successors, (40), 14 states have call predecessors, (40), 15 states have return successors, (41), 39 states have call predecessors, (41), 39 states have call successors, (41) [2022-11-25 23:39:03,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 165 transitions. [2022-11-25 23:39:03,676 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 165 transitions. Word has length 81 [2022-11-25 23:39:03,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:39:03,677 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 165 transitions. [2022-11-25 23:39:03,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 17 states have internal predecessors, (29), 9 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (15), 9 states have call predecessors, (15), 9 states have call successors, (15) [2022-11-25 23:39:03,678 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 165 transitions. [2022-11-25 23:39:03,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-11-25 23:39:03,679 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:39:03,679 INFO L195 NwaCegarLoop]: trace histogram [9, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:39:03,693 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94242371-04b9-4a99-bf94-885615788746/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-11-25 23:39:03,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94242371-04b9-4a99-bf94-885615788746/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:39:03,887 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:39:03,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:39:03,888 INFO L85 PathProgramCache]: Analyzing trace with hash 347930842, now seen corresponding path program 1 times [2022-11-25 23:39:03,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:39:03,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246581723] [2022-11-25 23:39:03,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:39:03,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:39:04,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:39:04,300 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2022-11-25 23:39:04,301 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:39:04,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246581723] [2022-11-25 23:39:04,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246581723] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:39:04,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [694291155] [2022-11-25 23:39:04,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:39:04,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:39:04,302 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94242371-04b9-4a99-bf94-885615788746/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:39:04,303 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94242371-04b9-4a99-bf94-885615788746/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:39:04,322 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94242371-04b9-4a99-bf94-885615788746/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-25 23:39:04,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:39:04,675 INFO L263 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 64 conjunts are in the unsatisfiable core [2022-11-25 23:39:04,683 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:39:04,694 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 23:39:04,879 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 23:39:04,880 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-25 23:39:04,887 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-25 23:39:04,891 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-25 23:39:04,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:39:04,930 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 24 treesize of output 21 [2022-11-25 23:39:04,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:39:04,935 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 20 [2022-11-25 23:39:05,572 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 56 proven. 11 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-11-25 23:39:05,572 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:39:06,086 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:39:06,086 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 1 case distinctions, treesize of input 42 treesize of output 35 [2022-11-25 23:39:06,109 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:39:06,110 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 133 treesize of output 149 [2022-11-25 23:39:06,117 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 148 treesize of output 144 [2022-11-25 23:39:06,125 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 144 treesize of output 142 [2022-11-25 23:39:06,199 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 6 treesize of output 4 [2022-11-25 23:39:06,226 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:39:06,227 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 65 [2022-11-25 23:39:06,233 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 48 treesize of output 46 [2022-11-25 23:39:06,270 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:39:06,271 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2022-11-25 23:39:06,293 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:39:06,293 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 72 [2022-11-25 23:39:06,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [694291155] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:39:06,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [105186636] [2022-11-25 23:39:06,923 INFO L159 IcfgInterpreter]: Started Sifa with 48 locations of interest [2022-11-25 23:39:06,923 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:39:06,924 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:39:06,924 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:39:06,924 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:39:06,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:39:07,018 INFO L321 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2022-11-25 23:39:07,018 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 12 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 37 treesize of output 61 [2022-11-25 23:39:07,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:39:07,040 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2022-11-25 23:39:07,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:39:07,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:39:07,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:39:07,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:39:07,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:39:07,310 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 0 case distinctions, treesize of input 62 treesize of output 77 [2022-11-25 23:39:07,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:39:07,349 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2022-11-25 23:39:07,374 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 24 treesize of output 9 [2022-11-25 23:39:07,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:39:07,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:39:07,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:39:07,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:39:07,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:39:07,397 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 0 case distinctions, treesize of input 62 treesize of output 77 [2022-11-25 23:39:07,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:39:07,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:39:07,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:39:07,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:39:07,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:39:07,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:39:07,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:39:07,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:39:07,457 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:39:07,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:39:07,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:39:07,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:39:07,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:39:07,464 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:39:07,483 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-25 23:39:07,483 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 16 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 103 [2022-11-25 23:39:07,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:39:07,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:39:07,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:39:07,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:39:07,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:39:07,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:39:07,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:39:07,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:39:07,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:39:07,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:39:07,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:39:07,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:39:07,527 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:39:07,548 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-25 23:39:07,549 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 16 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 103 [2022-11-25 23:39:07,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:39:07,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:39:07,661 INFO L321 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-11-25 23:39:07,662 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 8 case distinctions, treesize of input 42 treesize of output 73 [2022-11-25 23:39:07,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:39:07,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:39:07,698 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 17 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 46 [2022-11-25 23:39:07,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:39:07,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:39:07,742 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 28 [2022-11-25 23:39:07,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:39:07,779 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 7 [2022-11-25 23:39:07,845 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 9 [2022-11-25 23:39:07,874 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:39:07,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:39:07,877 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2022-11-25 23:39:07,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:39:07,899 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 23 [2022-11-25 23:39:07,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:39:07,923 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 19 [2022-11-25 23:39:07,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:39:07,947 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 19 [2022-11-25 23:39:07,965 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-11-25 23:39:07,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:39:07,999 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 29 treesize of output 17 [2022-11-25 23:39:08,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:39:08,019 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 35 treesize of output 7 [2022-11-25 23:39:08,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:39:08,041 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 35 treesize of output 7 [2022-11-25 23:39:08,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:39:08,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:39:08,067 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 19 [2022-11-25 23:39:19,520 INFO L197 IcfgInterpreter]: Interpreting procedure aws_linked_list_empty with input of size 19 for LOIs [2022-11-25 23:39:19,550 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 74 for LOIs [2022-11-25 23:39:19,588 INFO L197 IcfgInterpreter]: Interpreting procedure aws_linked_list_is_valid with input of size 19 for LOIs [2022-11-25 23:39:20,366 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 15 for LOIs [2022-11-25 23:39:20,368 INFO L197 IcfgInterpreter]: Interpreting procedure nondet_uint64_t with input of size 104 for LOIs [2022-11-25 23:39:20,387 INFO L197 IcfgInterpreter]: Interpreting procedure aws_linked_list_node_next_is_valid with input of size 20 for LOIs [2022-11-25 23:39:20,456 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:39:47,761 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '9051#(and (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_96| Int)) (and (<= 0 (ite (= (ite (and (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_96| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_96|) 0)) (= 16 (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_96|) 0))) 1 0) 0) 0 1)) (<= 0 |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_96|) (not (= (mod (ite (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_96| 0) 0 1) 256) 0)) (not (= (mod (ite (= (ite (= (mod (ite (= (ite (and (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_96| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_96|) 0)) (= 16 (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_96|) 0))) 1 0) 0) 0 1) 256) 0) 1 0) 0) 0 1) 256) 0)) (<= (ite (= (ite (and (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_96| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_96|) 0)) (= 16 (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_96|) 0))) 1 0) 0) 0 1) 1))) (<= 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) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_BEFORE_CALL_123| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base_BEFORE_CALL_123| Int)) (and (<= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base_BEFORE_CALL_123|) (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_BEFORE_CALL_123| 24)) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base_BEFORE_CALL_123|) (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_BEFORE_CALL_123| 24))) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base_BEFORE_CALL_123|) (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_BEFORE_CALL_123| 24))) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base_BEFORE_CALL_123|) (<= 0 (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base_BEFORE_CALL_123|) (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_BEFORE_CALL_123| 24))) (<= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_BEFORE_CALL_123| 0) (= (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_BEFORE_CALL_123| 16) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base_BEFORE_CALL_123|) (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_BEFORE_CALL_123| 24))) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base_BEFORE_CALL_123|) (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_BEFORE_CALL_123| 24)))) (<= 0 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base_BEFORE_CALL_123|) (<= 0 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_BEFORE_CALL_123|))) (= |__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-25 23:39:47,761 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-25 23:39:47,762 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 23:39:47,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 13] total 17 [2022-11-25 23:39:47,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184294819] [2022-11-25 23:39:47,762 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 23:39:47,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-25 23:39:47,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:39:47,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-25 23:39:47,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=268, Invalid=3632, Unknown=6, NotChecked=0, Total=3906 [2022-11-25 23:39:47,765 INFO L87 Difference]: Start difference. First operand 127 states and 165 transitions. Second operand has 17 states, 15 states have (on average 4.2) internal successors, (63), 16 states have internal predecessors, (63), 8 states have call successors, (32), 4 states have call predecessors, (32), 7 states have return successors, (31), 8 states have call predecessors, (31), 8 states have call successors, (31) [2022-11-25 23:39:50,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:39:50,727 INFO L93 Difference]: Finished difference Result 278 states and 364 transitions. [2022-11-25 23:39:50,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-25 23:39:50,727 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 4.2) internal successors, (63), 16 states have internal predecessors, (63), 8 states have call successors, (32), 4 states have call predecessors, (32), 7 states have return successors, (31), 8 states have call predecessors, (31), 8 states have call successors, (31) Word has length 82 [2022-11-25 23:39:50,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:39:50,729 INFO L225 Difference]: With dead ends: 278 [2022-11-25 23:39:50,729 INFO L226 Difference]: Without dead ends: 181 [2022-11-25 23:39:50,732 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 169 SyntacticMatches, 18 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2121 ImplicationChecksByTransitivity, 29.2s TimeCoverageRelationStatistics Valid=399, Invalid=5295, Unknown=6, NotChecked=0, Total=5700 [2022-11-25 23:39:50,733 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 201 mSDsluCounter, 594 mSDsCounter, 0 mSdLazyCounter, 1156 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 1303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 1156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-11-25 23:39:50,733 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 671 Invalid, 1303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 1156 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-11-25 23:39:50,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2022-11-25 23:39:50,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 148. [2022-11-25 23:39:50,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 87 states have (on average 1.206896551724138) internal successors, (105), 89 states have internal predecessors, (105), 41 states have call successors, (41), 18 states have call predecessors, (41), 19 states have return successors, (41), 40 states have call predecessors, (41), 40 states have call successors, (41) [2022-11-25 23:39:50,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 187 transitions. [2022-11-25 23:39:50,787 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 187 transitions. Word has length 82 [2022-11-25 23:39:50,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:39:50,788 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 187 transitions. [2022-11-25 23:39:50,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 4.2) internal successors, (63), 16 states have internal predecessors, (63), 8 states have call successors, (32), 4 states have call predecessors, (32), 7 states have return successors, (31), 8 states have call predecessors, (31), 8 states have call successors, (31) [2022-11-25 23:39:50,789 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 187 transitions. [2022-11-25 23:39:50,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-11-25 23:39:50,790 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:39:50,790 INFO L195 NwaCegarLoop]: trace histogram [9, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:39:50,798 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94242371-04b9-4a99-bf94-885615788746/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-11-25 23:39:50,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94242371-04b9-4a99-bf94-885615788746/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:39:50,998 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:39:50,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:39:50,999 INFO L85 PathProgramCache]: Analyzing trace with hash 612279792, now seen corresponding path program 1 times [2022-11-25 23:39:50,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:39:50,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136510892] [2022-11-25 23:39:50,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:39:50,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:39:51,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:39:51,427 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2022-11-25 23:39:51,428 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:39:51,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136510892] [2022-11-25 23:39:51,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136510892] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:39:51,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1236178114] [2022-11-25 23:39:51,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:39:51,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:39:51,429 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94242371-04b9-4a99-bf94-885615788746/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:39:51,430 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94242371-04b9-4a99-bf94-885615788746/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:39:51,467 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94242371-04b9-4a99-bf94-885615788746/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-25 23:39:51,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:39:51,837 INFO L263 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-25 23:39:51,841 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:39:51,974 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-11-25 23:39:51,975 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 23:39:51,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1236178114] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:39:51,975 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 23:39:51,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 14 [2022-11-25 23:39:51,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991431185] [2022-11-25 23:39:51,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:39:51,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 23:39:51,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:39:51,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 23:39:51,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2022-11-25 23:39:51,977 INFO L87 Difference]: Start difference. First operand 148 states and 187 transitions. Second operand has 8 states, 7 states have (on average 5.428571428571429) internal successors, (38), 8 states have internal predecessors, (38), 5 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 4 states have call predecessors, (16), 5 states have call successors, (16) [2022-11-25 23:39:52,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:39:52,417 INFO L93 Difference]: Finished difference Result 257 states and 327 transitions. [2022-11-25 23:39:52,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 23:39:52,417 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.428571428571429) internal successors, (38), 8 states have internal predecessors, (38), 5 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 4 states have call predecessors, (16), 5 states have call successors, (16) Word has length 87 [2022-11-25 23:39:52,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:39:52,419 INFO L225 Difference]: With dead ends: 257 [2022-11-25 23:39:52,419 INFO L226 Difference]: Without dead ends: 150 [2022-11-25 23:39:52,420 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2022-11-25 23:39:52,420 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 59 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 23:39:52,421 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 573 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 23:39:52,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-11-25 23:39:52,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 148. [2022-11-25 23:39:52,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 87 states have (on average 1.1954022988505748) internal successors, (104), 89 states have internal predecessors, (104), 41 states have call successors, (41), 18 states have call predecessors, (41), 19 states have return successors, (41), 40 states have call predecessors, (41), 40 states have call successors, (41) [2022-11-25 23:39:52,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 186 transitions. [2022-11-25 23:39:52,481 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 186 transitions. Word has length 87 [2022-11-25 23:39:52,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:39:52,482 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 186 transitions. [2022-11-25 23:39:52,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.428571428571429) internal successors, (38), 8 states have internal predecessors, (38), 5 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 4 states have call predecessors, (16), 5 states have call successors, (16) [2022-11-25 23:39:52,482 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 186 transitions. [2022-11-25 23:39:52,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-11-25 23:39:52,483 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:39:52,484 INFO L195 NwaCegarLoop]: trace histogram [9, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:39:52,496 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94242371-04b9-4a99-bf94-885615788746/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-25 23:39:52,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94242371-04b9-4a99-bf94-885615788746/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:39:52,691 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:39:52,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:39:52,691 INFO L85 PathProgramCache]: Analyzing trace with hash 229903191, now seen corresponding path program 1 times [2022-11-25 23:39:52,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:39:52,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433672621] [2022-11-25 23:39:52,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:39:52,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:39:52,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:39:53,109 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2022-11-25 23:39:53,110 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:39:53,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433672621] [2022-11-25 23:39:53,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433672621] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:39:53,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1137782179] [2022-11-25 23:39:53,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:39:53,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:39:53,111 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94242371-04b9-4a99-bf94-885615788746/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:39:53,112 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94242371-04b9-4a99-bf94-885615788746/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:39:53,144 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94242371-04b9-4a99-bf94-885615788746/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-25 23:39:53,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:39:53,526 INFO L263 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-25 23:39:53,529 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:39:53,686 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-11-25 23:39:53,686 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 23:39:53,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1137782179] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:39:53,687 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 23:39:53,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 16 [2022-11-25 23:39:53,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715641895] [2022-11-25 23:39:53,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:39:53,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 23:39:53,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:39:53,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 23:39:53,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2022-11-25 23:39:53,688 INFO L87 Difference]: Start difference. First operand 148 states and 186 transitions. Second operand has 9 states, 8 states have (on average 5.0) internal successors, (40), 9 states have internal predecessors, (40), 5 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 4 states have call predecessors, (16), 5 states have call successors, (16) [2022-11-25 23:39:54,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:39:54,225 INFO L93 Difference]: Finished difference Result 273 states and 347 transitions. [2022-11-25 23:39:54,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 23:39:54,226 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.0) internal successors, (40), 9 states have internal predecessors, (40), 5 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 4 states have call predecessors, (16), 5 states have call successors, (16) Word has length 89 [2022-11-25 23:39:54,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:39:54,227 INFO L225 Difference]: With dead ends: 273 [2022-11-25 23:39:54,227 INFO L226 Difference]: Without dead ends: 165 [2022-11-25 23:39:54,228 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=351, Unknown=0, NotChecked=0, Total=420 [2022-11-25 23:39:54,229 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 74 mSDsluCounter, 563 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 667 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 23:39:54,229 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 667 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 23:39:54,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-11-25 23:39:54,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 148. [2022-11-25 23:39:54,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 87 states have (on average 1.1839080459770115) internal successors, (103), 89 states have internal predecessors, (103), 41 states have call successors, (41), 18 states have call predecessors, (41), 19 states have return successors, (41), 40 states have call predecessors, (41), 40 states have call successors, (41) [2022-11-25 23:39:54,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 185 transitions. [2022-11-25 23:39:54,288 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 185 transitions. Word has length 89 [2022-11-25 23:39:54,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:39:54,288 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 185 transitions. [2022-11-25 23:39:54,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.0) internal successors, (40), 9 states have internal predecessors, (40), 5 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 4 states have call predecessors, (16), 5 states have call successors, (16) [2022-11-25 23:39:54,289 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 185 transitions. [2022-11-25 23:39:54,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-11-25 23:39:54,290 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:39:54,290 INFO L195 NwaCegarLoop]: trace histogram [9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:39:54,304 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94242371-04b9-4a99-bf94-885615788746/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-25 23:39:54,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94242371-04b9-4a99-bf94-885615788746/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:39:54,498 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:39:54,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:39:54,499 INFO L85 PathProgramCache]: Analyzing trace with hash 2142124211, now seen corresponding path program 1 times [2022-11-25 23:39:54,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:39:54,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476196796] [2022-11-25 23:39:54,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:39:54,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:39:54,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:39:54,877 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2022-11-25 23:39:54,877 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:39:54,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476196796] [2022-11-25 23:39:54,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476196796] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:39:54,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [30493822] [2022-11-25 23:39:54,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:39:54,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:39:54,878 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94242371-04b9-4a99-bf94-885615788746/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:39:54,879 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94242371-04b9-4a99-bf94-885615788746/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:39:54,889 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94242371-04b9-4a99-bf94-885615788746/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-25 23:39:55,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:39:55,345 INFO L263 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 107 conjunts are in the unsatisfiable core [2022-11-25 23:39:55,353 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:39:55,376 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 23:39:55,628 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 23:39:55,629 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-25 23:39:55,641 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-11-25 23:39:55,645 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 23:39:55,712 INFO L321 Elim1Store]: treesize reduction 42, result has 20.8 percent of original size [2022-11-25 23:39:55,712 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 81 treesize of output 103 [2022-11-25 23:39:55,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:39:55,721 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 99 treesize of output 81 [2022-11-25 23:39:55,730 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2022-11-25 23:39:55,843 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_DerPreprocessor_40 (Array Int Int)) (v_DerPreprocessor_39 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_173| Int)) (let ((.cse1 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_173|))) (let ((.cse0 (select .cse1 0))) (and (= .cse0 (select v_DerPreprocessor_40 24)) (not (= .cse0 0)) (not (= .cse0 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_173|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_173|) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse0 v_DerPreprocessor_39) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_173| v_DerPreprocessor_40) .cse0 v_DerPreprocessor_39) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_173| v_DerPreprocessor_40) .cse0) (select |c_#memory_$Pointer$.base| .cse0)) (= .cse0 (select .cse1 24)))))) is different from true [2022-11-25 23:39:56,110 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_DerPreprocessor_41 (Array Int Int)) (v_DerPreprocessor_42 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_173| Int)) (let ((.cse1 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_173|))) (let ((.cse0 (select .cse1 0))) (and (not (= .cse0 0)) (not (= .cse0 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_173|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_173|) (= .cse0 (select v_DerPreprocessor_41 24)) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse0 v_DerPreprocessor_42) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_173| v_DerPreprocessor_41) .cse0 v_DerPreprocessor_42) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_173| v_DerPreprocessor_41) .cse0) (select |c_#memory_$Pointer$.base| .cse0)) (= .cse0 (select .cse1 24)))))) (exists ((v_DerPreprocessor_40 (Array Int Int)) (v_DerPreprocessor_39 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_174| Int)) (let ((.cse2 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_174|))) (let ((.cse3 (select .cse2 0))) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_174|) (= (select .cse2 24) .cse3) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse3 v_DerPreprocessor_39) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_174| v_DerPreprocessor_40) .cse3 v_DerPreprocessor_39) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_174| v_DerPreprocessor_40) .cse3) (select |c_#memory_$Pointer$.base| .cse3)) (not (= .cse3 0)) (= .cse3 (select v_DerPreprocessor_40 24)) (not (= .cse3 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_174|))))))) is different from true [2022-11-25 23:39:56,713 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_DerPreprocessor_41 (Array Int Int)) (v_DerPreprocessor_42 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_173| Int)) (let ((.cse1 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_173|))) (let ((.cse0 (select .cse1 0))) (and (not (= .cse0 0)) (not (= .cse0 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_173|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_173|) (= .cse0 (select v_DerPreprocessor_41 24)) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse0 v_DerPreprocessor_42) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_173| v_DerPreprocessor_41) .cse0 v_DerPreprocessor_42) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_173| v_DerPreprocessor_41) .cse0) (select |c_#memory_$Pointer$.base| .cse0)) (= .cse0 (select .cse1 24)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_175| Int) (v_DerPreprocessor_43 (Array Int Int)) (v_DerPreprocessor_44 (Array Int Int))) (let ((.cse3 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_175|))) (let ((.cse2 (select .cse3 0))) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_175|) (not (= .cse2 0)) (= .cse2 (select .cse3 24)) (not (= .cse2 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_175|)) (= (select |c_#memory_$Pointer$.base| .cse2) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse2 v_DerPreprocessor_44) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_175| v_DerPreprocessor_43) .cse2 v_DerPreprocessor_44) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_175| v_DerPreprocessor_43) .cse2)) (= .cse2 (select v_DerPreprocessor_43 24)))))) (exists ((v_DerPreprocessor_40 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_114| Int) (v_DerPreprocessor_39 (Array Int Int))) (let ((.cse5 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_114|))) (let ((.cse4 (select .cse5 0))) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_114|) (not (= .cse4 |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_114|)) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse4 v_DerPreprocessor_39) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_114| v_DerPreprocessor_40) .cse4 v_DerPreprocessor_39) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_114| v_DerPreprocessor_40) .cse4) (select |c_#memory_$Pointer$.base| .cse4)) (= .cse4 (select .cse5 24)) (not (= .cse4 0)) (= .cse4 (select v_DerPreprocessor_40 24)))))) (exists ((v_DerPreprocessor_45 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_174| Int) (v_DerPreprocessor_46 (Array Int Int))) (let ((.cse7 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_174|))) (let ((.cse6 (select .cse7 0))) (and (= (select |c_#memory_$Pointer$.base| .cse6) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse6 v_DerPreprocessor_46) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_174| v_DerPreprocessor_45) .cse6 v_DerPreprocessor_46) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_174| v_DerPreprocessor_45) .cse6)) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_174|) (= (select .cse7 24) .cse6) (not (= .cse6 0)) (not (= .cse6 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_174|)) (= .cse6 (select v_DerPreprocessor_45 24))))))) is different from true [2022-11-25 23:39:57,571 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_DerPreprocessor_41 (Array Int Int)) (v_DerPreprocessor_42 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_173| Int)) (let ((.cse1 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_173|))) (let ((.cse0 (select .cse1 0))) (and (not (= .cse0 0)) (not (= .cse0 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_173|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_173|) (= .cse0 (select v_DerPreprocessor_41 24)) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse0 v_DerPreprocessor_42) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_173| v_DerPreprocessor_41) .cse0 v_DerPreprocessor_42) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_173| v_DerPreprocessor_41) .cse0) (select |c_#memory_$Pointer$.base| .cse0)) (= .cse0 (select .cse1 24)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_175| Int) (v_DerPreprocessor_43 (Array Int Int)) (v_DerPreprocessor_44 (Array Int Int))) (let ((.cse3 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_175|))) (let ((.cse2 (select .cse3 0))) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_175|) (not (= .cse2 0)) (= .cse2 (select .cse3 24)) (not (= .cse2 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_175|)) (= (select |c_#memory_$Pointer$.base| .cse2) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse2 v_DerPreprocessor_44) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_175| v_DerPreprocessor_43) .cse2 v_DerPreprocessor_44) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_175| v_DerPreprocessor_43) .cse2)) (= .cse2 (select v_DerPreprocessor_43 24)))))) (exists ((v_DerPreprocessor_45 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_174| Int) (v_DerPreprocessor_46 (Array Int Int))) (let ((.cse5 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_174|))) (let ((.cse4 (select .cse5 0))) (and (= (select |c_#memory_$Pointer$.base| .cse4) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse4 v_DerPreprocessor_46) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_174| v_DerPreprocessor_45) .cse4 v_DerPreprocessor_46) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_174| v_DerPreprocessor_45) .cse4)) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_174|) (= (select .cse5 24) .cse4) (not (= .cse4 0)) (not (= .cse4 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_174|)) (= .cse4 (select v_DerPreprocessor_45 24)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_114| Int) (v_DerPreprocessor_48 (Array Int Int)) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse7 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_114|))) (let ((.cse6 (select .cse7 0))) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_114|) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse6 v_DerPreprocessor_48) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_114| v_DerPreprocessor_47) .cse6 v_DerPreprocessor_48) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_114| v_DerPreprocessor_47) .cse6) (select |c_#memory_$Pointer$.base| .cse6)) (not (= .cse6 |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_114|)) (= .cse6 (select v_DerPreprocessor_47 24)) (= .cse6 (select .cse7 24)) (not (= .cse6 0)))))) (exists ((v_DerPreprocessor_40 (Array Int Int)) (v_DerPreprocessor_39 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_115| Int)) (let ((.cse8 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_115|))) (let ((.cse9 (select .cse8 0))) (and (= (select .cse8 24) .cse9) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse9 v_DerPreprocessor_39) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_115| v_DerPreprocessor_40) .cse9 v_DerPreprocessor_39) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_115| v_DerPreprocessor_40) .cse9) (select |c_#memory_$Pointer$.base| .cse9)) (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_115| .cse9)) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_115|) (= (select v_DerPreprocessor_40 24) .cse9) (not (= .cse9 0))))))) is different from true [2022-11-25 23:39:58,432 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_DerPreprocessor_41 (Array Int Int)) (v_DerPreprocessor_42 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_173| Int)) (let ((.cse1 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_173|))) (let ((.cse0 (select .cse1 0))) (and (not (= .cse0 0)) (not (= .cse0 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_173|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_173|) (= .cse0 (select v_DerPreprocessor_41 24)) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse0 v_DerPreprocessor_42) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_173| v_DerPreprocessor_41) .cse0 v_DerPreprocessor_42) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_173| v_DerPreprocessor_41) .cse0) (select |c_#memory_$Pointer$.base| .cse0)) (= .cse0 (select .cse1 24)))))) (exists ((v_DerPreprocessor_40 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_117| Int) (v_DerPreprocessor_39 (Array Int Int))) (let ((.cse3 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_117|))) (let ((.cse2 (select .cse3 0))) (and (not (= .cse2 |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_117|)) (= .cse2 (select .cse3 24)) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_117|) (= (select v_DerPreprocessor_40 24) .cse2) (not (= .cse2 0)) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse2 v_DerPreprocessor_39) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_117| v_DerPreprocessor_40) .cse2 v_DerPreprocessor_39) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_117| v_DerPreprocessor_40) .cse2) (select |c_#memory_$Pointer$.base| .cse2)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_175| Int) (v_DerPreprocessor_43 (Array Int Int)) (v_DerPreprocessor_44 (Array Int Int))) (let ((.cse5 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_175|))) (let ((.cse4 (select .cse5 0))) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_175|) (not (= .cse4 0)) (= .cse4 (select .cse5 24)) (not (= .cse4 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_175|)) (= (select |c_#memory_$Pointer$.base| .cse4) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse4 v_DerPreprocessor_44) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_175| v_DerPreprocessor_43) .cse4 v_DerPreprocessor_44) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_175| v_DerPreprocessor_43) .cse4)) (= .cse4 (select v_DerPreprocessor_43 24)))))) (exists ((v_DerPreprocessor_50 (Array Int Int)) (v_DerPreprocessor_49 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_116| Int)) (let ((.cse7 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_116|))) (let ((.cse6 (select .cse7 0))) (and (not (= .cse6 |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_116|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_116|) (= (select |c_#memory_$Pointer$.base| .cse6) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse6 v_DerPreprocessor_50) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_116| v_DerPreprocessor_49) .cse6 v_DerPreprocessor_50) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_116| v_DerPreprocessor_49) .cse6)) (not (= .cse6 0)) (= (select v_DerPreprocessor_49 24) .cse6) (= (select .cse7 24) .cse6))))) (exists ((v_DerPreprocessor_45 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_174| Int) (v_DerPreprocessor_46 (Array Int Int))) (let ((.cse9 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_174|))) (let ((.cse8 (select .cse9 0))) (and (= (select |c_#memory_$Pointer$.base| .cse8) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse8 v_DerPreprocessor_46) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_174| v_DerPreprocessor_45) .cse8 v_DerPreprocessor_46) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_174| v_DerPreprocessor_45) .cse8)) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_174|) (= (select .cse9 24) .cse8) (not (= .cse8 0)) (not (= .cse8 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_174|)) (= .cse8 (select v_DerPreprocessor_45 24)))))) (exists ((v_DerPreprocessor_51 (Array Int Int)) (v_DerPreprocessor_52 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_115| Int)) (let ((.cse10 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_115|))) (let ((.cse11 (select .cse10 0))) (and (= (select .cse10 24) .cse11) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse11 v_DerPreprocessor_52) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_115| v_DerPreprocessor_51) .cse11 v_DerPreprocessor_52) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_115| v_DerPreprocessor_51) .cse11) (select |c_#memory_$Pointer$.base| .cse11)) (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_115| .cse11)) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_115|) (not (= .cse11 0)) (= .cse11 (select v_DerPreprocessor_51 24)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_114| Int) (v_DerPreprocessor_48 (Array Int Int)) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse13 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_114|))) (let ((.cse12 (select .cse13 0))) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_114|) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse12 v_DerPreprocessor_48) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_114| v_DerPreprocessor_47) .cse12 v_DerPreprocessor_48) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_114| v_DerPreprocessor_47) .cse12) (select |c_#memory_$Pointer$.base| .cse12)) (not (= .cse12 |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_114|)) (= .cse12 (select v_DerPreprocessor_47 24)) (= .cse12 (select .cse13 24)) (not (= .cse12 0))))))) is different from true [2022-11-25 23:40:56,317 WARN L233 SmtUtils]: Spent 38.19s on a formula simplification that was a NOOP. DAG size: 229 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 23:41:44,390 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_DerPreprocessor_41 (Array Int Int)) (v_DerPreprocessor_42 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_173| Int)) (let ((.cse1 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_173|))) (let ((.cse0 (select .cse1 0))) (and (not (= .cse0 0)) (not (= .cse0 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_173|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_173|) (= .cse0 (select v_DerPreprocessor_41 24)) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse0 v_DerPreprocessor_42) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_173| v_DerPreprocessor_41) .cse0 v_DerPreprocessor_42) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_173| v_DerPreprocessor_41) .cse0) (select |c_#memory_$Pointer$.base| .cse0)) (= .cse0 (select .cse1 24)))))) (exists ((v_DerPreprocessor_40 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_117| Int) (v_DerPreprocessor_39 (Array Int Int))) (let ((.cse3 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_117|))) (let ((.cse2 (select .cse3 0))) (and (not (= .cse2 |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_117|)) (= .cse2 (select .cse3 24)) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_117|) (= (select v_DerPreprocessor_40 24) .cse2) (not (= .cse2 0)) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse2 v_DerPreprocessor_39) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_117| v_DerPreprocessor_40) .cse2 v_DerPreprocessor_39) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_117| v_DerPreprocessor_40) .cse2) (select |c_#memory_$Pointer$.base| .cse2)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_118| Int) (v_DerPreprocessor_55 (Array Int Int)) (v_DerPreprocessor_56 (Array Int Int))) (let ((.cse4 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_118|))) (let ((.cse5 (select .cse4 0))) (and (= (select .cse4 24) .cse5) (= .cse5 (select v_DerPreprocessor_55 24)) (not (= .cse5 0)) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_118|) (not (= .cse5 |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_118|)) (= (select |c_#memory_$Pointer$.base| .cse5) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse5 v_DerPreprocessor_56) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_118| v_DerPreprocessor_55) .cse5 v_DerPreprocessor_56) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_118| v_DerPreprocessor_55) .cse5)))))) (exists ((v_DerPreprocessor_53 (Array Int Int)) (v_DerPreprocessor_54 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_120| Int)) (let ((.cse6 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_120|))) (let ((.cse7 (select .cse6 0)) (.cse8 (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_120|))) (and (= (select .cse6 16) 0) (= .cse7 (select .cse6 24)) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse7 v_DerPreprocessor_54) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_120| v_DerPreprocessor_53) .cse7 v_DerPreprocessor_54) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_120| v_DerPreprocessor_53) .cse7) (select |c_#memory_$Pointer$.base| .cse7)) (= 0 (select .cse8 16)) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_120|) (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_120| .cse7)) (= (select .cse6 8) 0) (not (= .cse7 0)) (= .cse7 (select v_DerPreprocessor_53 24)) (= (select .cse8 8) 0))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_175| Int) (v_DerPreprocessor_43 (Array Int Int)) (v_DerPreprocessor_44 (Array Int Int))) (let ((.cse10 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_175|))) (let ((.cse9 (select .cse10 0))) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_175|) (not (= .cse9 0)) (= .cse9 (select .cse10 24)) (not (= .cse9 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_175|)) (= (select |c_#memory_$Pointer$.base| .cse9) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse9 v_DerPreprocessor_44) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_175| v_DerPreprocessor_43) .cse9 v_DerPreprocessor_44) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_175| v_DerPreprocessor_43) .cse9)) (= .cse9 (select v_DerPreprocessor_43 24)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_119| Int) (v_DerPreprocessor_57 (Array Int Int)) (v_DerPreprocessor_58 (Array Int Int))) (let ((.cse12 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_119|))) (let ((.cse11 (select .cse12 0))) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_119| .cse11)) (= (select .cse12 24) .cse11) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse11 v_DerPreprocessor_58) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_119| v_DerPreprocessor_57) .cse11 v_DerPreprocessor_58) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_119| v_DerPreprocessor_57) .cse11) (select |c_#memory_$Pointer$.base| .cse11)) (not (= .cse11 0)) (= (select v_DerPreprocessor_57 24) .cse11) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_119|))))) (exists ((v_DerPreprocessor_50 (Array Int Int)) (v_DerPreprocessor_49 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_116| Int)) (let ((.cse14 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_116|))) (let ((.cse13 (select .cse14 0))) (and (not (= .cse13 |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_116|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_116|) (= (select |c_#memory_$Pointer$.base| .cse13) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse13 v_DerPreprocessor_50) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_116| v_DerPreprocessor_49) .cse13 v_DerPreprocessor_50) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_116| v_DerPreprocessor_49) .cse13)) (not (= .cse13 0)) (= (select v_DerPreprocessor_49 24) .cse13) (= (select .cse14 24) .cse13))))) (exists ((v_DerPreprocessor_45 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_174| Int) (v_DerPreprocessor_46 (Array Int Int))) (let ((.cse16 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_174|))) (let ((.cse15 (select .cse16 0))) (and (= (select |c_#memory_$Pointer$.base| .cse15) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse15 v_DerPreprocessor_46) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_174| v_DerPreprocessor_45) .cse15 v_DerPreprocessor_46) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_174| v_DerPreprocessor_45) .cse15)) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_174|) (= (select .cse16 24) .cse15) (not (= .cse15 0)) (not (= .cse15 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_174|)) (= .cse15 (select v_DerPreprocessor_45 24)))))) (exists ((v_DerPreprocessor_51 (Array Int Int)) (v_DerPreprocessor_52 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_115| Int)) (let ((.cse17 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_115|))) (let ((.cse18 (select .cse17 0))) (and (= (select .cse17 24) .cse18) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse18 v_DerPreprocessor_52) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_115| v_DerPreprocessor_51) .cse18 v_DerPreprocessor_52) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_115| v_DerPreprocessor_51) .cse18) (select |c_#memory_$Pointer$.base| .cse18)) (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_115| .cse18)) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_115|) (not (= .cse18 0)) (= .cse18 (select v_DerPreprocessor_51 24)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_114| Int) (v_DerPreprocessor_48 (Array Int Int)) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse20 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_114|))) (let ((.cse19 (select .cse20 0))) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_114|) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse19 v_DerPreprocessor_48) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_114| v_DerPreprocessor_47) .cse19 v_DerPreprocessor_48) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_114| v_DerPreprocessor_47) .cse19) (select |c_#memory_$Pointer$.base| .cse19)) (not (= .cse19 |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_114|)) (= .cse19 (select v_DerPreprocessor_47 24)) (= .cse19 (select .cse20 24)) (not (= .cse19 0))))))) is different from true [2022-11-25 23:41:51,825 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_DerPreprocessor_41 (Array Int Int)) (v_DerPreprocessor_42 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_173| Int)) (let ((.cse1 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_173|))) (let ((.cse0 (select .cse1 0))) (and (not (= .cse0 0)) (not (= .cse0 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_173|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_173|) (= .cse0 (select v_DerPreprocessor_41 24)) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse0 v_DerPreprocessor_42) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_173| v_DerPreprocessor_41) .cse0 v_DerPreprocessor_42) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_173| v_DerPreprocessor_41) .cse0) (select |c_#memory_$Pointer$.base| .cse0)) (= .cse0 (select .cse1 24)))))) (exists ((v_DerPreprocessor_40 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_117| Int) (v_DerPreprocessor_39 (Array Int Int))) (let ((.cse3 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_117|))) (let ((.cse2 (select .cse3 0))) (and (not (= .cse2 |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_117|)) (= .cse2 (select .cse3 24)) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_117|) (= (select v_DerPreprocessor_40 24) .cse2) (not (= .cse2 0)) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse2 v_DerPreprocessor_39) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_117| v_DerPreprocessor_40) .cse2 v_DerPreprocessor_39) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_117| v_DerPreprocessor_40) .cse2) (select |c_#memory_$Pointer$.base| .cse2)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_44| Int) (v_DerPreprocessor_53 (Array Int Int)) (v_DerPreprocessor_54 (Array Int Int))) (let ((.cse5 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_44|))) (let ((.cse4 (select .cse5 0)) (.cse6 (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_44|))) (and (= .cse4 (select .cse5 24)) (= (select .cse6 16) 0) (= (select .cse5 16) 0) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse4 v_DerPreprocessor_54) |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_44| v_DerPreprocessor_53) .cse4 v_DerPreprocessor_54) |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_44| v_DerPreprocessor_53) .cse4) (select |c_#memory_$Pointer$.base| .cse4)) (= .cse4 (select v_DerPreprocessor_53 24)) (<= 2 |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_44|) (= (select .cse5 8) 0) (not (= .cse4 0)) (not (= .cse4 |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_44|)) (= (select .cse6 8) 0))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_118| Int) (v_DerPreprocessor_55 (Array Int Int)) (v_DerPreprocessor_56 (Array Int Int))) (let ((.cse7 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_118|))) (let ((.cse8 (select .cse7 0))) (and (= (select .cse7 24) .cse8) (= .cse8 (select v_DerPreprocessor_55 24)) (not (= .cse8 0)) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_118|) (not (= .cse8 |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_118|)) (= (select |c_#memory_$Pointer$.base| .cse8) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse8 v_DerPreprocessor_56) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_118| v_DerPreprocessor_55) .cse8 v_DerPreprocessor_56) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_118| v_DerPreprocessor_55) .cse8)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_175| Int) (v_DerPreprocessor_43 (Array Int Int)) (v_DerPreprocessor_44 (Array Int Int))) (let ((.cse10 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_175|))) (let ((.cse9 (select .cse10 0))) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_175|) (not (= .cse9 0)) (= .cse9 (select .cse10 24)) (not (= .cse9 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_175|)) (= (select |c_#memory_$Pointer$.base| .cse9) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse9 v_DerPreprocessor_44) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_175| v_DerPreprocessor_43) .cse9 v_DerPreprocessor_44) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_175| v_DerPreprocessor_43) .cse9)) (= .cse9 (select v_DerPreprocessor_43 24)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_119| Int) (v_DerPreprocessor_57 (Array Int Int)) (v_DerPreprocessor_58 (Array Int Int))) (let ((.cse12 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_119|))) (let ((.cse11 (select .cse12 0))) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_119| .cse11)) (= (select .cse12 24) .cse11) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse11 v_DerPreprocessor_58) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_119| v_DerPreprocessor_57) .cse11 v_DerPreprocessor_58) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_119| v_DerPreprocessor_57) .cse11) (select |c_#memory_$Pointer$.base| .cse11)) (not (= .cse11 0)) (= (select v_DerPreprocessor_57 24) .cse11) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_119|))))) (exists ((v_DerPreprocessor_50 (Array Int Int)) (v_DerPreprocessor_49 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_116| Int)) (let ((.cse14 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_116|))) (let ((.cse13 (select .cse14 0))) (and (not (= .cse13 |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_116|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_116|) (= (select |c_#memory_$Pointer$.base| .cse13) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse13 v_DerPreprocessor_50) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_116| v_DerPreprocessor_49) .cse13 v_DerPreprocessor_50) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_116| v_DerPreprocessor_49) .cse13)) (not (= .cse13 0)) (= (select v_DerPreprocessor_49 24) .cse13) (= (select .cse14 24) .cse13))))) (exists ((v_DerPreprocessor_60 (Array Int Int)) (v_DerPreprocessor_59 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_120| Int)) (let ((.cse15 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_120|))) (let ((.cse16 (select .cse15 0)) (.cse17 (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_120|))) (and (= (select .cse15 16) 0) (= .cse16 (select .cse15 24)) (= 0 (select .cse17 16)) (= .cse16 (select v_DerPreprocessor_59 24)) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_120|) (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_120| .cse16)) (= (select .cse15 8) 0) (not (= .cse16 0)) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse16 v_DerPreprocessor_60) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_120| v_DerPreprocessor_59) .cse16 v_DerPreprocessor_60) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_120| v_DerPreprocessor_59) .cse16) (select |c_#memory_$Pointer$.base| .cse16)) (= (select .cse17 8) 0))))) (exists ((v_DerPreprocessor_45 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_174| Int) (v_DerPreprocessor_46 (Array Int Int))) (let ((.cse19 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_174|))) (let ((.cse18 (select .cse19 0))) (and (= (select |c_#memory_$Pointer$.base| .cse18) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse18 v_DerPreprocessor_46) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_174| v_DerPreprocessor_45) .cse18 v_DerPreprocessor_46) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_174| v_DerPreprocessor_45) .cse18)) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_174|) (= (select .cse19 24) .cse18) (not (= .cse18 0)) (not (= .cse18 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_174|)) (= .cse18 (select v_DerPreprocessor_45 24)))))) (exists ((v_DerPreprocessor_51 (Array Int Int)) (v_DerPreprocessor_52 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_115| Int)) (let ((.cse20 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_115|))) (let ((.cse21 (select .cse20 0))) (and (= (select .cse20 24) .cse21) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse21 v_DerPreprocessor_52) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_115| v_DerPreprocessor_51) .cse21 v_DerPreprocessor_52) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_115| v_DerPreprocessor_51) .cse21) (select |c_#memory_$Pointer$.base| .cse21)) (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_115| .cse21)) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_115|) (not (= .cse21 0)) (= .cse21 (select v_DerPreprocessor_51 24)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_114| Int) (v_DerPreprocessor_48 (Array Int Int)) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse23 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_114|))) (let ((.cse22 (select .cse23 0))) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_114|) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse22 v_DerPreprocessor_48) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_114| v_DerPreprocessor_47) .cse22 v_DerPreprocessor_48) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_114| v_DerPreprocessor_47) .cse22) (select |c_#memory_$Pointer$.base| .cse22)) (not (= .cse22 |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_114|)) (= .cse22 (select v_DerPreprocessor_47 24)) (= .cse22 (select .cse23 24)) (not (= .cse22 0))))))) is different from true [2022-11-25 23:42:03,240 WARN L233 SmtUtils]: Spent 5.76s on a formula simplification that was a NOOP. DAG size: 313 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 23:42:18,805 WARN L233 SmtUtils]: Spent 14.04s on a formula simplification that was a NOOP. DAG size: 311 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 23:42:35,751 WARN L233 SmtUtils]: Spent 15.07s on a formula simplification that was a NOOP. DAG size: 342 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 23:42:36,901 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_DerPreprocessor_41 (Array Int Int)) (v_DerPreprocessor_42 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_173| Int)) (let ((.cse1 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_173|))) (let ((.cse0 (select .cse1 0))) (and (not (= .cse0 0)) (not (= .cse0 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_173|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_173|) (= .cse0 (select v_DerPreprocessor_41 24)) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse0 v_DerPreprocessor_42) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_173| v_DerPreprocessor_41) .cse0 v_DerPreprocessor_42) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_173| v_DerPreprocessor_41) .cse0) (select |c_#memory_$Pointer$.base| .cse0)) (= .cse0 (select .cse1 24)))))) (exists ((v_DerPreprocessor_40 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_117| Int) (v_DerPreprocessor_39 (Array Int Int))) (let ((.cse3 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_117|))) (let ((.cse2 (select .cse3 0))) (and (not (= .cse2 |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_117|)) (= .cse2 (select .cse3 24)) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_117|) (= (select v_DerPreprocessor_40 24) .cse2) (not (= .cse2 0)) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse2 v_DerPreprocessor_39) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_117| v_DerPreprocessor_40) .cse2 v_DerPreprocessor_39) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_117| v_DerPreprocessor_40) .cse2) (select |c_#memory_$Pointer$.base| .cse2)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_44| Int) (v_DerPreprocessor_53 (Array Int Int)) (v_DerPreprocessor_54 (Array Int Int))) (let ((.cse5 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_44|))) (let ((.cse4 (select .cse5 0)) (.cse6 (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_44|))) (and (= .cse4 (select .cse5 24)) (= (select .cse6 16) 0) (= (select .cse5 16) 0) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse4 v_DerPreprocessor_54) |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_44| v_DerPreprocessor_53) .cse4 v_DerPreprocessor_54) |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_44| v_DerPreprocessor_53) .cse4) (select |c_#memory_$Pointer$.base| .cse4)) (= .cse4 (select v_DerPreprocessor_53 24)) (<= 2 |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_44|) (= (select .cse5 8) 0) (not (= .cse4 0)) (not (= .cse4 |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_44|)) (= (select .cse6 8) 0))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_118| Int) (v_DerPreprocessor_55 (Array Int Int)) (v_DerPreprocessor_56 (Array Int Int))) (let ((.cse7 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_118|))) (let ((.cse8 (select .cse7 0))) (and (= (select .cse7 24) .cse8) (= .cse8 (select v_DerPreprocessor_55 24)) (not (= .cse8 0)) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_118|) (not (= .cse8 |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_118|)) (= (select |c_#memory_$Pointer$.base| .cse8) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse8 v_DerPreprocessor_56) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_118| v_DerPreprocessor_55) .cse8 v_DerPreprocessor_56) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_118| v_DerPreprocessor_55) .cse8)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_175| Int) (v_DerPreprocessor_43 (Array Int Int)) (v_DerPreprocessor_44 (Array Int Int))) (let ((.cse10 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_175|))) (let ((.cse9 (select .cse10 0))) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_175|) (not (= .cse9 0)) (= .cse9 (select .cse10 24)) (not (= .cse9 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_175|)) (= (select |c_#memory_$Pointer$.base| .cse9) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse9 v_DerPreprocessor_44) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_175| v_DerPreprocessor_43) .cse9 v_DerPreprocessor_44) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_175| v_DerPreprocessor_43) .cse9)) (= .cse9 (select v_DerPreprocessor_43 24)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_119| Int) (v_DerPreprocessor_57 (Array Int Int)) (v_DerPreprocessor_58 (Array Int Int))) (let ((.cse12 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_119|))) (let ((.cse11 (select .cse12 0))) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_119| .cse11)) (= (select .cse12 24) .cse11) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse11 v_DerPreprocessor_58) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_119| v_DerPreprocessor_57) .cse11 v_DerPreprocessor_58) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_119| v_DerPreprocessor_57) .cse11) (select |c_#memory_$Pointer$.base| .cse11)) (not (= .cse11 0)) (= (select v_DerPreprocessor_57 24) .cse11) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_119|))))) (exists ((v_DerPreprocessor_50 (Array Int Int)) (v_DerPreprocessor_49 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_116| Int)) (let ((.cse14 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_116|))) (let ((.cse13 (select .cse14 0))) (and (not (= .cse13 |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_116|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_116|) (= (select |c_#memory_$Pointer$.base| .cse13) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse13 v_DerPreprocessor_50) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_116| v_DerPreprocessor_49) .cse13 v_DerPreprocessor_50) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_116| v_DerPreprocessor_49) .cse13)) (not (= .cse13 0)) (= (select v_DerPreprocessor_49 24) .cse13) (= (select .cse14 24) .cse13))))) (exists ((v_DerPreprocessor_60 (Array Int Int)) (v_DerPreprocessor_59 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_120| Int)) (let ((.cse15 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_120|))) (let ((.cse16 (select .cse15 0)) (.cse17 (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_120|))) (and (= (select .cse15 16) 0) (= .cse16 (select .cse15 24)) (= 0 (select .cse17 16)) (= .cse16 (select v_DerPreprocessor_59 24)) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_120|) (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_120| .cse16)) (= (select .cse15 8) 0) (not (= .cse16 0)) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse16 v_DerPreprocessor_60) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_120| v_DerPreprocessor_59) .cse16 v_DerPreprocessor_60) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_120| v_DerPreprocessor_59) .cse16) (select |c_#memory_$Pointer$.base| .cse16)) (= (select .cse17 8) 0))))) (exists ((v_DerPreprocessor_45 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_174| Int) (v_DerPreprocessor_46 (Array Int Int))) (let ((.cse19 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_174|))) (let ((.cse18 (select .cse19 0))) (and (= (select |c_#memory_$Pointer$.base| .cse18) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse18 v_DerPreprocessor_46) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_174| v_DerPreprocessor_45) .cse18 v_DerPreprocessor_46) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_174| v_DerPreprocessor_45) .cse18)) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_174|) (= (select .cse19 24) .cse18) (not (= .cse18 0)) (not (= .cse18 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_174|)) (= .cse18 (select v_DerPreprocessor_45 24)))))) (exists ((v_DerPreprocessor_51 (Array Int Int)) (v_DerPreprocessor_52 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_115| Int)) (let ((.cse20 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_115|))) (let ((.cse21 (select .cse20 0))) (and (= (select .cse20 24) .cse21) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse21 v_DerPreprocessor_52) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_115| v_DerPreprocessor_51) .cse21 v_DerPreprocessor_52) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_115| v_DerPreprocessor_51) .cse21) (select |c_#memory_$Pointer$.base| .cse21)) (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_115| .cse21)) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_115|) (not (= .cse21 0)) (= .cse21 (select v_DerPreprocessor_51 24)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_45| Int) (v_DerPreprocessor_63 (Array Int Int)) (v_DerPreprocessor_64 (Array Int Int))) (let ((.cse22 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_45|))) (let ((.cse23 (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_45|)) (.cse24 (select .cse22 0))) (and (= (select .cse22 8) 0) (= (select .cse23 8) 0) (= (select v_DerPreprocessor_64 24) .cse24) (= (select .cse22 16) 0) (not (= .cse24 0)) (= (select .cse23 16) 0) (= .cse24 (select .cse22 24)) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse24 v_DerPreprocessor_63) |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_45| v_DerPreprocessor_64) .cse24 v_DerPreprocessor_63) |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_45| v_DerPreprocessor_64) .cse24) (select |c_#memory_$Pointer$.base| .cse24)) (<= 2 |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_45|) (not (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_45| .cse24)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_46| Int) (v_DerPreprocessor_62 (Array Int Int)) (v_DerPreprocessor_61 (Array Int Int))) (let ((.cse26 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_46|))) (let ((.cse27 (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_46|)) (.cse25 (select .cse26 0))) (and (= (select v_DerPreprocessor_61 24) .cse25) (= (select .cse26 16) 0) (= (select .cse27 8) 0) (not (= .cse25 0)) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse25 v_DerPreprocessor_62) |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_46| v_DerPreprocessor_61) .cse25 v_DerPreprocessor_62) |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_46| v_DerPreprocessor_61) .cse25) (select |c_#memory_$Pointer$.base| .cse25)) (<= 2 |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_46|) (not (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_46| .cse25)) (= (select .cse27 16) 0) (= (select .cse26 24) .cse25) (= (select .cse26 8) 0))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_114| Int) (v_DerPreprocessor_48 (Array Int Int)) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse29 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_114|))) (let ((.cse28 (select .cse29 0))) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_114|) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse28 v_DerPreprocessor_48) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_114| v_DerPreprocessor_47) .cse28 v_DerPreprocessor_48) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_114| v_DerPreprocessor_47) .cse28) (select |c_#memory_$Pointer$.base| .cse28)) (not (= .cse28 |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_114|)) (= .cse28 (select v_DerPreprocessor_47 24)) (= .cse28 (select .cse29 24)) (not (= .cse28 0))))))) is different from true [2022-11-25 23:43:09,237 WARN L233 SmtUtils]: Spent 27.92s on a formula simplification that was a NOOP. DAG size: 383 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 23:43:09,930 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_48| Int) (v_DerPreprocessor_67 (Array Int Int)) (v_DerPreprocessor_68 (Array Int Int))) (let ((.cse1 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_48|))) (let ((.cse0 (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_48|)) (.cse2 (select .cse1 0))) (and (= (select .cse0 16) 0) (= (select .cse1 8) 0) (= .cse2 (select v_DerPreprocessor_68 24)) (not (= .cse2 0)) (= (select .cse1 16) 0) (not (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_48| .cse2)) (<= 2 |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_48|) (= .cse2 (select .cse1 24)) (= (select .cse0 8) 0) (= (select |c_#memory_$Pointer$.base| .cse2) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse2 v_DerPreprocessor_67) |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_48| v_DerPreprocessor_68) .cse2 v_DerPreprocessor_67) |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_48| v_DerPreprocessor_68) .cse2)))))) (exists ((v_DerPreprocessor_41 (Array Int Int)) (v_DerPreprocessor_42 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_173| Int)) (let ((.cse4 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_173|))) (let ((.cse3 (select .cse4 0))) (and (not (= .cse3 0)) (not (= .cse3 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_173|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_173|) (= .cse3 (select v_DerPreprocessor_41 24)) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse3 v_DerPreprocessor_42) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_173| v_DerPreprocessor_41) .cse3 v_DerPreprocessor_42) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_173| v_DerPreprocessor_41) .cse3) (select |c_#memory_$Pointer$.base| .cse3)) (= .cse3 (select .cse4 24)))))) (exists ((v_DerPreprocessor_40 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_117| Int) (v_DerPreprocessor_39 (Array Int Int))) (let ((.cse6 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_117|))) (let ((.cse5 (select .cse6 0))) (and (not (= .cse5 |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_117|)) (= .cse5 (select .cse6 24)) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_117|) (= (select v_DerPreprocessor_40 24) .cse5) (not (= .cse5 0)) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse5 v_DerPreprocessor_39) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_117| v_DerPreprocessor_40) .cse5 v_DerPreprocessor_39) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_117| v_DerPreprocessor_40) .cse5) (select |c_#memory_$Pointer$.base| .cse5)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_44| Int) (v_DerPreprocessor_53 (Array Int Int)) (v_DerPreprocessor_54 (Array Int Int))) (let ((.cse8 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_44|))) (let ((.cse7 (select .cse8 0)) (.cse9 (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_44|))) (and (= .cse7 (select .cse8 24)) (= (select .cse9 16) 0) (= (select .cse8 16) 0) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse7 v_DerPreprocessor_54) |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_44| v_DerPreprocessor_53) .cse7 v_DerPreprocessor_54) |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_44| v_DerPreprocessor_53) .cse7) (select |c_#memory_$Pointer$.base| .cse7)) (= .cse7 (select v_DerPreprocessor_53 24)) (<= 2 |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_44|) (= (select .cse8 8) 0) (not (= .cse7 0)) (not (= .cse7 |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_44|)) (= (select .cse9 8) 0))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_118| Int) (v_DerPreprocessor_55 (Array Int Int)) (v_DerPreprocessor_56 (Array Int Int))) (let ((.cse10 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_118|))) (let ((.cse11 (select .cse10 0))) (and (= (select .cse10 24) .cse11) (= .cse11 (select v_DerPreprocessor_55 24)) (not (= .cse11 0)) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_118|) (not (= .cse11 |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_118|)) (= (select |c_#memory_$Pointer$.base| .cse11) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse11 v_DerPreprocessor_56) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_118| v_DerPreprocessor_55) .cse11 v_DerPreprocessor_56) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_118| v_DerPreprocessor_55) .cse11)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_175| Int) (v_DerPreprocessor_43 (Array Int Int)) (v_DerPreprocessor_44 (Array Int Int))) (let ((.cse13 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_175|))) (let ((.cse12 (select .cse13 0))) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_175|) (not (= .cse12 0)) (= .cse12 (select .cse13 24)) (not (= .cse12 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_175|)) (= (select |c_#memory_$Pointer$.base| .cse12) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse12 v_DerPreprocessor_44) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_175| v_DerPreprocessor_43) .cse12 v_DerPreprocessor_44) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_175| v_DerPreprocessor_43) .cse12)) (= .cse12 (select v_DerPreprocessor_43 24)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_119| Int) (v_DerPreprocessor_57 (Array Int Int)) (v_DerPreprocessor_58 (Array Int Int))) (let ((.cse15 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_119|))) (let ((.cse14 (select .cse15 0))) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_119| .cse14)) (= (select .cse15 24) .cse14) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse14 v_DerPreprocessor_58) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_119| v_DerPreprocessor_57) .cse14 v_DerPreprocessor_58) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_119| v_DerPreprocessor_57) .cse14) (select |c_#memory_$Pointer$.base| .cse14)) (not (= .cse14 0)) (= (select v_DerPreprocessor_57 24) .cse14) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_119|))))) (exists ((v_DerPreprocessor_50 (Array Int Int)) (v_DerPreprocessor_49 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_116| Int)) (let ((.cse17 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_116|))) (let ((.cse16 (select .cse17 0))) (and (not (= .cse16 |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_116|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_116|) (= (select |c_#memory_$Pointer$.base| .cse16) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse16 v_DerPreprocessor_50) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_116| v_DerPreprocessor_49) .cse16 v_DerPreprocessor_50) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_116| v_DerPreprocessor_49) .cse16)) (not (= .cse16 0)) (= (select v_DerPreprocessor_49 24) .cse16) (= (select .cse17 24) .cse16))))) (exists ((v_DerPreprocessor_60 (Array Int Int)) (v_DerPreprocessor_59 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_120| Int)) (let ((.cse18 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_120|))) (let ((.cse19 (select .cse18 0)) (.cse20 (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_120|))) (and (= (select .cse18 16) 0) (= .cse19 (select .cse18 24)) (= 0 (select .cse20 16)) (= .cse19 (select v_DerPreprocessor_59 24)) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_120|) (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_120| .cse19)) (= (select .cse18 8) 0) (not (= .cse19 0)) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse19 v_DerPreprocessor_60) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_120| v_DerPreprocessor_59) .cse19 v_DerPreprocessor_60) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_120| v_DerPreprocessor_59) .cse19) (select |c_#memory_$Pointer$.base| .cse19)) (= (select .cse20 8) 0))))) (exists ((v_DerPreprocessor_45 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_174| Int) (v_DerPreprocessor_46 (Array Int Int))) (let ((.cse22 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_174|))) (let ((.cse21 (select .cse22 0))) (and (= (select |c_#memory_$Pointer$.base| .cse21) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse21 v_DerPreprocessor_46) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_174| v_DerPreprocessor_45) .cse21 v_DerPreprocessor_46) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_174| v_DerPreprocessor_45) .cse21)) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_174|) (= (select .cse22 24) .cse21) (not (= .cse21 0)) (not (= .cse21 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_174|)) (= .cse21 (select v_DerPreprocessor_45 24)))))) (exists ((v_DerPreprocessor_65 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_47| Int) (v_DerPreprocessor_66 (Array Int Int))) (let ((.cse24 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_47|))) (let ((.cse25 (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_47|)) (.cse23 (select .cse24 0))) (and (= .cse23 (select .cse24 24)) (not (= .cse23 0)) (= (select .cse24 8) 0) (= (select .cse25 16) 0) (= (select .cse25 8) 0) (<= 2 |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_47|) (not (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_47| .cse23)) (= (select .cse24 16) 0) (= (select |c_#memory_$Pointer$.base| .cse23) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse23 v_DerPreprocessor_65) |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_47| v_DerPreprocessor_66) .cse23 v_DerPreprocessor_65) |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_47| v_DerPreprocessor_66) .cse23)) (= .cse23 (select v_DerPreprocessor_66 24)))))) (exists ((v_DerPreprocessor_51 (Array Int Int)) (v_DerPreprocessor_52 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_115| Int)) (let ((.cse26 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_115|))) (let ((.cse27 (select .cse26 0))) (and (= (select .cse26 24) .cse27) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse27 v_DerPreprocessor_52) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_115| v_DerPreprocessor_51) .cse27 v_DerPreprocessor_52) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_115| v_DerPreprocessor_51) .cse27) (select |c_#memory_$Pointer$.base| .cse27)) (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_115| .cse27)) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_115|) (not (= .cse27 0)) (= .cse27 (select v_DerPreprocessor_51 24)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_45| Int) (v_DerPreprocessor_63 (Array Int Int)) (v_DerPreprocessor_64 (Array Int Int))) (let ((.cse28 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_45|))) (let ((.cse29 (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_45|)) (.cse30 (select .cse28 0))) (and (= (select .cse28 8) 0) (= (select .cse29 8) 0) (= (select v_DerPreprocessor_64 24) .cse30) (= (select .cse28 16) 0) (not (= .cse30 0)) (= (select .cse29 16) 0) (= .cse30 (select .cse28 24)) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse30 v_DerPreprocessor_63) |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_45| v_DerPreprocessor_64) .cse30 v_DerPreprocessor_63) |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_45| v_DerPreprocessor_64) .cse30) (select |c_#memory_$Pointer$.base| .cse30)) (<= 2 |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_45|) (not (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_45| .cse30)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_46| Int) (v_DerPreprocessor_62 (Array Int Int)) (v_DerPreprocessor_61 (Array Int Int))) (let ((.cse32 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_46|))) (let ((.cse33 (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_46|)) (.cse31 (select .cse32 0))) (and (= (select v_DerPreprocessor_61 24) .cse31) (= (select .cse32 16) 0) (= (select .cse33 8) 0) (not (= .cse31 0)) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse31 v_DerPreprocessor_62) |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_46| v_DerPreprocessor_61) .cse31 v_DerPreprocessor_62) |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_46| v_DerPreprocessor_61) .cse31) (select |c_#memory_$Pointer$.base| .cse31)) (<= 2 |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_46|) (not (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_46| .cse31)) (= (select .cse33 16) 0) (= (select .cse32 24) .cse31) (= (select .cse32 8) 0))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_114| Int) (v_DerPreprocessor_48 (Array Int Int)) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse35 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_114|))) (let ((.cse34 (select .cse35 0))) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_114|) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse34 v_DerPreprocessor_48) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_114| v_DerPreprocessor_47) .cse34 v_DerPreprocessor_48) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_114| v_DerPreprocessor_47) .cse34) (select |c_#memory_$Pointer$.base| .cse34)) (not (= .cse34 |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_114|)) (= .cse34 (select v_DerPreprocessor_47 24)) (= .cse34 (select .cse35 24)) (not (= .cse34 0))))))) is different from true [2022-11-25 23:43:45,109 WARN L233 SmtUtils]: Spent 32.40s on a formula simplification that was a NOOP. DAG size: 447 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 23:44:25,558 WARN L233 SmtUtils]: Spent 34.29s on a formula simplification that was a NOOP. DAG size: 471 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 23:45:04,701 WARN L233 SmtUtils]: Spent 34.64s on a formula simplification that was a NOOP. DAG size: 528 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 23:45:42,638 WARN L233 SmtUtils]: Spent 34.35s on a formula simplification that was a NOOP. DAG size: 504 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 23:45:44,092 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 105 not checked. [2022-11-25 23:45:44,092 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:45:54,605 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 6 proven. 17 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2022-11-25 23:45:54,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [30493822] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:45:54,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1153392274] [2022-11-25 23:45:54,619 INFO L159 IcfgInterpreter]: Started Sifa with 47 locations of interest [2022-11-25 23:45:54,619 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:45:54,620 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:45:54,620 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:45:54,621 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:45:54,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:45:54,785 INFO L321 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2022-11-25 23:45:54,785 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 12 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 37 treesize of output 61 [2022-11-25 23:45:54,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:45:54,808 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2022-11-25 23:45:55,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:45:55,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:45:55,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:45:55,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:45:55,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:45:55,030 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 0 case distinctions, treesize of input 62 treesize of output 77 [2022-11-25 23:45:55,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:45:55,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:45:55,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:45:55,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:45:55,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:45:55,060 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 0 case distinctions, treesize of input 62 treesize of output 77 [2022-11-25 23:45:55,088 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 24 treesize of output 9 [2022-11-25 23:45:55,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:45:55,116 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2022-11-25 23:45:55,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:45:55,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:45:55,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:45:55,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:45:55,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:45:55,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:45:55,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:45:55,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:45:55,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:45:55,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:45:55,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:45:55,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:45:55,179 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:45:55,213 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-25 23:45:55,213 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 16 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 103 [2022-11-25 23:45:55,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:45:55,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:45:55,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:45:55,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:45:55,260 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 28 [2022-11-25 23:45:55,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:45:55,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:45:55,428 INFO L321 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-11-25 23:45:55,428 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 8 case distinctions, treesize of input 42 treesize of output 73 [2022-11-25 23:45:55,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:45:55,463 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 7 [2022-11-25 23:45:55,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:45:55,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:45:55,486 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 17 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 46 [2022-11-25 23:45:55,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:45:55,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:45:55,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:45:55,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:45:55,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:45:55,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:45:55,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:45:55,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:45:55,527 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:45:55,528 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 20 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 99 [2022-11-25 23:45:55,582 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-11-25 23:45:55,600 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 9 [2022-11-25 23:45:55,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:45:55,629 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2022-11-25 23:45:55,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:45:55,661 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 13 [2022-11-25 23:45:55,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:45:55,691 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 13 [2022-11-25 23:45:55,708 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:45:55,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:45:55,711 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 23 [2022-11-25 23:45:55,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:45:55,763 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 35 treesize of output 7 [2022-11-25 23:45:55,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:45:55,776 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 29 treesize of output 17 [2022-11-25 23:45:55,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:45:55,800 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 35 treesize of output 7 [2022-11-25 23:45:55,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:45:55,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:45:55,822 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 19 [2022-11-25 23:45:59,342 INFO L197 IcfgInterpreter]: Interpreting procedure aws_linked_list_empty with input of size 109 for LOIs [2022-11-25 23:45:59,597 INFO L197 IcfgInterpreter]: Interpreting procedure aws_linked_list_is_valid with input of size 73 for LOIs [2022-11-25 23:46:00,370 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 15 for LOIs [2022-11-25 23:46:00,373 INFO L197 IcfgInterpreter]: Interpreting procedure nondet_uint64_t with input of size 104 for LOIs [2022-11-25 23:46:00,392 INFO L197 IcfgInterpreter]: Interpreting procedure aws_linked_list_node_next_is_valid with input of size 20 for LOIs [2022-11-25 23:46:00,456 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:46:24,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1153392274] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:46:24,888 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:46:24,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [6, 37, 11] total 76 [2022-11-25 23:46:24,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642088409] [2022-11-25 23:46:24,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:46:24,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-25 23:46:24,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:46:24,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-25 23:46:24,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=291, Invalid=4060, Unknown=107, NotChecked=1242, Total=5700 [2022-11-25 23:46:24,893 INFO L87 Difference]: Start difference. First operand 148 states and 185 transitions. Second operand has 27 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 16 states have internal predecessors, (28), 9 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (15), 9 states have call predecessors, (15), 9 states have call successors, (15) [2022-11-25 23:46:37,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:46:37,497 INFO L93 Difference]: Finished difference Result 258 states and 324 transitions. [2022-11-25 23:46:37,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-25 23:46:37,498 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 16 states have internal predecessors, (28), 9 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (15), 9 states have call predecessors, (15), 9 states have call successors, (15) Word has length 93 [2022-11-25 23:46:37,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:46:37,500 INFO L225 Difference]: With dead ends: 258 [2022-11-25 23:46:37,500 INFO L226 Difference]: Without dead ends: 148 [2022-11-25 23:46:37,502 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 196 SyntacticMatches, 13 SemanticMatches, 81 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 1752 ImplicationChecksByTransitivity, 349.7s TimeCoverageRelationStatistics Valid=381, Invalid=4949, Unknown=108, NotChecked=1368, Total=6806 [2022-11-25 23:46:37,503 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 128 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 1877 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 1920 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 1877 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2022-11-25 23:46:37,504 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 462 Invalid, 1920 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 1877 Invalid, 0 Unknown, 0 Unchecked, 7.4s Time] [2022-11-25 23:46:37,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2022-11-25 23:46:37,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2022-11-25 23:46:37,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 87 states have (on average 1.1724137931034482) internal successors, (102), 89 states have internal predecessors, (102), 41 states have call successors, (41), 18 states have call predecessors, (41), 19 states have return successors, (41), 40 states have call predecessors, (41), 40 states have call successors, (41) [2022-11-25 23:46:37,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 184 transitions. [2022-11-25 23:46:37,544 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 184 transitions. Word has length 93 [2022-11-25 23:46:37,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:46:37,544 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 184 transitions. [2022-11-25 23:46:37,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 16 states have internal predecessors, (28), 9 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (15), 9 states have call predecessors, (15), 9 states have call successors, (15) [2022-11-25 23:46:37,545 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 184 transitions. [2022-11-25 23:46:37,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-11-25 23:46:37,546 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:46:37,546 INFO L195 NwaCegarLoop]: trace histogram [9, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:46:37,554 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94242371-04b9-4a99-bf94-885615788746/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-11-25 23:46:37,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94242371-04b9-4a99-bf94-885615788746/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:46:37,754 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:46:37,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:46:37,755 INFO L85 PathProgramCache]: Analyzing trace with hash 672928668, now seen corresponding path program 1 times [2022-11-25 23:46:37,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:46:37,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232177939] [2022-11-25 23:46:37,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:46:37,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:46:37,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:46:38,107 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2022-11-25 23:46:38,108 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:46:38,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232177939] [2022-11-25 23:46:38,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232177939] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:46:38,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1852223128] [2022-11-25 23:46:38,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:46:38,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:46:38,109 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94242371-04b9-4a99-bf94-885615788746/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:46:38,111 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94242371-04b9-4a99-bf94-885615788746/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:46:38,130 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94242371-04b9-4a99-bf94-885615788746/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-25 23:46:38,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:46:38,490 INFO L263 TraceCheckSpWp]: Trace formula consists of 548 conjuncts, 29 conjunts are in the unsatisfiable core [2022-11-25 23:46:38,493 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:46:38,861 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 58 proven. 3 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2022-11-25 23:46:38,861 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:46:39,475 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2022-11-25 23:46:39,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1852223128] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:46:39,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1847702814] [2022-11-25 23:46:39,477 INFO L159 IcfgInterpreter]: Started Sifa with 48 locations of interest [2022-11-25 23:46:39,477 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:46:39,478 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:46:39,478 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:46:39,478 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:46:39,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:46:39,620 INFO L321 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2022-11-25 23:46:39,621 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 12 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 37 treesize of output 61 [2022-11-25 23:46:39,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:46:39,643 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2022-11-25 23:46:39,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:46:39,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:46:39,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:46:39,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:46:39,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:46:39,843 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 0 case distinctions, treesize of input 62 treesize of output 77 [2022-11-25 23:46:39,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:46:39,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:46:39,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:46:39,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:46:39,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:46:39,880 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 0 case distinctions, treesize of input 62 treesize of output 77 [2022-11-25 23:46:39,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:46:39,914 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2022-11-25 23:46:39,940 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 24 treesize of output 9 [2022-11-25 23:46:39,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:46:39,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:46:39,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:46:39,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:46:39,995 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 28 [2022-11-25 23:46:40,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:46:40,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:46:40,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:46:40,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:46:40,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:46:40,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:46:40,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:46:40,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:46:40,032 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:46:40,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:46:40,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:46:40,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:46:40,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:46:40,042 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:46:40,078 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-25 23:46:40,079 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 16 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 103 [2022-11-25 23:46:40,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:46:40,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:46:40,250 INFO L321 Elim1Store]: treesize reduction 40, result has 48.1 percent of original size [2022-11-25 23:46:40,250 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 32 treesize of output 62 [2022-11-25 23:46:40,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:46:40,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:46:40,441 INFO L321 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-11-25 23:46:40,441 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 8 case distinctions, treesize of input 42 treesize of output 73 [2022-11-25 23:46:40,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:46:40,480 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 7 [2022-11-25 23:46:40,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:46:40,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:46:40,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:46:40,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:46:40,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:46:40,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:46:40,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:46:40,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:46:40,518 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 20 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 99 [2022-11-25 23:46:40,598 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:46:40,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:46:40,602 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2022-11-25 23:46:40,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:46:40,646 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 13 [2022-11-25 23:46:40,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:46:40,670 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 23 [2022-11-25 23:46:40,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:46:40,699 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 19 [2022-11-25 23:46:40,719 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 9 [2022-11-25 23:46:40,733 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-11-25 23:46:40,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:46:40,774 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 35 treesize of output 7 [2022-11-25 23:46:40,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:46:40,790 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 29 treesize of output 17 [2022-11-25 23:46:40,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:46:40,814 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 35 treesize of output 7 [2022-11-25 23:46:40,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:46:40,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:46:40,835 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 19 [2022-11-25 23:46:50,480 INFO L197 IcfgInterpreter]: Interpreting procedure aws_linked_list_empty with input of size 19 for LOIs [2022-11-25 23:46:50,511 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 74 for LOIs [2022-11-25 23:46:50,550 INFO L197 IcfgInterpreter]: Interpreting procedure aws_linked_list_is_valid with input of size 19 for LOIs [2022-11-25 23:46:51,405 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 15 for LOIs [2022-11-25 23:46:51,408 INFO L197 IcfgInterpreter]: Interpreting procedure nondet_uint64_t with input of size 104 for LOIs [2022-11-25 23:46:51,433 INFO L197 IcfgInterpreter]: Interpreting procedure aws_linked_list_node_next_is_valid with input of size 20 for LOIs [2022-11-25 23:46:51,501 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:47:26,061 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '13405#(and (<= 0 |__VERIFIER_assert_#in~cond|) (= |~#s_can_fail_allocator_static~0.base| 4) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_BEFORE_CALL_189| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base_BEFORE_CALL_189| Int)) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base_BEFORE_CALL_189|) (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_BEFORE_CALL_189| 24))) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base_BEFORE_CALL_189|) (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_BEFORE_CALL_189| 24))) (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_BEFORE_CALL_189| 16)) (<= 0 (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base_BEFORE_CALL_189|) (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_BEFORE_CALL_189| 24))) (<= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_BEFORE_CALL_189| 0) (<= 0 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base_BEFORE_CALL_189|) (<= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base_BEFORE_CALL_189|) (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_BEFORE_CALL_189| 24)) 0) (<= 0 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_BEFORE_CALL_189|) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base_BEFORE_CALL_189|) (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_BEFORE_CALL_189| 24))) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base_BEFORE_CALL_189|) (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_BEFORE_CALL_189| 24))) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base_BEFORE_CALL_189|))) (= (mod __VERIFIER_assert_~cond 256) 0) (= |~#s_can_fail_allocator_static~0.offset| 0) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_#in~list#1.base_BEFORE_CALL_95| Int)) (and (<= 0 (ite (= (ite (and (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_#in~list#1.base_BEFORE_CALL_95|) 0) |v_ULTIMATE.start_aws_linked_list_pop_back_#in~list#1.base_BEFORE_CALL_95|) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_pop_back_#in~list#1.base_BEFORE_CALL_95|) 0) 16)) 1 0) 0) 0 1)) (<= (ite (= (ite (and (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_#in~list#1.base_BEFORE_CALL_95|) 0) |v_ULTIMATE.start_aws_linked_list_pop_back_#in~list#1.base_BEFORE_CALL_95|) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_pop_back_#in~list#1.base_BEFORE_CALL_95|) 0) 16)) 1 0) 0) 0 1) 1) (not (= (mod (ite (= (ite (= (mod (ite (= (ite (and (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_#in~list#1.base_BEFORE_CALL_95|) 0) |v_ULTIMATE.start_aws_linked_list_pop_back_#in~list#1.base_BEFORE_CALL_95|) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_pop_back_#in~list#1.base_BEFORE_CALL_95|) 0) 16)) 1 0) 0) 0 1) 256) 0) 1 0) 0) 0 1) 256) 0)) (not (= (mod (ite (= |v_ULTIMATE.start_aws_linked_list_pop_back_#in~list#1.base_BEFORE_CALL_95| 0) 0 1) 256) 0)) (<= 0 |v_ULTIMATE.start_aws_linked_list_pop_back_#in~list#1.base_BEFORE_CALL_95|))) (= |__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-25 23:47:26,061 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-25 23:47:26,061 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:47:26,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 12, 6] total 16 [2022-11-25 23:47:26,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897082680] [2022-11-25 23:47:26,062 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:47:26,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-25 23:47:26,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:47:26,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-25 23:47:26,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=2441, Unknown=0, NotChecked=0, Total=2652 [2022-11-25 23:47:26,064 INFO L87 Difference]: Start difference. First operand 148 states and 184 transitions. Second operand has 16 states, 10 states have (on average 4.9) internal successors, (49), 12 states have internal predecessors, (49), 5 states have call successors, (22), 2 states have call predecessors, (22), 8 states have return successors, (25), 6 states have call predecessors, (25), 5 states have call successors, (25) [2022-11-25 23:47:27,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:47:27,391 INFO L93 Difference]: Finished difference Result 269 states and 337 transitions. [2022-11-25 23:47:27,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-25 23:47:27,392 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 10 states have (on average 4.9) internal successors, (49), 12 states have internal predecessors, (49), 5 states have call successors, (22), 2 states have call predecessors, (22), 8 states have return successors, (25), 6 states have call predecessors, (25), 5 states have call successors, (25) Word has length 96 [2022-11-25 23:47:27,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:47:27,393 INFO L225 Difference]: With dead ends: 269 [2022-11-25 23:47:27,394 INFO L226 Difference]: Without dead ends: 165 [2022-11-25 23:47:27,395 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 233 SyntacticMatches, 9 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 823 ImplicationChecksByTransitivity, 35.2s TimeCoverageRelationStatistics Valid=227, Invalid=2743, Unknown=0, NotChecked=0, Total=2970 [2022-11-25 23:47:27,396 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 7 mSDsluCounter, 1187 mSDsCounter, 0 mSdLazyCounter, 524 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1294 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:47:27,396 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1294 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 524 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-25 23:47:27,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-11-25 23:47:27,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 149. [2022-11-25 23:47:27,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 88 states have (on average 1.1704545454545454) internal successors, (103), 90 states have internal predecessors, (103), 41 states have call successors, (41), 18 states have call predecessors, (41), 19 states have return successors, (41), 40 states have call predecessors, (41), 40 states have call successors, (41) [2022-11-25 23:47:27,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 185 transitions. [2022-11-25 23:47:27,449 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 185 transitions. Word has length 96 [2022-11-25 23:47:27,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:47:27,450 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 185 transitions. [2022-11-25 23:47:27,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 10 states have (on average 4.9) internal successors, (49), 12 states have internal predecessors, (49), 5 states have call successors, (22), 2 states have call predecessors, (22), 8 states have return successors, (25), 6 states have call predecessors, (25), 5 states have call successors, (25) [2022-11-25 23:47:27,450 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 185 transitions. [2022-11-25 23:47:27,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-11-25 23:47:27,451 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:47:27,451 INFO L195 NwaCegarLoop]: trace histogram [9, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:47:27,463 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94242371-04b9-4a99-bf94-885615788746/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-11-25 23:47:27,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94242371-04b9-4a99-bf94-885615788746/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-25 23:47:27,659 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:47:27,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:47:27,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1616069117, now seen corresponding path program 1 times [2022-11-25 23:47:27,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:47:27,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313827835] [2022-11-25 23:47:27,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:47:27,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:47:27,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:47:28,790 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2022-11-25 23:47:28,790 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:47:28,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313827835] [2022-11-25 23:47:28,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313827835] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:47:28,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [910753515] [2022-11-25 23:47:28,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:47:28,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:47:28,791 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94242371-04b9-4a99-bf94-885615788746/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:47:28,793 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94242371-04b9-4a99-bf94-885615788746/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:47:28,795 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94242371-04b9-4a99-bf94-885615788746/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-25 23:47:29,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:47:29,183 INFO L263 TraceCheckSpWp]: Trace formula consists of 555 conjuncts, 107 conjunts are in the unsatisfiable core [2022-11-25 23:47:29,188 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:47:29,210 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 23:47:29,764 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 23:47:29,765 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-25 23:47:29,777 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-11-25 23:47:29,784 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 23:47:29,939 INFO L321 Elim1Store]: treesize reduction 38, result has 22.4 percent of original size [2022-11-25 23:47:29,940 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 73 treesize of output 99 [2022-11-25 23:47:29,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:47:29,951 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 85 treesize of output 71 [2022-11-25 23:47:29,962 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 16 treesize of output 15 [2022-11-25 23:47:30,130 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_242| Int) (v_DerPreprocessor_93 (Array Int Int)) (v_DerPreprocessor_94 (Array Int Int))) (let ((.cse1 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_242|))) (let ((.cse0 (select .cse1 0))) (and (not (= .cse0 0)) (= (select |c_#memory_$Pointer$.base| .cse0) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse0 v_DerPreprocessor_93) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_242| v_DerPreprocessor_94) .cse0 v_DerPreprocessor_93) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_242| v_DerPreprocessor_94) .cse0)) (not (= .cse0 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_242|)) (= (select v_DerPreprocessor_94 24) (select .cse1 24)))))) is different from true [2022-11-25 23:47:30,455 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_242| Int) (v_DerPreprocessor_93 (Array Int Int)) (v_DerPreprocessor_94 (Array Int Int))) (let ((.cse1 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_242|))) (let ((.cse0 (select .cse1 0))) (and (not (= .cse0 0)) (= (select |c_#memory_$Pointer$.base| .cse0) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse0 v_DerPreprocessor_93) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_242| v_DerPreprocessor_94) .cse0 v_DerPreprocessor_93) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_242| v_DerPreprocessor_94) .cse0)) (not (= .cse0 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_242|)) (= (select v_DerPreprocessor_94 24) (select .cse1 24)))))) (exists ((v_DerPreprocessor_95 (Array Int Int)) (v_DerPreprocessor_96 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_243| Int)) (let ((.cse3 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_243|))) (let ((.cse2 (select .cse3 0))) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_243| .cse2)) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse2 v_DerPreprocessor_95) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_243| v_DerPreprocessor_96) .cse2 v_DerPreprocessor_95) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_243| v_DerPreprocessor_96) .cse2) (select |c_#memory_$Pointer$.base| .cse2)) (= (select v_DerPreprocessor_96 24) (select .cse3 24)) (not (= .cse2 0))))))) is different from true [2022-11-25 23:47:31,042 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_242| Int) (v_DerPreprocessor_93 (Array Int Int)) (v_DerPreprocessor_94 (Array Int Int))) (let ((.cse1 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_242|))) (let ((.cse0 (select .cse1 0))) (and (not (= .cse0 0)) (= (select |c_#memory_$Pointer$.base| .cse0) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse0 v_DerPreprocessor_93) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_242| v_DerPreprocessor_94) .cse0 v_DerPreprocessor_93) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_242| v_DerPreprocessor_94) .cse0)) (not (= .cse0 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_242|)) (= (select v_DerPreprocessor_94 24) (select .cse1 24)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_163| Int) (v_DerPreprocessor_97 (Array Int Int)) (v_DerPreprocessor_98 (Array Int Int))) (let ((.cse3 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_163|))) (let ((.cse2 (select .cse3 0))) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_163| .cse2)) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse2 v_DerPreprocessor_97) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_163| v_DerPreprocessor_98) .cse2 v_DerPreprocessor_97) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_163| v_DerPreprocessor_98) .cse2) (select |c_#memory_$Pointer$.base| .cse2)) (not (= .cse2 0)) (= (select v_DerPreprocessor_98 24) (select .cse3 24)))))) (exists ((v_DerPreprocessor_95 (Array Int Int)) (v_DerPreprocessor_96 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_243| Int)) (let ((.cse5 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_243|))) (let ((.cse4 (select .cse5 0))) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_243| .cse4)) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse4 v_DerPreprocessor_95) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_243| v_DerPreprocessor_96) .cse4 v_DerPreprocessor_95) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_243| v_DerPreprocessor_96) .cse4) (select |c_#memory_$Pointer$.base| .cse4)) (= (select v_DerPreprocessor_96 24) (select .cse5 24)) (not (= .cse4 0))))))) is different from true [2022-11-25 23:47:31,742 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_242| Int) (v_DerPreprocessor_93 (Array Int Int)) (v_DerPreprocessor_94 (Array Int Int))) (let ((.cse1 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_242|))) (let ((.cse0 (select .cse1 0))) (and (not (= .cse0 0)) (= (select |c_#memory_$Pointer$.base| .cse0) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse0 v_DerPreprocessor_93) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_242| v_DerPreprocessor_94) .cse0 v_DerPreprocessor_93) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_242| v_DerPreprocessor_94) .cse0)) (not (= .cse0 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_242|)) (= (select v_DerPreprocessor_94 24) (select .cse1 24)))))) (exists ((v_DerPreprocessor_100 (Array Int Int)) (v_DerPreprocessor_99 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_164| Int)) (let ((.cse3 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_164|))) (let ((.cse2 (select .cse3 0))) (and (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse2 v_DerPreprocessor_99) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_164| v_DerPreprocessor_100) .cse2 v_DerPreprocessor_99) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_164| v_DerPreprocessor_100) .cse2) (select |c_#memory_$Pointer$.base| .cse2)) (not (= .cse2 0)) (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_164| .cse2)) (= (select .cse3 24) (select v_DerPreprocessor_100 24)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_163| Int) (v_DerPreprocessor_97 (Array Int Int)) (v_DerPreprocessor_98 (Array Int Int))) (let ((.cse5 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_163|))) (let ((.cse4 (select .cse5 0))) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_163| .cse4)) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse4 v_DerPreprocessor_97) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_163| v_DerPreprocessor_98) .cse4 v_DerPreprocessor_97) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_163| v_DerPreprocessor_98) .cse4) (select |c_#memory_$Pointer$.base| .cse4)) (not (= .cse4 0)) (= (select v_DerPreprocessor_98 24) (select .cse5 24)))))) (exists ((v_DerPreprocessor_95 (Array Int Int)) (v_DerPreprocessor_96 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_243| Int)) (let ((.cse7 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_243|))) (let ((.cse6 (select .cse7 0))) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_243| .cse6)) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse6 v_DerPreprocessor_95) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_243| v_DerPreprocessor_96) .cse6 v_DerPreprocessor_95) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_243| v_DerPreprocessor_96) .cse6) (select |c_#memory_$Pointer$.base| .cse6)) (= (select v_DerPreprocessor_96 24) (select .cse7 24)) (not (= .cse6 0))))))) is different from true [2022-11-25 23:47:32,397 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_242| Int) (v_DerPreprocessor_93 (Array Int Int)) (v_DerPreprocessor_94 (Array Int Int))) (let ((.cse1 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_242|))) (let ((.cse0 (select .cse1 0))) (and (not (= .cse0 0)) (= (select |c_#memory_$Pointer$.base| .cse0) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse0 v_DerPreprocessor_93) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_242| v_DerPreprocessor_94) .cse0 v_DerPreprocessor_93) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_242| v_DerPreprocessor_94) .cse0)) (not (= .cse0 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_242|)) (= (select v_DerPreprocessor_94 24) (select .cse1 24)))))) (exists ((v_DerPreprocessor_100 (Array Int Int)) (v_DerPreprocessor_99 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_164| Int)) (let ((.cse3 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_164|))) (let ((.cse2 (select .cse3 0))) (and (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse2 v_DerPreprocessor_99) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_164| v_DerPreprocessor_100) .cse2 v_DerPreprocessor_99) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_164| v_DerPreprocessor_100) .cse2) (select |c_#memory_$Pointer$.base| .cse2)) (not (= .cse2 0)) (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_164| .cse2)) (= (select .cse3 24) (select v_DerPreprocessor_100 24)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_163| Int) (v_DerPreprocessor_97 (Array Int Int)) (v_DerPreprocessor_98 (Array Int Int))) (let ((.cse5 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_163|))) (let ((.cse4 (select .cse5 0))) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_163| .cse4)) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse4 v_DerPreprocessor_97) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_163| v_DerPreprocessor_98) .cse4 v_DerPreprocessor_97) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_163| v_DerPreprocessor_98) .cse4) (select |c_#memory_$Pointer$.base| .cse4)) (not (= .cse4 0)) (= (select v_DerPreprocessor_98 24) (select .cse5 24)))))) (exists ((v_DerPreprocessor_101 (Array Int Int)) (v_DerPreprocessor_102 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_165| Int)) (let ((.cse7 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_165|))) (let ((.cse6 (select .cse7 0))) (and (not (= .cse6 0)) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse6 v_DerPreprocessor_101) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_165| v_DerPreprocessor_102) .cse6 v_DerPreprocessor_101) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_165| v_DerPreprocessor_102) .cse6) (select |c_#memory_$Pointer$.base| .cse6)) (= (select .cse7 24) (select v_DerPreprocessor_102 24)) (not (= .cse6 |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_165|)))))) (exists ((v_DerPreprocessor_95 (Array Int Int)) (v_DerPreprocessor_96 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_243| Int)) (let ((.cse9 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_243|))) (let ((.cse8 (select .cse9 0))) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_243| .cse8)) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse8 v_DerPreprocessor_95) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_243| v_DerPreprocessor_96) .cse8 v_DerPreprocessor_95) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_243| v_DerPreprocessor_96) .cse8) (select |c_#memory_$Pointer$.base| .cse8)) (= (select v_DerPreprocessor_96 24) (select .cse9 24)) (not (= .cse8 0))))))) is different from true [2022-11-25 23:47:35,890 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_DerPreprocessor_103 (Array Int Int)) (v_DerPreprocessor_104 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_166| Int)) (let ((.cse1 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_166|))) (let ((.cse0 (select .cse1 0))) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_166| .cse0)) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse0 v_DerPreprocessor_103) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_166| v_DerPreprocessor_104) .cse0 v_DerPreprocessor_103) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_166| v_DerPreprocessor_104) .cse0) (select |c_#memory_$Pointer$.base| .cse0)) (not (= .cse0 0)) (= (select v_DerPreprocessor_104 24) (select .cse1 24)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_242| Int) (v_DerPreprocessor_93 (Array Int Int)) (v_DerPreprocessor_94 (Array Int Int))) (let ((.cse3 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_242|))) (let ((.cse2 (select .cse3 0))) (and (not (= .cse2 0)) (= (select |c_#memory_$Pointer$.base| .cse2) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse2 v_DerPreprocessor_93) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_242| v_DerPreprocessor_94) .cse2 v_DerPreprocessor_93) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_242| v_DerPreprocessor_94) .cse2)) (not (= .cse2 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_242|)) (= (select v_DerPreprocessor_94 24) (select .cse3 24)))))) (exists ((v_DerPreprocessor_100 (Array Int Int)) (v_DerPreprocessor_99 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_164| Int)) (let ((.cse5 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_164|))) (let ((.cse4 (select .cse5 0))) (and (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse4 v_DerPreprocessor_99) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_164| v_DerPreprocessor_100) .cse4 v_DerPreprocessor_99) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_164| v_DerPreprocessor_100) .cse4) (select |c_#memory_$Pointer$.base| .cse4)) (not (= .cse4 0)) (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_164| .cse4)) (= (select .cse5 24) (select v_DerPreprocessor_100 24)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_163| Int) (v_DerPreprocessor_97 (Array Int Int)) (v_DerPreprocessor_98 (Array Int Int))) (let ((.cse7 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_163|))) (let ((.cse6 (select .cse7 0))) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_163| .cse6)) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse6 v_DerPreprocessor_97) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_163| v_DerPreprocessor_98) .cse6 v_DerPreprocessor_97) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_163| v_DerPreprocessor_98) .cse6) (select |c_#memory_$Pointer$.base| .cse6)) (not (= .cse6 0)) (= (select v_DerPreprocessor_98 24) (select .cse7 24)))))) (exists ((v_DerPreprocessor_101 (Array Int Int)) (v_DerPreprocessor_102 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_165| Int)) (let ((.cse9 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_165|))) (let ((.cse8 (select .cse9 0))) (and (not (= .cse8 0)) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse8 v_DerPreprocessor_101) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_165| v_DerPreprocessor_102) .cse8 v_DerPreprocessor_101) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_165| v_DerPreprocessor_102) .cse8) (select |c_#memory_$Pointer$.base| .cse8)) (= (select .cse9 24) (select v_DerPreprocessor_102 24)) (not (= .cse8 |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_165|)))))) (exists ((v_DerPreprocessor_95 (Array Int Int)) (v_DerPreprocessor_96 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_243| Int)) (let ((.cse11 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_243|))) (let ((.cse10 (select .cse11 0))) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_243| .cse10)) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse10 v_DerPreprocessor_95) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_243| v_DerPreprocessor_96) .cse10 v_DerPreprocessor_95) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_243| v_DerPreprocessor_96) .cse10) (select |c_#memory_$Pointer$.base| .cse10)) (= (select v_DerPreprocessor_96 24) (select .cse11 24)) (not (= .cse10 0))))))) is different from true [2022-11-25 23:47:37,201 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_DerPreprocessor_103 (Array Int Int)) (v_DerPreprocessor_104 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_166| Int)) (let ((.cse1 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_166|))) (let ((.cse0 (select .cse1 0))) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_166| .cse0)) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse0 v_DerPreprocessor_103) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_166| v_DerPreprocessor_104) .cse0 v_DerPreprocessor_103) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_166| v_DerPreprocessor_104) .cse0) (select |c_#memory_$Pointer$.base| .cse0)) (not (= .cse0 0)) (= (select v_DerPreprocessor_104 24) (select .cse1 24)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_242| Int) (v_DerPreprocessor_93 (Array Int Int)) (v_DerPreprocessor_94 (Array Int Int))) (let ((.cse3 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_242|))) (let ((.cse2 (select .cse3 0))) (and (not (= .cse2 0)) (= (select |c_#memory_$Pointer$.base| .cse2) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse2 v_DerPreprocessor_93) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_242| v_DerPreprocessor_94) .cse2 v_DerPreprocessor_93) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_242| v_DerPreprocessor_94) .cse2)) (not (= .cse2 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_242|)) (= (select v_DerPreprocessor_94 24) (select .cse3 24)))))) (exists ((v_DerPreprocessor_100 (Array Int Int)) (v_DerPreprocessor_99 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_164| Int)) (let ((.cse5 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_164|))) (let ((.cse4 (select .cse5 0))) (and (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse4 v_DerPreprocessor_99) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_164| v_DerPreprocessor_100) .cse4 v_DerPreprocessor_99) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_164| v_DerPreprocessor_100) .cse4) (select |c_#memory_$Pointer$.base| .cse4)) (not (= .cse4 0)) (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_164| .cse4)) (= (select .cse5 24) (select v_DerPreprocessor_100 24)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_163| Int) (v_DerPreprocessor_97 (Array Int Int)) (v_DerPreprocessor_98 (Array Int Int))) (let ((.cse7 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_163|))) (let ((.cse6 (select .cse7 0))) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_163| .cse6)) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse6 v_DerPreprocessor_97) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_163| v_DerPreprocessor_98) .cse6 v_DerPreprocessor_97) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_163| v_DerPreprocessor_98) .cse6) (select |c_#memory_$Pointer$.base| .cse6)) (not (= .cse6 0)) (= (select v_DerPreprocessor_98 24) (select .cse7 24)))))) (exists ((v_DerPreprocessor_105 (Array Int Int)) (v_DerPreprocessor_106 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_73| Int)) (let ((.cse9 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_73|))) (let ((.cse8 (select .cse9 0))) (and (not (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_73| .cse8)) (= (select |c_#memory_$Pointer$.base| .cse8) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse8 v_DerPreprocessor_105) |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_73| v_DerPreprocessor_106) .cse8 v_DerPreprocessor_105) |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_73| v_DerPreprocessor_106) .cse8)) (= (select v_DerPreprocessor_106 24) (select .cse9 24)) (not (= .cse8 0)))))) (exists ((v_DerPreprocessor_101 (Array Int Int)) (v_DerPreprocessor_102 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_165| Int)) (let ((.cse11 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_165|))) (let ((.cse10 (select .cse11 0))) (and (not (= .cse10 0)) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse10 v_DerPreprocessor_101) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_165| v_DerPreprocessor_102) .cse10 v_DerPreprocessor_101) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_165| v_DerPreprocessor_102) .cse10) (select |c_#memory_$Pointer$.base| .cse10)) (= (select .cse11 24) (select v_DerPreprocessor_102 24)) (not (= .cse10 |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_165|)))))) (exists ((v_DerPreprocessor_95 (Array Int Int)) (v_DerPreprocessor_96 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_243| Int)) (let ((.cse13 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_243|))) (let ((.cse12 (select .cse13 0))) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_243| .cse12)) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse12 v_DerPreprocessor_95) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_243| v_DerPreprocessor_96) .cse12 v_DerPreprocessor_95) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_243| v_DerPreprocessor_96) .cse12) (select |c_#memory_$Pointer$.base| .cse12)) (= (select v_DerPreprocessor_96 24) (select .cse13 24)) (not (= .cse12 0))))))) is different from true [2022-11-25 23:47:41,103 INFO L321 Elim1Store]: treesize reduction 960, result has 0.1 percent of original size [2022-11-25 23:47:41,103 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 16 select indices, 16 select index equivalence classes, 0 disjoint index pairs (out of 120 index pairs), introduced 24 new quantified variables, introduced 120 case distinctions, treesize of input 496 treesize of output 358 [2022-11-25 23:47:41,119 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 1 [2022-11-25 23:47:41,126 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 57 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 57 not checked. [2022-11-25 23:47:41,126 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:47:43,283 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:47:43,283 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 33 [2022-11-25 23:47:43,325 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:47:43,326 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 154 treesize of output 156 [2022-11-25 23:47:43,335 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 144 treesize of output 140 [2022-11-25 23:47:43,345 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 140 treesize of output 138 [2022-11-25 23:47:43,463 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 6 treesize of output 4 [2022-11-25 23:47:43,473 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 24 treesize of output 22 [2022-11-25 23:47:43,523 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:47:43,524 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 61 [2022-11-25 23:47:44,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [910753515] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:47:44,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [623761829] [2022-11-25 23:47:44,348 INFO L159 IcfgInterpreter]: Started Sifa with 48 locations of interest [2022-11-25 23:47:44,348 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:47:44,349 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:47:44,349 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:47:44,349 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:47:44,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:47:44,524 INFO L321 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2022-11-25 23:47:44,524 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 12 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 37 treesize of output 61 [2022-11-25 23:47:44,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:47:44,551 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2022-11-25 23:47:44,747 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 24 treesize of output 9 [2022-11-25 23:47:44,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:47:44,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:47:44,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:47:44,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:47:44,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:47:44,772 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 0 case distinctions, treesize of input 62 treesize of output 77 [2022-11-25 23:47:44,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:47:44,803 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2022-11-25 23:47:44,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:47:44,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:47:44,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:47:44,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:47:44,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:47:44,833 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 0 case distinctions, treesize of input 62 treesize of output 77 [2022-11-25 23:47:44,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:47:44,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:47:45,012 INFO L321 Elim1Store]: treesize reduction 40, result has 48.1 percent of original size [2022-11-25 23:47:45,013 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 32 treesize of output 62 [2022-11-25 23:47:45,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:47:45,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:47:45,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:47:45,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:47:45,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:47:45,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:47:45,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:47:45,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:47:45,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:47:45,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:47:45,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:47:45,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:47:45,071 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:47:45,109 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-25 23:47:45,109 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 16 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 103 [2022-11-25 23:47:45,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:47:45,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:47:45,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:47:45,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:47:45,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:47:45,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:47:45,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:47:45,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:47:45,156 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:47:45,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:47:45,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:47:45,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:47:45,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:47:45,166 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:47:45,203 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-25 23:47:45,204 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 16 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 103 [2022-11-25 23:47:45,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:47:45,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:47:45,392 INFO L321 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-11-25 23:47:45,392 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 8 case distinctions, treesize of input 42 treesize of output 73 [2022-11-25 23:47:45,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:47:45,434 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 7 [2022-11-25 23:47:45,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:47:45,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:47:45,468 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 28 [2022-11-25 23:47:45,529 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-11-25 23:47:45,544 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 9 [2022-11-25 23:47:45,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:47:45,570 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2022-11-25 23:47:45,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:47:45,605 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 13 [2022-11-25 23:47:45,626 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:47:45,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:47:45,631 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 23 [2022-11-25 23:47:45,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:47:45,661 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 19 [2022-11-25 23:47:45,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:47:45,696 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 29 treesize of output 17 [2022-11-25 23:47:45,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:47:45,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:47:45,719 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 19 [2022-11-25 23:47:45,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:47:45,745 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 35 treesize of output 7 [2022-11-25 23:47:45,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:47:45,771 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 35 treesize of output 7 [2022-11-25 23:47:55,492 INFO L197 IcfgInterpreter]: Interpreting procedure aws_linked_list_empty with input of size 19 for LOIs [2022-11-25 23:47:55,542 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 74 for LOIs [2022-11-25 23:47:55,581 INFO L197 IcfgInterpreter]: Interpreting procedure aws_linked_list_is_valid with input of size 19 for LOIs [2022-11-25 23:47:56,301 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 15 for LOIs [2022-11-25 23:47:56,303 INFO L197 IcfgInterpreter]: Interpreting procedure nondet_uint64_t with input of size 104 for LOIs [2022-11-25 23:47:56,321 INFO L197 IcfgInterpreter]: Interpreting procedure aws_linked_list_node_next_is_valid with input of size 20 for LOIs [2022-11-25 23:47:56,379 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:48:37,454 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '14686#(and (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_272| Int)) (and (<= 0 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_272|) (not (= (mod (ite (= (ite (= (mod (ite (= (ite (and (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_272| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_272|) 0)) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_272|) 0) 16)) 1 0) 0) 0 1) 256) 0) 1 0) 0) 0 1) 256) 0)) (not (= (mod (ite (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_272| 0) 0 1) 256) 0)) (<= (ite (= (ite (and (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_272| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_272|) 0)) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_272|) 0) 16)) 1 0) 0) 0 1) 1) (<= 0 (ite (= (ite (and (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_272| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_272|) 0)) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_272|) 0) 16)) 1 0) 0) 0 1)))) (<= 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) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base_BEFORE_CALL_231| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_BEFORE_CALL_231| Int)) (and (<= 0 (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base_BEFORE_CALL_231|) (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_BEFORE_CALL_231| 24))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base_BEFORE_CALL_231|) (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_BEFORE_CALL_231| 24))) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base_BEFORE_CALL_231|) (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_BEFORE_CALL_231| 24))) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base_BEFORE_CALL_231|) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base_BEFORE_CALL_231|) (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_BEFORE_CALL_231| 24))) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base_BEFORE_CALL_231|) (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_BEFORE_CALL_231| 24))) (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_BEFORE_CALL_231| 16)) (<= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_BEFORE_CALL_231| 0) (<= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base_BEFORE_CALL_231|) (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_BEFORE_CALL_231| 24)) 0) (<= 0 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base_BEFORE_CALL_231|) (<= 0 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_BEFORE_CALL_231|))) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-11-25 23:48:37,454 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-25 23:48:37,454 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 23:48:37,454 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 29] total 38 [2022-11-25 23:48:37,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565928328] [2022-11-25 23:48:37,455 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 23:48:37,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-11-25 23:48:37,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:48:37,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-11-25 23:48:37,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=346, Invalid=5622, Unknown=66, NotChecked=1106, Total=7140 [2022-11-25 23:48:37,458 INFO L87 Difference]: Start difference. First operand 149 states and 185 transitions. Second operand has 38 states, 31 states have (on average 2.838709677419355) internal successors, (88), 32 states have internal predecessors, (88), 19 states have call successors, (36), 10 states have call predecessors, (36), 13 states have return successors, (35), 16 states have call predecessors, (35), 19 states have call successors, (35) [2022-11-25 23:48:38,627 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base_BEFORE_CALL_203| Int)) (= (select |c_#valid| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base_BEFORE_CALL_203|) 1)) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_242| Int) (v_DerPreprocessor_93 (Array Int Int)) (v_DerPreprocessor_94 (Array Int Int))) (let ((.cse1 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_242|))) (let ((.cse0 (select .cse1 0))) (and (not (= .cse0 0)) (= (select |c_#memory_$Pointer$.base| .cse0) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse0 v_DerPreprocessor_93) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_242| v_DerPreprocessor_94) .cse0 v_DerPreprocessor_93) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_242| v_DerPreprocessor_94) .cse0)) (not (= .cse0 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_242|)) (= (select v_DerPreprocessor_94 24) (select .cse1 24))))))) is different from true [2022-11-25 23:48:39,372 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_242| Int) (v_DerPreprocessor_93 (Array Int Int)) (v_DerPreprocessor_94 (Array Int Int))) (let ((.cse1 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_242|))) (let ((.cse0 (select .cse1 0))) (and (not (= .cse0 0)) (= (select |c_#memory_$Pointer$.base| .cse0) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse0 v_DerPreprocessor_93) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_242| v_DerPreprocessor_94) .cse0 v_DerPreprocessor_93) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_242| v_DerPreprocessor_94) .cse0)) (not (= .cse0 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_242|)) (= (select v_DerPreprocessor_94 24) (select .cse1 24)))))) (exists ((v_DerPreprocessor_100 (Array Int Int)) (v_DerPreprocessor_99 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_164| Int)) (let ((.cse3 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_164|))) (let ((.cse2 (select .cse3 0))) (and (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse2 v_DerPreprocessor_99) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_164| v_DerPreprocessor_100) .cse2 v_DerPreprocessor_99) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_164| v_DerPreprocessor_100) .cse2) (select |c_#memory_$Pointer$.base| .cse2)) (not (= .cse2 0)) (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_164| .cse2)) (= (select .cse3 24) (select v_DerPreprocessor_100 24)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_163| Int) (v_DerPreprocessor_97 (Array Int Int)) (v_DerPreprocessor_98 (Array Int Int))) (let ((.cse5 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_163|))) (let ((.cse4 (select .cse5 0))) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_163| .cse4)) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse4 v_DerPreprocessor_97) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_163| v_DerPreprocessor_98) .cse4 v_DerPreprocessor_97) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_163| v_DerPreprocessor_98) .cse4) (select |c_#memory_$Pointer$.base| .cse4)) (not (= .cse4 0)) (= (select v_DerPreprocessor_98 24) (select .cse5 24)))))) (exists ((v_DerPreprocessor_101 (Array Int Int)) (v_DerPreprocessor_102 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_165| Int)) (let ((.cse7 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_165|))) (let ((.cse6 (select .cse7 0))) (and (not (= .cse6 0)) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse6 v_DerPreprocessor_101) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_165| v_DerPreprocessor_102) .cse6 v_DerPreprocessor_101) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_165| v_DerPreprocessor_102) .cse6) (select |c_#memory_$Pointer$.base| .cse6)) (= (select .cse7 24) (select v_DerPreprocessor_102 24)) (not (= .cse6 |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_165|)))))) (or (not (= (select (select |c_#memory_$Pointer$.base| |c_aws_linked_list_is_valid_#in~list#1.base|) |c_aws_linked_list_is_valid_#in~list#1.offset|) 0)) (not (= (select (select |c_#memory_$Pointer$.offset| |c_aws_linked_list_is_valid_#in~list#1.base|) |c_aws_linked_list_is_valid_#in~list#1.offset|) 0))) (exists ((v_DerPreprocessor_95 (Array Int Int)) (v_DerPreprocessor_96 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_243| Int)) (let ((.cse9 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_243|))) (let ((.cse8 (select .cse9 0))) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_243| .cse8)) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse8 v_DerPreprocessor_95) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_243| v_DerPreprocessor_96) .cse8 v_DerPreprocessor_95) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_243| v_DerPreprocessor_96) .cse8) (select |c_#memory_$Pointer$.base| .cse8)) (= (select v_DerPreprocessor_96 24) (select .cse9 24)) (not (= .cse8 0))))))) is different from true [2022-11-25 23:48:41,544 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_DerPreprocessor_103 (Array Int Int)) (v_DerPreprocessor_104 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_166| Int)) (let ((.cse1 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_166|))) (let ((.cse0 (select .cse1 0))) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_166| .cse0)) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse0 v_DerPreprocessor_103) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_166| v_DerPreprocessor_104) .cse0 v_DerPreprocessor_103) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_166| v_DerPreprocessor_104) .cse0) (select |c_#memory_$Pointer$.base| .cse0)) (not (= .cse0 0)) (= (select v_DerPreprocessor_104 24) (select .cse1 24)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_242| Int) (v_DerPreprocessor_93 (Array Int Int)) (v_DerPreprocessor_94 (Array Int Int))) (let ((.cse3 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_242|))) (let ((.cse2 (select .cse3 0))) (and (not (= .cse2 0)) (= (select |c_#memory_$Pointer$.base| .cse2) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse2 v_DerPreprocessor_93) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_242| v_DerPreprocessor_94) .cse2 v_DerPreprocessor_93) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_242| v_DerPreprocessor_94) .cse2)) (not (= .cse2 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_242|)) (= (select v_DerPreprocessor_94 24) (select .cse3 24)))))) (exists ((v_DerPreprocessor_100 (Array Int Int)) (v_DerPreprocessor_99 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_164| Int)) (let ((.cse5 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_164|))) (let ((.cse4 (select .cse5 0))) (and (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse4 v_DerPreprocessor_99) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_164| v_DerPreprocessor_100) .cse4 v_DerPreprocessor_99) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_164| v_DerPreprocessor_100) .cse4) (select |c_#memory_$Pointer$.base| .cse4)) (not (= .cse4 0)) (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_164| .cse4)) (= (select .cse5 24) (select v_DerPreprocessor_100 24)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_163| Int) (v_DerPreprocessor_97 (Array Int Int)) (v_DerPreprocessor_98 (Array Int Int))) (let ((.cse7 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_163|))) (let ((.cse6 (select .cse7 0))) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_163| .cse6)) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse6 v_DerPreprocessor_97) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_163| v_DerPreprocessor_98) .cse6 v_DerPreprocessor_97) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_163| v_DerPreprocessor_98) .cse6) (select |c_#memory_$Pointer$.base| .cse6)) (not (= .cse6 0)) (= (select v_DerPreprocessor_98 24) (select .cse7 24)))))) (exists ((v_DerPreprocessor_105 (Array Int Int)) (v_DerPreprocessor_106 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_73| Int)) (let ((.cse9 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_73|))) (let ((.cse8 (select .cse9 0))) (and (not (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_73| .cse8)) (= (select |c_#memory_$Pointer$.base| .cse8) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse8 v_DerPreprocessor_105) |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_73| v_DerPreprocessor_106) .cse8 v_DerPreprocessor_105) |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_73| v_DerPreprocessor_106) .cse8)) (= (select v_DerPreprocessor_106 24) (select .cse9 24)) (not (= .cse8 0)))))) (exists ((v_DerPreprocessor_101 (Array Int Int)) (v_DerPreprocessor_102 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_165| Int)) (let ((.cse11 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_165|))) (let ((.cse10 (select .cse11 0))) (and (not (= .cse10 0)) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse10 v_DerPreprocessor_101) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_165| v_DerPreprocessor_102) .cse10 v_DerPreprocessor_101) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_165| v_DerPreprocessor_102) .cse10) (select |c_#memory_$Pointer$.base| .cse10)) (= (select .cse11 24) (select v_DerPreprocessor_102 24)) (not (= .cse10 |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_165|)))))) (or (not (= (select (select |c_#memory_$Pointer$.base| |c_aws_linked_list_is_valid_#in~list#1.base|) |c_aws_linked_list_is_valid_#in~list#1.offset|) 0)) (not (= (select (select |c_#memory_$Pointer$.offset| |c_aws_linked_list_is_valid_#in~list#1.base|) |c_aws_linked_list_is_valid_#in~list#1.offset|) 0))) (exists ((v_DerPreprocessor_95 (Array Int Int)) (v_DerPreprocessor_96 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_243| Int)) (let ((.cse13 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_243|))) (let ((.cse12 (select .cse13 0))) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_243| .cse12)) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse12 v_DerPreprocessor_95) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_243| v_DerPreprocessor_96) .cse12 v_DerPreprocessor_95) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_243| v_DerPreprocessor_96) .cse12) (select |c_#memory_$Pointer$.base| .cse12)) (= (select v_DerPreprocessor_96 24) (select .cse13 24)) (not (= .cse12 0))))))) is different from true [2022-11-25 23:48:59,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:48:59,438 INFO L93 Difference]: Finished difference Result 553 states and 710 transitions. [2022-11-25 23:48:59,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-11-25 23:48:59,439 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 31 states have (on average 2.838709677419355) internal successors, (88), 32 states have internal predecessors, (88), 19 states have call successors, (36), 10 states have call predecessors, (36), 13 states have return successors, (35), 16 states have call predecessors, (35), 19 states have call successors, (35) Word has length 98 [2022-11-25 23:48:59,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:48:59,443 INFO L225 Difference]: With dead ends: 553 [2022-11-25 23:48:59,443 INFO L226 Difference]: Without dead ends: 436 [2022-11-25 23:48:59,447 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 225 SyntacticMatches, 12 SemanticMatches, 117 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 4011 ImplicationChecksByTransitivity, 53.9s TimeCoverageRelationStatistics Valid=628, Invalid=11007, Unknown=177, NotChecked=2230, Total=14042 [2022-11-25 23:48:59,448 INFO L413 NwaCegarLoop]: 235 mSDtfsCounter, 202 mSDsluCounter, 3164 mSDsCounter, 0 mSdLazyCounter, 3826 mSolverCounterSat, 96 mSolverCounterUnsat, 187 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 3399 SdHoareTripleChecker+Invalid, 6492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 3826 IncrementalHoareTripleChecker+Invalid, 187 IncrementalHoareTripleChecker+Unknown, 2383 IncrementalHoareTripleChecker+Unchecked, 16.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:48:59,448 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 3399 Invalid, 6492 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [96 Valid, 3826 Invalid, 187 Unknown, 2383 Unchecked, 16.1s Time] [2022-11-25 23:48:59,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2022-11-25 23:48:59,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 320. [2022-11-25 23:48:59,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 191 states have (on average 1.1727748691099475) internal successors, (224), 194 states have internal predecessors, (224), 84 states have call successors, (84), 43 states have call predecessors, (84), 44 states have return successors, (83), 82 states have call predecessors, (83), 82 states have call successors, (83) [2022-11-25 23:48:59,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 391 transitions. [2022-11-25 23:48:59,552 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 391 transitions. Word has length 98 [2022-11-25 23:48:59,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:48:59,552 INFO L495 AbstractCegarLoop]: Abstraction has 320 states and 391 transitions. [2022-11-25 23:48:59,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 31 states have (on average 2.838709677419355) internal successors, (88), 32 states have internal predecessors, (88), 19 states have call successors, (36), 10 states have call predecessors, (36), 13 states have return successors, (35), 16 states have call predecessors, (35), 19 states have call successors, (35) [2022-11-25 23:48:59,553 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 391 transitions. [2022-11-25 23:48:59,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-11-25 23:48:59,554 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:48:59,554 INFO L195 NwaCegarLoop]: trace histogram [9, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:48:59,572 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94242371-04b9-4a99-bf94-885615788746/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-25 23:48:59,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94242371-04b9-4a99-bf94-885615788746/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-25 23:48:59,773 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:48:59,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:48:59,773 INFO L85 PathProgramCache]: Analyzing trace with hash 2049678780, now seen corresponding path program 2 times [2022-11-25 23:48:59,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:48:59,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749420749] [2022-11-25 23:48:59,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:48:59,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:48:59,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:49:02,694 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 29 proven. 12 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2022-11-25 23:49:02,694 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:49:02,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749420749] [2022-11-25 23:49:02,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749420749] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:49:02,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1488499346] [2022-11-25 23:49:02,695 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 23:49:02,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:49:02,695 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94242371-04b9-4a99-bf94-885615788746/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:49:02,697 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94242371-04b9-4a99-bf94-885615788746/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:49:02,706 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94242371-04b9-4a99-bf94-885615788746/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-25 23:49:03,641 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-11-25 23:49:03,641 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 23:49:03,647 INFO L263 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 108 conjunts are in the unsatisfiable core [2022-11-25 23:49:03,655 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:49:03,689 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-25 23:49:03,838 INFO L321 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2022-11-25 23:49:03,839 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 27 treesize of output 45 [2022-11-25 23:49:05,323 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-25 23:49:05,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:49:05,338 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-25 23:49:05,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:49:05,414 INFO L321 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2022-11-25 23:49:05,414 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 28 [2022-11-25 23:49:05,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:49:05,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:49:05,710 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 23:49:05,710 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 25 [2022-11-25 23:49:05,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:49:05,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:49:05,913 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 21 [2022-11-25 23:49:05,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:49:05,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:49:05,925 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2022-11-25 23:49:05,932 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 10 treesize of output 9 [2022-11-25 23:49:05,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:49:05,950 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 20 [2022-11-25 23:49:20,575 WARN L233 SmtUtils]: Spent 6.73s on a formula simplification that was a NOOP. DAG size: 89 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 23:49:27,842 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 70 proven. 21 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-11-25 23:49:27,842 INFO L328 TraceCheckSpWp]: Computing backward predicates...