./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/aws-c-common/aws_linked_list_prev_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4e7fbc69 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_646932c1-a86b-4cec-a0b8-5c653003e0c0/bin/utaipan-Q6hlc19bkW/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_646932c1-a86b-4cec-a0b8-5c653003e0c0/bin/utaipan-Q6hlc19bkW/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_646932c1-a86b-4cec-a0b8-5c653003e0c0/bin/utaipan-Q6hlc19bkW/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_646932c1-a86b-4cec-a0b8-5c653003e0c0/bin/utaipan-Q6hlc19bkW/config/TaipanReach.xml -i ../../sv-benchmarks/c/aws-c-common/aws_linked_list_prev_harness.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_646932c1-a86b-4cec-a0b8-5c653003e0c0/bin/utaipan-Q6hlc19bkW/config/svcomp-Reach-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_646932c1-a86b-4cec-a0b8-5c653003e0c0/bin/utaipan-Q6hlc19bkW --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 0aec0bb8b8715e014581c4eef5e1e25c7e0452a528f8abdf2f2a721d17b0fa7f --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-4e7fbc6 [2022-11-23 15:15:00,485 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 15:15:00,487 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 15:15:00,509 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 15:15:00,510 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 15:15:00,511 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 15:15:00,512 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 15:15:00,514 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 15:15:00,516 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 15:15:00,517 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 15:15:00,518 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 15:15:00,519 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 15:15:00,519 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 15:15:00,521 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 15:15:00,522 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 15:15:00,523 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 15:15:00,524 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 15:15:00,525 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 15:15:00,527 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 15:15:00,529 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 15:15:00,530 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 15:15:00,535 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 15:15:00,537 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 15:15:00,538 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 15:15:00,541 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 15:15:00,542 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 15:15:00,542 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 15:15:00,543 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 15:15:00,544 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 15:15:00,545 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 15:15:00,545 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 15:15:00,546 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 15:15:00,555 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 15:15:00,556 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 15:15:00,557 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 15:15:00,557 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 15:15:00,558 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 15:15:00,558 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 15:15:00,559 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 15:15:00,560 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 15:15:00,561 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 15:15:00,565 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_646932c1-a86b-4cec-a0b8-5c653003e0c0/bin/utaipan-Q6hlc19bkW/config/svcomp-Reach-64bit-Taipan_Default.epf [2022-11-23 15:15:00,610 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 15:15:00,611 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 15:15:00,611 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 15:15:00,611 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 15:15:00,612 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 15:15:00,612 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 15:15:00,612 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-23 15:15:00,613 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-23 15:15:00,613 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-23 15:15:00,613 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-23 15:15:00,613 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-23 15:15:00,614 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-23 15:15:00,614 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-23 15:15:00,614 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-23 15:15:00,614 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-23 15:15:00,614 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-23 15:15:00,615 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-23 15:15:00,615 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-23 15:15:00,615 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 15:15:00,616 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 15:15:00,616 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 15:15:00,616 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-23 15:15:00,616 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 15:15:00,617 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-23 15:15:00,617 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-23 15:15:00,617 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 15:15:00,617 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-23 15:15:00,617 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 15:15:00,618 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 15:15:00,618 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 15:15:00,618 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 15:15:00,618 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-23 15:15:00,626 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 15:15:00,626 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-23 15:15:00,626 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-23 15:15:00,627 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-23 15:15:00,628 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-23 15:15:00,628 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-23 15:15:00,628 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_646932c1-a86b-4cec-a0b8-5c653003e0c0/bin/utaipan-Q6hlc19bkW/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_646932c1-a86b-4cec-a0b8-5c653003e0c0/bin/utaipan-Q6hlc19bkW Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0aec0bb8b8715e014581c4eef5e1e25c7e0452a528f8abdf2f2a721d17b0fa7f [2022-11-23 15:15:00,936 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 15:15:00,978 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 15:15:00,981 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 15:15:00,982 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 15:15:00,983 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 15:15:00,985 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_646932c1-a86b-4cec-a0b8-5c653003e0c0/bin/utaipan-Q6hlc19bkW/../../sv-benchmarks/c/aws-c-common/aws_linked_list_prev_harness.i [2022-11-23 15:15:03,983 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 15:15:04,509 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 15:15:04,510 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_646932c1-a86b-4cec-a0b8-5c653003e0c0/sv-benchmarks/c/aws-c-common/aws_linked_list_prev_harness.i [2022-11-23 15:15:04,557 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_646932c1-a86b-4cec-a0b8-5c653003e0c0/bin/utaipan-Q6hlc19bkW/data/2db6e6199/de88f5409a8d469fa0e7ec0e6b5e6448/FLAGf915569d8 [2022-11-23 15:15:04,575 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_646932c1-a86b-4cec-a0b8-5c653003e0c0/bin/utaipan-Q6hlc19bkW/data/2db6e6199/de88f5409a8d469fa0e7ec0e6b5e6448 [2022-11-23 15:15:04,581 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 15:15:04,582 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 15:15:04,589 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 15:15:04,589 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 15:15:04,592 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 15:15:04,593 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:15:04" (1/1) ... [2022-11-23 15:15:04,594 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36fff92a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:15:04, skipping insertion in model container [2022-11-23 15:15:04,595 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:15:04" (1/1) ... [2022-11-23 15:15:04,602 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 15:15:04,717 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 15:15:05,041 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_646932c1-a86b-4cec-a0b8-5c653003e0c0/sv-benchmarks/c/aws-c-common/aws_linked_list_prev_harness.i[4494,4507] [2022-11-23 15:15:05,048 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_646932c1-a86b-4cec-a0b8-5c653003e0c0/sv-benchmarks/c/aws-c-common/aws_linked_list_prev_harness.i[4554,4567] [2022-11-23 15:15:05,800 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-23 15:15:05,801 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-23 15:15:05,802 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-23 15:15:05,803 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-23 15:15:05,804 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-23 15:15:05,817 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-23 15:15:05,817 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-23 15:15:05,819 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-23 15:15:05,820 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-23 15:15:05,822 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-23 15:15:05,824 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-23 15:15:05,825 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-23 15:15:05,825 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-23 15:15:06,160 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-11-23 15:15:06,162 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-11-23 15:15:06,163 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-11-23 15:15:06,164 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-11-23 15:15:06,166 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-11-23 15:15:06,167 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-11-23 15:15:06,168 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-11-23 15:15:06,168 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-11-23 15:15:06,169 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-11-23 15:15:06,170 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-11-23 15:15:06,314 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-11-23 15:15:06,341 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 15:15:06,366 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 15:15:06,397 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_646932c1-a86b-4cec-a0b8-5c653003e0c0/sv-benchmarks/c/aws-c-common/aws_linked_list_prev_harness.i[4494,4507] [2022-11-23 15:15:06,397 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_646932c1-a86b-4cec-a0b8-5c653003e0c0/sv-benchmarks/c/aws-c-common/aws_linked_list_prev_harness.i[4554,4567] [2022-11-23 15:15:06,483 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-23 15:15:06,486 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-23 15:15:06,486 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-23 15:15:06,499 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-23 15:15:06,500 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-23 15:15:06,507 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-23 15:15:06,519 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-23 15:15:06,520 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-23 15:15:06,521 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-23 15:15:06,522 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-23 15:15:06,523 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-23 15:15:06,523 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-23 15:15:06,523 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-23 15:15:06,558 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-11-23 15:15:06,559 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-11-23 15:15:06,560 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-11-23 15:15:06,561 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-11-23 15:15:06,562 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-11-23 15:15:06,563 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-11-23 15:15:06,563 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-11-23 15:15:06,564 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-11-23 15:15:06,564 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-11-23 15:15:06,565 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-11-23 15:15:06,587 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-11-23 15:15:06,669 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 15:15:06,874 INFO L208 MainTranslator]: Completed translation [2022-11-23 15:15:06,875 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:15:06 WrapperNode [2022-11-23 15:15:06,875 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 15:15:06,876 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 15:15:06,876 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 15:15:06,876 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 15:15:06,883 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:15:06" (1/1) ... [2022-11-23 15:15:06,938 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:15:06" (1/1) ... [2022-11-23 15:15:06,973 INFO L138 Inliner]: procedures = 679, calls = 1038, calls flagged for inlining = 50, calls inlined = 4, statements flattened = 57 [2022-11-23 15:15:06,973 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 15:15:06,974 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 15:15:06,974 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 15:15:06,974 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 15:15:06,993 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:15:06" (1/1) ... [2022-11-23 15:15:06,994 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:15:06" (1/1) ... [2022-11-23 15:15:07,002 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:15:06" (1/1) ... [2022-11-23 15:15:07,005 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:15:06" (1/1) ... [2022-11-23 15:15:07,016 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:15:06" (1/1) ... [2022-11-23 15:15:07,032 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:15:06" (1/1) ... [2022-11-23 15:15:07,035 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:15:06" (1/1) ... [2022-11-23 15:15:07,052 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:15:06" (1/1) ... [2022-11-23 15:15:07,056 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 15:15:07,056 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 15:15:07,057 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 15:15:07,057 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 15:15:07,057 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:15:06" (1/1) ... [2022-11-23 15:15:07,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 15:15:07,080 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_646932c1-a86b-4cec-a0b8-5c653003e0c0/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 15:15:07,100 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_646932c1-a86b-4cec-a0b8-5c653003e0c0/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-23 15:15:07,127 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_646932c1-a86b-4cec-a0b8-5c653003e0c0/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-23 15:15:07,146 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-23 15:15:07,146 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-23 15:15:07,147 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-23 15:15:07,148 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2022-11-23 15:15:07,148 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2022-11-23 15:15:07,148 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-23 15:15:07,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-23 15:15:07,148 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 15:15:07,148 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 15:15:07,148 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-23 15:15:07,149 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-23 15:15:07,149 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-23 15:15:07,150 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-23 15:15:07,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-23 15:15:07,150 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_prev_is_valid [2022-11-23 15:15:07,150 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_prev_is_valid [2022-11-23 15:15:07,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-23 15:15:07,478 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 15:15:07,480 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 15:15:07,681 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 15:15:07,797 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 15:15:07,797 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-23 15:15:07,800 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:15:07 BoogieIcfgContainer [2022-11-23 15:15:07,800 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 15:15:07,803 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-23 15:15:07,803 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-23 15:15:07,807 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-23 15:15:07,807 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 03:15:04" (1/3) ... [2022-11-23 15:15:07,808 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19e4d4f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:15:07, skipping insertion in model container [2022-11-23 15:15:07,808 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:15:06" (2/3) ... [2022-11-23 15:15:07,808 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19e4d4f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:15:07, skipping insertion in model container [2022-11-23 15:15:07,808 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:15:07" (3/3) ... [2022-11-23 15:15:07,810 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_linked_list_prev_harness.i [2022-11-23 15:15:07,830 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-23 15:15:07,831 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-23 15:15:07,878 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-23 15:15:07,885 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;@5607c138, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 15:15:07,886 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-23 15:15:07,890 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-11-23 15:15:07,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-23 15:15:07,899 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:15:07,899 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:15:07,900 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 15:15:07,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:15:07,906 INFO L85 PathProgramCache]: Analyzing trace with hash 846701445, now seen corresponding path program 1 times [2022-11-23 15:15:07,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:15:07,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716412729] [2022-11-23 15:15:07,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:15:07,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:15:08,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:15:10,561 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 15:15:10,562 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:15:10,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716412729] [2022-11-23 15:15:10,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716412729] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 15:15:10,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [770348925] [2022-11-23 15:15:10,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:15:10,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:15:10,565 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_646932c1-a86b-4cec-a0b8-5c653003e0c0/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 15:15:10,571 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_646932c1-a86b-4cec-a0b8-5c653003e0c0/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 15:15:10,595 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_646932c1-a86b-4cec-a0b8-5c653003e0c0/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-23 15:15:10,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:15:10,763 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 66 conjunts are in the unsatisfiable core [2022-11-23 15:15:10,774 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:15:10,850 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-23 15:15:10,857 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-23 15:15:10,866 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 15:15:10,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:15:10,875 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-23 15:15:10,884 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-23 15:15:12,821 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 15:15:12,822 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 15:15:12,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [770348925] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:15:12,822 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-23 15:15:12,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [11] total 20 [2022-11-23 15:15:12,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974453649] [2022-11-23 15:15:12,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:15:12,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-23 15:15:12,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:15:12,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-23 15:15:12,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380 [2022-11-23 15:15:12,864 INFO L87 Difference]: Start difference. First operand has 33 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 13 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-23 15:15:13,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:15:13,622 INFO L93 Difference]: Finished difference Result 62 states and 81 transitions. [2022-11-23 15:15:13,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-23 15:15:13,625 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 15 [2022-11-23 15:15:13,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:15:13,632 INFO L225 Difference]: With dead ends: 62 [2022-11-23 15:15:13,633 INFO L226 Difference]: Without dead ends: 35 [2022-11-23 15:15:13,636 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=100, Invalid=500, Unknown=0, NotChecked=0, Total=600 [2022-11-23 15:15:13,639 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 24 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-23 15:15:13,640 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 81 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-23 15:15:13,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-11-23 15:15:13,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-11-23 15:15:13,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 18 states have internal predecessors, (18), 12 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-23 15:15:13,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2022-11-23 15:15:13,685 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 15 [2022-11-23 15:15:13,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:15:13,686 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2022-11-23 15:15:13,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-23 15:15:13,686 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2022-11-23 15:15:13,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-23 15:15:13,688 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:15:13,688 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:15:13,705 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_646932c1-a86b-4cec-a0b8-5c653003e0c0/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-23 15:15:13,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_646932c1-a86b-4cec-a0b8-5c653003e0c0/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2022-11-23 15:15:13,905 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 15:15:13,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:15:13,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1013014958, now seen corresponding path program 1 times [2022-11-23 15:15:13,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:15:13,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640696681] [2022-11-23 15:15:13,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:15:13,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:15:13,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:15:15,861 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 15:15:15,862 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:15:15,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640696681] [2022-11-23 15:15:15,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640696681] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 15:15:15,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [521066814] [2022-11-23 15:15:15,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:15:15,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:15:15,863 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_646932c1-a86b-4cec-a0b8-5c653003e0c0/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 15:15:15,864 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_646932c1-a86b-4cec-a0b8-5c653003e0c0/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 15:15:15,891 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_646932c1-a86b-4cec-a0b8-5c653003e0c0/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-23 15:15:16,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:15:16,060 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 90 conjunts are in the unsatisfiable core [2022-11-23 15:15:16,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:15:16,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:15:16,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:15:16,107 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-11-23 15:15:16,117 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2022-11-23 15:15:16,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:15:16,131 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 20 [2022-11-23 15:15:16,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:15:16,141 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2022-11-23 15:15:16,148 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-11-23 15:15:16,155 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-11-23 15:15:18,256 INFO L321 Elim1Store]: treesize reduction 69, result has 25.0 percent of original size [2022-11-23 15:15:18,257 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 10 new quantified variables, introduced 15 case distinctions, treesize of input 304 treesize of output 176 [2022-11-23 15:15:18,310 INFO L321 Elim1Store]: treesize reduction 74, result has 8.6 percent of original size [2022-11-23 15:15:18,311 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 118 treesize of output 64 [2022-11-23 15:15:18,391 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 15:15:18,392 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 15:15:29,517 WARN L233 SmtUtils]: Spent 8.05s on a formula simplification that was a NOOP. DAG size: 43 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 15:15:31,411 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 15:15:31,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [521066814] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 15:15:31,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1732716400] [2022-11-23 15:15:31,441 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2022-11-23 15:15:31,441 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 15:15:31,447 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-23 15:15:31,453 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-23 15:15:31,454 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-23 15:15:31,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:15:31,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:15:31,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:15:31,538 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 30 [2022-11-23 15:15:31,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:15:31,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:15:31,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:15:31,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:15:31,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:15:31,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:15:31,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:15:31,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:15:31,573 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 15:15:31,600 INFO L321 Elim1Store]: treesize reduction 26, result has 49.0 percent of original size [2022-11-23 15:15:31,600 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 75 treesize of output 83 [2022-11-23 15:15:31,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:15:31,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:15:31,730 INFO L321 Elim1Store]: treesize reduction 136, result has 24.9 percent of original size [2022-11-23 15:15:31,730 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 14 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 12 case distinctions, treesize of input 49 treesize of output 85 [2022-11-23 15:15:31,760 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 9 [2022-11-23 15:15:31,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:15:31,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:15:31,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:15:31,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:15:31,780 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 19 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 75 [2022-11-23 15:15:31,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:15:31,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:15:31,805 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 17 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 43 [2022-11-23 15:15:32,672 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 19 for LOIs [2022-11-23 15:15:32,680 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 19 for LOIs [2022-11-23 15:15:32,683 INFO L197 IcfgInterpreter]: Interpreting procedure aws_linked_list_node_prev_is_valid with input of size 34 for LOIs [2022-11-23 15:15:32,771 INFO L197 IcfgInterpreter]: Interpreting procedure aws_linked_list_node_next_is_valid with input of size 15 for LOIs [2022-11-23 15:15:32,833 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-23 15:15:35,139 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '424#(and (<= 0 |__VERIFIER_assert_#in~cond|) (= |~#s_can_fail_allocator_static~0.base| 4) (= (mod __VERIFIER_assert_~cond 256) 0) (= |~#s_can_fail_allocator_static~0.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (= ~tl_last_error~0 0) (= |#NULL.offset| 0) (<= |__VERIFIER_assert_#in~cond| 1) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-11-23 15:15:35,140 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-23 15:15:35,140 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 15:15:35,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 11] total 31 [2022-11-23 15:15:35,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843459917] [2022-11-23 15:15:35,140 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 15:15:35,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-23 15:15:35,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:15:35,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-23 15:15:35,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=2151, Unknown=0, NotChecked=0, Total=2352 [2022-11-23 15:15:35,143 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand has 31 states, 14 states have (on average 2.357142857142857) internal successors, (33), 22 states have internal predecessors, (33), 13 states have call successors, (17), 4 states have call predecessors, (17), 11 states have return successors, (15), 11 states have call predecessors, (15), 11 states have call successors, (15) [2022-11-23 15:15:36,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:15:36,144 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2022-11-23 15:15:36,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-23 15:15:36,145 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 14 states have (on average 2.357142857142857) internal successors, (33), 22 states have internal predecessors, (33), 13 states have call successors, (17), 4 states have call predecessors, (17), 11 states have return successors, (15), 11 states have call predecessors, (15), 11 states have call successors, (15) Word has length 24 [2022-11-23 15:15:36,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:15:36,146 INFO L225 Difference]: With dead ends: 42 [2022-11-23 15:15:36,146 INFO L226 Difference]: Without dead ends: 40 [2022-11-23 15:15:36,147 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 30 SyntacticMatches, 6 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 871 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=242, Invalid=2620, Unknown=0, NotChecked=0, Total=2862 [2022-11-23 15:15:36,149 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 42 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 419 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-23 15:15:36,149 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 167 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 419 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-23 15:15:36,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-11-23 15:15:36,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2022-11-23 15:15:36,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 20 states have (on average 1.05) internal successors, (21), 21 states have internal predecessors, (21), 12 states have call successors, (12), 6 states have call predecessors, (12), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-23 15:15:36,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2022-11-23 15:15:36,164 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 24 [2022-11-23 15:15:36,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:15:36,164 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2022-11-23 15:15:36,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 14 states have (on average 2.357142857142857) internal successors, (33), 22 states have internal predecessors, (33), 13 states have call successors, (17), 4 states have call predecessors, (17), 11 states have return successors, (15), 11 states have call predecessors, (15), 11 states have call successors, (15) [2022-11-23 15:15:36,165 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2022-11-23 15:15:36,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-23 15:15:36,166 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:15:36,166 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:15:36,172 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_646932c1-a86b-4cec-a0b8-5c653003e0c0/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-23 15:15:36,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_646932c1-a86b-4cec-a0b8-5c653003e0c0/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:15:36,372 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 15:15:36,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:15:36,373 INFO L85 PathProgramCache]: Analyzing trace with hash 615597899, now seen corresponding path program 1 times [2022-11-23 15:15:36,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:15:36,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582070263] [2022-11-23 15:15:36,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:15:36,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:15:36,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:15:36,634 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-23 15:15:36,634 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:15:36,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582070263] [2022-11-23 15:15:36,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582070263] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:15:36,635 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:15:36,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-23 15:15:36,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609071722] [2022-11-23 15:15:36,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:15:36,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 15:15:36,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:15:36,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 15:15:36,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-23 15:15:36,637 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-23 15:15:36,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:15:36,784 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2022-11-23 15:15:36,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 15:15:36,785 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 30 [2022-11-23 15:15:36,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:15:36,786 INFO L225 Difference]: With dead ends: 45 [2022-11-23 15:15:36,786 INFO L226 Difference]: Without dead ends: 43 [2022-11-23 15:15:36,787 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-23 15:15:36,787 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 9 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 15:15:36,788 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 108 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 15:15:36,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-11-23 15:15:36,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-11-23 15:15:36,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 24 states have internal predecessors, (24), 12 states have call successors, (12), 7 states have call predecessors, (12), 7 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-23 15:15:36,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2022-11-23 15:15:36,801 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 30 [2022-11-23 15:15:36,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:15:36,801 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2022-11-23 15:15:36,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-23 15:15:36,802 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2022-11-23 15:15:36,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-23 15:15:36,803 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:15:36,803 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:15:36,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-23 15:15:36,804 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 15:15:36,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:15:36,804 INFO L85 PathProgramCache]: Analyzing trace with hash 584950545, now seen corresponding path program 1 times [2022-11-23 15:15:36,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:15:36,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623884796] [2022-11-23 15:15:36,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:15:36,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:15:36,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:15:38,223 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-23 15:15:38,223 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:15:38,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623884796] [2022-11-23 15:15:38,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623884796] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:15:38,224 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:15:38,224 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-23 15:15:38,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643211598] [2022-11-23 15:15:38,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:15:38,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-23 15:15:38,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:15:38,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-23 15:15:38,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-23 15:15:38,225 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand has 8 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-23 15:15:38,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:15:38,447 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2022-11-23 15:15:38,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 15:15:38,448 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 39 [2022-11-23 15:15:38,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:15:38,449 INFO L225 Difference]: With dead ends: 49 [2022-11-23 15:15:38,449 INFO L226 Difference]: Without dead ends: 47 [2022-11-23 15:15:38,449 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-11-23 15:15:38,450 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 11 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 15:15:38,450 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 109 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 15:15:38,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-11-23 15:15:38,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-11-23 15:15:38,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 27 states have internal predecessors, (27), 12 states have call successors, (12), 8 states have call predecessors, (12), 8 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-23 15:15:38,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2022-11-23 15:15:38,465 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 39 [2022-11-23 15:15:38,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:15:38,466 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2022-11-23 15:15:38,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-23 15:15:38,466 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2022-11-23 15:15:38,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-23 15:15:38,467 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:15:38,468 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:15:38,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-23 15:15:38,468 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 15:15:38,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:15:38,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1736704596, now seen corresponding path program 1 times [2022-11-23 15:15:38,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:15:38,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669949087] [2022-11-23 15:15:38,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:15:38,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:15:38,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:15:40,175 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-11-23 15:15:40,175 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:15:40,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669949087] [2022-11-23 15:15:40,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669949087] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 15:15:40,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2010101687] [2022-11-23 15:15:40,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:15:40,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:15:40,176 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_646932c1-a86b-4cec-a0b8-5c653003e0c0/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 15:15:40,179 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_646932c1-a86b-4cec-a0b8-5c653003e0c0/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 15:15:40,203 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_646932c1-a86b-4cec-a0b8-5c653003e0c0/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-23 15:15:40,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:15:40,378 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 63 conjunts are in the unsatisfiable core [2022-11-23 15:15:40,388 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:15:43,004 WARN L859 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_linked_list_prev_~node#1.offset_BEFORE_CALL_29| Int) (|v_ULTIMATE.start_aws_linked_list_prev_~node#1.base_BEFORE_CALL_29| Int)) (let ((.cse1 (+ 8 |v_ULTIMATE.start_aws_linked_list_prev_~node#1.offset_BEFORE_CALL_29|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_prev_~node#1.base_BEFORE_CALL_29|) .cse1))) (and (not (= .cse0 0)) (not (= (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_prev_~node#1.base_BEFORE_CALL_29|) .cse1)) .cse0) 0)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_prev_~node#1.offset_BEFORE_CALL_29| Int) (|v_ULTIMATE.start_aws_linked_list_prev_~node#1.base_BEFORE_CALL_29| Int)) (let ((.cse4 (+ 8 |v_ULTIMATE.start_aws_linked_list_prev_~node#1.offset_BEFORE_CALL_29|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_prev_~node#1.base_BEFORE_CALL_29|) .cse4)) (.cse3 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_prev_~node#1.base_BEFORE_CALL_29|) .cse4))) (and (= (select (select |c_#memory_$Pointer$.offset| .cse2) .cse3) 0) (= (select (select |c_#memory_$Pointer$.base| .cse2) .cse3) 0))))) (exists ((|v_ULTIMATE.start_aws_linked_list_prev_~node#1.offset_BEFORE_CALL_29| Int) (|v_ULTIMATE.start_aws_linked_list_prev_~node#1.base_BEFORE_CALL_29| Int)) (let ((.cse6 (+ 8 |v_ULTIMATE.start_aws_linked_list_prev_~node#1.offset_BEFORE_CALL_29|))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_prev_~node#1.base_BEFORE_CALL_29|) .cse6))) (and (not (= .cse5 0)) (not (= (select (select |c_#memory_$Pointer$.offset| .cse5) (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_prev_~node#1.base_BEFORE_CALL_29|) .cse6)) 0)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_prev_~node#1.offset_BEFORE_CALL_29| Int) (|v_ULTIMATE.start_aws_linked_list_prev_~node#1.base_BEFORE_CALL_29| Int)) (let ((.cse8 (+ 8 |v_ULTIMATE.start_aws_linked_list_prev_~node#1.offset_BEFORE_CALL_29|))) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_prev_~node#1.base_BEFORE_CALL_29|) .cse8))) (and (not (= .cse7 0)) (not (= (select (select |c_#memory_$Pointer$.base| .cse7) (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_prev_~node#1.base_BEFORE_CALL_29|) .cse8)) 0)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_prev_~node#1.offset_BEFORE_CALL_29| Int) (|v_ULTIMATE.start_aws_linked_list_prev_~node#1.base_BEFORE_CALL_29| Int)) (let ((.cse10 (+ 8 |v_ULTIMATE.start_aws_linked_list_prev_~node#1.offset_BEFORE_CALL_29|))) (let ((.cse9 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_prev_~node#1.base_BEFORE_CALL_29|) .cse10))) (and (not (= .cse9 0)) (not (= (select (select |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_prev_~node#1.base_BEFORE_CALL_29|) .cse10)) .cse9) 0)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_prev_~node#1.offset_BEFORE_CALL_29| Int) (|v_ULTIMATE.start_aws_linked_list_prev_~node#1.base_BEFORE_CALL_29| Int)) (let ((.cse11 (+ 8 |v_ULTIMATE.start_aws_linked_list_prev_~node#1.offset_BEFORE_CALL_29|))) (and (= (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_prev_~node#1.base_BEFORE_CALL_29|) .cse11) 0) (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_prev_~node#1.base_BEFORE_CALL_29|) .cse11) 0))))) is different from true [2022-11-23 15:15:47,341 WARN L859 $PredicateComparison]: unable to prove that (or (exists ((|ULTIMATE.start_aws_linked_list_prev_~node#1.base| Int) (|ULTIMATE.start_aws_linked_list_prev_~node#1.offset| Int)) (let ((.cse5 (+ |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 8))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) .cse5)) (.cse0 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) .cse5))) (let ((.cse1 (select (select |c_#memory_$Pointer$.offset| .cse4) .cse0))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse4) .cse0)) (.cse3 (+ .cse1 8))) (and (not (= .cse0 0)) (not (= .cse1 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse2) .cse3) .cse0) (= (select (select |c_#memory_$Pointer$.base| .cse2) .cse3) .cse4))))))) (exists ((|ULTIMATE.start_aws_linked_list_prev_~node#1.base| Int) (|ULTIMATE.start_aws_linked_list_prev_~node#1.offset| Int)) (let ((.cse10 (+ |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 8))) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) .cse10)) (.cse9 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) .cse10))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| .cse7) .cse9)) (.cse8 (+ (select (select |c_#memory_$Pointer$.offset| .cse7) .cse9) 8))) (and (not (= .cse6 0)) (not (= .cse7 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse6) .cse8) .cse9) (= (select (select |c_#memory_$Pointer$.base| .cse6) .cse8) .cse7)))))) (exists ((|ULTIMATE.start_aws_linked_list_prev_~node#1.base| Int) (|ULTIMATE.start_aws_linked_list_prev_~node#1.offset| Int)) (let ((.cse15 (+ |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 8))) (let ((.cse14 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) .cse15)) (.cse11 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) .cse15))) (let ((.cse12 (select (select |c_#memory_$Pointer$.base| .cse14) .cse11)) (.cse13 (+ (select (select |c_#memory_$Pointer$.offset| .cse14) .cse11) 8))) (and (not (= .cse11 0)) (not (= .cse12 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse12) .cse13) .cse11) (= (select (select |c_#memory_$Pointer$.base| .cse12) .cse13) .cse14)))))) (exists ((|ULTIMATE.start_aws_linked_list_prev_~node#1.base| Int) (|ULTIMATE.start_aws_linked_list_prev_~node#1.offset| Int)) (let ((.cse21 (+ |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 8))) (let ((.cse16 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) .cse21)) (.cse20 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) .cse21))) (let ((.cse17 (select (select |c_#memory_$Pointer$.offset| .cse16) .cse20))) (let ((.cse18 (select (select |c_#memory_$Pointer$.base| .cse16) .cse20)) (.cse19 (+ .cse17 8))) (and (not (= .cse16 0)) (not (= .cse17 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse18) .cse19) .cse20) (= (select (select |c_#memory_$Pointer$.base| .cse18) .cse19) .cse16)))))))) is different from true [2022-11-23 15:16:07,600 WARN L233 SmtUtils]: Spent 18.08s on a formula simplification that was a NOOP. DAG size: 43 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 15:16:30,576 WARN L233 SmtUtils]: Spent 18.41s on a formula simplification that was a NOOP. DAG size: 45 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 15:16:36,737 WARN L859 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_1| Int)) (and (not (= |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_1| 0)) (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_1| Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_1|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_1|)) (.cse1 (+ .cse2 8))) (and (= (select (select |c_#memory_$Pointer$.base| .cse0) .cse1) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_1|) (not (= .cse2 0)) (= |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_1| (select (select |c_#memory_$Pointer$.offset| .cse0) .cse1)))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_1| Int)) (and (not (= |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_1| 0)) (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_1| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_1|)) (.cse4 (+ (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_1|) 8))) (and (= (select (select |c_#memory_$Pointer$.base| .cse3) .cse4) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_1|) (not (= .cse3 0)) (= |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_1| (select (select |c_#memory_$Pointer$.offset| .cse3) .cse4))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_1| Int)) (and (not (= |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_1| 0)) (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_1| Int)) (let ((.cse7 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_1|))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_1|)) (.cse6 (+ .cse7 8))) (and (= (select (select |c_#memory_$Pointer$.base| .cse5) .cse6) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_1|) (not (= .cse7 0)) (= |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_1| (select (select |c_#memory_$Pointer$.offset| .cse5) .cse6)))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_1| Int)) (and (not (= |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_1| 0)) (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_1| Int)) (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_1|)) (.cse9 (+ (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_1|) 8))) (and (= (select (select |c_#memory_$Pointer$.base| .cse8) .cse9) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_1|) (not (= .cse8 0)) (= |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_1| (select (select |c_#memory_$Pointer$.offset| .cse8) .cse9)))))))) is different from true [2022-11-23 15:16:39,716 WARN L859 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_2| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_2| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_2|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_2|)) (.cse2 (+ .cse0 8))) (and (not (= .cse0 0)) (= (select (select |c_#memory_$Pointer$.base| .cse1) .cse2) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_2|) (= (select (select |c_#memory_$Pointer$.offset| .cse1) .cse2) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_2|))))) (not (= |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_2| 0)))) (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_2| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_2| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_2|)) (.cse4 (+ (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_2|) 8))) (and (= (select (select |c_#memory_$Pointer$.base| .cse3) .cse4) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_2|) (not (= .cse3 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse3) .cse4) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_2|)))) (not (= |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_2| 0)))) (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_2| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_2| Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_2|)) (.cse6 (+ (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_2|) 8))) (and (= (select (select |c_#memory_$Pointer$.base| .cse5) .cse6) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_2|) (not (= .cse5 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse5) .cse6) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_2|)))) (not (= |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_2| 0)))) (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_2| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_2| Int)) (let ((.cse7 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_2|))) (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_2|)) (.cse9 (+ .cse7 8))) (and (not (= .cse7 0)) (= (select (select |c_#memory_$Pointer$.base| .cse8) .cse9) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_2|) (= (select (select |c_#memory_$Pointer$.offset| .cse8) .cse9) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_2|))))) (not (= |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_2| 0))))) is different from true [2022-11-23 15:16:43,380 WARN L859 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_3| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_3| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_3|) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_3|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_3|) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_3|)) (.cse2 (+ .cse0 8))) (and (not (= .cse0 0)) (= |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_3| (select (select |c_#memory_$Pointer$.offset| .cse1) .cse2)) (= (select (select |c_#memory_$Pointer$.base| .cse1) .cse2) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_3|))))) (not (= |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_3| 0)))) (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_3| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_3| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_3|) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_3|)) (.cse4 (+ (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_3|) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_3|) 8))) (and (not (= .cse3 0)) (= |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_3| (select (select |c_#memory_$Pointer$.offset| .cse3) .cse4)) (= (select (select |c_#memory_$Pointer$.base| .cse3) .cse4) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_3|)))) (not (= |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_3| 0)))) (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_3| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_3| Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_3|) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_3|))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_3|) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_3|)) (.cse7 (+ .cse5 8))) (and (not (= .cse5 0)) (= |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_3| (select (select |c_#memory_$Pointer$.offset| .cse6) .cse7)) (= (select (select |c_#memory_$Pointer$.base| .cse6) .cse7) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_3|))))) (not (= |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_3| 0)))) (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_3| Int)) (and (not (= |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_3| 0)) (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_3| Int)) (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_3|) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_3|)) (.cse9 (+ (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_3|) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_3|) 8))) (and (not (= .cse8 0)) (= |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_3| (select (select |c_#memory_$Pointer$.offset| .cse8) .cse9)) (= (select (select |c_#memory_$Pointer$.base| .cse8) .cse9) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_3|))))))) is different from true [2022-11-23 15:17:18,954 WARN L233 SmtUtils]: Spent 23.26s on a formula simplification that was a NOOP. DAG size: 78 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 15:17:25,829 WARN L233 SmtUtils]: Spent 6.81s on a formula simplification. DAG size of input: 313 DAG size of output: 307 (called from [L 318] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-11-23 15:17:25,831 INFO L321 Elim1Store]: treesize reduction 18, result has 97.7 percent of original size [2022-11-23 15:17:25,832 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 15 new quantified variables, introduced 45 case distinctions, treesize of input 273 treesize of output 934 [2022-11-23 15:17:26,541 INFO L217 Elim1Store]: Index analysis took 630 ms [2022-11-23 15:17:34,646 WARN L233 SmtUtils]: Spent 7.97s on a formula simplification. DAG size of input: 301 DAG size of output: 300 (called from [L 318] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-11-23 15:17:34,648 INFO L321 Elim1Store]: treesize reduction 3, result has 99.4 percent of original size [2022-11-23 15:17:34,648 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 15 new quantified variables, introduced 45 case distinctions, treesize of input 796 treesize of output 1116