./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 6b4ec56b 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_938a64e2-7277-4202-880d-2371f7fea809/bin/utaipan-6cKwYrpEi9/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938a64e2-7277-4202-880d-2371f7fea809/bin/utaipan-6cKwYrpEi9/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938a64e2-7277-4202-880d-2371f7fea809/bin/utaipan-6cKwYrpEi9/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938a64e2-7277-4202-880d-2371f7fea809/bin/utaipan-6cKwYrpEi9/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_938a64e2-7277-4202-880d-2371f7fea809/bin/utaipan-6cKwYrpEi9/config/svcomp-Reach-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938a64e2-7277-4202-880d-2371f7fea809/bin/utaipan-6cKwYrpEi9 --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-6b4ec56 [2022-11-20 19:54:06,124 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 19:54:06,126 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 19:54:06,145 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 19:54:06,145 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 19:54:06,146 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 19:54:06,147 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 19:54:06,149 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 19:54:06,151 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 19:54:06,152 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 19:54:06,153 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 19:54:06,154 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 19:54:06,154 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 19:54:06,155 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 19:54:06,157 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 19:54:06,158 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 19:54:06,159 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 19:54:06,159 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 19:54:06,161 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 19:54:06,163 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 19:54:06,164 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 19:54:06,166 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 19:54:06,167 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 19:54:06,168 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 19:54:06,171 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 19:54:06,171 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 19:54:06,172 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 19:54:06,173 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 19:54:06,173 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 19:54:06,174 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 19:54:06,174 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 19:54:06,175 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 19:54:06,176 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 19:54:06,177 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 19:54:06,178 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 19:54:06,178 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 19:54:06,179 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 19:54:06,179 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 19:54:06,180 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 19:54:06,180 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 19:54:06,181 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 19:54:06,182 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938a64e2-7277-4202-880d-2371f7fea809/bin/utaipan-6cKwYrpEi9/config/svcomp-Reach-64bit-Taipan_Default.epf [2022-11-20 19:54:06,205 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 19:54:06,205 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 19:54:06,206 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 19:54:06,206 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 19:54:06,207 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 19:54:06,207 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 19:54:06,207 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-20 19:54:06,208 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-20 19:54:06,208 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-20 19:54:06,208 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-20 19:54:06,208 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-20 19:54:06,209 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-20 19:54:06,209 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-20 19:54:06,209 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-20 19:54:06,210 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-20 19:54:06,210 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-20 19:54:06,210 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-20 19:54:06,210 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-20 19:54:06,211 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 19:54:06,212 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 19:54:06,212 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 19:54:06,212 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 19:54:06,212 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 19:54:06,213 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 19:54:06,213 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 19:54:06,213 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 19:54:06,214 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 19:54:06,214 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 19:54:06,214 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 19:54:06,215 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 19:54:06,215 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 19:54:06,215 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-20 19:54:06,215 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 19:54:06,216 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 19:54:06,216 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-20 19:54:06,216 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 19:54:06,216 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 19:54:06,217 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-20 19:54:06,217 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_938a64e2-7277-4202-880d-2371f7fea809/bin/utaipan-6cKwYrpEi9/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_938a64e2-7277-4202-880d-2371f7fea809/bin/utaipan-6cKwYrpEi9 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-20 19:54:06,588 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 19:54:06,647 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 19:54:06,650 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 19:54:06,652 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 19:54:06,653 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 19:54:06,655 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938a64e2-7277-4202-880d-2371f7fea809/bin/utaipan-6cKwYrpEi9/../../sv-benchmarks/c/aws-c-common/aws_linked_list_pop_back_harness.i [2022-11-20 19:54:09,982 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 19:54:10,473 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 19:54:10,474 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938a64e2-7277-4202-880d-2371f7fea809/sv-benchmarks/c/aws-c-common/aws_linked_list_pop_back_harness.i [2022-11-20 19:54:10,525 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938a64e2-7277-4202-880d-2371f7fea809/bin/utaipan-6cKwYrpEi9/data/8cd7960fe/ce058fde50de4f4b93b3129df40918e8/FLAG5ecd337cf [2022-11-20 19:54:10,547 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938a64e2-7277-4202-880d-2371f7fea809/bin/utaipan-6cKwYrpEi9/data/8cd7960fe/ce058fde50de4f4b93b3129df40918e8 [2022-11-20 19:54:10,552 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 19:54:10,554 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 19:54:10,560 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 19:54:10,561 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 19:54:10,565 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 19:54:10,566 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:54:10" (1/1) ... [2022-11-20 19:54:10,567 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16c233bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:54:10, skipping insertion in model container [2022-11-20 19:54:10,567 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:54:10" (1/1) ... [2022-11-20 19:54:10,576 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 19:54:10,676 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 19:54:10,997 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_938a64e2-7277-4202-880d-2371f7fea809/sv-benchmarks/c/aws-c-common/aws_linked_list_pop_back_harness.i[4498,4511] [2022-11-20 19:54:11,007 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_938a64e2-7277-4202-880d-2371f7fea809/sv-benchmarks/c/aws-c-common/aws_linked_list_pop_back_harness.i[4558,4571] [2022-11-20 19:54:12,096 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 19:54:12,097 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 19:54:12,098 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 19:54:12,099 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 19:54:12,100 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 19:54:12,113 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 19:54:12,114 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 19:54:12,116 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 19:54:12,117 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 19:54:12,119 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 19:54:12,121 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 19:54:12,122 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 19:54:12,122 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 19:54:12,692 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-11-20 19:54:12,693 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-11-20 19:54:12,695 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-11-20 19:54:12,697 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-11-20 19:54:12,698 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-11-20 19:54:12,699 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-11-20 19:54:12,701 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-11-20 19:54:12,702 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-11-20 19:54:12,714 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-11-20 19:54:12,715 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-11-20 19:54:12,916 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-11-20 19:54:12,950 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 19:54:12,971 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 19:54:12,989 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_938a64e2-7277-4202-880d-2371f7fea809/sv-benchmarks/c/aws-c-common/aws_linked_list_pop_back_harness.i[4498,4511] [2022-11-20 19:54:13,006 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_938a64e2-7277-4202-880d-2371f7fea809/sv-benchmarks/c/aws-c-common/aws_linked_list_pop_back_harness.i[4558,4571] [2022-11-20 19:54:13,061 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 19:54:13,062 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 19:54:13,063 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 19:54:13,063 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 19:54:13,064 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 19:54:13,075 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 19:54:13,076 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 19:54:13,077 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 19:54:13,078 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 19:54:13,080 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 19:54:13,081 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 19:54:13,082 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 19:54:13,082 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 19:54:13,217 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-11-20 19:54:13,219 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-11-20 19:54:13,220 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-11-20 19:54:13,221 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-11-20 19:54:13,222 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-11-20 19:54:13,223 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-11-20 19:54:13,224 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-11-20 19:54:13,224 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-11-20 19:54:13,225 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-11-20 19:54:13,226 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-11-20 19:54:13,290 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-11-20 19:54:13,332 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 19:54:13,591 INFO L208 MainTranslator]: Completed translation [2022-11-20 19:54:13,592 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:54:13 WrapperNode [2022-11-20 19:54:13,592 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 19:54:13,594 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 19:54:13,594 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 19:54:13,594 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 19:54:13,604 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:54:13" (1/1) ... [2022-11-20 19:54:13,712 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:54:13" (1/1) ... [2022-11-20 19:54:13,799 INFO L138 Inliner]: procedures = 679, calls = 1045, calls flagged for inlining = 52, calls inlined = 8, statements flattened = 224 [2022-11-20 19:54:13,799 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 19:54:13,804 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 19:54:13,804 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 19:54:13,805 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 19:54:13,818 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:54:13" (1/1) ... [2022-11-20 19:54:13,819 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:54:13" (1/1) ... [2022-11-20 19:54:13,842 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:54:13" (1/1) ... [2022-11-20 19:54:13,843 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:54:13" (1/1) ... [2022-11-20 19:54:13,876 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:54:13" (1/1) ... [2022-11-20 19:54:13,896 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:54:13" (1/1) ... [2022-11-20 19:54:13,901 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:54:13" (1/1) ... [2022-11-20 19:54:13,904 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:54:13" (1/1) ... [2022-11-20 19:54:13,911 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 19:54:13,912 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 19:54:13,912 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 19:54:13,912 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 19:54:13,913 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:54:13" (1/1) ... [2022-11-20 19:54:13,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 19:54:13,945 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938a64e2-7277-4202-880d-2371f7fea809/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 19:54:13,967 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938a64e2-7277-4202-880d-2371f7fea809/bin/utaipan-6cKwYrpEi9/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 19:54:13,990 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938a64e2-7277-4202-880d-2371f7fea809/bin/utaipan-6cKwYrpEi9/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 19:54:14,024 INFO L130 BoogieDeclarations]: Found specification of procedure aws_is_mem_zeroed [2022-11-20 19:54:14,025 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_is_mem_zeroed [2022-11-20 19:54:14,026 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_remove [2022-11-20 19:54:14,027 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_remove [2022-11-20 19:54:14,027 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 19:54:14,027 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-20 19:54:14,028 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-20 19:54:14,028 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-20 19:54:14,028 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2022-11-20 19:54:14,029 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2022-11-20 19:54:14,030 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-20 19:54:14,030 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_is_valid [2022-11-20 19:54:14,030 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_is_valid [2022-11-20 19:54:14,031 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 19:54:14,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-20 19:54:14,031 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 19:54:14,031 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 19:54:14,031 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_empty [2022-11-20 19:54:14,032 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_empty [2022-11-20 19:54:14,032 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-11-20 19:54:14,032 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-11-20 19:54:14,032 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-20 19:54:14,032 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-20 19:54:14,033 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 19:54:14,033 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-20 19:54:14,034 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-20 19:54:14,034 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2022-11-20 19:54:14,034 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2022-11-20 19:54:14,034 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_prev_is_valid [2022-11-20 19:54:14,034 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_prev_is_valid [2022-11-20 19:54:14,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 19:54:14,489 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 19:54:14,490 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 19:54:15,037 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 19:54:15,214 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 19:54:15,215 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2022-11-20 19:54:15,218 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:54:15 BoogieIcfgContainer [2022-11-20 19:54:15,219 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 19:54:15,222 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 19:54:15,222 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 19:54:15,226 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 19:54:15,226 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 07:54:10" (1/3) ... [2022-11-20 19:54:15,227 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c5902d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:54:15, skipping insertion in model container [2022-11-20 19:54:15,228 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:54:13" (2/3) ... [2022-11-20 19:54:15,228 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c5902d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:54:15, skipping insertion in model container [2022-11-20 19:54:15,228 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:54:15" (3/3) ... [2022-11-20 19:54:15,230 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_linked_list_pop_back_harness.i [2022-11-20 19:54:15,254 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 19:54:15,254 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-20 19:54:15,337 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 19:54:15,345 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;@795aa084, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 19:54:15,346 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-20 19:54:15,351 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-20 19:54:15,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-11-20 19:54:15,364 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 19:54:15,365 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-20 19:54:15,369 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 19:54:15,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 19:54:15,378 INFO L85 PathProgramCache]: Analyzing trace with hash -53848961, now seen corresponding path program 1 times [2022-11-20 19:54:15,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 19:54:15,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017577389] [2022-11-20 19:54:15,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 19:54:15,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 19:54:15,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 19:54:16,569 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-20 19:54:16,570 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 19:54:16,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017577389] [2022-11-20 19:54:16,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017577389] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 19:54:16,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1047254350] [2022-11-20 19:54:16,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 19:54:16,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 19:54:16,572 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938a64e2-7277-4202-880d-2371f7fea809/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 19:54:16,576 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938a64e2-7277-4202-880d-2371f7fea809/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 19:54:16,582 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938a64e2-7277-4202-880d-2371f7fea809/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-20 19:54:16,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 19:54:16,882 INFO L263 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 97 conjunts are in the unsatisfiable core [2022-11-20 19:54:16,900 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 19:54:17,072 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-20 19:54:17,101 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-20 19:54:17,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:54:17,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:54:17,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:54:17,248 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-20 19:54:17,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:54:17,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:54:17,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:54:17,284 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-20 19:54:20,330 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-20 19:54:20,331 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 19:54:20,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1047254350] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 19:54:20,332 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 19:54:20,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [5] total 12 [2022-11-20 19:54:20,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470898439] [2022-11-20 19:54:20,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 19:54:20,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 19:54:20,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 19:54:20,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 19:54:20,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-11-20 19:54:20,379 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-20 19:54:21,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 19:54:21,027 INFO L93 Difference]: Finished difference Result 232 states and 346 transitions. [2022-11-20 19:54:21,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 19:54:21,031 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-20 19:54:21,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 19:54:21,042 INFO L225 Difference]: With dead ends: 232 [2022-11-20 19:54:21,042 INFO L226 Difference]: Without dead ends: 143 [2022-11-20 19:54:21,047 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 56 SyntacticMatches, 8 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2022-11-20 19:54:21,051 INFO L413 NwaCegarLoop]: 161 mSDtfsCounter, 21 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 698 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 102 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 19:54:21,052 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 698 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 156 Invalid, 0 Unknown, 102 Unchecked, 0.4s Time] [2022-11-20 19:54:21,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-11-20 19:54:21,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 113. [2022-11-20 19:54:21,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 57 states have (on average 1.1929824561403508) internal successors, (68), 58 states have internal predecessors, (68), 43 states have call successors, (43), 13 states have call predecessors, (43), 12 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2022-11-20 19:54:21,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 153 transitions. [2022-11-20 19:54:21,122 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 153 transitions. Word has length 70 [2022-11-20 19:54:21,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 19:54:21,123 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 153 transitions. [2022-11-20 19:54:21,124 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-20 19:54:21,124 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 153 transitions. [2022-11-20 19:54:21,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-11-20 19:54:21,127 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 19:54:21,128 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-20 19:54:21,139 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938a64e2-7277-4202-880d-2371f7fea809/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-20 19:54:21,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938a64e2-7277-4202-880d-2371f7fea809/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2022-11-20 19:54:21,337 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 19:54:21,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 19:54:21,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1869393802, now seen corresponding path program 1 times [2022-11-20 19:54:21,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 19:54:21,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337267408] [2022-11-20 19:54:21,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 19:54:21,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 19:54:21,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 19:54:21,697 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-20 19:54:21,697 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 19:54:21,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337267408] [2022-11-20 19:54:21,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337267408] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 19:54:21,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [176544786] [2022-11-20 19:54:21,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 19:54:21,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 19:54:21,699 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938a64e2-7277-4202-880d-2371f7fea809/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 19:54:21,700 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938a64e2-7277-4202-880d-2371f7fea809/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 19:54:21,713 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938a64e2-7277-4202-880d-2371f7fea809/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-20 19:54:22,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 19:54:22,006 INFO L263 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 114 conjunts are in the unsatisfiable core [2022-11-20 19:54:22,017 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 19:54:22,036 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-20 19:54:22,225 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-20 19:54:22,258 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-20 19:54:22,362 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 19:54:22,363 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-20 19:54:22,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:54:22,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:54:22,377 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-20 19:54:22,384 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-20 19:54:22,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:54:22,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:54:22,406 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-20 19:54:22,417 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-20 19:54:22,565 INFO L321 Elim1Store]: treesize reduction 42, result has 20.8 percent of original size [2022-11-20 19:54:22,566 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-20 19:54:22,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:54:22,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:54:22,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:54:22,583 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-20 19:54:22,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:54:22,599 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-20 19:54:22,615 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-20 19:54:22,638 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-20 19:54:22,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 13 treesize of output 9 [2022-11-20 19:54:22,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:54:22,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:54:22,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:54:22,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-20 19:54:26,368 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-20 19:54:26,368 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 19:54:32,089 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-20 19:54:32,972 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 19:54:32,972 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-20 19:54:32,992 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 19:54:32,993 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-20 19:54:33,009 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 19:54:33,009 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-20 19:54:33,079 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 19:54:33,080 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-20 19:54:33,106 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-20 19:54:33,140 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-20 19:54:33,163 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-20 19:54:33,189 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-20 19:54:33,376 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-20 19:54:33,396 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-20 19:54:33,451 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 19:54:33,452 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-20 19:54:33,497 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 19:54:33,497 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-20 19:54:33,592 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 19:54:33,592 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-20 19:54:33,611 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 19:54:33,611 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-20 19:54:33,625 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-20 19:54:33,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 87 treesize of output 79 [2022-11-20 19:54:33,818 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-20 19:54:33,849 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 19:54:33,850 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-20 19:54:34,001 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 19:54:34,002 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-20 19:54:34,022 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 19:54:34,023 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-20 19:54:34,035 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-20 19:54:34,049 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-20 19:54:34,181 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-20 19:54:34,214 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 19:54:34,215 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-20 19:54:34,291 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 19:54:34,292 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-20 19:54:34,300 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 19:54:34,313 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 19:54:34,314 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-20 19:54:34,325 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-20 19:54:34,390 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-20 19:54:34,440 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 19:54:34,441 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-20 19:54:34,500 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 19:54:34,501 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-20 19:54:34,522 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 19:54:34,523 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-20 19:54:34,536 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-20 19:54:34,551 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-20 19:54:34,703 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-20 19:54:34,738 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 19:54:34,739 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-20 19:54:34,847 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 19:54:34,848 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-20 19:54:34,878 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 19:54:34,879 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-20 19:54:34,904 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 19:54:34,905 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-20 19:54:34,925 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-20 19:54:34,942 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-20 19:54:34,956 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 19:54:34,970 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 19:54:34,971 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-20 19:54:34,988 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-20 19:54:35,109 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-20 19:54:35,147 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-20 19:54:35,180 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 19:54:35,180 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-20 19:54:35,271 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 19:54:35,272 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-20 19:54:35,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [176544786] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 19:54:35,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2001696969] [2022-11-20 19:54:35,810 INFO L159 IcfgInterpreter]: Started Sifa with 39 locations of interest [2022-11-20 19:54:35,810 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 19:54:35,815 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-20 19:54:35,822 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-20 19:54:35,822 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-20 19:54:35,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:54:35,974 INFO L321 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2022-11-20 19:54:35,975 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-20 19:54:35,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:54:36,000 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-20 19:54:36,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:54:36,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:54:36,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:54:36,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:54:36,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:54:36,409 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-20 19:54:36,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:54:36,447 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-20 19:54:36,473 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-20 19:54:36,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:54:36,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:54:36,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:54:36,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:54:36,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:54:36,499 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-20 19:54:36,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:54:36,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:54:36,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:54:36,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:54:36,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:54:36,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:54:36,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:54:36,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:54:36,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:54:36,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:54:36,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:54:36,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:54:36,585 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 19:54:36,601 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-20 19:54:36,602 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-20 19:54:36,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:54:36,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:54:36,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:54:36,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:54:36,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:54:36,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:54:36,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:54:36,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:54:36,642 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 19:54:36,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:54:36,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:54:36,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:54:36,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:54:36,651 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 19:54:36,674 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-20 19:54:36,677 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-20 19:54:36,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:54:36,720 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-20 19:54:36,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:54:36,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:54:36,835 INFO L321 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-11-20 19:54:36,835 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-20 19:54:36,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:54:36,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:54:36,886 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-20 19:54:36,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:54:36,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:54:36,915 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-20 19:54:37,017 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-20 19:54:37,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:54:37,045 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-20 19:54:37,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:54:37,078 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-20 19:54:37,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:54:37,108 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-20 19:54:37,123 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 19:54:37,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:54:37,126 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-20 19:54:37,143 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-20 19:54:37,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:54:37,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:54:37,180 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-20 19:54:37,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:54:37,200 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-20 19:54:37,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:54:37,221 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-20 19:54:37,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:54:37,243 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-20 19:54:41,641 INFO L197 IcfgInterpreter]: Interpreting procedure aws_linked_list_empty with input of size 109 for LOIs [2022-11-20 19:54:41,998 INFO L197 IcfgInterpreter]: Interpreting procedure aws_linked_list_is_valid with input of size 73 for LOIs [2022-11-20 19:54:42,302 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 15 for LOIs [2022-11-20 19:54:42,306 INFO L197 IcfgInterpreter]: Interpreting procedure nondet_uint64_t with input of size 104 for LOIs [2022-11-20 19:54:42,330 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-20 19:54:50,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [2001696969] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 19:54:50,489 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-20 19:54:50,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [5, 11] total 34 [2022-11-20 19:54:50,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377520065] [2022-11-20 19:54:50,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 19:54:50,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-20 19:54:50,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 19:54:50,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-20 19:54:50,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=1489, Unknown=2, NotChecked=78, Total=1722 [2022-11-20 19:54:50,493 INFO L87 Difference]: Start difference. First operand 113 states and 153 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-20 19:54:53,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 19:54:53,103 INFO L93 Difference]: Finished difference Result 207 states and 274 transitions. [2022-11-20 19:54:53,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-20 19:54:53,104 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-20 19:54:53,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 19:54:53,108 INFO L225 Difference]: With dead ends: 207 [2022-11-20 19:54:53,108 INFO L226 Difference]: Without dead ends: 123 [2022-11-20 19:54:53,110 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 151 SyntacticMatches, 19 SemanticMatches, 42 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 653 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=171, Invalid=1637, Unknown=2, NotChecked=82, Total=1892 [2022-11-20 19:54:53,111 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 76 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 1017 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 481 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-20 19:54:53,112 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 362 Invalid, 1017 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 482 Invalid, 0 Unknown, 481 Unchecked, 1.6s Time] [2022-11-20 19:54:53,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-11-20 19:54:53,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 119. [2022-11-20 19:54:53,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 60 states have (on average 1.1833333333333333) internal successors, (71), 61 states have internal predecessors, (71), 43 states have call successors, (43), 16 states have call predecessors, (43), 15 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2022-11-20 19:54:53,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 156 transitions. [2022-11-20 19:54:53,167 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 156 transitions. Word has length 71 [2022-11-20 19:54:53,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 19:54:53,167 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 156 transitions. [2022-11-20 19:54:53,168 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-20 19:54:53,168 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 156 transitions. [2022-11-20 19:54:53,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-11-20 19:54:53,170 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 19:54:53,170 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-20 19:54:53,180 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938a64e2-7277-4202-880d-2371f7fea809/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-20 19:54:53,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938a64e2-7277-4202-880d-2371f7fea809/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 19:54:53,379 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 19:54:53,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 19:54:53,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1341664707, now seen corresponding path program 1 times [2022-11-20 19:54:53,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 19:54:53,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016293668] [2022-11-20 19:54:53,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 19:54:53,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 19:54:53,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 19:54:53,668 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-20 19:54:53,668 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 19:54:53,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016293668] [2022-11-20 19:54:53,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016293668] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 19:54:53,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1586426521] [2022-11-20 19:54:53,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 19:54:53,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 19:54:53,669 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938a64e2-7277-4202-880d-2371f7fea809/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 19:54:53,670 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938a64e2-7277-4202-880d-2371f7fea809/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 19:54:53,703 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938a64e2-7277-4202-880d-2371f7fea809/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-20 19:54:53,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 19:54:53,934 INFO L263 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-20 19:54:53,938 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 19:54:54,034 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-20 19:54:54,034 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 19:54:54,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1586426521] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 19:54:54,034 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 19:54:54,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2022-11-20 19:54:54,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284224285] [2022-11-20 19:54:54,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 19:54:54,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 19:54:54,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 19:54:54,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 19:54:54,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-11-20 19:54:54,037 INFO L87 Difference]: Start difference. First operand 119 states and 156 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-20 19:54:54,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 19:54:54,399 INFO L93 Difference]: Finished difference Result 210 states and 280 transitions. [2022-11-20 19:54:54,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 19:54:54,399 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-20 19:54:54,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 19:54:54,401 INFO L225 Difference]: With dead ends: 210 [2022-11-20 19:54:54,401 INFO L226 Difference]: Without dead ends: 124 [2022-11-20 19:54:54,402 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-20 19:54:54,403 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-20 19:54:54,404 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-20 19:54:54,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-11-20 19:54:54,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2022-11-20 19:54:54,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 63 states have (on average 1.1746031746031746) internal successors, (74), 66 states have internal predecessors, (74), 43 states have call successors, (43), 16 states have call predecessors, (43), 17 states have return successors, (48), 41 states have call predecessors, (48), 42 states have call successors, (48) [2022-11-20 19:54:54,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 165 transitions. [2022-11-20 19:54:54,470 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 165 transitions. Word has length 72 [2022-11-20 19:54:54,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 19:54:54,470 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 165 transitions. [2022-11-20 19:54:54,471 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-20 19:54:54,471 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 165 transitions. [2022-11-20 19:54:54,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-11-20 19:54:54,479 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 19:54:54,479 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-20 19:54:54,485 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938a64e2-7277-4202-880d-2371f7fea809/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-11-20 19:54:54,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938a64e2-7277-4202-880d-2371f7fea809/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-11-20 19:54:54,680 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 19:54:54,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 19:54:54,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1924319100, now seen corresponding path program 1 times [2022-11-20 19:54:54,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 19:54:54,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095141679] [2022-11-20 19:54:54,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 19:54:54,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 19:54:54,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 19:54:55,071 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-20 19:54:55,071 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 19:54:55,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095141679] [2022-11-20 19:54:55,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095141679] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 19:54:55,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1735187009] [2022-11-20 19:54:55,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 19:54:55,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 19:54:55,072 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938a64e2-7277-4202-880d-2371f7fea809/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 19:54:55,074 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938a64e2-7277-4202-880d-2371f7fea809/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 19:54:55,093 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938a64e2-7277-4202-880d-2371f7fea809/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-20 19:54:55,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 19:54:55,348 INFO L263 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-20 19:54:55,351 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 19:54:55,470 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-20 19:54:55,470 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 19:54:55,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1735187009] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 19:54:55,471 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 19:54:55,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 14 [2022-11-20 19:54:55,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297973902] [2022-11-20 19:54:55,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 19:54:55,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 19:54:55,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 19:54:55,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 19:54:55,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2022-11-20 19:54:55,473 INFO L87 Difference]: Start difference. First operand 124 states and 165 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-20 19:54:55,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 19:54:55,881 INFO L93 Difference]: Finished difference Result 227 states and 310 transitions. [2022-11-20 19:54:55,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 19:54:55,881 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-20 19:54:55,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 19:54:55,883 INFO L225 Difference]: With dead ends: 227 [2022-11-20 19:54:55,884 INFO L226 Difference]: Without dead ends: 136 [2022-11-20 19:54:55,884 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2022-11-20 19:54:55,885 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 85 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 589 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-20 19:54:55,886 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 589 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 19:54:55,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-11-20 19:54:55,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 126. [2022-11-20 19:54:55,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 65 states have (on average 1.1846153846153846) internal successors, (77), 68 states have internal predecessors, (77), 43 states have call successors, (43), 16 states have call predecessors, (43), 17 states have return successors, (48), 41 states have call predecessors, (48), 42 states have call successors, (48) [2022-11-20 19:54:55,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 168 transitions. [2022-11-20 19:54:55,927 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 168 transitions. Word has length 74 [2022-11-20 19:54:55,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 19:54:55,928 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 168 transitions. [2022-11-20 19:54:55,928 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-20 19:54:55,928 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 168 transitions. [2022-11-20 19:54:55,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-11-20 19:54:55,930 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 19:54:55,930 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-20 19:54:55,938 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938a64e2-7277-4202-880d-2371f7fea809/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-20 19:54:56,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938a64e2-7277-4202-880d-2371f7fea809/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 19:54:56,135 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 19:54:56,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 19:54:56,136 INFO L85 PathProgramCache]: Analyzing trace with hash -915652434, now seen corresponding path program 1 times [2022-11-20 19:54:56,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 19:54:56,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129617581] [2022-11-20 19:54:56,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 19:54:56,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 19:54:56,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 19:54:56,610 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-20 19:54:56,610 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 19:54:56,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129617581] [2022-11-20 19:54:56,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129617581] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 19:54:56,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [200954511] [2022-11-20 19:54:56,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 19:54:56,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 19:54:56,611 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938a64e2-7277-4202-880d-2371f7fea809/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 19:54:56,612 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938a64e2-7277-4202-880d-2371f7fea809/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 19:54:56,637 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938a64e2-7277-4202-880d-2371f7fea809/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-20 19:54:56,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 19:54:56,889 INFO L263 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-20 19:54:56,892 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 19:54:56,913 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-20 19:54:56,913 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 19:54:56,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [200954511] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 19:54:56,913 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 19:54:56,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2022-11-20 19:54:56,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809070669] [2022-11-20 19:54:56,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 19:54:56,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 19:54:56,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 19:54:56,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 19:54:56,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-20 19:54:56,916 INFO L87 Difference]: Start difference. First operand 126 states and 168 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-20 19:54:57,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 19:54:57,043 INFO L93 Difference]: Finished difference Result 228 states and 314 transitions. [2022-11-20 19:54:57,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 19:54:57,044 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-20 19:54:57,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 19:54:57,048 INFO L225 Difference]: With dead ends: 228 [2022-11-20 19:54:57,048 INFO L226 Difference]: Without dead ends: 135 [2022-11-20 19:54:57,049 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-20 19:54:57,050 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 6 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 19:54:57,051 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 226 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 19:54:57,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-11-20 19:54:57,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 127. [2022-11-20 19:54:57,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 66 states have (on average 1.1818181818181819) internal successors, (78), 69 states have internal predecessors, (78), 43 states have call successors, (43), 16 states have call predecessors, (43), 17 states have return successors, (48), 41 states have call predecessors, (48), 42 states have call successors, (48) [2022-11-20 19:54:57,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 169 transitions. [2022-11-20 19:54:57,122 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 169 transitions. Word has length 75 [2022-11-20 19:54:57,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 19:54:57,122 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 169 transitions. [2022-11-20 19:54:57,123 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-20 19:54:57,123 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 169 transitions. [2022-11-20 19:54:57,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-11-20 19:54:57,125 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 19:54:57,125 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-20 19:54:57,134 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938a64e2-7277-4202-880d-2371f7fea809/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-20 19:54:57,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938a64e2-7277-4202-880d-2371f7fea809/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 19:54:57,330 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 19:54:57,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 19:54:57,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1617287136, now seen corresponding path program 1 times [2022-11-20 19:54:57,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 19:54:57,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548604807] [2022-11-20 19:54:57,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 19:54:57,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 19:54:57,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 19:54:57,741 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-20 19:54:57,742 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 19:54:57,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548604807] [2022-11-20 19:54:57,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548604807] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 19:54:57,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1455842516] [2022-11-20 19:54:57,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 19:54:57,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 19:54:57,743 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938a64e2-7277-4202-880d-2371f7fea809/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 19:54:57,746 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938a64e2-7277-4202-880d-2371f7fea809/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 19:54:57,778 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938a64e2-7277-4202-880d-2371f7fea809/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-20 19:54:58,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 19:54:58,025 INFO L263 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 75 conjunts are in the unsatisfiable core [2022-11-20 19:54:58,035 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 19:54:58,181 INFO L321 Elim1Store]: treesize reduction 30, result has 38.8 percent of original size [2022-11-20 19:54:58,182 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-20 19:54:58,209 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 19:54:58,209 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-20 19:54:58,219 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-20 19:54:58,231 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-20 19:54:58,268 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-20 19:54:58,274 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-20 19:55:15,298 WARN L233 SmtUtils]: Spent 14.42s 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-20 19:55:20,119 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-20 19:55:20,119 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 19:55:25,063 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-20 19:55:25,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1455842516] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 19:55:25,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [884259490] [2022-11-20 19:55:25,067 INFO L159 IcfgInterpreter]: Started Sifa with 47 locations of interest [2022-11-20 19:55:25,068 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 19:55:25,068 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-20 19:55:25,069 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-20 19:55:25,069 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-20 19:55:25,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:55:25,155 INFO L321 Elim1Store]: treesize reduction 30, result has 48.3 percent of original size [2022-11-20 19:55:25,156 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-20 19:55:25,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:55:25,235 INFO L321 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2022-11-20 19:55:25,235 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-20 19:55:25,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:55:25,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:55:25,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:55:25,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:55:25,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:55:25,490 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-20 19:55:25,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:55:25,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:55:25,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:55:25,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:55:25,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:55:25,523 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-20 19:55:25,551 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-20 19:55:25,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:55:25,576 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-20 19:55:25,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:55:25,642 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-20 19:55:25,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:55:25,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:55:25,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:55:25,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:55:25,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:55:25,669 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-20 19:55:25,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:55:25,701 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-20 19:55:25,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:55:25,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:55:25,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:55:25,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:55:25,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:55:25,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:55:25,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:55:25,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:55:25,735 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-20 19:55:26,288 INFO L197 IcfgInterpreter]: Interpreting procedure aws_linked_list_empty with input of size 130 for LOIs [2022-11-20 19:55:26,509 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 15 for LOIs [2022-11-20 19:55:26,511 INFO L197 IcfgInterpreter]: Interpreting procedure nondet_uint64_t with input of size 104 for LOIs [2022-11-20 19:55:26,529 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-20 19:55:31,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [884259490] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 19:55:31,954 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-20 19:55:31,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [6, 15, 8] total 36 [2022-11-20 19:55:31,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744911793] [2022-11-20 19:55:31,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 19:55:31,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-20 19:55:31,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 19:55:31,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-20 19:55:31,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=1099, Unknown=0, NotChecked=0, Total=1260 [2022-11-20 19:55:31,957 INFO L87 Difference]: Start difference. First operand 127 states and 169 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-20 19:55:33,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 19:55:33,136 INFO L93 Difference]: Finished difference Result 234 states and 307 transitions. [2022-11-20 19:55:33,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-20 19:55:33,138 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-20 19:55:33,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 19:55:33,140 INFO L225 Difference]: With dead ends: 234 [2022-11-20 19:55:33,140 INFO L226 Difference]: Without dead ends: 119 [2022-11-20 19:55:33,141 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 180 SyntacticMatches, 24 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 514 ImplicationChecksByTransitivity, 23.3s TimeCoverageRelationStatistics Valid=161, Invalid=1099, Unknown=0, NotChecked=0, Total=1260 [2022-11-20 19:55:33,142 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 115 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 395 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-20 19:55:33,143 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 326 Invalid, 711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 307 Invalid, 0 Unknown, 395 Unchecked, 1.1s Time] [2022-11-20 19:55:33,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-11-20 19:55:33,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 118. [2022-11-20 19:55:33,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 63 states have (on average 1.1746031746031746) internal successors, (74), 65 states have internal predecessors, (74), 38 states have call successors, (38), 15 states have call predecessors, (38), 16 states have return successors, (43), 37 states have call predecessors, (43), 37 states have call successors, (43) [2022-11-20 19:55:33,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 155 transitions. [2022-11-20 19:55:33,188 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 155 transitions. Word has length 78 [2022-11-20 19:55:33,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 19:55:33,189 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 155 transitions. [2022-11-20 19:55:33,189 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-20 19:55:33,190 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 155 transitions. [2022-11-20 19:55:33,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-11-20 19:55:33,191 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 19:55:33,191 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-20 19:55:33,206 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938a64e2-7277-4202-880d-2371f7fea809/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-20 19:55:33,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938a64e2-7277-4202-880d-2371f7fea809/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 19:55:33,406 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 19:55:33,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 19:55:33,407 INFO L85 PathProgramCache]: Analyzing trace with hash 306134295, now seen corresponding path program 1 times [2022-11-20 19:55:33,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 19:55:33,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66291824] [2022-11-20 19:55:33,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 19:55:33,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 19:55:33,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 19:55:33,772 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-20 19:55:33,773 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 19:55:33,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66291824] [2022-11-20 19:55:33,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66291824] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 19:55:33,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [269545380] [2022-11-20 19:55:33,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 19:55:33,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 19:55:33,774 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938a64e2-7277-4202-880d-2371f7fea809/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 19:55:33,775 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938a64e2-7277-4202-880d-2371f7fea809/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 19:55:33,782 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938a64e2-7277-4202-880d-2371f7fea809/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-20 19:55:34,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 19:55:34,123 INFO L263 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 114 conjunts are in the unsatisfiable core [2022-11-20 19:55:34,133 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 19:55:34,152 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-20 19:55:34,396 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-20 19:55:34,413 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 19:55:34,413 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-20 19:55:34,420 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-20 19:55:34,435 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 19:55:34,435 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-20 19:55:34,514 INFO L321 Elim1Store]: treesize reduction 42, result has 20.8 percent of original size [2022-11-20 19:55:34,515 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-20 19:55:34,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:55:34,522 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-20 19:55:34,530 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-20 19:55:34,539 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-20 19:55:34,551 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-20 19:55:34,555 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-20 19:55:45,320 WARN L233 SmtUtils]: Spent 6.46s 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-20 19:55:53,481 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-20 19:55:53,481 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 19:55:58,502 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-20 19:55:58,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [269545380] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 19:55:58,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1649081437] [2022-11-20 19:55:58,506 INFO L159 IcfgInterpreter]: Started Sifa with 47 locations of interest [2022-11-20 19:55:58,507 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 19:55:58,507 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-20 19:55:58,508 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-20 19:55:58,508 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-20 19:55:58,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:55:58,608 INFO L321 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2022-11-20 19:55:58,608 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-20 19:55:58,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:55:58,648 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-20 19:55:58,892 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-20 19:55:58,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:55:58,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:55:58,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:55:58,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:55:58,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:55:58,930 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-20 19:55:58,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:55:58,962 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-20 19:55:58,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:55:58,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:55:58,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:55:58,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:55:58,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:55:58,998 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-20 19:55:59,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:55:59,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:55:59,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:55:59,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:55:59,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:55:59,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:55:59,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:55:59,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:55:59,080 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 19:55:59,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:55:59,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:55:59,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:55:59,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:55:59,088 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 19:55:59,110 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-20 19:55:59,111 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-20 19:55:59,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:55:59,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:55:59,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:55:59,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:55:59,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:55:59,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:55:59,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:55:59,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:55:59,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:55:59,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:55:59,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:55:59,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:55:59,163 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 19:55:59,184 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-20 19:55:59,185 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-20 19:55:59,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:55:59,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:55:59,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:55:59,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:55:59,235 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-20 19:55:59,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:55:59,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:55:59,355 INFO L321 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-11-20 19:55:59,356 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-20 19:55:59,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:55:59,401 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-20 19:55:59,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:55:59,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:55:59,426 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-20 19:55:59,500 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-20 19:55:59,519 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-20 19:55:59,573 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 19:55:59,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:55:59,577 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-20 19:55:59,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:55:59,610 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-20 19:55:59,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:55:59,630 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-20 19:55:59,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:55:59,655 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-20 19:55:59,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:55:59,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:55:59,710 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-20 19:55:59,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:55:59,725 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-20 19:55:59,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:55:59,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 35 treesize of output 7 [2022-11-20 19:55:59,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:55:59,769 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-20 19:56:04,081 INFO L197 IcfgInterpreter]: Interpreting procedure aws_linked_list_empty with input of size 109 for LOIs [2022-11-20 19:56:04,428 INFO L197 IcfgInterpreter]: Interpreting procedure aws_linked_list_is_valid with input of size 73 for LOIs [2022-11-20 19:56:04,931 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 15 for LOIs [2022-11-20 19:56:04,935 INFO L197 IcfgInterpreter]: Interpreting procedure nondet_uint64_t with input of size 104 for LOIs [2022-11-20 19:56:04,957 INFO L197 IcfgInterpreter]: Interpreting procedure aws_linked_list_node_next_is_valid with input of size 25 for LOIs [2022-11-20 19:56:05,037 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-20 19:56:16,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1649081437] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 19:56:16,428 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-20 19:56:16,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [6, 18, 8] total 55 [2022-11-20 19:56:16,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153356922] [2022-11-20 19:56:16,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 19:56:16,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-20 19:56:16,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 19:56:16,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-20 19:56:16,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=2742, Unknown=1, NotChecked=0, Total=2970 [2022-11-20 19:56:16,431 INFO L87 Difference]: Start difference. First operand 118 states and 155 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-20 19:56:19,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 19:56:19,090 INFO L93 Difference]: Finished difference Result 223 states and 295 transitions. [2022-11-20 19:56:19,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-20 19:56:19,092 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-20 19:56:19,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 19:56:19,098 INFO L225 Difference]: With dead ends: 223 [2022-11-20 19:56:19,099 INFO L226 Difference]: Without dead ends: 126 [2022-11-20 19:56:19,101 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 162 SyntacticMatches, 26 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1322 ImplicationChecksByTransitivity, 28.1s TimeCoverageRelationStatistics Valid=245, Invalid=2946, Unknown=1, NotChecked=0, Total=3192 [2022-11-20 19:56:19,102 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 81 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 706 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 1075 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 706 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 323 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-20 19:56:19,103 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 429 Invalid, 1075 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 706 Invalid, 0 Unknown, 323 Unchecked, 1.7s Time] [2022-11-20 19:56:19,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-11-20 19:56:19,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2022-11-20 19:56:19,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 68 states have (on average 1.1911764705882353) internal successors, (81), 70 states have internal predecessors, (81), 39 states have call successors, (39), 16 states have call predecessors, (39), 17 states have return successors, (44), 38 states have call predecessors, (44), 38 states have call successors, (44) [2022-11-20 19:56:19,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 164 transitions. [2022-11-20 19:56:19,154 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 164 transitions. Word has length 79 [2022-11-20 19:56:19,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 19:56:19,154 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 164 transitions. [2022-11-20 19:56:19,155 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-20 19:56:19,155 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 164 transitions. [2022-11-20 19:56:19,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-11-20 19:56:19,156 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 19:56:19,156 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-20 19:56:19,165 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938a64e2-7277-4202-880d-2371f7fea809/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-20 19:56:19,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938a64e2-7277-4202-880d-2371f7fea809/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-11-20 19:56:19,365 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 19:56:19,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 19:56:19,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1082961456, now seen corresponding path program 1 times [2022-11-20 19:56:19,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 19:56:19,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369779614] [2022-11-20 19:56:19,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 19:56:19,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 19:56:19,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 19:56:19,805 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-20 19:56:19,806 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 19:56:19,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369779614] [2022-11-20 19:56:19,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369779614] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 19:56:19,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1425421536] [2022-11-20 19:56:19,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 19:56:19,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 19:56:19,807 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938a64e2-7277-4202-880d-2371f7fea809/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 19:56:19,808 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938a64e2-7277-4202-880d-2371f7fea809/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 19:56:19,814 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938a64e2-7277-4202-880d-2371f7fea809/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-20 19:56:20,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 19:56:20,175 INFO L263 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 87 conjunts are in the unsatisfiable core [2022-11-20 19:56:20,180 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 19:56:20,192 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-20 19:56:20,381 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-20 19:56:20,397 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 19:56:20,397 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-20 19:56:20,407 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-20 19:56:20,418 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 19:56:20,418 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-20 19:56:20,487 INFO L321 Elim1Store]: treesize reduction 38, result has 22.4 percent of original size [2022-11-20 19:56:20,487 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-20 19:56:20,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:56:20,494 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-20 19:56:20,501 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-20 19:56:20,513 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-20 19:56:20,517 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-20 19:56:34,262 INFO L321 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2022-11-20 19:56:34,263 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-20 19:56:34,267 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-20 19:56:34,267 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 19:56:35,724 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-20 19:56:35,736 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 19:56:35,736 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-20 19:56:35,755 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 19:56:35,756 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-20 19:56:35,770 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-20 19:56:35,778 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-20 19:56:35,893 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-20 19:56:35,898 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-20 19:56:35,935 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 19:56:35,936 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-20 19:56:36,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1425421536] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 19:56:36,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1541231238] [2022-11-20 19:56:36,797 INFO L159 IcfgInterpreter]: Started Sifa with 48 locations of interest [2022-11-20 19:56:36,798 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 19:56:36,798 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-20 19:56:36,798 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-20 19:56:36,799 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-20 19:56:36,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:56:36,887 INFO L321 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2022-11-20 19:56:36,888 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-20 19:56:36,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:56:36,911 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-20 19:56:37,151 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-20 19:56:37,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:56:37,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:56:37,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:56:37,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:56:37,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:56:37,178 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-20 19:56:37,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:56:37,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:56:37,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:56:37,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:56:37,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:56:37,223 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-20 19:56:37,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:56:37,256 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-20 19:56:37,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:56:37,324 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-20 19:56:37,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:56:37,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:56:37,399 INFO L321 Elim1Store]: treesize reduction 40, result has 48.1 percent of original size [2022-11-20 19:56:37,400 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-20 19:56:37,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:56:37,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:56:37,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:56:37,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:56:37,439 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-20 19:56:37,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:56:37,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:56:37,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:56:37,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:56:37,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:56:37,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:56:37,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:56:37,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:56:37,474 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 19:56:37,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:56:37,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:56:37,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:56:37,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:56:37,479 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 19:56:37,497 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-20 19:56:37,497 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-20 19:56:37,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:56:37,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:56:37,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:56:37,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:56:37,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:56:37,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:56:37,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:56:37,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:56:37,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:56:37,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:56:37,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:56:37,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:56:37,537 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 19:56:37,554 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-20 19:56:37,555 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-20 19:56:37,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:56:37,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:56:37,655 INFO L321 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-11-20 19:56:37,655 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-20 19:56:37,725 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-20 19:56:37,737 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-20 19:56:37,772 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 19:56:37,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:56:37,775 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-20 19:56:37,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:56:37,810 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-20 19:56:37,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:56:37,840 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-20 19:56:37,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:56:37,857 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-20 19:56:37,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:56:37,895 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-20 19:56:37,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:56:37,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:56:37,911 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-20 19:56:37,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:56:37,944 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-20 19:56:37,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:56:37,968 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-20 19:56:42,096 INFO L197 IcfgInterpreter]: Interpreting procedure aws_linked_list_empty with input of size 109 for LOIs [2022-11-20 19:56:42,375 INFO L197 IcfgInterpreter]: Interpreting procedure aws_linked_list_is_valid with input of size 96 for LOIs [2022-11-20 19:56:43,288 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 15 for LOIs [2022-11-20 19:56:43,290 INFO L197 IcfgInterpreter]: Interpreting procedure nondet_uint64_t with input of size 104 for LOIs [2022-11-20 19:56:43,310 INFO L197 IcfgInterpreter]: Interpreting procedure aws_linked_list_node_next_is_valid with input of size 20 for LOIs [2022-11-20 19:56:43,373 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-20 19:56:54,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1541231238] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 19:56:54,182 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-20 19:56:54,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [7, 13] total 45 [2022-11-20 19:56:54,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179344236] [2022-11-20 19:56:54,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 19:56:54,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-20 19:56:54,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 19:56:54,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-20 19:56:54,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=2648, Unknown=1, NotChecked=104, Total=2970 [2022-11-20 19:56:54,185 INFO L87 Difference]: Start difference. First operand 125 states and 164 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-20 19:56:56,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 19:56:56,857 INFO L93 Difference]: Finished difference Result 235 states and 306 transitions. [2022-11-20 19:56:56,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-20 19:56:56,857 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-20 19:56:56,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 19:56:56,859 INFO L225 Difference]: With dead ends: 235 [2022-11-20 19:56:56,859 INFO L226 Difference]: Without dead ends: 133 [2022-11-20 19:56:56,861 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 173 SyntacticMatches, 16 SemanticMatches, 55 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1098 ImplicationChecksByTransitivity, 27.1s TimeCoverageRelationStatistics Valid=239, Invalid=2844, Unknown=1, NotChecked=108, Total=3192 [2022-11-20 19:56:56,862 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 35 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 727 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 1057 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 298 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-11-20 19:56:56,862 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 689 Invalid, 1057 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 727 Invalid, 0 Unknown, 298 Unchecked, 1.9s Time] [2022-11-20 19:56:56,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-11-20 19:56:56,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2022-11-20 19:56:56,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 73 states have (on average 1.1917808219178083) internal successors, (87), 75 states have internal predecessors, (87), 40 states have call successors, (40), 18 states have call predecessors, (40), 19 states have return successors, (45), 39 states have call predecessors, (45), 39 states have call successors, (45) [2022-11-20 19:56:56,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 172 transitions. [2022-11-20 19:56:56,893 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 172 transitions. Word has length 81 [2022-11-20 19:56:56,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 19:56:56,893 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 172 transitions. [2022-11-20 19:56:56,894 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-20 19:56:56,894 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 172 transitions. [2022-11-20 19:56:56,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-11-20 19:56:56,895 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 19:56:56,895 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-20 19:56:56,904 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938a64e2-7277-4202-880d-2371f7fea809/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-20 19:56:57,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938a64e2-7277-4202-880d-2371f7fea809/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-11-20 19:56:57,103 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 19:56:57,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 19:56:57,104 INFO L85 PathProgramCache]: Analyzing trace with hash 347930842, now seen corresponding path program 1 times [2022-11-20 19:56:57,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 19:56:57,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603372041] [2022-11-20 19:56:57,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 19:56:57,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 19:56:57,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 19:56:57,400 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-20 19:56:57,400 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 19:56:57,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603372041] [2022-11-20 19:56:57,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603372041] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 19:56:57,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [362112394] [2022-11-20 19:56:57,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 19:56:57,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 19:56:57,401 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938a64e2-7277-4202-880d-2371f7fea809/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 19:56:57,406 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938a64e2-7277-4202-880d-2371f7fea809/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 19:56:57,437 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938a64e2-7277-4202-880d-2371f7fea809/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-20 19:56:57,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 19:56:57,802 INFO L263 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 64 conjunts are in the unsatisfiable core [2022-11-20 19:56:57,806 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 19:56:57,820 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-20 19:56:57,997 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 19:56:57,997 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-20 19:56:58,004 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-20 19:56:58,009 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-20 19:56:58,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:56:58,041 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-20 19:56:58,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:56:58,045 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-20 19:56:58,613 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-20 19:56:58,614 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 19:56:59,089 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 19:56:59,089 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-20 19:56:59,109 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 19:56:59,109 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-20 19:56:59,116 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-20 19:56:59,123 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-20 19:56:59,185 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-20 19:56:59,213 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 19:56:59,213 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-20 19:56:59,219 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-20 19:56:59,249 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 19:56:59,249 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-20 19:56:59,274 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 19:56:59,275 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-20 19:56:59,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [362112394] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 19:56:59,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1046148674] [2022-11-20 19:56:59,872 INFO L159 IcfgInterpreter]: Started Sifa with 48 locations of interest [2022-11-20 19:56:59,872 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 19:56:59,873 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-20 19:56:59,873 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-20 19:56:59,873 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-20 19:56:59,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:56:59,975 INFO L321 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2022-11-20 19:56:59,975 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-20 19:56:59,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:56:59,997 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-20 19:57:00,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:57:00,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:57:00,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:57:00,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:57:00,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:57:00,220 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-20 19:57:00,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:57:00,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-20 19:57:00,298 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-20 19:57:00,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:57:00,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:57:00,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:57:00,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:57:00,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:57:00,323 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-20 19:57:00,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:57:00,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:57:00,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:57:00,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:57:00,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:57:00,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:57:00,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:57:00,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:57:00,388 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 19:57:00,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:57:00,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:57:00,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:57:00,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:57:00,394 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 19:57:00,413 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-20 19:57:00,414 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-20 19:57:00,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:57:00,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:57:00,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:57:00,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:57:00,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:57:00,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:57:00,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:57:00,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:57:00,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:57:00,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:57:00,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:57:00,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:57:00,457 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 19:57:00,477 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-20 19:57:00,477 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-20 19:57:00,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:57:00,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:57:00,585 INFO L321 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-11-20 19:57:00,586 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-20 19:57:00,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:57:00,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:57:00,619 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-20 19:57:00,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:57:00,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:57:00,680 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-20 19:57:00,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:57:00,715 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-20 19:57:00,778 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-20 19:57:00,806 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 19:57:00,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:57:00,809 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-20 19:57:00,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:57:00,831 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-20 19:57:00,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:57:00,854 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-20 19:57:00,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:57:00,886 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-20 19:57:00,906 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-20 19:57:00,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:57:00,945 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-20 19:57:00,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:57:00,965 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-20 19:57:00,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:57:00,984 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-20 19:57:01,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:57:01,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:57:01,010 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-20 19:57:12,509 INFO L197 IcfgInterpreter]: Interpreting procedure aws_linked_list_empty with input of size 19 for LOIs [2022-11-20 19:57:12,545 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 74 for LOIs [2022-11-20 19:57:12,603 INFO L197 IcfgInterpreter]: Interpreting procedure aws_linked_list_is_valid with input of size 19 for LOIs [2022-11-20 19:57:13,429 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 15 for LOIs [2022-11-20 19:57:13,431 INFO L197 IcfgInterpreter]: Interpreting procedure nondet_uint64_t with input of size 104 for LOIs [2022-11-20 19:57:13,447 INFO L197 IcfgInterpreter]: Interpreting procedure aws_linked_list_node_next_is_valid with input of size 20 for LOIs [2022-11-20 19:57:13,506 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-20 19:57:39,629 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '7802#(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-20 19:57:39,629 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-20 19:57:39,629 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 19:57:39,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 13] total 17 [2022-11-20 19:57:39,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941276690] [2022-11-20 19:57:39,630 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 19:57:39,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-20 19:57:39,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 19:57:39,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-20 19:57:39,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=268, Invalid=3630, Unknown=8, NotChecked=0, Total=3906 [2022-11-20 19:57:39,634 INFO L87 Difference]: Start difference. First operand 133 states and 172 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-20 19:57:40,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 19:57:40,133 INFO L93 Difference]: Finished difference Result 236 states and 307 transitions. [2022-11-20 19:57:40,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-20 19:57:40,134 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-20 19:57:40,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 19:57:40,136 INFO L225 Difference]: With dead ends: 236 [2022-11-20 19:57:40,136 INFO L226 Difference]: Without dead ends: 137 [2022-11-20 19:57:40,138 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 164 SyntacticMatches, 18 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1797 ImplicationChecksByTransitivity, 27.5s TimeCoverageRelationStatistics Valid=302, Invalid=4246, Unknown=8, NotChecked=0, Total=4556 [2022-11-20 19:57:40,138 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 8 mSDsluCounter, 749 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 843 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 197 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 19:57:40,139 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 843 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 193 Invalid, 0 Unknown, 197 Unchecked, 0.2s Time] [2022-11-20 19:57:40,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-11-20 19:57:40,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2022-11-20 19:57:40,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 76 states have (on average 1.1842105263157894) internal successors, (90), 78 states have internal predecessors, (90), 40 states have call successors, (40), 19 states have call predecessors, (40), 20 states have return successors, (44), 39 states have call predecessors, (44), 39 states have call successors, (44) [2022-11-20 19:57:40,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 174 transitions. [2022-11-20 19:57:40,176 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 174 transitions. Word has length 82 [2022-11-20 19:57:40,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 19:57:40,177 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 174 transitions. [2022-11-20 19:57:40,177 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-20 19:57:40,177 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 174 transitions. [2022-11-20 19:57:40,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-11-20 19:57:40,178 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 19:57:40,178 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-20 19:57:40,185 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938a64e2-7277-4202-880d-2371f7fea809/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-20 19:57:40,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938a64e2-7277-4202-880d-2371f7fea809/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 19:57:40,379 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 19:57:40,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 19:57:40,380 INFO L85 PathProgramCache]: Analyzing trace with hash 612279792, now seen corresponding path program 1 times [2022-11-20 19:57:40,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 19:57:40,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299107711] [2022-11-20 19:57:40,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 19:57:40,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 19:57:40,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 19:57:40,746 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-20 19:57:40,746 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 19:57:40,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299107711] [2022-11-20 19:57:40,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299107711] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 19:57:40,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [507101681] [2022-11-20 19:57:40,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 19:57:40,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 19:57:40,748 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938a64e2-7277-4202-880d-2371f7fea809/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 19:57:40,749 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938a64e2-7277-4202-880d-2371f7fea809/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 19:57:40,781 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938a64e2-7277-4202-880d-2371f7fea809/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-20 19:57:41,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 19:57:41,152 INFO L263 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-20 19:57:41,155 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 19:57:41,285 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-20 19:57:41,286 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 19:57:41,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [507101681] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 19:57:41,286 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 19:57:41,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 14 [2022-11-20 19:57:41,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760473350] [2022-11-20 19:57:41,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 19:57:41,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 19:57:41,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 19:57:41,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 19:57:41,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2022-11-20 19:57:41,288 INFO L87 Difference]: Start difference. First operand 137 states and 174 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-20 19:57:41,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 19:57:41,707 INFO L93 Difference]: Finished difference Result 231 states and 296 transitions. [2022-11-20 19:57:41,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 19:57:41,708 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-20 19:57:41,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 19:57:41,709 INFO L225 Difference]: With dead ends: 231 [2022-11-20 19:57:41,709 INFO L226 Difference]: Without dead ends: 137 [2022-11-20 19:57:41,710 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-20 19:57:41,711 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 63 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 565 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-20 19:57:41,711 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 565 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 19:57:41,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-11-20 19:57:41,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2022-11-20 19:57:41,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 76 states have (on average 1.1578947368421053) internal successors, (88), 78 states have internal predecessors, (88), 40 states have call successors, (40), 19 states have call predecessors, (40), 20 states have return successors, (44), 39 states have call predecessors, (44), 39 states have call successors, (44) [2022-11-20 19:57:41,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 172 transitions. [2022-11-20 19:57:41,760 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 172 transitions. Word has length 87 [2022-11-20 19:57:41,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 19:57:41,762 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 172 transitions. [2022-11-20 19:57:41,762 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-20 19:57:41,763 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 172 transitions. [2022-11-20 19:57:41,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-11-20 19:57:41,766 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 19:57:41,766 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-20 19:57:41,781 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938a64e2-7277-4202-880d-2371f7fea809/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-20 19:57:41,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938a64e2-7277-4202-880d-2371f7fea809/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-20 19:57:41,975 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 19:57:41,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 19:57:41,976 INFO L85 PathProgramCache]: Analyzing trace with hash 229903191, now seen corresponding path program 1 times [2022-11-20 19:57:41,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 19:57:41,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629108996] [2022-11-20 19:57:41,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 19:57:41,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 19:57:42,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 19:57:42,381 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-20 19:57:42,381 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 19:57:42,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629108996] [2022-11-20 19:57:42,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629108996] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 19:57:42,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1657462394] [2022-11-20 19:57:42,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 19:57:42,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 19:57:42,382 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938a64e2-7277-4202-880d-2371f7fea809/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 19:57:42,384 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938a64e2-7277-4202-880d-2371f7fea809/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 19:57:42,401 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938a64e2-7277-4202-880d-2371f7fea809/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-20 19:57:42,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 19:57:42,783 INFO L263 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-20 19:57:42,786 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 19:57:42,944 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-20 19:57:42,944 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 19:57:42,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1657462394] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 19:57:42,945 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 19:57:42,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 16 [2022-11-20 19:57:42,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585268026] [2022-11-20 19:57:42,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 19:57:42,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 19:57:42,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 19:57:42,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 19:57:42,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2022-11-20 19:57:42,947 INFO L87 Difference]: Start difference. First operand 137 states and 172 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-20 19:57:43,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 19:57:43,416 INFO L93 Difference]: Finished difference Result 234 states and 301 transitions. [2022-11-20 19:57:43,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 19:57:43,417 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-20 19:57:43,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 19:57:43,418 INFO L225 Difference]: With dead ends: 234 [2022-11-20 19:57:43,419 INFO L226 Difference]: Without dead ends: 139 [2022-11-20 19:57:43,420 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-20 19:57:43,420 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.3s IncrementalHoareTripleChecker+Time [2022-11-20 19:57:43,421 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.3s Time] [2022-11-20 19:57:43,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-11-20 19:57:43,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 133. [2022-11-20 19:57:43,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 73 states have (on average 1.1506849315068493) internal successors, (84), 74 states have internal predecessors, (84), 40 states have call successors, (40), 19 states have call predecessors, (40), 19 states have return successors, (42), 39 states have call predecessors, (42), 39 states have call successors, (42) [2022-11-20 19:57:43,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 166 transitions. [2022-11-20 19:57:43,465 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 166 transitions. Word has length 89 [2022-11-20 19:57:43,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 19:57:43,466 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 166 transitions. [2022-11-20 19:57:43,466 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-20 19:57:43,467 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 166 transitions. [2022-11-20 19:57:43,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-11-20 19:57:43,468 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 19:57:43,468 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-20 19:57:43,482 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938a64e2-7277-4202-880d-2371f7fea809/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-20 19:57:43,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938a64e2-7277-4202-880d-2371f7fea809/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-20 19:57:43,676 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 19:57:43,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 19:57:43,677 INFO L85 PathProgramCache]: Analyzing trace with hash 2142124211, now seen corresponding path program 1 times [2022-11-20 19:57:43,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 19:57:43,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719034287] [2022-11-20 19:57:43,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 19:57:43,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 19:57:43,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 19:57:44,054 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-20 19:57:44,055 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 19:57:44,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719034287] [2022-11-20 19:57:44,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719034287] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 19:57:44,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [129398627] [2022-11-20 19:57:44,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 19:57:44,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 19:57:44,056 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938a64e2-7277-4202-880d-2371f7fea809/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 19:57:44,057 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938a64e2-7277-4202-880d-2371f7fea809/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 19:57:44,091 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938a64e2-7277-4202-880d-2371f7fea809/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-20 19:57:44,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 19:57:44,440 INFO L263 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 107 conjunts are in the unsatisfiable core [2022-11-20 19:57:44,446 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 19:57:44,459 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-20 19:57:44,717 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 19:57:44,718 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-20 19:57:44,728 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-20 19:57:44,742 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-20 19:57:44,813 INFO L321 Elim1Store]: treesize reduction 42, result has 20.8 percent of original size [2022-11-20 19:57:44,813 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-20 19:57:44,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:57:44,820 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-20 19:57:44,829 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-20 19:57:44,935 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-20 19:57:45,192 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-20 19:57:45,743 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-20 19:57:46,535 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-20 19:57:47,458 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-20 19:58:44,298 WARN L233 SmtUtils]: Spent 38.25s 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-20 19:59:37,992 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-20 19:59:45,726 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-20 19:59:57,624 WARN L233 SmtUtils]: Spent 6.31s 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-20 19:59:58,122 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_DerPreprocessor_62 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_45| Int) (v_DerPreprocessor_61 (Array Int Int))) (let ((.cse0 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_45|))) (let ((.cse1 (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_45|)) (.cse2 (select .cse0 0))) (and (= (select .cse0 8) 0) (= (select .cse1 8) 0) (= (select v_DerPreprocessor_61 24) .cse2) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse2 v_DerPreprocessor_62) |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_45| v_DerPreprocessor_61) .cse2 v_DerPreprocessor_62) |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_45| v_DerPreprocessor_61) .cse2) (select |c_#memory_$Pointer$.base| .cse2)) (= (select .cse0 16) 0) (not (= .cse2 0)) (= (select .cse1 16) 0) (= .cse2 (select .cse0 24)) (<= 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| .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_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 ((.cse23 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_115|))) (let ((.cse24 (select .cse23 0))) (and (= (select .cse23 24) .cse24) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse24 v_DerPreprocessor_52) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_115| v_DerPreprocessor_51) .cse24 v_DerPreprocessor_52) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_115| v_DerPreprocessor_51) .cse24) (select |c_#memory_$Pointer$.base| .cse24)) (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_115| .cse24)) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_115|) (not (= .cse24 0)) (= .cse24 (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 ((.cse26 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_114|))) (let ((.cse25 (select .cse26 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| .cse25 v_DerPreprocessor_48) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_114| v_DerPreprocessor_47) .cse25 v_DerPreprocessor_48) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_114| v_DerPreprocessor_47) .cse25) (select |c_#memory_$Pointer$.base| .cse25)) (not (= .cse25 |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_114|)) (= .cse25 (select v_DerPreprocessor_47 24)) (= .cse25 (select .cse26 24)) (not (= .cse25 0))))))) is different from true [2022-11-20 20:00:15,524 WARN L233 SmtUtils]: Spent 15.74s 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-20 20:00:16,662 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-20 20:00:48,936 WARN L233 SmtUtils]: Spent 28.04s 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-20 20:00:49,593 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-20 20:01:24,688 WARN L233 SmtUtils]: Spent 32.44s 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-20 20:02:03,399 WARN L233 SmtUtils]: Spent 34.31s 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-20 20:02:40,978 WARN L233 SmtUtils]: Spent 34.70s 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-20 20:03:17,309 WARN L233 SmtUtils]: Spent 34.41s 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-20 20:03:18,838 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 107 not checked. [2022-11-20 20:03:18,838 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:03:30,264 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-20 20:03:30,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [129398627] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:03:30,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1590748591] [2022-11-20 20:03:30,267 INFO L159 IcfgInterpreter]: Started Sifa with 47 locations of interest [2022-11-20 20:03:30,267 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 20:03:30,268 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-20 20:03:30,268 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-20 20:03:30,268 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-20 20:03:30,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:03:30,420 INFO L321 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2022-11-20 20:03:30,420 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-20 20:03:30,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:03:30,446 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-20 20:03:30,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:03:30,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:03:30,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:03:30,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:03:30,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:03:30,661 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-20 20:03:30,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:03:30,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:03:30,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:03:30,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:03:30,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:03:30,696 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-20 20:03:30,728 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-20 20:03:30,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:03:30,761 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-20 20:03:30,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:03:30,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:03:30,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:03:30,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:03:30,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:03:30,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:03:30,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:03:30,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:03:30,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:03:30,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:03:30,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:03:30,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:03:30,834 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:03:30,874 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-20 20:03:30,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-20 20:03:30,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:03:30,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:03:30,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:03:30,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:03:30,930 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-20 20:03:30,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:03:30,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:03:31,115 INFO L321 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-11-20 20:03:31,116 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-20 20:03:31,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:03:31,165 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-20 20:03:31,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:03:31,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:03:31,193 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-20 20:03:31,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:03:31,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:03:31,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:03:31,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:03:31,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:03:31,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:03:31,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:03:31,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:03:31,241 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:03:31,243 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-20 20:03:31,302 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-20 20:03:31,321 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-20 20:03:31,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:03:31,352 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-20 20:03:31,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:03:31,388 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-20 20:03:31,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:03:31,421 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-20 20:03:31,440 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:03:31,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:03:31,443 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-20 20:03:31,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:03:31,493 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-20 20:03:31,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:03:31,507 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-20 20:03:31,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:03:31,534 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-20 20:03:31,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:03:31,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:03:31,557 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-20 20:03:35,387 INFO L197 IcfgInterpreter]: Interpreting procedure aws_linked_list_empty with input of size 109 for LOIs [2022-11-20 20:03:35,655 INFO L197 IcfgInterpreter]: Interpreting procedure aws_linked_list_is_valid with input of size 73 for LOIs [2022-11-20 20:03:36,415 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 15 for LOIs [2022-11-20 20:03:36,418 INFO L197 IcfgInterpreter]: Interpreting procedure nondet_uint64_t with input of size 104 for LOIs [2022-11-20 20:03:36,433 INFO L197 IcfgInterpreter]: Interpreting procedure aws_linked_list_node_next_is_valid with input of size 20 for LOIs [2022-11-20 20:03:36,495 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-20 20:04:04,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1590748591] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:04:04,206 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-20 20:04:04,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [6, 37, 11] total 76 [2022-11-20 20:04:04,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323315562] [2022-11-20 20:04:04,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:04:04,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-20 20:04:04,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:04:04,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-20 20:04:04,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=287, Invalid=3973, Unknown=70, NotChecked=1370, Total=5700 [2022-11-20 20:04:04,210 INFO L87 Difference]: Start difference. First operand 133 states and 166 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-20 20:04:08,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:04:08,951 INFO L93 Difference]: Finished difference Result 230 states and 289 transitions. [2022-11-20 20:04:08,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-20 20:04:08,952 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-20 20:04:08,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:04:08,953 INFO L225 Difference]: With dead ends: 230 [2022-11-20 20:04:08,954 INFO L226 Difference]: Without dead ends: 137 [2022-11-20 20:04:08,956 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 196 SyntacticMatches, 13 SemanticMatches, 77 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 1577 ImplicationChecksByTransitivity, 333.6s TimeCoverageRelationStatistics Valid=310, Invalid=4352, Unknown=70, NotChecked=1430, Total=6162 [2022-11-20 20:04:08,956 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 103 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 968 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 1334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 968 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 312 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-11-20 20:04:08,957 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 445 Invalid, 1334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 968 Invalid, 0 Unknown, 312 Unchecked, 3.8s Time] [2022-11-20 20:04:08,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-11-20 20:04:08,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2022-11-20 20:04:08,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 76 states have (on average 1.131578947368421) internal successors, (86), 78 states have internal predecessors, (86), 40 states have call successors, (40), 19 states have call predecessors, (40), 20 states have return successors, (42), 39 states have call predecessors, (42), 39 states have call successors, (42) [2022-11-20 20:04:08,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 168 transitions. [2022-11-20 20:04:08,997 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 168 transitions. Word has length 93 [2022-11-20 20:04:08,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:04:08,998 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 168 transitions. [2022-11-20 20:04:08,998 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-20 20:04:08,998 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 168 transitions. [2022-11-20 20:04:08,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-11-20 20:04:09,000 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:04:09,000 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-20 20:04:09,013 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938a64e2-7277-4202-880d-2371f7fea809/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-11-20 20:04:09,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938a64e2-7277-4202-880d-2371f7fea809/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:04:09,207 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 20:04:09,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:04:09,207 INFO L85 PathProgramCache]: Analyzing trace with hash 672928668, now seen corresponding path program 1 times [2022-11-20 20:04:09,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:04:09,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853454511] [2022-11-20 20:04:09,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:04:09,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:04:09,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:04:09,564 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-20 20:04:09,564 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:04:09,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853454511] [2022-11-20 20:04:09,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853454511] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:04:09,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [291494589] [2022-11-20 20:04:09,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:04:09,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:04:09,565 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938a64e2-7277-4202-880d-2371f7fea809/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:04:09,570 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938a64e2-7277-4202-880d-2371f7fea809/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:04:09,593 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938a64e2-7277-4202-880d-2371f7fea809/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-20 20:04:09,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:04:09,978 INFO L263 TraceCheckSpWp]: Trace formula consists of 548 conjuncts, 29 conjunts are in the unsatisfiable core [2022-11-20 20:04:09,981 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:04:10,366 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-20 20:04:10,366 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:04:11,005 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-20 20:04:11,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [291494589] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:04:11,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [874025440] [2022-11-20 20:04:11,008 INFO L159 IcfgInterpreter]: Started Sifa with 48 locations of interest [2022-11-20 20:04:11,015 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 20:04:11,016 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-20 20:04:11,016 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-20 20:04:11,016 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-20 20:04:11,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:04:11,170 INFO L321 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2022-11-20 20:04:11,171 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-20 20:04:11,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:04:11,191 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-20 20:04:11,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:04:11,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:04:11,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:04:11,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:04:11,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:04:11,400 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-20 20:04:11,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:04:11,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:04:11,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:04:11,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:04:11,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:04:11,433 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-20 20:04:11,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:04:11,468 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-20 20:04:11,496 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-20 20:04:11,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:04:11,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:04:11,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:04:11,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:04:11,561 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-20 20:04:11,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:04:11,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:04:11,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:04:11,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:04:11,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:04:11,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:04:11,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:04:11,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:04:11,607 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:04:11,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:04:11,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:04:11,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:04:11,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:04:11,620 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:04:11,658 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-20 20:04:11,659 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-20 20:04:11,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:04:11,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:04:11,881 INFO L321 Elim1Store]: treesize reduction 40, result has 48.1 percent of original size [2022-11-20 20:04:11,881 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-20 20:04:11,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:04:11,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:04:12,091 INFO L321 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-11-20 20:04:12,091 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-20 20:04:12,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:04:12,130 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-20 20:04:12,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:04:12,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:04:12,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:04:12,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:04:12,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:04:12,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:04:12,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:04:12,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:04:12,168 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-20 20:04:12,257 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:04:12,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:04:12,261 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-20 20:04:12,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:04:12,301 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-20 20:04:12,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:04:12,326 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-20 20:04:12,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:04:12,355 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-20 20:04:12,373 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-20 20:04:12,387 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-20 20:04:12,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:04:12,429 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-20 20:04:12,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:04:12,447 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-20 20:04:12,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:04:12,477 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-20 20:04:12,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:04:12,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:04:12,500 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-20 20:04:22,485 INFO L197 IcfgInterpreter]: Interpreting procedure aws_linked_list_empty with input of size 19 for LOIs [2022-11-20 20:04:22,518 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 74 for LOIs [2022-11-20 20:04:22,562 INFO L197 IcfgInterpreter]: Interpreting procedure aws_linked_list_is_valid with input of size 19 for LOIs [2022-11-20 20:04:23,451 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 15 for LOIs [2022-11-20 20:04:23,454 INFO L197 IcfgInterpreter]: Interpreting procedure nondet_uint64_t with input of size 104 for LOIs [2022-11-20 20:04:23,477 INFO L197 IcfgInterpreter]: Interpreting procedure aws_linked_list_node_next_is_valid with input of size 20 for LOIs [2022-11-20 20:04:23,552 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-20 20:04:57,147 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '11890#(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-20 20:04:57,147 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-20 20:04:57,147 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 20:04:57,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 12, 6] total 16 [2022-11-20 20:04:57,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046606544] [2022-11-20 20:04:57,148 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 20:04:57,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-20 20:04:57,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:04:57,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-20 20:04:57,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=2441, Unknown=0, NotChecked=0, Total=2652 [2022-11-20 20:04:57,150 INFO L87 Difference]: Start difference. First operand 137 states and 168 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-20 20:04:58,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:04:58,443 INFO L93 Difference]: Finished difference Result 232 states and 294 transitions. [2022-11-20 20:04:58,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-20 20:04:58,444 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-20 20:04:58,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:04:58,446 INFO L225 Difference]: With dead ends: 232 [2022-11-20 20:04:58,446 INFO L226 Difference]: Without dead ends: 145 [2022-11-20 20:04:58,448 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 233 SyntacticMatches, 9 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 823 ImplicationChecksByTransitivity, 34.2s TimeCoverageRelationStatistics Valid=227, Invalid=2743, Unknown=0, NotChecked=0, Total=2970 [2022-11-20 20:04:58,448 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 7 mSDsluCounter, 1194 mSDsCounter, 0 mSdLazyCounter, 518 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1301 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-20 20:04:58,449 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1301 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 518 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-20 20:04:58,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-11-20 20:04:58,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 138. [2022-11-20 20:04:58,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 77 states have (on average 1.12987012987013) internal successors, (87), 79 states have internal predecessors, (87), 40 states have call successors, (40), 19 states have call predecessors, (40), 20 states have return successors, (42), 39 states have call predecessors, (42), 39 states have call successors, (42) [2022-11-20 20:04:58,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 169 transitions. [2022-11-20 20:04:58,491 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 169 transitions. Word has length 96 [2022-11-20 20:04:58,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:04:58,492 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 169 transitions. [2022-11-20 20:04:58,492 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-20 20:04:58,492 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 169 transitions. [2022-11-20 20:04:58,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-11-20 20:04:58,493 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:04:58,493 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-20 20:04:58,511 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938a64e2-7277-4202-880d-2371f7fea809/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-20 20:04:58,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938a64e2-7277-4202-880d-2371f7fea809/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-20 20:04:58,711 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 20:04:58,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:04:58,712 INFO L85 PathProgramCache]: Analyzing trace with hash -1616069117, now seen corresponding path program 1 times [2022-11-20 20:04:58,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:04:58,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352700377] [2022-11-20 20:04:58,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:04:58,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:04:58,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:04:59,943 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-20 20:04:59,943 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:04:59,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352700377] [2022-11-20 20:04:59,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352700377] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:04:59,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [795352996] [2022-11-20 20:04:59,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:04:59,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:04:59,944 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938a64e2-7277-4202-880d-2371f7fea809/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:04:59,945 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938a64e2-7277-4202-880d-2371f7fea809/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:04:59,951 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938a64e2-7277-4202-880d-2371f7fea809/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-20 20:05:00,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:05:00,334 INFO L263 TraceCheckSpWp]: Trace formula consists of 555 conjuncts, 107 conjunts are in the unsatisfiable core [2022-11-20 20:05:00,339 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:05:00,356 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-20 20:05:00,846 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 20:05:00,846 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-20 20:05:00,857 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-20 20:05:00,863 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-20 20:05:01,010 INFO L321 Elim1Store]: treesize reduction 38, result has 22.4 percent of original size [2022-11-20 20:05:01,010 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-20 20:05:01,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:05:01,021 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-20 20:05:01,034 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-20 20:05:01,216 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-20 20:05:01,540 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-20 20:05:02,109 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-20 20:05:02,820 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-20 20:05:03,489 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-20 20:05:07,031 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-20 20:05:08,379 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-20 20:05:12,473 INFO L321 Elim1Store]: treesize reduction 960, result has 0.1 percent of original size [2022-11-20 20:05:12,473 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-20 20:05:12,491 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-20 20:05:12,499 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-20 20:05:12,499 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:05:14,289 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1498 (Array Int Int)) (v_ArrVal_1497 (Array Int Int)) (v_ArrVal_1499 Int)) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_1498) |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_1497) |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_1499)) |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-20 20:05:14,304 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:05:14,304 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-20 20:05:14,349 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:05:14,349 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-20 20:05:14,358 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-20 20:05:14,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 140 treesize of output 138 [2022-11-20 20:05:14,549 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-20 20:05:14,558 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-20 20:05:14,611 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:05:14,611 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-20 20:05:15,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [795352996] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:05:15,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1848099440] [2022-11-20 20:05:15,429 INFO L159 IcfgInterpreter]: Started Sifa with 48 locations of interest [2022-11-20 20:05:15,429 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 20:05:15,429 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-20 20:05:15,430 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-20 20:05:15,430 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-20 20:05:15,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:05:15,594 INFO L321 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2022-11-20 20:05:15,594 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-20 20:05:15,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:05:15,620 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-20 20:05:15,830 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-20 20:05:15,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:05:15,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:05:15,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:05:15,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:05:15,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:05:15,855 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-20 20:05:15,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:05:15,886 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-20 20:05:15,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:05:15,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:05:15,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:05:15,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:05:15,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:05:15,917 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-20 20:05:15,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:05:15,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:05:16,101 INFO L321 Elim1Store]: treesize reduction 40, result has 48.1 percent of original size [2022-11-20 20:05:16,102 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-20 20:05:16,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:05:16,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:05:16,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:05:16,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:05:16,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:05:16,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:05:16,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:05:16,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:05:16,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:05:16,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:05:16,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:05:16,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:05:16,162 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:05:16,200 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-20 20:05:16,200 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-20 20:05:16,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:05:16,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:05:16,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:05:16,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:05:16,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:05:16,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:05:16,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:05:16,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:05:16,249 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:05:16,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:05:16,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:05:16,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:05:16,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:05:16,259 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:05:16,297 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-20 20:05:16,297 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-20 20:05:16,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:05:16,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:05:16,483 INFO L321 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-11-20 20:05:16,484 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-20 20:05:16,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:05:16,528 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-20 20:05:16,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:05:16,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:05:16,563 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-20 20:05:16,623 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-20 20:05:16,637 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-20 20:05:16,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:05:16,663 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-20 20:05:16,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:05:16,696 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-20 20:05:16,717 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:05:16,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:05:16,720 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-20 20:05:16,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:05:16,749 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-20 20:05:16,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:05:16,789 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-20 20:05:16,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:05:16,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:05:16,816 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-20 20:05:16,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:05:16,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 7 [2022-11-20 20:05:16,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:05:16,868 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-20 20:05:27,096 INFO L197 IcfgInterpreter]: Interpreting procedure aws_linked_list_empty with input of size 19 for LOIs [2022-11-20 20:05:27,129 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 74 for LOIs [2022-11-20 20:05:27,165 INFO L197 IcfgInterpreter]: Interpreting procedure aws_linked_list_is_valid with input of size 19 for LOIs [2022-11-20 20:05:27,945 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 15 for LOIs [2022-11-20 20:05:27,948 INFO L197 IcfgInterpreter]: Interpreting procedure nondet_uint64_t with input of size 104 for LOIs [2022-11-20 20:05:27,965 INFO L197 IcfgInterpreter]: Interpreting procedure aws_linked_list_node_next_is_valid with input of size 20 for LOIs [2022-11-20 20:05:28,028 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-20 20:06:07,872 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '13109#(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-20 20:06:07,873 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-20 20:06:07,873 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 20:06:07,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 29] total 38 [2022-11-20 20:06:07,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694319901] [2022-11-20 20:06:07,873 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 20:06:07,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-11-20 20:06:07,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:06:07,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-11-20 20:06:07,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=344, Invalid=5489, Unknown=51, NotChecked=1256, Total=7140 [2022-11-20 20:06:07,877 INFO L87 Difference]: Start difference. First operand 138 states and 169 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-20 20:06:08,503 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-20 20:06:10,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:06:10,412 INFO L93 Difference]: Finished difference Result 348 states and 441 transitions. [2022-11-20 20:06:10,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-11-20 20:06:10,413 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-20 20:06:10,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:06:10,415 INFO L225 Difference]: With dead ends: 348 [2022-11-20 20:06:10,415 INFO L226 Difference]: Without dead ends: 248 [2022-11-20 20:06:10,417 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 212 SyntacticMatches, 12 SemanticMatches, 88 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 2259 ImplicationChecksByTransitivity, 47.9s TimeCoverageRelationStatistics Valid=370, Invalid=6089, Unknown=57, NotChecked=1494, Total=8010 [2022-11-20 20:06:10,418 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 26 mSDsluCounter, 2152 mSDsCounter, 0 mSdLazyCounter, 663 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 2303 SdHoareTripleChecker+Invalid, 3607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2939 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-20 20:06:10,418 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 2303 Invalid, 3607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 663 Invalid, 0 Unknown, 2939 Unchecked, 1.4s Time] [2022-11-20 20:06:10,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2022-11-20 20:06:10,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 221. [2022-11-20 20:06:10,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 128 states have (on average 1.125) internal successors, (144), 132 states have internal predecessors, (144), 58 states have call successors, (58), 32 states have call predecessors, (58), 34 states have return successors, (64), 56 states have call predecessors, (64), 57 states have call successors, (64) [2022-11-20 20:06:10,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 266 transitions. [2022-11-20 20:06:10,497 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 266 transitions. Word has length 98 [2022-11-20 20:06:10,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:06:10,498 INFO L495 AbstractCegarLoop]: Abstraction has 221 states and 266 transitions. [2022-11-20 20:06:10,498 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-20 20:06:10,498 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 266 transitions. [2022-11-20 20:06:10,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-11-20 20:06:10,499 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:06:10,500 INFO L195 NwaCegarLoop]: trace histogram [9, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:06:10,507 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938a64e2-7277-4202-880d-2371f7fea809/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-20 20:06:10,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938a64e2-7277-4202-880d-2371f7fea809/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-20 20:06:10,707 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 20:06:10,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:06:10,708 INFO L85 PathProgramCache]: Analyzing trace with hash 638919251, now seen corresponding path program 2 times [2022-11-20 20:06:10,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:06:10,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912706877] [2022-11-20 20:06:10,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:06:10,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:06:10,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:06:12,990 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2022-11-20 20:06:12,990 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:06:12,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912706877] [2022-11-20 20:06:12,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912706877] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:06:12,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1787387847] [2022-11-20 20:06:12,990 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 20:06:12,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:06:12,991 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938a64e2-7277-4202-880d-2371f7fea809/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:06:12,994 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938a64e2-7277-4202-880d-2371f7fea809/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:06:13,017 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938a64e2-7277-4202-880d-2371f7fea809/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-20 20:06:13,578 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-11-20 20:06:13,579 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 20:06:13,583 INFO L263 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 110 conjunts are in the unsatisfiable core [2022-11-20 20:06:13,590 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:06:13,882 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-20 20:06:13,900 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-20 20:06:14,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:06:14,078 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2022-11-20 20:06:14,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:06:14,088 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 23 treesize of output 23 [2022-11-20 20:06:14,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:06:14,112 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2022-11-20 20:06:14,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:06:14,124 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 23 treesize of output 23 [2022-11-20 20:06:14,381 INFO L321 Elim1Store]: treesize reduction 42, result has 20.8 percent of original size [2022-11-20 20:06:14,381 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 140 treesize of output 152 [2022-11-20 20:06:14,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:06:14,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:06:14,396 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 148 treesize of output 127 [2022-11-20 20:06:14,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:06:14,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:06:14,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:06:14,418 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 45 [2022-11-20 20:06:14,441 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 14 treesize of output 13 [2022-11-20 20:06:14,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:06:14,460 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 68 treesize of output 21 [2022-11-20 20:06:14,468 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 11 treesize of output 7 [2022-11-20 20:06:51,053 WARN L233 SmtUtils]: Spent 20.83s on a formula simplification that was a NOOP. DAG size: 90 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 20:07:04,673 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 69 proven. 20 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-11-20 20:07:04,673 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:07:12,512 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 25 proven. 3 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2022-11-20 20:07:12,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1787387847] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:07:12,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2067375078] [2022-11-20 20:07:12,514 INFO L159 IcfgInterpreter]: Started Sifa with 48 locations of interest [2022-11-20 20:07:12,514 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 20:07:12,514 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-20 20:07:12,515 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-20 20:07:12,515 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-20 20:07:12,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:07:12,655 INFO L321 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2022-11-20 20:07:12,655 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-20 20:07:12,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:07:12,678 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-20 20:07:12,899 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-20 20:07:12,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:07:12,926 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-20 20:07:12,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:07:12,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:07:12,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:07:12,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:07:12,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:07:12,956 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-20 20:07:12,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:07:12,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:07:12,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:07:12,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:07:12,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:07:12,988 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-20 20:07:13,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:07:13,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:07:13,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:07:13,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:07:13,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:07:13,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:07:13,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:07:13,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:07:13,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:07:13,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:07:13,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:07:13,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:07:13,075 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:07:13,110 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-20 20:07:13,111 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-20 20:07:13,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:07:13,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:07:13,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:07:13,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:07:13,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:07:13,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:07:13,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:07:13,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:07:13,170 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:07:13,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:07:13,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:07:13,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:07:13,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:07:13,179 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:07:13,214 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-20 20:07:13,215 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-20 20:07:13,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:07:13,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:07:13,388 INFO L321 Elim1Store]: treesize reduction 40, result has 48.1 percent of original size [2022-11-20 20:07:13,389 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-20 20:07:13,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:07:13,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:07:13,587 INFO L321 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-11-20 20:07:13,589 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-20 20:07:13,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:07:13,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:07:13,639 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-20 20:07:13,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:07:13,672 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-20 20:07:13,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:07:13,761 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-20 20:07:13,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:07:13,799 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-20 20:07:13,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:07:13,833 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-20 20:07:13,852 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:07:13,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:07:13,855 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-20 20:07:13,880 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-20 20:07:13,896 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-20 20:07:13,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:07:13,943 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-20 20:07:13,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:07:13,978 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-20 20:07:14,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:07:14,007 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-20 20:07:14,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:07:14,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:07:14,032 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-20 20:07:24,004 INFO L197 IcfgInterpreter]: Interpreting procedure aws_linked_list_empty with input of size 19 for LOIs [2022-11-20 20:07:24,036 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 74 for LOIs [2022-11-20 20:07:24,074 INFO L197 IcfgInterpreter]: Interpreting procedure aws_linked_list_is_valid with input of size 19 for LOIs [2022-11-20 20:07:24,797 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 15 for LOIs [2022-11-20 20:07:24,799 INFO L197 IcfgInterpreter]: Interpreting procedure nondet_uint64_t with input of size 104 for LOIs [2022-11-20 20:07:24,817 INFO L197 IcfgInterpreter]: Interpreting procedure aws_linked_list_node_next_is_valid with input of size 20 for LOIs [2022-11-20 20:07:24,880 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-20 20:07:59,754 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '14649#(and (<= 0 |__VERIFIER_assert_#in~cond|) (= |~#s_can_fail_allocator_static~0.base| 4) (= (mod __VERIFIER_assert_~cond 256) 0) (= |~#s_can_fail_allocator_static~0.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (= ~tl_last_error~0 0) (= |#NULL.offset| 0) (exists ((|v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_111| Int)) (and (not (= (mod (ite (= (ite (= (mod (ite (= (ite (and (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_111|) 0) |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_111|) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_111|) 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_back_~list#1.base_BEFORE_CALL_111| 0) 0 1) 256) 0)) (<= 0 |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_111|) (<= 0 (ite (= (ite (and (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_111|) 0) |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_111|) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_111|) 0) 16)) 1 0) 0) 0 1)) (<= (ite (= (ite (and (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_111|) 0) |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_111|) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_111|) 0) 16)) 1 0) 0) 0 1) 1))) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base_BEFORE_CALL_273| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_BEFORE_CALL_273| Int)) (and (<= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base_BEFORE_CALL_273|) (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_BEFORE_CALL_273| 24)) 0) (<= 0 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_BEFORE_CALL_273|) (<= 0 (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base_BEFORE_CALL_273|) (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_BEFORE_CALL_273| 24))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base_BEFORE_CALL_273|) (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_BEFORE_CALL_273| 24))) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base_BEFORE_CALL_273|) (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_BEFORE_CALL_273| 24))) (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_BEFORE_CALL_273| 16)) (<= 0 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base_BEFORE_CALL_273|) (<= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_BEFORE_CALL_273| 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base_BEFORE_CALL_273|) (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_BEFORE_CALL_273| 24))) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base_BEFORE_CALL_273|) (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_BEFORE_CALL_273| 24))) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base_BEFORE_CALL_273|))) (<= |__VERIFIER_assert_#in~cond| 1) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-11-20 20:07:59,754 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-20 20:07:59,754 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 20:07:59,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 7] total 34 [2022-11-20 20:07:59,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854618536] [2022-11-20 20:07:59,754 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 20:07:59,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-11-20 20:07:59,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:07:59,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-20 20:07:59,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=292, Invalid=4536, Unknown=2, NotChecked=0, Total=4830 [2022-11-20 20:07:59,757 INFO L87 Difference]: Start difference. First operand 221 states and 266 transitions. Second operand has 34 states, 32 states have (on average 3.3125) internal successors, (106), 34 states have internal predecessors, (106), 17 states have call successors, (48), 6 states have call predecessors, (48), 10 states have return successors, (47), 15 states have call predecessors, (47), 17 states have call successors, (47) [2022-11-20 20:08:16,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:08:16,685 INFO L93 Difference]: Finished difference Result 494 states and 664 transitions. [2022-11-20 20:08:16,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-11-20 20:08:16,685 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 32 states have (on average 3.3125) internal successors, (106), 34 states have internal predecessors, (106), 17 states have call successors, (48), 6 states have call predecessors, (48), 10 states have return successors, (47), 15 states have call predecessors, (47), 17 states have call successors, (47) Word has length 99 [2022-11-20 20:08:16,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:08:16,688 INFO L225 Difference]: With dead ends: 494 [2022-11-20 20:08:16,689 INFO L226 Difference]: Without dead ends: 387 [2022-11-20 20:08:16,691 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 226 SyntacticMatches, 28 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3375 ImplicationChecksByTransitivity, 89.2s TimeCoverageRelationStatistics Valid=516, Invalid=8792, Unknown=4, NotChecked=0, Total=9312 [2022-11-20 20:08:16,691 INFO L413 NwaCegarLoop]: 217 mSDtfsCounter, 237 mSDsluCounter, 3338 mSDsCounter, 0 mSdLazyCounter, 2518 mSolverCounterSat, 353 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 3555 SdHoareTripleChecker+Invalid, 3533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 353 IncrementalHoareTripleChecker+Valid, 2518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 662 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2022-11-20 20:08:16,691 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 3555 Invalid, 3533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [353 Valid, 2518 Invalid, 0 Unknown, 662 Unchecked, 5.8s Time] [2022-11-20 20:08:16,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2022-11-20 20:08:16,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 333. [2022-11-20 20:08:16,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 190 states have (on average 1.1368421052631579) internal successors, (216), 198 states have internal predecessors, (216), 92 states have call successors, (92), 44 states have call predecessors, (92), 50 states have return successors, (123), 90 states have call predecessors, (123), 90 states have call successors, (123) [2022-11-20 20:08:16,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 431 transitions. [2022-11-20 20:08:16,824 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 431 transitions. Word has length 99 [2022-11-20 20:08:16,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:08:16,825 INFO L495 AbstractCegarLoop]: Abstraction has 333 states and 431 transitions. [2022-11-20 20:08:16,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 32 states have (on average 3.3125) internal successors, (106), 34 states have internal predecessors, (106), 17 states have call successors, (48), 6 states have call predecessors, (48), 10 states have return successors, (47), 15 states have call predecessors, (47), 17 states have call successors, (47) [2022-11-20 20:08:16,825 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 431 transitions. [2022-11-20 20:08:16,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-11-20 20:08:16,827 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:08:16,827 INFO L195 NwaCegarLoop]: trace histogram [9, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:08:16,835 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938a64e2-7277-4202-880d-2371f7fea809/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-20 20:08:17,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938a64e2-7277-4202-880d-2371f7fea809/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-20 20:08:17,035 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 20:08:17,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:08:17,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1810876099, now seen corresponding path program 2 times [2022-11-20 20:08:17,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:08:17,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74286860] [2022-11-20 20:08:17,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:08:17,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:08:17,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat