./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_linked_list_insert_after_harness.i --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/aws-c-common/aws_linked_list_insert_after_harness.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 811b19098d8792ad6e5000a82cea527dd92a4bca0da5ce1bf33c0114316cf54d --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 21:09:46,223 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 21:09:46,226 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 21:09:46,259 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 21:09:46,260 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 21:09:46,262 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 21:09:46,264 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 21:09:46,266 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 21:09:46,267 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 21:09:46,270 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 21:09:46,271 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 21:09:46,272 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 21:09:46,272 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 21:09:46,274 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 21:09:46,275 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 21:09:46,278 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 21:09:46,278 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 21:09:46,279 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 21:09:46,280 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 21:09:46,285 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 21:09:46,286 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 21:09:46,286 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 21:09:46,288 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 21:09:46,288 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 21:09:46,293 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 21:09:46,293 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 21:09:46,294 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 21:09:46,295 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 21:09:46,295 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 21:09:46,296 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 21:09:46,296 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 21:09:46,297 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 21:09:46,298 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 21:09:46,299 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 21:09:46,300 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 21:09:46,300 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 21:09:46,300 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 21:09:46,301 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 21:09:46,301 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 21:09:46,302 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 21:09:46,302 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 21:09:46,303 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-02-20 21:09:46,326 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 21:09:46,326 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 21:09:46,327 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 21:09:46,327 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 21:09:46,328 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 21:09:46,328 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 21:09:46,328 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 21:09:46,329 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 21:09:46,329 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 21:09:46,329 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 21:09:46,330 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 21:09:46,330 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 21:09:46,330 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 21:09:46,330 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 21:09:46,330 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 21:09:46,330 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 21:09:46,330 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 21:09:46,331 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 21:09:46,331 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 21:09:46,331 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 21:09:46,331 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 21:09:46,331 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 21:09:46,331 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 21:09:46,332 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 21:09:46,332 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 21:09:46,332 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 21:09:46,332 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 21:09:46,332 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 21:09:46,332 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 21:09:46,333 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 21:09:46,333 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> Automizer 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 -> 811b19098d8792ad6e5000a82cea527dd92a4bca0da5ce1bf33c0114316cf54d [2022-02-20 21:09:46,527 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 21:09:46,543 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 21:09:46,545 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 21:09:46,545 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 21:09:46,546 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 21:09:46,547 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_linked_list_insert_after_harness.i [2022-02-20 21:09:46,607 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/104617615/e82a63ba0c4a466dac861971652a4aae/FLAG0fe0152f8 [2022-02-20 21:09:47,166 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 21:09:47,166 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_insert_after_harness.i [2022-02-20 21:09:47,197 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/104617615/e82a63ba0c4a466dac861971652a4aae/FLAG0fe0152f8 [2022-02-20 21:09:47,586 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/104617615/e82a63ba0c4a466dac861971652a4aae [2022-02-20 21:09:47,589 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 21:09:47,590 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 21:09:47,592 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 21:09:47,593 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 21:09:47,595 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 21:09:47,596 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 09:09:47" (1/1) ... [2022-02-20 21:09:47,597 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d864596 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:09:47, skipping insertion in model container [2022-02-20 21:09:47,597 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 09:09:47" (1/1) ... [2022-02-20 21:09:47,615 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 21:09:47,676 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 21:09:47,883 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_insert_after_harness.i[4502,4515] [2022-02-20 21:09:47,889 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_insert_after_harness.i[4562,4575] [2022-02-20 21:09:48,366 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:09:48,372 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:09:48,374 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:09:48,374 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:09:48,376 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:09:48,387 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:09:48,389 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:09:48,391 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:09:48,393 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:09:48,395 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:09:48,396 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:09:48,396 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:09:48,397 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:09:48,612 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-02-20 21:09:48,613 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-02-20 21:09:48,613 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-02-20 21:09:48,614 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-02-20 21:09:48,615 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-02-20 21:09:48,616 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-02-20 21:09:48,616 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-02-20 21:09:48,617 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-02-20 21:09:48,617 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-02-20 21:09:48,617 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-02-20 21:09:48,702 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-02-20 21:09:48,716 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 21:09:48,735 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 21:09:48,758 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_insert_after_harness.i[4502,4515] [2022-02-20 21:09:48,759 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_insert_after_harness.i[4562,4575] [2022-02-20 21:09:48,802 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:09:48,802 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:09:48,802 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:09:48,803 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:09:48,803 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:09:48,812 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:09:48,812 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:09:48,815 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:09:48,816 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:09:48,817 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:09:48,817 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:09:48,818 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:09:48,818 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:09:48,867 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-02-20 21:09:48,868 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-02-20 21:09:48,869 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-02-20 21:09:48,870 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-02-20 21:09:48,870 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-02-20 21:09:48,871 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-02-20 21:09:48,872 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-02-20 21:09:48,872 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-02-20 21:09:48,873 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-02-20 21:09:48,873 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-02-20 21:09:48,918 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-02-20 21:09:48,937 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 21:09:49,073 INFO L208 MainTranslator]: Completed translation [2022-02-20 21:09:49,074 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:09:49 WrapperNode [2022-02-20 21:09:49,074 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 21:09:49,074 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 21:09:49,074 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 21:09:49,075 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 21:09:49,079 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:09:49" (1/1) ... [2022-02-20 21:09:49,122 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:09:49" (1/1) ... [2022-02-20 21:09:49,154 INFO L137 Inliner]: procedures = 679, calls = 1048, calls flagged for inlining = 50, calls inlined = 4, statements flattened = 78 [2022-02-20 21:09:49,154 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 21:09:49,155 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 21:09:49,155 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 21:09:49,155 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 21:09:49,162 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:09:49" (1/1) ... [2022-02-20 21:09:49,162 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:09:49" (1/1) ... [2022-02-20 21:09:49,165 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:09:49" (1/1) ... [2022-02-20 21:09:49,165 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:09:49" (1/1) ... [2022-02-20 21:09:49,175 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:09:49" (1/1) ... [2022-02-20 21:09:49,177 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:09:49" (1/1) ... [2022-02-20 21:09:49,179 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:09:49" (1/1) ... [2022-02-20 21:09:49,183 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 21:09:49,183 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 21:09:49,183 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 21:09:49,184 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 21:09:49,194 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:09:49" (1/1) ... [2022-02-20 21:09:49,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 21:09:49,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 21:09:49,223 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 21:09:49,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 21:09:49,258 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 21:09:49,259 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-20 21:09:49,259 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-20 21:09:49,259 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2022-02-20 21:09:49,260 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2022-02-20 21:09:49,260 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 21:09:49,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 21:09:49,261 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 21:09:49,261 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 21:09:49,261 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-02-20 21:09:49,262 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-02-20 21:09:49,262 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 21:09:49,262 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 21:09:49,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-02-20 21:09:49,263 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_prev_is_valid [2022-02-20 21:09:49,263 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_prev_is_valid [2022-02-20 21:09:49,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 21:09:49,428 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 21:09:49,429 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 21:09:49,617 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 21:09:49,622 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 21:09:49,623 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 21:09:49,624 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 09:09:49 BoogieIcfgContainer [2022-02-20 21:09:49,625 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 21:09:49,626 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 21:09:49,630 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 21:09:49,632 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 21:09:49,633 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 09:09:47" (1/3) ... [2022-02-20 21:09:49,634 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a07ac6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 09:09:49, skipping insertion in model container [2022-02-20 21:09:49,634 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:09:49" (2/3) ... [2022-02-20 21:09:49,634 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a07ac6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 09:09:49, skipping insertion in model container [2022-02-20 21:09:49,634 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 09:09:49" (3/3) ... [2022-02-20 21:09:49,635 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_linked_list_insert_after_harness.i [2022-02-20 21:09:49,639 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 21:09:49,639 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 21:09:49,670 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 21:09:49,675 INFO L339 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=PETRI_NET, 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, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 21:09:49,677 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 21:09:49,699 INFO L276 IsEmpty]: Start isEmpty. Operand has 63 states, 37 states have (on average 1.1891891891891893) internal successors, (44), 38 states have internal predecessors, (44), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-02-20 21:09:49,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-02-20 21:09:49,702 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:09:49,703 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 21:09:49,703 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:09:49,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:09:49,707 INFO L85 PathProgramCache]: Analyzing trace with hash -946824848, now seen corresponding path program 1 times [2022-02-20 21:09:49,713 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:09:49,713 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227810684] [2022-02-20 21:09:49,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:09:49,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:09:49,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:09:49,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 21:09:50,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:09:50,051 INFO L290 TraceCheckUtils]: 0: Hoare triple {66#true} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short304 := ~node.base != 0 || ~node.offset != 0; {66#true} is VALID [2022-02-20 21:09:50,051 INFO L290 TraceCheckUtils]: 1: Hoare triple {66#true} assume #t~short304;call #t~mem303.base, #t~mem303.offset := read~$Pointer$(~node.base, ~node.offset, 8);#t~short304 := #t~mem303.base != 0 || #t~mem303.offset != 0; {66#true} is VALID [2022-02-20 21:09:50,052 INFO L290 TraceCheckUtils]: 2: Hoare triple {66#true} #t~short307 := #t~short304; {66#true} is VALID [2022-02-20 21:09:50,052 INFO L290 TraceCheckUtils]: 3: Hoare triple {66#true} assume #t~short307;call #t~mem305.base, #t~mem305.offset := read~$Pointer$(~node.base, ~node.offset, 8);call #t~mem306.base, #t~mem306.offset := read~$Pointer$(#t~mem305.base, 8 + #t~mem305.offset, 8);#t~short307 := #t~mem306.base == ~node.base && #t~mem306.offset == ~node.offset; {66#true} is VALID [2022-02-20 21:09:50,052 INFO L290 TraceCheckUtils]: 4: Hoare triple {66#true} #res := (if 0 == (if #t~short307 then 1 else 0) then 0 else 1);havoc #t~mem303.base, #t~mem303.offset;havoc #t~short304;havoc #t~mem305.base, #t~mem305.offset;havoc #t~mem306.base, #t~mem306.offset;havoc #t~short307; {66#true} is VALID [2022-02-20 21:09:50,052 INFO L290 TraceCheckUtils]: 5: Hoare triple {66#true} assume true; {66#true} is VALID [2022-02-20 21:09:50,053 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {66#true} {66#true} #93#return; {66#true} is VALID [2022-02-20 21:09:50,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 21:09:50,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:09:50,066 INFO L290 TraceCheckUtils]: 0: Hoare triple {66#true} ~cond := #in~cond; {66#true} is VALID [2022-02-20 21:09:50,067 INFO L290 TraceCheckUtils]: 1: Hoare triple {66#true} assume 0 == ~cond % 256;assume false; {67#false} is VALID [2022-02-20 21:09:50,067 INFO L290 TraceCheckUtils]: 2: Hoare triple {67#false} assume true; {67#false} is VALID [2022-02-20 21:09:50,067 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {67#false} {66#true} #95#return; {67#false} is VALID [2022-02-20 21:09:50,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-02-20 21:09:50,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:09:50,079 INFO L290 TraceCheckUtils]: 0: Hoare triple {66#true} ~cond := #in~cond; {66#true} is VALID [2022-02-20 21:09:50,080 INFO L290 TraceCheckUtils]: 1: Hoare triple {66#true} assume 0 == ~cond % 256;assume false; {67#false} is VALID [2022-02-20 21:09:50,080 INFO L290 TraceCheckUtils]: 2: Hoare triple {67#false} assume true; {67#false} is VALID [2022-02-20 21:09:50,080 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {67#false} {67#false} #97#return; {67#false} is VALID [2022-02-20 21:09:50,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-02-20 21:09:50,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:09:50,096 INFO L290 TraceCheckUtils]: 0: Hoare triple {66#true} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short304 := ~node.base != 0 || ~node.offset != 0; {66#true} is VALID [2022-02-20 21:09:50,096 INFO L290 TraceCheckUtils]: 1: Hoare triple {66#true} assume #t~short304;call #t~mem303.base, #t~mem303.offset := read~$Pointer$(~node.base, ~node.offset, 8);#t~short304 := #t~mem303.base != 0 || #t~mem303.offset != 0; {66#true} is VALID [2022-02-20 21:09:50,096 INFO L290 TraceCheckUtils]: 2: Hoare triple {66#true} #t~short307 := #t~short304; {66#true} is VALID [2022-02-20 21:09:50,097 INFO L290 TraceCheckUtils]: 3: Hoare triple {66#true} assume #t~short307;call #t~mem305.base, #t~mem305.offset := read~$Pointer$(~node.base, ~node.offset, 8);call #t~mem306.base, #t~mem306.offset := read~$Pointer$(#t~mem305.base, 8 + #t~mem305.offset, 8);#t~short307 := #t~mem306.base == ~node.base && #t~mem306.offset == ~node.offset; {66#true} is VALID [2022-02-20 21:09:50,097 INFO L290 TraceCheckUtils]: 4: Hoare triple {66#true} #res := (if 0 == (if #t~short307 then 1 else 0) then 0 else 1);havoc #t~mem303.base, #t~mem303.offset;havoc #t~short304;havoc #t~mem305.base, #t~mem305.offset;havoc #t~mem306.base, #t~mem306.offset;havoc #t~short307; {66#true} is VALID [2022-02-20 21:09:50,097 INFO L290 TraceCheckUtils]: 5: Hoare triple {66#true} assume true; {66#true} is VALID [2022-02-20 21:09:50,097 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {66#true} {67#false} #99#return; {67#false} is VALID [2022-02-20 21:09:50,098 INFO L290 TraceCheckUtils]: 0: Hoare triple {66#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(39, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(78, 4);~#s_can_fail_allocator_static~0.base, ~#s_can_fail_allocator_static~0.offset := 5, 0;call #Ultimate.allocInit(40, 5);call write~init~$Pointer$(#funAddr~s_can_fail_malloc_allocator.base, #funAddr~s_can_fail_malloc_allocator.offset, ~#s_can_fail_allocator_static~0.base, ~#s_can_fail_allocator_static~0.offset, 8);call write~init~$Pointer$(#funAddr~s_can_fail_free_allocator.base, #funAddr~s_can_fail_free_allocator.offset, ~#s_can_fail_allocator_static~0.base, 8 + ~#s_can_fail_allocator_static~0.offset, 8);call write~init~$Pointer$(#funAddr~s_can_fail_realloc_allocator.base, #funAddr~s_can_fail_realloc_allocator.offset, ~#s_can_fail_allocator_static~0.base, 16 + ~#s_can_fail_allocator_static~0.offset, 8);call write~init~$Pointer$(#funAddr~s_can_fail_calloc_allocator.base, #funAddr~s_can_fail_calloc_allocator.offset, ~#s_can_fail_allocator_static~0.base, 24 + ~#s_can_fail_allocator_static~0.offset, 8);call write~init~$Pointer$(0, 0, ~#s_can_fail_allocator_static~0.base, 32 + ~#s_can_fail_allocator_static~0.offset, 8);~tl_last_error~0 := 0; {66#true} is VALID [2022-02-20 21:09:50,098 INFO L290 TraceCheckUtils]: 1: Hoare triple {66#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;assume { :begin_inline_aws_linked_list_insert_after_harness } true;havoc aws_linked_list_insert_after_harness_#t~ret674#1, aws_linked_list_insert_after_harness_#t~ret675#1, aws_linked_list_insert_after_harness_#t~ret676#1, aws_linked_list_insert_after_harness_#t~ret677#1, aws_linked_list_insert_after_harness_#t~mem678#1.base, aws_linked_list_insert_after_harness_#t~mem678#1.offset, aws_linked_list_insert_after_harness_#t~mem679#1.base, aws_linked_list_insert_after_harness_#t~mem679#1.offset, aws_linked_list_insert_after_harness_~#after~0#1.base, aws_linked_list_insert_after_harness_~#after~0#1.offset, aws_linked_list_insert_after_harness_~#after_next~0#1.base, aws_linked_list_insert_after_harness_~#after_next~0#1.offset, aws_linked_list_insert_after_harness_~#to_add~0#1.base, aws_linked_list_insert_after_harness_~#to_add~0#1.offset;call aws_linked_list_insert_after_harness_~#after~0#1.base, aws_linked_list_insert_after_harness_~#after~0#1.offset := #Ultimate.allocOnStack(16);call aws_linked_list_insert_after_harness_~#after_next~0#1.base, aws_linked_list_insert_after_harness_~#after_next~0#1.offset := #Ultimate.allocOnStack(16);call aws_linked_list_insert_after_harness_~#to_add~0#1.base, aws_linked_list_insert_after_harness_~#to_add~0#1.offset := #Ultimate.allocOnStack(16);call write~$Pointer$(aws_linked_list_insert_after_harness_~#after_next~0#1.base, aws_linked_list_insert_after_harness_~#after_next~0#1.offset, aws_linked_list_insert_after_harness_~#after~0#1.base, aws_linked_list_insert_after_harness_~#after~0#1.offset, 8);call write~$Pointer$(aws_linked_list_insert_after_harness_~#after~0#1.base, aws_linked_list_insert_after_harness_~#after~0#1.offset, aws_linked_list_insert_after_harness_~#after_next~0#1.base, 8 + aws_linked_list_insert_after_harness_~#after_next~0#1.offset, 8);assume { :begin_inline_aws_linked_list_insert_after } true;aws_linked_list_insert_after_#in~after#1.base, aws_linked_list_insert_after_#in~after#1.offset, aws_linked_list_insert_after_#in~to_add#1.base, aws_linked_list_insert_after_#in~to_add#1.offset := aws_linked_list_insert_after_harness_~#after~0#1.base, aws_linked_list_insert_after_harness_~#after~0#1.offset, aws_linked_list_insert_after_harness_~#to_add~0#1.base, aws_linked_list_insert_after_harness_~#to_add~0#1.offset;havoc aws_linked_list_insert_after_#t~ret339#1, aws_linked_list_insert_after_#t~mem340#1.base, aws_linked_list_insert_after_#t~mem340#1.offset, aws_linked_list_insert_after_#t~mem341#1.base, aws_linked_list_insert_after_#t~mem341#1.offset, aws_linked_list_insert_after_#t~ret342#1, aws_linked_list_insert_after_#t~ret343#1, aws_linked_list_insert_after_#t~ret344#1, aws_linked_list_insert_after_#t~mem345#1.base, aws_linked_list_insert_after_#t~mem345#1.offset, aws_linked_list_insert_after_~after#1.base, aws_linked_list_insert_after_~after#1.offset, aws_linked_list_insert_after_~to_add#1.base, aws_linked_list_insert_after_~to_add#1.offset;aws_linked_list_insert_after_~after#1.base, aws_linked_list_insert_after_~after#1.offset := aws_linked_list_insert_after_#in~after#1.base, aws_linked_list_insert_after_#in~after#1.offset;aws_linked_list_insert_after_~to_add#1.base, aws_linked_list_insert_after_~to_add#1.offset := aws_linked_list_insert_after_#in~to_add#1.base, aws_linked_list_insert_after_#in~to_add#1.offset; {66#true} is VALID [2022-02-20 21:09:50,098 INFO L272 TraceCheckUtils]: 2: Hoare triple {66#true} call aws_linked_list_insert_after_#t~ret339#1 := aws_linked_list_node_next_is_valid(aws_linked_list_insert_after_~after#1.base, aws_linked_list_insert_after_~after#1.offset); {66#true} is VALID [2022-02-20 21:09:50,098 INFO L290 TraceCheckUtils]: 3: Hoare triple {66#true} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short304 := ~node.base != 0 || ~node.offset != 0; {66#true} is VALID [2022-02-20 21:09:50,099 INFO L290 TraceCheckUtils]: 4: Hoare triple {66#true} assume #t~short304;call #t~mem303.base, #t~mem303.offset := read~$Pointer$(~node.base, ~node.offset, 8);#t~short304 := #t~mem303.base != 0 || #t~mem303.offset != 0; {66#true} is VALID [2022-02-20 21:09:50,099 INFO L290 TraceCheckUtils]: 5: Hoare triple {66#true} #t~short307 := #t~short304; {66#true} is VALID [2022-02-20 21:09:50,099 INFO L290 TraceCheckUtils]: 6: Hoare triple {66#true} assume #t~short307;call #t~mem305.base, #t~mem305.offset := read~$Pointer$(~node.base, ~node.offset, 8);call #t~mem306.base, #t~mem306.offset := read~$Pointer$(#t~mem305.base, 8 + #t~mem305.offset, 8);#t~short307 := #t~mem306.base == ~node.base && #t~mem306.offset == ~node.offset; {66#true} is VALID [2022-02-20 21:09:50,099 INFO L290 TraceCheckUtils]: 7: Hoare triple {66#true} #res := (if 0 == (if #t~short307 then 1 else 0) then 0 else 1);havoc #t~mem303.base, #t~mem303.offset;havoc #t~short304;havoc #t~mem305.base, #t~mem305.offset;havoc #t~mem306.base, #t~mem306.offset;havoc #t~short307; {66#true} is VALID [2022-02-20 21:09:50,099 INFO L290 TraceCheckUtils]: 8: Hoare triple {66#true} assume true; {66#true} is VALID [2022-02-20 21:09:50,100 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {66#true} {66#true} #93#return; {66#true} is VALID [2022-02-20 21:09:50,100 INFO L272 TraceCheckUtils]: 10: Hoare triple {66#true} call assume_abort_if_not(aws_linked_list_insert_after_#t~ret339#1); {66#true} is VALID [2022-02-20 21:09:50,100 INFO L290 TraceCheckUtils]: 11: Hoare triple {66#true} ~cond := #in~cond; {66#true} is VALID [2022-02-20 21:09:50,100 INFO L290 TraceCheckUtils]: 12: Hoare triple {66#true} assume 0 == ~cond % 256;assume false; {67#false} is VALID [2022-02-20 21:09:50,101 INFO L290 TraceCheckUtils]: 13: Hoare triple {67#false} assume true; {67#false} is VALID [2022-02-20 21:09:50,101 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {67#false} {66#true} #95#return; {67#false} is VALID [2022-02-20 21:09:50,101 INFO L290 TraceCheckUtils]: 15: Hoare triple {67#false} havoc aws_linked_list_insert_after_#t~ret339#1; {67#false} is VALID [2022-02-20 21:09:50,101 INFO L272 TraceCheckUtils]: 16: Hoare triple {67#false} call assume_abort_if_not((if 0 == (if aws_linked_list_insert_after_~to_add#1.base != 0 || aws_linked_list_insert_after_~to_add#1.offset != 0 then 1 else 0) then 0 else 1)); {66#true} is VALID [2022-02-20 21:09:50,101 INFO L290 TraceCheckUtils]: 17: Hoare triple {66#true} ~cond := #in~cond; {66#true} is VALID [2022-02-20 21:09:50,102 INFO L290 TraceCheckUtils]: 18: Hoare triple {66#true} assume 0 == ~cond % 256;assume false; {67#false} is VALID [2022-02-20 21:09:50,102 INFO L290 TraceCheckUtils]: 19: Hoare triple {67#false} assume true; {67#false} is VALID [2022-02-20 21:09:50,102 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {67#false} {67#false} #97#return; {67#false} is VALID [2022-02-20 21:09:50,102 INFO L290 TraceCheckUtils]: 21: Hoare triple {67#false} call write~$Pointer$(aws_linked_list_insert_after_~after#1.base, aws_linked_list_insert_after_~after#1.offset, aws_linked_list_insert_after_~to_add#1.base, 8 + aws_linked_list_insert_after_~to_add#1.offset, 8);call aws_linked_list_insert_after_#t~mem340#1.base, aws_linked_list_insert_after_#t~mem340#1.offset := read~$Pointer$(aws_linked_list_insert_after_~after#1.base, aws_linked_list_insert_after_~after#1.offset, 8);call write~$Pointer$(aws_linked_list_insert_after_#t~mem340#1.base, aws_linked_list_insert_after_#t~mem340#1.offset, aws_linked_list_insert_after_~to_add#1.base, aws_linked_list_insert_after_~to_add#1.offset, 8);havoc aws_linked_list_insert_after_#t~mem340#1.base, aws_linked_list_insert_after_#t~mem340#1.offset;call aws_linked_list_insert_after_#t~mem341#1.base, aws_linked_list_insert_after_#t~mem341#1.offset := read~$Pointer$(aws_linked_list_insert_after_~after#1.base, aws_linked_list_insert_after_~after#1.offset, 8);call write~$Pointer$(aws_linked_list_insert_after_~to_add#1.base, aws_linked_list_insert_after_~to_add#1.offset, aws_linked_list_insert_after_#t~mem341#1.base, 8 + aws_linked_list_insert_after_#t~mem341#1.offset, 8);havoc aws_linked_list_insert_after_#t~mem341#1.base, aws_linked_list_insert_after_#t~mem341#1.offset;call write~$Pointer$(aws_linked_list_insert_after_~to_add#1.base, aws_linked_list_insert_after_~to_add#1.offset, aws_linked_list_insert_after_~after#1.base, aws_linked_list_insert_after_~after#1.offset, 8); {67#false} is VALID [2022-02-20 21:09:50,103 INFO L272 TraceCheckUtils]: 22: Hoare triple {67#false} call aws_linked_list_insert_after_#t~ret342#1 := aws_linked_list_node_next_is_valid(aws_linked_list_insert_after_~after#1.base, aws_linked_list_insert_after_~after#1.offset); {66#true} is VALID [2022-02-20 21:09:50,103 INFO L290 TraceCheckUtils]: 23: Hoare triple {66#true} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short304 := ~node.base != 0 || ~node.offset != 0; {66#true} is VALID [2022-02-20 21:09:50,103 INFO L290 TraceCheckUtils]: 24: Hoare triple {66#true} assume #t~short304;call #t~mem303.base, #t~mem303.offset := read~$Pointer$(~node.base, ~node.offset, 8);#t~short304 := #t~mem303.base != 0 || #t~mem303.offset != 0; {66#true} is VALID [2022-02-20 21:09:50,103 INFO L290 TraceCheckUtils]: 25: Hoare triple {66#true} #t~short307 := #t~short304; {66#true} is VALID [2022-02-20 21:09:50,103 INFO L290 TraceCheckUtils]: 26: Hoare triple {66#true} assume #t~short307;call #t~mem305.base, #t~mem305.offset := read~$Pointer$(~node.base, ~node.offset, 8);call #t~mem306.base, #t~mem306.offset := read~$Pointer$(#t~mem305.base, 8 + #t~mem305.offset, 8);#t~short307 := #t~mem306.base == ~node.base && #t~mem306.offset == ~node.offset; {66#true} is VALID [2022-02-20 21:09:50,103 INFO L290 TraceCheckUtils]: 27: Hoare triple {66#true} #res := (if 0 == (if #t~short307 then 1 else 0) then 0 else 1);havoc #t~mem303.base, #t~mem303.offset;havoc #t~short304;havoc #t~mem305.base, #t~mem305.offset;havoc #t~mem306.base, #t~mem306.offset;havoc #t~short307; {66#true} is VALID [2022-02-20 21:09:50,104 INFO L290 TraceCheckUtils]: 28: Hoare triple {66#true} assume true; {66#true} is VALID [2022-02-20 21:09:50,104 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {66#true} {67#false} #99#return; {67#false} is VALID [2022-02-20 21:09:50,104 INFO L272 TraceCheckUtils]: 30: Hoare triple {67#false} call __VERIFIER_assert(aws_linked_list_insert_after_#t~ret342#1); {67#false} is VALID [2022-02-20 21:09:50,104 INFO L290 TraceCheckUtils]: 31: Hoare triple {67#false} ~cond := #in~cond; {67#false} is VALID [2022-02-20 21:09:50,104 INFO L290 TraceCheckUtils]: 32: Hoare triple {67#false} assume 0 == ~cond % 256; {67#false} is VALID [2022-02-20 21:09:50,105 INFO L290 TraceCheckUtils]: 33: Hoare triple {67#false} assume !false; {67#false} is VALID [2022-02-20 21:09:50,105 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-02-20 21:09:50,105 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:09:50,106 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227810684] [2022-02-20 21:09:50,106 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227810684] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:09:50,106 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:09:50,106 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 21:09:50,108 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348536570] [2022-02-20 21:09:50,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:09:50,111 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 34 [2022-02-20 21:09:50,113 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:09:50,115 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 21:09:50,148 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:09:50,148 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 21:09:50,149 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:09:50,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 21:09:50,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 21:09:50,171 INFO L87 Difference]: Start difference. First operand has 63 states, 37 states have (on average 1.1891891891891893) internal successors, (44), 38 states have internal predecessors, (44), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 21:09:50,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:09:50,285 INFO L93 Difference]: Finished difference Result 122 states and 174 transitions. [2022-02-20 21:09:50,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 21:09:50,285 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 34 [2022-02-20 21:09:50,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:09:50,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 21:09:50,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 174 transitions. [2022-02-20 21:09:50,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 21:09:50,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 174 transitions. [2022-02-20 21:09:50,323 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 174 transitions. [2022-02-20 21:09:50,463 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 174 edges. 174 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:09:50,470 INFO L225 Difference]: With dead ends: 122 [2022-02-20 21:09:50,470 INFO L226 Difference]: Without dead ends: 58 [2022-02-20 21:09:50,473 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 21:09:50,475 INFO L933 BasicCegarLoop]: 82 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 21:09:50,476 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 21:09:50,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-02-20 21:09:50,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2022-02-20 21:09:50,496 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:09:50,497 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand has 58 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 34 states have internal predecessors, (38), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-02-20 21:09:50,497 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand has 58 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 34 states have internal predecessors, (38), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-02-20 21:09:50,498 INFO L87 Difference]: Start difference. First operand 58 states. Second operand has 58 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 34 states have internal predecessors, (38), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-02-20 21:09:50,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:09:50,502 INFO L93 Difference]: Finished difference Result 58 states and 77 transitions. [2022-02-20 21:09:50,502 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 77 transitions. [2022-02-20 21:09:50,504 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:09:50,504 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:09:50,504 INFO L74 IsIncluded]: Start isIncluded. First operand has 58 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 34 states have internal predecessors, (38), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand 58 states. [2022-02-20 21:09:50,505 INFO L87 Difference]: Start difference. First operand has 58 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 34 states have internal predecessors, (38), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand 58 states. [2022-02-20 21:09:50,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:09:50,509 INFO L93 Difference]: Finished difference Result 58 states and 77 transitions. [2022-02-20 21:09:50,509 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 77 transitions. [2022-02-20 21:09:50,510 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:09:50,510 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:09:50,510 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:09:50,510 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:09:50,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 34 states have internal predecessors, (38), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-02-20 21:09:50,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 77 transitions. [2022-02-20 21:09:50,515 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 77 transitions. Word has length 34 [2022-02-20 21:09:50,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:09:50,515 INFO L470 AbstractCegarLoop]: Abstraction has 58 states and 77 transitions. [2022-02-20 21:09:50,515 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 21:09:50,515 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 77 transitions. [2022-02-20 21:09:50,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-02-20 21:09:50,516 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:09:50,516 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 21:09:50,517 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 21:09:50,517 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:09:50,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:09:50,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1749038484, now seen corresponding path program 1 times [2022-02-20 21:09:50,518 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:09:50,518 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406242792] [2022-02-20 21:09:50,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:09:50,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:09:50,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:09:50,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 21:09:50,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:09:50,972 INFO L290 TraceCheckUtils]: 0: Hoare triple {460#true} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short304 := ~node.base != 0 || ~node.offset != 0; {460#true} is VALID [2022-02-20 21:09:50,973 INFO L290 TraceCheckUtils]: 1: Hoare triple {460#true} assume #t~short304;call #t~mem303.base, #t~mem303.offset := read~$Pointer$(~node.base, ~node.offset, 8);#t~short304 := #t~mem303.base != 0 || #t~mem303.offset != 0; {460#true} is VALID [2022-02-20 21:09:50,973 INFO L290 TraceCheckUtils]: 2: Hoare triple {460#true} #t~short307 := #t~short304; {460#true} is VALID [2022-02-20 21:09:50,973 INFO L290 TraceCheckUtils]: 3: Hoare triple {460#true} assume #t~short307;call #t~mem305.base, #t~mem305.offset := read~$Pointer$(~node.base, ~node.offset, 8);call #t~mem306.base, #t~mem306.offset := read~$Pointer$(#t~mem305.base, 8 + #t~mem305.offset, 8);#t~short307 := #t~mem306.base == ~node.base && #t~mem306.offset == ~node.offset; {460#true} is VALID [2022-02-20 21:09:50,973 INFO L290 TraceCheckUtils]: 4: Hoare triple {460#true} #res := (if 0 == (if #t~short307 then 1 else 0) then 0 else 1);havoc #t~mem303.base, #t~mem303.offset;havoc #t~short304;havoc #t~mem305.base, #t~mem305.offset;havoc #t~mem306.base, #t~mem306.offset;havoc #t~short307; {460#true} is VALID [2022-02-20 21:09:50,974 INFO L290 TraceCheckUtils]: 5: Hoare triple {460#true} assume true; {460#true} is VALID [2022-02-20 21:09:50,975 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {460#true} {462#(and (= |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base|) |ULTIMATE.start_aws_linked_list_insert_after_~after#1.offset|) |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base|)) (not (= |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base| |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base|)))} #93#return; {462#(and (= |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base|) |ULTIMATE.start_aws_linked_list_insert_after_~after#1.offset|) |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base|)) (not (= |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base| |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base|)))} is VALID [2022-02-20 21:09:50,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 21:09:50,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:09:50,984 INFO L290 TraceCheckUtils]: 0: Hoare triple {460#true} ~cond := #in~cond; {460#true} is VALID [2022-02-20 21:09:50,985 INFO L290 TraceCheckUtils]: 1: Hoare triple {460#true} assume !(0 == ~cond % 256); {460#true} is VALID [2022-02-20 21:09:50,985 INFO L290 TraceCheckUtils]: 2: Hoare triple {460#true} assume true; {460#true} is VALID [2022-02-20 21:09:50,986 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {460#true} {462#(and (= |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base|) |ULTIMATE.start_aws_linked_list_insert_after_~after#1.offset|) |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base|)) (not (= |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base| |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base|)))} #95#return; {462#(and (= |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base|) |ULTIMATE.start_aws_linked_list_insert_after_~after#1.offset|) |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base|)) (not (= |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base| |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base|)))} is VALID [2022-02-20 21:09:50,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-02-20 21:09:50,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:09:51,007 INFO L290 TraceCheckUtils]: 0: Hoare triple {460#true} ~cond := #in~cond; {460#true} is VALID [2022-02-20 21:09:51,008 INFO L290 TraceCheckUtils]: 1: Hoare triple {460#true} assume !(0 == ~cond % 256); {460#true} is VALID [2022-02-20 21:09:51,008 INFO L290 TraceCheckUtils]: 2: Hoare triple {460#true} assume true; {460#true} is VALID [2022-02-20 21:09:51,009 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {460#true} {462#(and (= |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base|) |ULTIMATE.start_aws_linked_list_insert_after_~after#1.offset|) |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base|)) (not (= |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base| |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base|)))} #97#return; {462#(and (= |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base|) |ULTIMATE.start_aws_linked_list_insert_after_~after#1.offset|) |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base|)) (not (= |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base| |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base|)))} is VALID [2022-02-20 21:09:51,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-02-20 21:09:51,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:09:51,147 INFO L290 TraceCheckUtils]: 0: Hoare triple {460#true} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short304 := ~node.base != 0 || ~node.offset != 0; {489#(and (= aws_linked_list_node_next_is_valid_~node.base |aws_linked_list_node_next_is_valid_#in~node.base|) (= aws_linked_list_node_next_is_valid_~node.offset |aws_linked_list_node_next_is_valid_#in~node.offset|))} is VALID [2022-02-20 21:09:51,148 INFO L290 TraceCheckUtils]: 1: Hoare triple {489#(and (= aws_linked_list_node_next_is_valid_~node.base |aws_linked_list_node_next_is_valid_#in~node.base|) (= aws_linked_list_node_next_is_valid_~node.offset |aws_linked_list_node_next_is_valid_#in~node.offset|))} assume #t~short304;call #t~mem303.base, #t~mem303.offset := read~$Pointer$(~node.base, ~node.offset, 8);#t~short304 := #t~mem303.base != 0 || #t~mem303.offset != 0; {489#(and (= aws_linked_list_node_next_is_valid_~node.base |aws_linked_list_node_next_is_valid_#in~node.base|) (= aws_linked_list_node_next_is_valid_~node.offset |aws_linked_list_node_next_is_valid_#in~node.offset|))} is VALID [2022-02-20 21:09:51,149 INFO L290 TraceCheckUtils]: 2: Hoare triple {489#(and (= aws_linked_list_node_next_is_valid_~node.base |aws_linked_list_node_next_is_valid_#in~node.base|) (= aws_linked_list_node_next_is_valid_~node.offset |aws_linked_list_node_next_is_valid_#in~node.offset|))} #t~short307 := #t~short304; {489#(and (= aws_linked_list_node_next_is_valid_~node.base |aws_linked_list_node_next_is_valid_#in~node.base|) (= aws_linked_list_node_next_is_valid_~node.offset |aws_linked_list_node_next_is_valid_#in~node.offset|))} is VALID [2022-02-20 21:09:51,150 INFO L290 TraceCheckUtils]: 3: Hoare triple {489#(and (= aws_linked_list_node_next_is_valid_~node.base |aws_linked_list_node_next_is_valid_#in~node.base|) (= aws_linked_list_node_next_is_valid_~node.offset |aws_linked_list_node_next_is_valid_#in~node.offset|))} assume #t~short307;call #t~mem305.base, #t~mem305.offset := read~$Pointer$(~node.base, ~node.offset, 8);call #t~mem306.base, #t~mem306.offset := read~$Pointer$(#t~mem305.base, 8 + #t~mem305.offset, 8);#t~short307 := #t~mem306.base == ~node.base && #t~mem306.offset == ~node.offset; {490#(or (not (= (select (select |#memory_$Pointer$.offset| |aws_linked_list_node_next_is_valid_#in~node.base|) |aws_linked_list_node_next_is_valid_#in~node.offset|) 0)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |aws_linked_list_node_next_is_valid_#in~node.base|) |aws_linked_list_node_next_is_valid_#in~node.offset|)) 8) |aws_linked_list_node_next_is_valid_#in~node.base|)) (not (= |aws_linked_list_node_next_is_valid_#in~node.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |aws_linked_list_node_next_is_valid_#in~node.base|) |aws_linked_list_node_next_is_valid_#in~node.offset|)) 8))) |aws_linked_list_node_next_is_valid_#t~short307|)} is VALID [2022-02-20 21:09:51,151 INFO L290 TraceCheckUtils]: 4: Hoare triple {490#(or (not (= (select (select |#memory_$Pointer$.offset| |aws_linked_list_node_next_is_valid_#in~node.base|) |aws_linked_list_node_next_is_valid_#in~node.offset|) 0)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |aws_linked_list_node_next_is_valid_#in~node.base|) |aws_linked_list_node_next_is_valid_#in~node.offset|)) 8) |aws_linked_list_node_next_is_valid_#in~node.base|)) (not (= |aws_linked_list_node_next_is_valid_#in~node.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |aws_linked_list_node_next_is_valid_#in~node.base|) |aws_linked_list_node_next_is_valid_#in~node.offset|)) 8))) |aws_linked_list_node_next_is_valid_#t~short307|)} #res := (if 0 == (if #t~short307 then 1 else 0) then 0 else 1);havoc #t~mem303.base, #t~mem303.offset;havoc #t~short304;havoc #t~mem305.base, #t~mem305.offset;havoc #t~mem306.base, #t~mem306.offset;havoc #t~short307; {491#(or (and (<= |aws_linked_list_node_next_is_valid_#res| 1) (<= 1 |aws_linked_list_node_next_is_valid_#res|)) (not (= (select (select |#memory_$Pointer$.offset| |aws_linked_list_node_next_is_valid_#in~node.base|) |aws_linked_list_node_next_is_valid_#in~node.offset|) 0)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |aws_linked_list_node_next_is_valid_#in~node.base|) |aws_linked_list_node_next_is_valid_#in~node.offset|)) 8) |aws_linked_list_node_next_is_valid_#in~node.base|)) (not (= |aws_linked_list_node_next_is_valid_#in~node.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |aws_linked_list_node_next_is_valid_#in~node.base|) |aws_linked_list_node_next_is_valid_#in~node.offset|)) 8))))} is VALID [2022-02-20 21:09:51,151 INFO L290 TraceCheckUtils]: 5: Hoare triple {491#(or (and (<= |aws_linked_list_node_next_is_valid_#res| 1) (<= 1 |aws_linked_list_node_next_is_valid_#res|)) (not (= (select (select |#memory_$Pointer$.offset| |aws_linked_list_node_next_is_valid_#in~node.base|) |aws_linked_list_node_next_is_valid_#in~node.offset|) 0)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |aws_linked_list_node_next_is_valid_#in~node.base|) |aws_linked_list_node_next_is_valid_#in~node.offset|)) 8) |aws_linked_list_node_next_is_valid_#in~node.base|)) (not (= |aws_linked_list_node_next_is_valid_#in~node.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |aws_linked_list_node_next_is_valid_#in~node.base|) |aws_linked_list_node_next_is_valid_#in~node.offset|)) 8))))} assume true; {491#(or (and (<= |aws_linked_list_node_next_is_valid_#res| 1) (<= 1 |aws_linked_list_node_next_is_valid_#res|)) (not (= (select (select |#memory_$Pointer$.offset| |aws_linked_list_node_next_is_valid_#in~node.base|) |aws_linked_list_node_next_is_valid_#in~node.offset|) 0)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |aws_linked_list_node_next_is_valid_#in~node.base|) |aws_linked_list_node_next_is_valid_#in~node.offset|)) 8) |aws_linked_list_node_next_is_valid_#in~node.base|)) (not (= |aws_linked_list_node_next_is_valid_#in~node.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |aws_linked_list_node_next_is_valid_#in~node.base|) |aws_linked_list_node_next_is_valid_#in~node.offset|)) 8))))} is VALID [2022-02-20 21:09:51,153 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {491#(or (and (<= |aws_linked_list_node_next_is_valid_#res| 1) (<= 1 |aws_linked_list_node_next_is_valid_#res|)) (not (= (select (select |#memory_$Pointer$.offset| |aws_linked_list_node_next_is_valid_#in~node.base|) |aws_linked_list_node_next_is_valid_#in~node.offset|) 0)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |aws_linked_list_node_next_is_valid_#in~node.base|) |aws_linked_list_node_next_is_valid_#in~node.offset|)) 8) |aws_linked_list_node_next_is_valid_#in~node.base|)) (not (= |aws_linked_list_node_next_is_valid_#in~node.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |aws_linked_list_node_next_is_valid_#in~node.base|) |aws_linked_list_node_next_is_valid_#in~node.offset|)) 8))))} {478#(and (= |ULTIMATE.start_aws_linked_list_insert_after_~after#1.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base|) |ULTIMATE.start_aws_linked_list_insert_after_~after#1.offset|)) 8)) (= |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base|) |ULTIMATE.start_aws_linked_list_insert_after_~after#1.offset|)) 8)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base|) |ULTIMATE.start_aws_linked_list_insert_after_~after#1.offset|) 0))} #99#return; {486#(and (<= 1 |ULTIMATE.start_aws_linked_list_insert_after_#t~ret342#1|) (<= |ULTIMATE.start_aws_linked_list_insert_after_#t~ret342#1| 1))} is VALID [2022-02-20 21:09:51,153 INFO L290 TraceCheckUtils]: 0: Hoare triple {460#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(39, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(78, 4);~#s_can_fail_allocator_static~0.base, ~#s_can_fail_allocator_static~0.offset := 5, 0;call #Ultimate.allocInit(40, 5);call write~init~$Pointer$(#funAddr~s_can_fail_malloc_allocator.base, #funAddr~s_can_fail_malloc_allocator.offset, ~#s_can_fail_allocator_static~0.base, ~#s_can_fail_allocator_static~0.offset, 8);call write~init~$Pointer$(#funAddr~s_can_fail_free_allocator.base, #funAddr~s_can_fail_free_allocator.offset, ~#s_can_fail_allocator_static~0.base, 8 + ~#s_can_fail_allocator_static~0.offset, 8);call write~init~$Pointer$(#funAddr~s_can_fail_realloc_allocator.base, #funAddr~s_can_fail_realloc_allocator.offset, ~#s_can_fail_allocator_static~0.base, 16 + ~#s_can_fail_allocator_static~0.offset, 8);call write~init~$Pointer$(#funAddr~s_can_fail_calloc_allocator.base, #funAddr~s_can_fail_calloc_allocator.offset, ~#s_can_fail_allocator_static~0.base, 24 + ~#s_can_fail_allocator_static~0.offset, 8);call write~init~$Pointer$(0, 0, ~#s_can_fail_allocator_static~0.base, 32 + ~#s_can_fail_allocator_static~0.offset, 8);~tl_last_error~0 := 0; {460#true} is VALID [2022-02-20 21:09:51,155 INFO L290 TraceCheckUtils]: 1: Hoare triple {460#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;assume { :begin_inline_aws_linked_list_insert_after_harness } true;havoc aws_linked_list_insert_after_harness_#t~ret674#1, aws_linked_list_insert_after_harness_#t~ret675#1, aws_linked_list_insert_after_harness_#t~ret676#1, aws_linked_list_insert_after_harness_#t~ret677#1, aws_linked_list_insert_after_harness_#t~mem678#1.base, aws_linked_list_insert_after_harness_#t~mem678#1.offset, aws_linked_list_insert_after_harness_#t~mem679#1.base, aws_linked_list_insert_after_harness_#t~mem679#1.offset, aws_linked_list_insert_after_harness_~#after~0#1.base, aws_linked_list_insert_after_harness_~#after~0#1.offset, aws_linked_list_insert_after_harness_~#after_next~0#1.base, aws_linked_list_insert_after_harness_~#after_next~0#1.offset, aws_linked_list_insert_after_harness_~#to_add~0#1.base, aws_linked_list_insert_after_harness_~#to_add~0#1.offset;call aws_linked_list_insert_after_harness_~#after~0#1.base, aws_linked_list_insert_after_harness_~#after~0#1.offset := #Ultimate.allocOnStack(16);call aws_linked_list_insert_after_harness_~#after_next~0#1.base, aws_linked_list_insert_after_harness_~#after_next~0#1.offset := #Ultimate.allocOnStack(16);call aws_linked_list_insert_after_harness_~#to_add~0#1.base, aws_linked_list_insert_after_harness_~#to_add~0#1.offset := #Ultimate.allocOnStack(16);call write~$Pointer$(aws_linked_list_insert_after_harness_~#after_next~0#1.base, aws_linked_list_insert_after_harness_~#after_next~0#1.offset, aws_linked_list_insert_after_harness_~#after~0#1.base, aws_linked_list_insert_after_harness_~#after~0#1.offset, 8);call write~$Pointer$(aws_linked_list_insert_after_harness_~#after~0#1.base, aws_linked_list_insert_after_harness_~#after~0#1.offset, aws_linked_list_insert_after_harness_~#after_next~0#1.base, 8 + aws_linked_list_insert_after_harness_~#after_next~0#1.offset, 8);assume { :begin_inline_aws_linked_list_insert_after } true;aws_linked_list_insert_after_#in~after#1.base, aws_linked_list_insert_after_#in~after#1.offset, aws_linked_list_insert_after_#in~to_add#1.base, aws_linked_list_insert_after_#in~to_add#1.offset := aws_linked_list_insert_after_harness_~#after~0#1.base, aws_linked_list_insert_after_harness_~#after~0#1.offset, aws_linked_list_insert_after_harness_~#to_add~0#1.base, aws_linked_list_insert_after_harness_~#to_add~0#1.offset;havoc aws_linked_list_insert_after_#t~ret339#1, aws_linked_list_insert_after_#t~mem340#1.base, aws_linked_list_insert_after_#t~mem340#1.offset, aws_linked_list_insert_after_#t~mem341#1.base, aws_linked_list_insert_after_#t~mem341#1.offset, aws_linked_list_insert_after_#t~ret342#1, aws_linked_list_insert_after_#t~ret343#1, aws_linked_list_insert_after_#t~ret344#1, aws_linked_list_insert_after_#t~mem345#1.base, aws_linked_list_insert_after_#t~mem345#1.offset, aws_linked_list_insert_after_~after#1.base, aws_linked_list_insert_after_~after#1.offset, aws_linked_list_insert_after_~to_add#1.base, aws_linked_list_insert_after_~to_add#1.offset;aws_linked_list_insert_after_~after#1.base, aws_linked_list_insert_after_~after#1.offset := aws_linked_list_insert_after_#in~after#1.base, aws_linked_list_insert_after_#in~after#1.offset;aws_linked_list_insert_after_~to_add#1.base, aws_linked_list_insert_after_~to_add#1.offset := aws_linked_list_insert_after_#in~to_add#1.base, aws_linked_list_insert_after_#in~to_add#1.offset; {462#(and (= |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base|) |ULTIMATE.start_aws_linked_list_insert_after_~after#1.offset|) |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base|)) (not (= |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base| |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base|)))} is VALID [2022-02-20 21:09:51,155 INFO L272 TraceCheckUtils]: 2: Hoare triple {462#(and (= |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base|) |ULTIMATE.start_aws_linked_list_insert_after_~after#1.offset|) |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base|)) (not (= |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base| |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base|)))} call aws_linked_list_insert_after_#t~ret339#1 := aws_linked_list_node_next_is_valid(aws_linked_list_insert_after_~after#1.base, aws_linked_list_insert_after_~after#1.offset); {460#true} is VALID [2022-02-20 21:09:51,156 INFO L290 TraceCheckUtils]: 3: Hoare triple {460#true} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short304 := ~node.base != 0 || ~node.offset != 0; {460#true} is VALID [2022-02-20 21:09:51,156 INFO L290 TraceCheckUtils]: 4: Hoare triple {460#true} assume #t~short304;call #t~mem303.base, #t~mem303.offset := read~$Pointer$(~node.base, ~node.offset, 8);#t~short304 := #t~mem303.base != 0 || #t~mem303.offset != 0; {460#true} is VALID [2022-02-20 21:09:51,156 INFO L290 TraceCheckUtils]: 5: Hoare triple {460#true} #t~short307 := #t~short304; {460#true} is VALID [2022-02-20 21:09:51,156 INFO L290 TraceCheckUtils]: 6: Hoare triple {460#true} assume #t~short307;call #t~mem305.base, #t~mem305.offset := read~$Pointer$(~node.base, ~node.offset, 8);call #t~mem306.base, #t~mem306.offset := read~$Pointer$(#t~mem305.base, 8 + #t~mem305.offset, 8);#t~short307 := #t~mem306.base == ~node.base && #t~mem306.offset == ~node.offset; {460#true} is VALID [2022-02-20 21:09:51,157 INFO L290 TraceCheckUtils]: 7: Hoare triple {460#true} #res := (if 0 == (if #t~short307 then 1 else 0) then 0 else 1);havoc #t~mem303.base, #t~mem303.offset;havoc #t~short304;havoc #t~mem305.base, #t~mem305.offset;havoc #t~mem306.base, #t~mem306.offset;havoc #t~short307; {460#true} is VALID [2022-02-20 21:09:51,157 INFO L290 TraceCheckUtils]: 8: Hoare triple {460#true} assume true; {460#true} is VALID [2022-02-20 21:09:51,158 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {460#true} {462#(and (= |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base|) |ULTIMATE.start_aws_linked_list_insert_after_~after#1.offset|) |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base|)) (not (= |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base| |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base|)))} #93#return; {462#(and (= |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base|) |ULTIMATE.start_aws_linked_list_insert_after_~after#1.offset|) |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base|)) (not (= |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base| |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base|)))} is VALID [2022-02-20 21:09:51,158 INFO L272 TraceCheckUtils]: 10: Hoare triple {462#(and (= |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base|) |ULTIMATE.start_aws_linked_list_insert_after_~after#1.offset|) |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base|)) (not (= |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base| |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base|)))} call assume_abort_if_not(aws_linked_list_insert_after_#t~ret339#1); {460#true} is VALID [2022-02-20 21:09:51,158 INFO L290 TraceCheckUtils]: 11: Hoare triple {460#true} ~cond := #in~cond; {460#true} is VALID [2022-02-20 21:09:51,158 INFO L290 TraceCheckUtils]: 12: Hoare triple {460#true} assume !(0 == ~cond % 256); {460#true} is VALID [2022-02-20 21:09:51,159 INFO L290 TraceCheckUtils]: 13: Hoare triple {460#true} assume true; {460#true} is VALID [2022-02-20 21:09:51,159 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {460#true} {462#(and (= |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base|) |ULTIMATE.start_aws_linked_list_insert_after_~after#1.offset|) |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base|)) (not (= |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base| |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base|)))} #95#return; {462#(and (= |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base|) |ULTIMATE.start_aws_linked_list_insert_after_~after#1.offset|) |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base|)) (not (= |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base| |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base|)))} is VALID [2022-02-20 21:09:51,160 INFO L290 TraceCheckUtils]: 15: Hoare triple {462#(and (= |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base|) |ULTIMATE.start_aws_linked_list_insert_after_~after#1.offset|) |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base|)) (not (= |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base| |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base|)))} havoc aws_linked_list_insert_after_#t~ret339#1; {462#(and (= |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base|) |ULTIMATE.start_aws_linked_list_insert_after_~after#1.offset|) |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base|)) (not (= |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base| |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base|)))} is VALID [2022-02-20 21:09:51,160 INFO L272 TraceCheckUtils]: 16: Hoare triple {462#(and (= |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base|) |ULTIMATE.start_aws_linked_list_insert_after_~after#1.offset|) |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base|)) (not (= |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base| |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base|)))} call assume_abort_if_not((if 0 == (if aws_linked_list_insert_after_~to_add#1.base != 0 || aws_linked_list_insert_after_~to_add#1.offset != 0 then 1 else 0) then 0 else 1)); {460#true} is VALID [2022-02-20 21:09:51,160 INFO L290 TraceCheckUtils]: 17: Hoare triple {460#true} ~cond := #in~cond; {460#true} is VALID [2022-02-20 21:09:51,161 INFO L290 TraceCheckUtils]: 18: Hoare triple {460#true} assume !(0 == ~cond % 256); {460#true} is VALID [2022-02-20 21:09:51,161 INFO L290 TraceCheckUtils]: 19: Hoare triple {460#true} assume true; {460#true} is VALID [2022-02-20 21:09:51,161 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {460#true} {462#(and (= |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base|) |ULTIMATE.start_aws_linked_list_insert_after_~after#1.offset|) |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base|)) (not (= |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base| |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base|)))} #97#return; {462#(and (= |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base|) |ULTIMATE.start_aws_linked_list_insert_after_~after#1.offset|) |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base|)) (not (= |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base| |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base|)))} is VALID [2022-02-20 21:09:51,163 INFO L290 TraceCheckUtils]: 21: Hoare triple {462#(and (= |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base|) |ULTIMATE.start_aws_linked_list_insert_after_~after#1.offset|) |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base|)) (not (= |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base| |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base|)))} call write~$Pointer$(aws_linked_list_insert_after_~after#1.base, aws_linked_list_insert_after_~after#1.offset, aws_linked_list_insert_after_~to_add#1.base, 8 + aws_linked_list_insert_after_~to_add#1.offset, 8);call aws_linked_list_insert_after_#t~mem340#1.base, aws_linked_list_insert_after_#t~mem340#1.offset := read~$Pointer$(aws_linked_list_insert_after_~after#1.base, aws_linked_list_insert_after_~after#1.offset, 8);call write~$Pointer$(aws_linked_list_insert_after_#t~mem340#1.base, aws_linked_list_insert_after_#t~mem340#1.offset, aws_linked_list_insert_after_~to_add#1.base, aws_linked_list_insert_after_~to_add#1.offset, 8);havoc aws_linked_list_insert_after_#t~mem340#1.base, aws_linked_list_insert_after_#t~mem340#1.offset;call aws_linked_list_insert_after_#t~mem341#1.base, aws_linked_list_insert_after_#t~mem341#1.offset := read~$Pointer$(aws_linked_list_insert_after_~after#1.base, aws_linked_list_insert_after_~after#1.offset, 8);call write~$Pointer$(aws_linked_list_insert_after_~to_add#1.base, aws_linked_list_insert_after_~to_add#1.offset, aws_linked_list_insert_after_#t~mem341#1.base, 8 + aws_linked_list_insert_after_#t~mem341#1.offset, 8);havoc aws_linked_list_insert_after_#t~mem341#1.base, aws_linked_list_insert_after_#t~mem341#1.offset;call write~$Pointer$(aws_linked_list_insert_after_~to_add#1.base, aws_linked_list_insert_after_~to_add#1.offset, aws_linked_list_insert_after_~after#1.base, aws_linked_list_insert_after_~after#1.offset, 8); {478#(and (= |ULTIMATE.start_aws_linked_list_insert_after_~after#1.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base|) |ULTIMATE.start_aws_linked_list_insert_after_~after#1.offset|)) 8)) (= |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base|) |ULTIMATE.start_aws_linked_list_insert_after_~after#1.offset|)) 8)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base|) |ULTIMATE.start_aws_linked_list_insert_after_~after#1.offset|) 0))} is VALID [2022-02-20 21:09:51,164 INFO L272 TraceCheckUtils]: 22: Hoare triple {478#(and (= |ULTIMATE.start_aws_linked_list_insert_after_~after#1.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base|) |ULTIMATE.start_aws_linked_list_insert_after_~after#1.offset|)) 8)) (= |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base|) |ULTIMATE.start_aws_linked_list_insert_after_~after#1.offset|)) 8)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base|) |ULTIMATE.start_aws_linked_list_insert_after_~after#1.offset|) 0))} call aws_linked_list_insert_after_#t~ret342#1 := aws_linked_list_node_next_is_valid(aws_linked_list_insert_after_~after#1.base, aws_linked_list_insert_after_~after#1.offset); {460#true} is VALID [2022-02-20 21:09:51,164 INFO L290 TraceCheckUtils]: 23: Hoare triple {460#true} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short304 := ~node.base != 0 || ~node.offset != 0; {489#(and (= aws_linked_list_node_next_is_valid_~node.base |aws_linked_list_node_next_is_valid_#in~node.base|) (= aws_linked_list_node_next_is_valid_~node.offset |aws_linked_list_node_next_is_valid_#in~node.offset|))} is VALID [2022-02-20 21:09:51,165 INFO L290 TraceCheckUtils]: 24: Hoare triple {489#(and (= aws_linked_list_node_next_is_valid_~node.base |aws_linked_list_node_next_is_valid_#in~node.base|) (= aws_linked_list_node_next_is_valid_~node.offset |aws_linked_list_node_next_is_valid_#in~node.offset|))} assume #t~short304;call #t~mem303.base, #t~mem303.offset := read~$Pointer$(~node.base, ~node.offset, 8);#t~short304 := #t~mem303.base != 0 || #t~mem303.offset != 0; {489#(and (= aws_linked_list_node_next_is_valid_~node.base |aws_linked_list_node_next_is_valid_#in~node.base|) (= aws_linked_list_node_next_is_valid_~node.offset |aws_linked_list_node_next_is_valid_#in~node.offset|))} is VALID [2022-02-20 21:09:51,165 INFO L290 TraceCheckUtils]: 25: Hoare triple {489#(and (= aws_linked_list_node_next_is_valid_~node.base |aws_linked_list_node_next_is_valid_#in~node.base|) (= aws_linked_list_node_next_is_valid_~node.offset |aws_linked_list_node_next_is_valid_#in~node.offset|))} #t~short307 := #t~short304; {489#(and (= aws_linked_list_node_next_is_valid_~node.base |aws_linked_list_node_next_is_valid_#in~node.base|) (= aws_linked_list_node_next_is_valid_~node.offset |aws_linked_list_node_next_is_valid_#in~node.offset|))} is VALID [2022-02-20 21:09:51,166 INFO L290 TraceCheckUtils]: 26: Hoare triple {489#(and (= aws_linked_list_node_next_is_valid_~node.base |aws_linked_list_node_next_is_valid_#in~node.base|) (= aws_linked_list_node_next_is_valid_~node.offset |aws_linked_list_node_next_is_valid_#in~node.offset|))} assume #t~short307;call #t~mem305.base, #t~mem305.offset := read~$Pointer$(~node.base, ~node.offset, 8);call #t~mem306.base, #t~mem306.offset := read~$Pointer$(#t~mem305.base, 8 + #t~mem305.offset, 8);#t~short307 := #t~mem306.base == ~node.base && #t~mem306.offset == ~node.offset; {490#(or (not (= (select (select |#memory_$Pointer$.offset| |aws_linked_list_node_next_is_valid_#in~node.base|) |aws_linked_list_node_next_is_valid_#in~node.offset|) 0)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |aws_linked_list_node_next_is_valid_#in~node.base|) |aws_linked_list_node_next_is_valid_#in~node.offset|)) 8) |aws_linked_list_node_next_is_valid_#in~node.base|)) (not (= |aws_linked_list_node_next_is_valid_#in~node.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |aws_linked_list_node_next_is_valid_#in~node.base|) |aws_linked_list_node_next_is_valid_#in~node.offset|)) 8))) |aws_linked_list_node_next_is_valid_#t~short307|)} is VALID [2022-02-20 21:09:51,167 INFO L290 TraceCheckUtils]: 27: Hoare triple {490#(or (not (= (select (select |#memory_$Pointer$.offset| |aws_linked_list_node_next_is_valid_#in~node.base|) |aws_linked_list_node_next_is_valid_#in~node.offset|) 0)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |aws_linked_list_node_next_is_valid_#in~node.base|) |aws_linked_list_node_next_is_valid_#in~node.offset|)) 8) |aws_linked_list_node_next_is_valid_#in~node.base|)) (not (= |aws_linked_list_node_next_is_valid_#in~node.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |aws_linked_list_node_next_is_valid_#in~node.base|) |aws_linked_list_node_next_is_valid_#in~node.offset|)) 8))) |aws_linked_list_node_next_is_valid_#t~short307|)} #res := (if 0 == (if #t~short307 then 1 else 0) then 0 else 1);havoc #t~mem303.base, #t~mem303.offset;havoc #t~short304;havoc #t~mem305.base, #t~mem305.offset;havoc #t~mem306.base, #t~mem306.offset;havoc #t~short307; {491#(or (and (<= |aws_linked_list_node_next_is_valid_#res| 1) (<= 1 |aws_linked_list_node_next_is_valid_#res|)) (not (= (select (select |#memory_$Pointer$.offset| |aws_linked_list_node_next_is_valid_#in~node.base|) |aws_linked_list_node_next_is_valid_#in~node.offset|) 0)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |aws_linked_list_node_next_is_valid_#in~node.base|) |aws_linked_list_node_next_is_valid_#in~node.offset|)) 8) |aws_linked_list_node_next_is_valid_#in~node.base|)) (not (= |aws_linked_list_node_next_is_valid_#in~node.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |aws_linked_list_node_next_is_valid_#in~node.base|) |aws_linked_list_node_next_is_valid_#in~node.offset|)) 8))))} is VALID [2022-02-20 21:09:51,167 INFO L290 TraceCheckUtils]: 28: Hoare triple {491#(or (and (<= |aws_linked_list_node_next_is_valid_#res| 1) (<= 1 |aws_linked_list_node_next_is_valid_#res|)) (not (= (select (select |#memory_$Pointer$.offset| |aws_linked_list_node_next_is_valid_#in~node.base|) |aws_linked_list_node_next_is_valid_#in~node.offset|) 0)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |aws_linked_list_node_next_is_valid_#in~node.base|) |aws_linked_list_node_next_is_valid_#in~node.offset|)) 8) |aws_linked_list_node_next_is_valid_#in~node.base|)) (not (= |aws_linked_list_node_next_is_valid_#in~node.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |aws_linked_list_node_next_is_valid_#in~node.base|) |aws_linked_list_node_next_is_valid_#in~node.offset|)) 8))))} assume true; {491#(or (and (<= |aws_linked_list_node_next_is_valid_#res| 1) (<= 1 |aws_linked_list_node_next_is_valid_#res|)) (not (= (select (select |#memory_$Pointer$.offset| |aws_linked_list_node_next_is_valid_#in~node.base|) |aws_linked_list_node_next_is_valid_#in~node.offset|) 0)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |aws_linked_list_node_next_is_valid_#in~node.base|) |aws_linked_list_node_next_is_valid_#in~node.offset|)) 8) |aws_linked_list_node_next_is_valid_#in~node.base|)) (not (= |aws_linked_list_node_next_is_valid_#in~node.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |aws_linked_list_node_next_is_valid_#in~node.base|) |aws_linked_list_node_next_is_valid_#in~node.offset|)) 8))))} is VALID [2022-02-20 21:09:51,169 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {491#(or (and (<= |aws_linked_list_node_next_is_valid_#res| 1) (<= 1 |aws_linked_list_node_next_is_valid_#res|)) (not (= (select (select |#memory_$Pointer$.offset| |aws_linked_list_node_next_is_valid_#in~node.base|) |aws_linked_list_node_next_is_valid_#in~node.offset|) 0)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |aws_linked_list_node_next_is_valid_#in~node.base|) |aws_linked_list_node_next_is_valid_#in~node.offset|)) 8) |aws_linked_list_node_next_is_valid_#in~node.base|)) (not (= |aws_linked_list_node_next_is_valid_#in~node.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |aws_linked_list_node_next_is_valid_#in~node.base|) |aws_linked_list_node_next_is_valid_#in~node.offset|)) 8))))} {478#(and (= |ULTIMATE.start_aws_linked_list_insert_after_~after#1.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base|) |ULTIMATE.start_aws_linked_list_insert_after_~after#1.offset|)) 8)) (= |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base|) |ULTIMATE.start_aws_linked_list_insert_after_~after#1.offset|)) 8)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base|) |ULTIMATE.start_aws_linked_list_insert_after_~after#1.offset|) 0))} #99#return; {486#(and (<= 1 |ULTIMATE.start_aws_linked_list_insert_after_#t~ret342#1|) (<= |ULTIMATE.start_aws_linked_list_insert_after_#t~ret342#1| 1))} is VALID [2022-02-20 21:09:51,169 INFO L272 TraceCheckUtils]: 30: Hoare triple {486#(and (<= 1 |ULTIMATE.start_aws_linked_list_insert_after_#t~ret342#1|) (<= |ULTIMATE.start_aws_linked_list_insert_after_#t~ret342#1| 1))} call __VERIFIER_assert(aws_linked_list_insert_after_#t~ret342#1); {487#(and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1))} is VALID [2022-02-20 21:09:51,170 INFO L290 TraceCheckUtils]: 31: Hoare triple {487#(and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1))} ~cond := #in~cond; {488#(and (<= (div __VERIFIER_assert_~cond 256) 0) (<= 1 __VERIFIER_assert_~cond))} is VALID [2022-02-20 21:09:51,170 INFO L290 TraceCheckUtils]: 32: Hoare triple {488#(and (<= (div __VERIFIER_assert_~cond 256) 0) (<= 1 __VERIFIER_assert_~cond))} assume 0 == ~cond % 256; {461#false} is VALID [2022-02-20 21:09:51,170 INFO L290 TraceCheckUtils]: 33: Hoare triple {461#false} assume !false; {461#false} is VALID [2022-02-20 21:09:51,171 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-20 21:09:51,171 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:09:51,171 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406242792] [2022-02-20 21:09:51,171 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406242792] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:09:51,172 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:09:51,172 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-20 21:09:51,172 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343530064] [2022-02-20 21:09:51,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:09:51,173 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 34 [2022-02-20 21:09:51,173 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:09:51,174 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 21:09:51,200 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:09:51,200 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 21:09:51,200 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:09:51,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 21:09:51,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-02-20 21:09:51,201 INFO L87 Difference]: Start difference. First operand 58 states and 77 transitions. Second operand has 10 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 21:09:52,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:09:52,364 INFO L93 Difference]: Finished difference Result 69 states and 92 transitions. [2022-02-20 21:09:52,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 21:09:52,365 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 34 [2022-02-20 21:09:52,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:09:52,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 21:09:52,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 92 transitions. [2022-02-20 21:09:52,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 21:09:52,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 92 transitions. [2022-02-20 21:09:52,370 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 92 transitions. [2022-02-20 21:09:52,462 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:09:52,464 INFO L225 Difference]: With dead ends: 69 [2022-02-20 21:09:52,464 INFO L226 Difference]: Without dead ends: 67 [2022-02-20 21:09:52,465 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2022-02-20 21:09:52,465 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 23 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 21:09:52,466 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 380 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 21:09:52,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-02-20 21:09:52,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2022-02-20 21:09:52,474 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:09:52,474 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand has 66 states, 38 states have (on average 1.131578947368421) internal successors, (43), 40 states have internal predecessors, (43), 21 states have call successors, (21), 5 states have call predecessors, (21), 6 states have return successors, (25), 20 states have call predecessors, (25), 20 states have call successors, (25) [2022-02-20 21:09:52,475 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand has 66 states, 38 states have (on average 1.131578947368421) internal successors, (43), 40 states have internal predecessors, (43), 21 states have call successors, (21), 5 states have call predecessors, (21), 6 states have return successors, (25), 20 states have call predecessors, (25), 20 states have call successors, (25) [2022-02-20 21:09:52,475 INFO L87 Difference]: Start difference. First operand 67 states. Second operand has 66 states, 38 states have (on average 1.131578947368421) internal successors, (43), 40 states have internal predecessors, (43), 21 states have call successors, (21), 5 states have call predecessors, (21), 6 states have return successors, (25), 20 states have call predecessors, (25), 20 states have call successors, (25) [2022-02-20 21:09:52,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:09:52,480 INFO L93 Difference]: Finished difference Result 67 states and 90 transitions. [2022-02-20 21:09:52,480 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 90 transitions. [2022-02-20 21:09:52,483 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:09:52,483 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:09:52,484 INFO L74 IsIncluded]: Start isIncluded. First operand has 66 states, 38 states have (on average 1.131578947368421) internal successors, (43), 40 states have internal predecessors, (43), 21 states have call successors, (21), 5 states have call predecessors, (21), 6 states have return successors, (25), 20 states have call predecessors, (25), 20 states have call successors, (25) Second operand 67 states. [2022-02-20 21:09:52,485 INFO L87 Difference]: Start difference. First operand has 66 states, 38 states have (on average 1.131578947368421) internal successors, (43), 40 states have internal predecessors, (43), 21 states have call successors, (21), 5 states have call predecessors, (21), 6 states have return successors, (25), 20 states have call predecessors, (25), 20 states have call successors, (25) Second operand 67 states. [2022-02-20 21:09:52,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:09:52,489 INFO L93 Difference]: Finished difference Result 67 states and 90 transitions. [2022-02-20 21:09:52,489 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 90 transitions. [2022-02-20 21:09:52,489 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:09:52,490 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:09:52,490 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:09:52,490 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:09:52,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 38 states have (on average 1.131578947368421) internal successors, (43), 40 states have internal predecessors, (43), 21 states have call successors, (21), 5 states have call predecessors, (21), 6 states have return successors, (25), 20 states have call predecessors, (25), 20 states have call successors, (25) [2022-02-20 21:09:52,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 89 transitions. [2022-02-20 21:09:52,495 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 89 transitions. Word has length 34 [2022-02-20 21:09:52,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:09:52,495 INFO L470 AbstractCegarLoop]: Abstraction has 66 states and 89 transitions. [2022-02-20 21:09:52,495 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 21:09:52,495 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 89 transitions. [2022-02-20 21:09:52,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-02-20 21:09:52,496 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:09:52,496 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 21:09:52,497 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 21:09:52,497 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:09:52,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:09:52,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1736582186, now seen corresponding path program 1 times [2022-02-20 21:09:52,497 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:09:52,498 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101305232] [2022-02-20 21:09:52,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:09:52,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:09:52,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:09:52,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 21:09:52,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:09:52,630 INFO L290 TraceCheckUtils]: 0: Hoare triple {825#true} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short304 := ~node.base != 0 || ~node.offset != 0; {825#true} is VALID [2022-02-20 21:09:52,630 INFO L290 TraceCheckUtils]: 1: Hoare triple {825#true} assume #t~short304;call #t~mem303.base, #t~mem303.offset := read~$Pointer$(~node.base, ~node.offset, 8);#t~short304 := #t~mem303.base != 0 || #t~mem303.offset != 0; {825#true} is VALID [2022-02-20 21:09:52,631 INFO L290 TraceCheckUtils]: 2: Hoare triple {825#true} #t~short307 := #t~short304; {825#true} is VALID [2022-02-20 21:09:52,631 INFO L290 TraceCheckUtils]: 3: Hoare triple {825#true} assume #t~short307;call #t~mem305.base, #t~mem305.offset := read~$Pointer$(~node.base, ~node.offset, 8);call #t~mem306.base, #t~mem306.offset := read~$Pointer$(#t~mem305.base, 8 + #t~mem305.offset, 8);#t~short307 := #t~mem306.base == ~node.base && #t~mem306.offset == ~node.offset; {825#true} is VALID [2022-02-20 21:09:52,631 INFO L290 TraceCheckUtils]: 4: Hoare triple {825#true} #res := (if 0 == (if #t~short307 then 1 else 0) then 0 else 1);havoc #t~mem303.base, #t~mem303.offset;havoc #t~short304;havoc #t~mem305.base, #t~mem305.offset;havoc #t~mem306.base, #t~mem306.offset;havoc #t~short307; {825#true} is VALID [2022-02-20 21:09:52,631 INFO L290 TraceCheckUtils]: 5: Hoare triple {825#true} assume true; {825#true} is VALID [2022-02-20 21:09:52,634 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {825#true} {827#(not (= |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base| 0))} #93#return; {827#(not (= |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base| 0))} is VALID [2022-02-20 21:09:52,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 21:09:52,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:09:52,642 INFO L290 TraceCheckUtils]: 0: Hoare triple {825#true} ~cond := #in~cond; {825#true} is VALID [2022-02-20 21:09:52,642 INFO L290 TraceCheckUtils]: 1: Hoare triple {825#true} assume !(0 == ~cond % 256); {825#true} is VALID [2022-02-20 21:09:52,643 INFO L290 TraceCheckUtils]: 2: Hoare triple {825#true} assume true; {825#true} is VALID [2022-02-20 21:09:52,643 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {825#true} {827#(not (= |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base| 0))} #95#return; {827#(not (= |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base| 0))} is VALID [2022-02-20 21:09:52,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-02-20 21:09:52,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:09:52,652 INFO L290 TraceCheckUtils]: 0: Hoare triple {825#true} ~cond := #in~cond; {825#true} is VALID [2022-02-20 21:09:52,652 INFO L290 TraceCheckUtils]: 1: Hoare triple {825#true} assume !(0 == ~cond % 256); {825#true} is VALID [2022-02-20 21:09:52,652 INFO L290 TraceCheckUtils]: 2: Hoare triple {825#true} assume true; {825#true} is VALID [2022-02-20 21:09:52,653 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {825#true} {827#(not (= |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base| 0))} #97#return; {827#(not (= |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base| 0))} is VALID [2022-02-20 21:09:52,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-02-20 21:09:52,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:09:52,725 INFO L290 TraceCheckUtils]: 0: Hoare triple {825#true} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short304 := ~node.base != 0 || ~node.offset != 0; {851#(and (= aws_linked_list_node_next_is_valid_~node.base |aws_linked_list_node_next_is_valid_#in~node.base|) (= aws_linked_list_node_next_is_valid_~node.offset |aws_linked_list_node_next_is_valid_#in~node.offset|))} is VALID [2022-02-20 21:09:52,726 INFO L290 TraceCheckUtils]: 1: Hoare triple {851#(and (= aws_linked_list_node_next_is_valid_~node.base |aws_linked_list_node_next_is_valid_#in~node.base|) (= aws_linked_list_node_next_is_valid_~node.offset |aws_linked_list_node_next_is_valid_#in~node.offset|))} assume #t~short304;call #t~mem303.base, #t~mem303.offset := read~$Pointer$(~node.base, ~node.offset, 8);#t~short304 := #t~mem303.base != 0 || #t~mem303.offset != 0; {852#(or (= (select (select |#memory_$Pointer$.base| |aws_linked_list_node_next_is_valid_#in~node.base|) |aws_linked_list_node_next_is_valid_#in~node.offset|) 0) |aws_linked_list_node_next_is_valid_#t~short304|)} is VALID [2022-02-20 21:09:52,726 INFO L290 TraceCheckUtils]: 2: Hoare triple {852#(or (= (select (select |#memory_$Pointer$.base| |aws_linked_list_node_next_is_valid_#in~node.base|) |aws_linked_list_node_next_is_valid_#in~node.offset|) 0) |aws_linked_list_node_next_is_valid_#t~short304|)} #t~short307 := #t~short304; {853#(or (= (select (select |#memory_$Pointer$.base| |aws_linked_list_node_next_is_valid_#in~node.base|) |aws_linked_list_node_next_is_valid_#in~node.offset|) 0) |aws_linked_list_node_next_is_valid_#t~short307|)} is VALID [2022-02-20 21:09:52,726 INFO L290 TraceCheckUtils]: 3: Hoare triple {853#(or (= (select (select |#memory_$Pointer$.base| |aws_linked_list_node_next_is_valid_#in~node.base|) |aws_linked_list_node_next_is_valid_#in~node.offset|) 0) |aws_linked_list_node_next_is_valid_#t~short307|)} assume !#t~short307; {854#(= (select (select |#memory_$Pointer$.base| |aws_linked_list_node_next_is_valid_#in~node.base|) |aws_linked_list_node_next_is_valid_#in~node.offset|) 0)} is VALID [2022-02-20 21:09:52,727 INFO L290 TraceCheckUtils]: 4: Hoare triple {854#(= (select (select |#memory_$Pointer$.base| |aws_linked_list_node_next_is_valid_#in~node.base|) |aws_linked_list_node_next_is_valid_#in~node.offset|) 0)} #res := (if 0 == (if #t~short307 then 1 else 0) then 0 else 1);havoc #t~mem303.base, #t~mem303.offset;havoc #t~short304;havoc #t~mem305.base, #t~mem305.offset;havoc #t~mem306.base, #t~mem306.offset;havoc #t~short307; {854#(= (select (select |#memory_$Pointer$.base| |aws_linked_list_node_next_is_valid_#in~node.base|) |aws_linked_list_node_next_is_valid_#in~node.offset|) 0)} is VALID [2022-02-20 21:09:52,727 INFO L290 TraceCheckUtils]: 5: Hoare triple {854#(= (select (select |#memory_$Pointer$.base| |aws_linked_list_node_next_is_valid_#in~node.base|) |aws_linked_list_node_next_is_valid_#in~node.offset|) 0)} assume true; {854#(= (select (select |#memory_$Pointer$.base| |aws_linked_list_node_next_is_valid_#in~node.base|) |aws_linked_list_node_next_is_valid_#in~node.offset|) 0)} is VALID [2022-02-20 21:09:52,728 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {854#(= (select (select |#memory_$Pointer$.base| |aws_linked_list_node_next_is_valid_#in~node.base|) |aws_linked_list_node_next_is_valid_#in~node.offset|) 0)} {843#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base|) |ULTIMATE.start_aws_linked_list_insert_after_~after#1.offset|) 0))} #99#return; {826#false} is VALID [2022-02-20 21:09:52,728 INFO L290 TraceCheckUtils]: 0: Hoare triple {825#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(39, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(78, 4);~#s_can_fail_allocator_static~0.base, ~#s_can_fail_allocator_static~0.offset := 5, 0;call #Ultimate.allocInit(40, 5);call write~init~$Pointer$(#funAddr~s_can_fail_malloc_allocator.base, #funAddr~s_can_fail_malloc_allocator.offset, ~#s_can_fail_allocator_static~0.base, ~#s_can_fail_allocator_static~0.offset, 8);call write~init~$Pointer$(#funAddr~s_can_fail_free_allocator.base, #funAddr~s_can_fail_free_allocator.offset, ~#s_can_fail_allocator_static~0.base, 8 + ~#s_can_fail_allocator_static~0.offset, 8);call write~init~$Pointer$(#funAddr~s_can_fail_realloc_allocator.base, #funAddr~s_can_fail_realloc_allocator.offset, ~#s_can_fail_allocator_static~0.base, 16 + ~#s_can_fail_allocator_static~0.offset, 8);call write~init~$Pointer$(#funAddr~s_can_fail_calloc_allocator.base, #funAddr~s_can_fail_calloc_allocator.offset, ~#s_can_fail_allocator_static~0.base, 24 + ~#s_can_fail_allocator_static~0.offset, 8);call write~init~$Pointer$(0, 0, ~#s_can_fail_allocator_static~0.base, 32 + ~#s_can_fail_allocator_static~0.offset, 8);~tl_last_error~0 := 0; {825#true} is VALID [2022-02-20 21:09:52,729 INFO L290 TraceCheckUtils]: 1: Hoare triple {825#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;assume { :begin_inline_aws_linked_list_insert_after_harness } true;havoc aws_linked_list_insert_after_harness_#t~ret674#1, aws_linked_list_insert_after_harness_#t~ret675#1, aws_linked_list_insert_after_harness_#t~ret676#1, aws_linked_list_insert_after_harness_#t~ret677#1, aws_linked_list_insert_after_harness_#t~mem678#1.base, aws_linked_list_insert_after_harness_#t~mem678#1.offset, aws_linked_list_insert_after_harness_#t~mem679#1.base, aws_linked_list_insert_after_harness_#t~mem679#1.offset, aws_linked_list_insert_after_harness_~#after~0#1.base, aws_linked_list_insert_after_harness_~#after~0#1.offset, aws_linked_list_insert_after_harness_~#after_next~0#1.base, aws_linked_list_insert_after_harness_~#after_next~0#1.offset, aws_linked_list_insert_after_harness_~#to_add~0#1.base, aws_linked_list_insert_after_harness_~#to_add~0#1.offset;call aws_linked_list_insert_after_harness_~#after~0#1.base, aws_linked_list_insert_after_harness_~#after~0#1.offset := #Ultimate.allocOnStack(16);call aws_linked_list_insert_after_harness_~#after_next~0#1.base, aws_linked_list_insert_after_harness_~#after_next~0#1.offset := #Ultimate.allocOnStack(16);call aws_linked_list_insert_after_harness_~#to_add~0#1.base, aws_linked_list_insert_after_harness_~#to_add~0#1.offset := #Ultimate.allocOnStack(16);call write~$Pointer$(aws_linked_list_insert_after_harness_~#after_next~0#1.base, aws_linked_list_insert_after_harness_~#after_next~0#1.offset, aws_linked_list_insert_after_harness_~#after~0#1.base, aws_linked_list_insert_after_harness_~#after~0#1.offset, 8);call write~$Pointer$(aws_linked_list_insert_after_harness_~#after~0#1.base, aws_linked_list_insert_after_harness_~#after~0#1.offset, aws_linked_list_insert_after_harness_~#after_next~0#1.base, 8 + aws_linked_list_insert_after_harness_~#after_next~0#1.offset, 8);assume { :begin_inline_aws_linked_list_insert_after } true;aws_linked_list_insert_after_#in~after#1.base, aws_linked_list_insert_after_#in~after#1.offset, aws_linked_list_insert_after_#in~to_add#1.base, aws_linked_list_insert_after_#in~to_add#1.offset := aws_linked_list_insert_after_harness_~#after~0#1.base, aws_linked_list_insert_after_harness_~#after~0#1.offset, aws_linked_list_insert_after_harness_~#to_add~0#1.base, aws_linked_list_insert_after_harness_~#to_add~0#1.offset;havoc aws_linked_list_insert_after_#t~ret339#1, aws_linked_list_insert_after_#t~mem340#1.base, aws_linked_list_insert_after_#t~mem340#1.offset, aws_linked_list_insert_after_#t~mem341#1.base, aws_linked_list_insert_after_#t~mem341#1.offset, aws_linked_list_insert_after_#t~ret342#1, aws_linked_list_insert_after_#t~ret343#1, aws_linked_list_insert_after_#t~ret344#1, aws_linked_list_insert_after_#t~mem345#1.base, aws_linked_list_insert_after_#t~mem345#1.offset, aws_linked_list_insert_after_~after#1.base, aws_linked_list_insert_after_~after#1.offset, aws_linked_list_insert_after_~to_add#1.base, aws_linked_list_insert_after_~to_add#1.offset;aws_linked_list_insert_after_~after#1.base, aws_linked_list_insert_after_~after#1.offset := aws_linked_list_insert_after_#in~after#1.base, aws_linked_list_insert_after_#in~after#1.offset;aws_linked_list_insert_after_~to_add#1.base, aws_linked_list_insert_after_~to_add#1.offset := aws_linked_list_insert_after_#in~to_add#1.base, aws_linked_list_insert_after_#in~to_add#1.offset; {827#(not (= |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base| 0))} is VALID [2022-02-20 21:09:52,730 INFO L272 TraceCheckUtils]: 2: Hoare triple {827#(not (= |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base| 0))} call aws_linked_list_insert_after_#t~ret339#1 := aws_linked_list_node_next_is_valid(aws_linked_list_insert_after_~after#1.base, aws_linked_list_insert_after_~after#1.offset); {825#true} is VALID [2022-02-20 21:09:52,730 INFO L290 TraceCheckUtils]: 3: Hoare triple {825#true} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short304 := ~node.base != 0 || ~node.offset != 0; {825#true} is VALID [2022-02-20 21:09:52,730 INFO L290 TraceCheckUtils]: 4: Hoare triple {825#true} assume #t~short304;call #t~mem303.base, #t~mem303.offset := read~$Pointer$(~node.base, ~node.offset, 8);#t~short304 := #t~mem303.base != 0 || #t~mem303.offset != 0; {825#true} is VALID [2022-02-20 21:09:52,730 INFO L290 TraceCheckUtils]: 5: Hoare triple {825#true} #t~short307 := #t~short304; {825#true} is VALID [2022-02-20 21:09:52,733 INFO L290 TraceCheckUtils]: 6: Hoare triple {825#true} assume #t~short307;call #t~mem305.base, #t~mem305.offset := read~$Pointer$(~node.base, ~node.offset, 8);call #t~mem306.base, #t~mem306.offset := read~$Pointer$(#t~mem305.base, 8 + #t~mem305.offset, 8);#t~short307 := #t~mem306.base == ~node.base && #t~mem306.offset == ~node.offset; {825#true} is VALID [2022-02-20 21:09:52,733 INFO L290 TraceCheckUtils]: 7: Hoare triple {825#true} #res := (if 0 == (if #t~short307 then 1 else 0) then 0 else 1);havoc #t~mem303.base, #t~mem303.offset;havoc #t~short304;havoc #t~mem305.base, #t~mem305.offset;havoc #t~mem306.base, #t~mem306.offset;havoc #t~short307; {825#true} is VALID [2022-02-20 21:09:52,733 INFO L290 TraceCheckUtils]: 8: Hoare triple {825#true} assume true; {825#true} is VALID [2022-02-20 21:09:52,734 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {825#true} {827#(not (= |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base| 0))} #93#return; {827#(not (= |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base| 0))} is VALID [2022-02-20 21:09:52,734 INFO L272 TraceCheckUtils]: 10: Hoare triple {827#(not (= |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base| 0))} call assume_abort_if_not(aws_linked_list_insert_after_#t~ret339#1); {825#true} is VALID [2022-02-20 21:09:52,734 INFO L290 TraceCheckUtils]: 11: Hoare triple {825#true} ~cond := #in~cond; {825#true} is VALID [2022-02-20 21:09:52,734 INFO L290 TraceCheckUtils]: 12: Hoare triple {825#true} assume !(0 == ~cond % 256); {825#true} is VALID [2022-02-20 21:09:52,734 INFO L290 TraceCheckUtils]: 13: Hoare triple {825#true} assume true; {825#true} is VALID [2022-02-20 21:09:52,735 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {825#true} {827#(not (= |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base| 0))} #95#return; {827#(not (= |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base| 0))} is VALID [2022-02-20 21:09:52,735 INFO L290 TraceCheckUtils]: 15: Hoare triple {827#(not (= |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base| 0))} havoc aws_linked_list_insert_after_#t~ret339#1; {827#(not (= |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base| 0))} is VALID [2022-02-20 21:09:52,735 INFO L272 TraceCheckUtils]: 16: Hoare triple {827#(not (= |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base| 0))} call assume_abort_if_not((if 0 == (if aws_linked_list_insert_after_~to_add#1.base != 0 || aws_linked_list_insert_after_~to_add#1.offset != 0 then 1 else 0) then 0 else 1)); {825#true} is VALID [2022-02-20 21:09:52,735 INFO L290 TraceCheckUtils]: 17: Hoare triple {825#true} ~cond := #in~cond; {825#true} is VALID [2022-02-20 21:09:52,735 INFO L290 TraceCheckUtils]: 18: Hoare triple {825#true} assume !(0 == ~cond % 256); {825#true} is VALID [2022-02-20 21:09:52,736 INFO L290 TraceCheckUtils]: 19: Hoare triple {825#true} assume true; {825#true} is VALID [2022-02-20 21:09:52,736 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {825#true} {827#(not (= |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base| 0))} #97#return; {827#(not (= |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base| 0))} is VALID [2022-02-20 21:09:52,737 INFO L290 TraceCheckUtils]: 21: Hoare triple {827#(not (= |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base| 0))} call write~$Pointer$(aws_linked_list_insert_after_~after#1.base, aws_linked_list_insert_after_~after#1.offset, aws_linked_list_insert_after_~to_add#1.base, 8 + aws_linked_list_insert_after_~to_add#1.offset, 8);call aws_linked_list_insert_after_#t~mem340#1.base, aws_linked_list_insert_after_#t~mem340#1.offset := read~$Pointer$(aws_linked_list_insert_after_~after#1.base, aws_linked_list_insert_after_~after#1.offset, 8);call write~$Pointer$(aws_linked_list_insert_after_#t~mem340#1.base, aws_linked_list_insert_after_#t~mem340#1.offset, aws_linked_list_insert_after_~to_add#1.base, aws_linked_list_insert_after_~to_add#1.offset, 8);havoc aws_linked_list_insert_after_#t~mem340#1.base, aws_linked_list_insert_after_#t~mem340#1.offset;call aws_linked_list_insert_after_#t~mem341#1.base, aws_linked_list_insert_after_#t~mem341#1.offset := read~$Pointer$(aws_linked_list_insert_after_~after#1.base, aws_linked_list_insert_after_~after#1.offset, 8);call write~$Pointer$(aws_linked_list_insert_after_~to_add#1.base, aws_linked_list_insert_after_~to_add#1.offset, aws_linked_list_insert_after_#t~mem341#1.base, 8 + aws_linked_list_insert_after_#t~mem341#1.offset, 8);havoc aws_linked_list_insert_after_#t~mem341#1.base, aws_linked_list_insert_after_#t~mem341#1.offset;call write~$Pointer$(aws_linked_list_insert_after_~to_add#1.base, aws_linked_list_insert_after_~to_add#1.offset, aws_linked_list_insert_after_~after#1.base, aws_linked_list_insert_after_~after#1.offset, 8); {843#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base|) |ULTIMATE.start_aws_linked_list_insert_after_~after#1.offset|) 0))} is VALID [2022-02-20 21:09:52,738 INFO L272 TraceCheckUtils]: 22: Hoare triple {843#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base|) |ULTIMATE.start_aws_linked_list_insert_after_~after#1.offset|) 0))} call aws_linked_list_insert_after_#t~ret342#1 := aws_linked_list_node_next_is_valid(aws_linked_list_insert_after_~after#1.base, aws_linked_list_insert_after_~after#1.offset); {825#true} is VALID [2022-02-20 21:09:52,738 INFO L290 TraceCheckUtils]: 23: Hoare triple {825#true} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short304 := ~node.base != 0 || ~node.offset != 0; {851#(and (= aws_linked_list_node_next_is_valid_~node.base |aws_linked_list_node_next_is_valid_#in~node.base|) (= aws_linked_list_node_next_is_valid_~node.offset |aws_linked_list_node_next_is_valid_#in~node.offset|))} is VALID [2022-02-20 21:09:52,739 INFO L290 TraceCheckUtils]: 24: Hoare triple {851#(and (= aws_linked_list_node_next_is_valid_~node.base |aws_linked_list_node_next_is_valid_#in~node.base|) (= aws_linked_list_node_next_is_valid_~node.offset |aws_linked_list_node_next_is_valid_#in~node.offset|))} assume #t~short304;call #t~mem303.base, #t~mem303.offset := read~$Pointer$(~node.base, ~node.offset, 8);#t~short304 := #t~mem303.base != 0 || #t~mem303.offset != 0; {852#(or (= (select (select |#memory_$Pointer$.base| |aws_linked_list_node_next_is_valid_#in~node.base|) |aws_linked_list_node_next_is_valid_#in~node.offset|) 0) |aws_linked_list_node_next_is_valid_#t~short304|)} is VALID [2022-02-20 21:09:52,739 INFO L290 TraceCheckUtils]: 25: Hoare triple {852#(or (= (select (select |#memory_$Pointer$.base| |aws_linked_list_node_next_is_valid_#in~node.base|) |aws_linked_list_node_next_is_valid_#in~node.offset|) 0) |aws_linked_list_node_next_is_valid_#t~short304|)} #t~short307 := #t~short304; {853#(or (= (select (select |#memory_$Pointer$.base| |aws_linked_list_node_next_is_valid_#in~node.base|) |aws_linked_list_node_next_is_valid_#in~node.offset|) 0) |aws_linked_list_node_next_is_valid_#t~short307|)} is VALID [2022-02-20 21:09:52,740 INFO L290 TraceCheckUtils]: 26: Hoare triple {853#(or (= (select (select |#memory_$Pointer$.base| |aws_linked_list_node_next_is_valid_#in~node.base|) |aws_linked_list_node_next_is_valid_#in~node.offset|) 0) |aws_linked_list_node_next_is_valid_#t~short307|)} assume !#t~short307; {854#(= (select (select |#memory_$Pointer$.base| |aws_linked_list_node_next_is_valid_#in~node.base|) |aws_linked_list_node_next_is_valid_#in~node.offset|) 0)} is VALID [2022-02-20 21:09:52,740 INFO L290 TraceCheckUtils]: 27: Hoare triple {854#(= (select (select |#memory_$Pointer$.base| |aws_linked_list_node_next_is_valid_#in~node.base|) |aws_linked_list_node_next_is_valid_#in~node.offset|) 0)} #res := (if 0 == (if #t~short307 then 1 else 0) then 0 else 1);havoc #t~mem303.base, #t~mem303.offset;havoc #t~short304;havoc #t~mem305.base, #t~mem305.offset;havoc #t~mem306.base, #t~mem306.offset;havoc #t~short307; {854#(= (select (select |#memory_$Pointer$.base| |aws_linked_list_node_next_is_valid_#in~node.base|) |aws_linked_list_node_next_is_valid_#in~node.offset|) 0)} is VALID [2022-02-20 21:09:52,740 INFO L290 TraceCheckUtils]: 28: Hoare triple {854#(= (select (select |#memory_$Pointer$.base| |aws_linked_list_node_next_is_valid_#in~node.base|) |aws_linked_list_node_next_is_valid_#in~node.offset|) 0)} assume true; {854#(= (select (select |#memory_$Pointer$.base| |aws_linked_list_node_next_is_valid_#in~node.base|) |aws_linked_list_node_next_is_valid_#in~node.offset|) 0)} is VALID [2022-02-20 21:09:52,741 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {854#(= (select (select |#memory_$Pointer$.base| |aws_linked_list_node_next_is_valid_#in~node.base|) |aws_linked_list_node_next_is_valid_#in~node.offset|) 0)} {843#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base|) |ULTIMATE.start_aws_linked_list_insert_after_~after#1.offset|) 0))} #99#return; {826#false} is VALID [2022-02-20 21:09:52,741 INFO L272 TraceCheckUtils]: 30: Hoare triple {826#false} call __VERIFIER_assert(aws_linked_list_insert_after_#t~ret342#1); {826#false} is VALID [2022-02-20 21:09:52,741 INFO L290 TraceCheckUtils]: 31: Hoare triple {826#false} ~cond := #in~cond; {826#false} is VALID [2022-02-20 21:09:52,741 INFO L290 TraceCheckUtils]: 32: Hoare triple {826#false} assume 0 == ~cond % 256; {826#false} is VALID [2022-02-20 21:09:52,748 INFO L290 TraceCheckUtils]: 33: Hoare triple {826#false} assume !false; {826#false} is VALID [2022-02-20 21:09:52,748 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-20 21:09:52,748 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:09:52,749 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101305232] [2022-02-20 21:09:52,749 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101305232] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:09:52,749 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:09:52,750 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 21:09:52,750 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256985115] [2022-02-20 21:09:52,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:09:52,750 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 states have internal predecessors, (22), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 34 [2022-02-20 21:09:52,750 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:09:52,751 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 states have internal predecessors, (22), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 21:09:52,772 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:09:52,772 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 21:09:52,772 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:09:52,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 21:09:52,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-02-20 21:09:52,774 INFO L87 Difference]: Start difference. First operand 66 states and 89 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 states have internal predecessors, (22), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 21:09:53,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:09:53,389 INFO L93 Difference]: Finished difference Result 135 states and 184 transitions. [2022-02-20 21:09:53,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 21:09:53,389 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 states have internal predecessors, (22), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 34 [2022-02-20 21:09:53,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:09:53,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 states have internal predecessors, (22), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 21:09:53,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 161 transitions. [2022-02-20 21:09:53,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 states have internal predecessors, (22), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 21:09:53,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 161 transitions. [2022-02-20 21:09:53,394 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 161 transitions. [2022-02-20 21:09:53,532 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 161 edges. 161 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:09:53,534 INFO L225 Difference]: With dead ends: 135 [2022-02-20 21:09:53,534 INFO L226 Difference]: Without dead ends: 72 [2022-02-20 21:09:53,535 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-02-20 21:09:53,535 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 38 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 21:09:53,535 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 232 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 21:09:53,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-02-20 21:09:53,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2022-02-20 21:09:53,543 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:09:53,544 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand has 71 states, 42 states have (on average 1.1428571428571428) internal successors, (48), 45 states have internal predecessors, (48), 21 states have call successors, (21), 5 states have call predecessors, (21), 7 states have return successors, (28), 20 states have call predecessors, (28), 20 states have call successors, (28) [2022-02-20 21:09:53,544 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand has 71 states, 42 states have (on average 1.1428571428571428) internal successors, (48), 45 states have internal predecessors, (48), 21 states have call successors, (21), 5 states have call predecessors, (21), 7 states have return successors, (28), 20 states have call predecessors, (28), 20 states have call successors, (28) [2022-02-20 21:09:53,544 INFO L87 Difference]: Start difference. First operand 72 states. Second operand has 71 states, 42 states have (on average 1.1428571428571428) internal successors, (48), 45 states have internal predecessors, (48), 21 states have call successors, (21), 5 states have call predecessors, (21), 7 states have return successors, (28), 20 states have call predecessors, (28), 20 states have call successors, (28) [2022-02-20 21:09:53,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:09:53,547 INFO L93 Difference]: Finished difference Result 72 states and 98 transitions. [2022-02-20 21:09:53,548 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 98 transitions. [2022-02-20 21:09:53,548 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:09:53,548 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:09:53,549 INFO L74 IsIncluded]: Start isIncluded. First operand has 71 states, 42 states have (on average 1.1428571428571428) internal successors, (48), 45 states have internal predecessors, (48), 21 states have call successors, (21), 5 states have call predecessors, (21), 7 states have return successors, (28), 20 states have call predecessors, (28), 20 states have call successors, (28) Second operand 72 states. [2022-02-20 21:09:53,549 INFO L87 Difference]: Start difference. First operand has 71 states, 42 states have (on average 1.1428571428571428) internal successors, (48), 45 states have internal predecessors, (48), 21 states have call successors, (21), 5 states have call predecessors, (21), 7 states have return successors, (28), 20 states have call predecessors, (28), 20 states have call successors, (28) Second operand 72 states. [2022-02-20 21:09:53,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:09:53,552 INFO L93 Difference]: Finished difference Result 72 states and 98 transitions. [2022-02-20 21:09:53,552 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 98 transitions. [2022-02-20 21:09:53,552 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:09:53,552 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:09:53,552 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:09:53,553 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:09:53,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 42 states have (on average 1.1428571428571428) internal successors, (48), 45 states have internal predecessors, (48), 21 states have call successors, (21), 5 states have call predecessors, (21), 7 states have return successors, (28), 20 states have call predecessors, (28), 20 states have call successors, (28) [2022-02-20 21:09:53,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 97 transitions. [2022-02-20 21:09:53,556 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 97 transitions. Word has length 34 [2022-02-20 21:09:53,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:09:53,556 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 97 transitions. [2022-02-20 21:09:53,556 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 states have internal predecessors, (22), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 21:09:53,556 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 97 transitions. [2022-02-20 21:09:53,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-02-20 21:09:53,557 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:09:53,557 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 21:09:53,557 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 21:09:53,557 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:09:53,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:09:53,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1343555176, now seen corresponding path program 1 times [2022-02-20 21:09:53,558 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:09:53,558 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911632358] [2022-02-20 21:09:53,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:09:53,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:09:53,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:09:53,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 21:09:53,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:09:53,716 INFO L290 TraceCheckUtils]: 0: Hoare triple {1293#true} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short304 := ~node.base != 0 || ~node.offset != 0; {1319#(or (not |aws_linked_list_node_next_is_valid_#t~short304|) (not (= |aws_linked_list_node_next_is_valid_#in~node.offset| 0)) (and (or (<= aws_linked_list_node_next_is_valid_~node.base 0) (<= aws_linked_list_node_next_is_valid_~node.base |aws_linked_list_node_next_is_valid_#in~node.base|)) (or (not (<= aws_linked_list_node_next_is_valid_~node.base 0)) (and (<= |aws_linked_list_node_next_is_valid_#in~node.base| aws_linked_list_node_next_is_valid_~node.base) (<= (+ aws_linked_list_node_next_is_valid_~node.base 1) 0)))))} is VALID [2022-02-20 21:09:53,716 INFO L290 TraceCheckUtils]: 1: Hoare triple {1319#(or (not |aws_linked_list_node_next_is_valid_#t~short304|) (not (= |aws_linked_list_node_next_is_valid_#in~node.offset| 0)) (and (or (<= aws_linked_list_node_next_is_valid_~node.base 0) (<= aws_linked_list_node_next_is_valid_~node.base |aws_linked_list_node_next_is_valid_#in~node.base|)) (or (not (<= aws_linked_list_node_next_is_valid_~node.base 0)) (and (<= |aws_linked_list_node_next_is_valid_#in~node.base| aws_linked_list_node_next_is_valid_~node.base) (<= (+ aws_linked_list_node_next_is_valid_~node.base 1) 0)))))} assume #t~short304;call #t~mem303.base, #t~mem303.offset := read~$Pointer$(~node.base, ~node.offset, 8);#t~short304 := #t~mem303.base != 0 || #t~mem303.offset != 0; {1320#(or (not (= |aws_linked_list_node_next_is_valid_#in~node.offset| 0)) (and (or (<= aws_linked_list_node_next_is_valid_~node.base 0) (<= aws_linked_list_node_next_is_valid_~node.base |aws_linked_list_node_next_is_valid_#in~node.base|)) (or (not (<= aws_linked_list_node_next_is_valid_~node.base 0)) (and (<= |aws_linked_list_node_next_is_valid_#in~node.base| aws_linked_list_node_next_is_valid_~node.base) (<= (+ aws_linked_list_node_next_is_valid_~node.base 1) 0)))))} is VALID [2022-02-20 21:09:53,717 INFO L290 TraceCheckUtils]: 2: Hoare triple {1320#(or (not (= |aws_linked_list_node_next_is_valid_#in~node.offset| 0)) (and (or (<= aws_linked_list_node_next_is_valid_~node.base 0) (<= aws_linked_list_node_next_is_valid_~node.base |aws_linked_list_node_next_is_valid_#in~node.base|)) (or (not (<= aws_linked_list_node_next_is_valid_~node.base 0)) (and (<= |aws_linked_list_node_next_is_valid_#in~node.base| aws_linked_list_node_next_is_valid_~node.base) (<= (+ aws_linked_list_node_next_is_valid_~node.base 1) 0)))))} #t~short307 := #t~short304; {1320#(or (not (= |aws_linked_list_node_next_is_valid_#in~node.offset| 0)) (and (or (<= aws_linked_list_node_next_is_valid_~node.base 0) (<= aws_linked_list_node_next_is_valid_~node.base |aws_linked_list_node_next_is_valid_#in~node.base|)) (or (not (<= aws_linked_list_node_next_is_valid_~node.base 0)) (and (<= |aws_linked_list_node_next_is_valid_#in~node.base| aws_linked_list_node_next_is_valid_~node.base) (<= (+ aws_linked_list_node_next_is_valid_~node.base 1) 0)))))} is VALID [2022-02-20 21:09:53,719 INFO L290 TraceCheckUtils]: 3: Hoare triple {1320#(or (not (= |aws_linked_list_node_next_is_valid_#in~node.offset| 0)) (and (or (<= aws_linked_list_node_next_is_valid_~node.base 0) (<= aws_linked_list_node_next_is_valid_~node.base |aws_linked_list_node_next_is_valid_#in~node.base|)) (or (not (<= aws_linked_list_node_next_is_valid_~node.base 0)) (and (<= |aws_linked_list_node_next_is_valid_#in~node.base| aws_linked_list_node_next_is_valid_~node.base) (<= (+ aws_linked_list_node_next_is_valid_~node.base 1) 0)))))} assume #t~short307;call #t~mem305.base, #t~mem305.offset := read~$Pointer$(~node.base, ~node.offset, 8);call #t~mem306.base, #t~mem306.offset := read~$Pointer$(#t~mem305.base, 8 + #t~mem305.offset, 8);#t~short307 := #t~mem306.base == ~node.base && #t~mem306.offset == ~node.offset; {1321#(or (<= 1 |aws_linked_list_node_next_is_valid_#in~node.base|) (not (= |aws_linked_list_node_next_is_valid_#in~node.offset| 0)) (<= (+ |aws_linked_list_node_next_is_valid_#in~node.base| 1) 0))} is VALID [2022-02-20 21:09:53,719 INFO L290 TraceCheckUtils]: 4: Hoare triple {1321#(or (<= 1 |aws_linked_list_node_next_is_valid_#in~node.base|) (not (= |aws_linked_list_node_next_is_valid_#in~node.offset| 0)) (<= (+ |aws_linked_list_node_next_is_valid_#in~node.base| 1) 0))} #res := (if 0 == (if #t~short307 then 1 else 0) then 0 else 1);havoc #t~mem303.base, #t~mem303.offset;havoc #t~short304;havoc #t~mem305.base, #t~mem305.offset;havoc #t~mem306.base, #t~mem306.offset;havoc #t~short307; {1321#(or (<= 1 |aws_linked_list_node_next_is_valid_#in~node.base|) (not (= |aws_linked_list_node_next_is_valid_#in~node.offset| 0)) (<= (+ |aws_linked_list_node_next_is_valid_#in~node.base| 1) 0))} is VALID [2022-02-20 21:09:53,720 INFO L290 TraceCheckUtils]: 5: Hoare triple {1321#(or (<= 1 |aws_linked_list_node_next_is_valid_#in~node.base|) (not (= |aws_linked_list_node_next_is_valid_#in~node.offset| 0)) (<= (+ |aws_linked_list_node_next_is_valid_#in~node.base| 1) 0))} assume true; {1321#(or (<= 1 |aws_linked_list_node_next_is_valid_#in~node.base|) (not (= |aws_linked_list_node_next_is_valid_#in~node.offset| 0)) (<= (+ |aws_linked_list_node_next_is_valid_#in~node.base| 1) 0))} is VALID [2022-02-20 21:09:53,721 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1321#(or (<= 1 |aws_linked_list_node_next_is_valid_#in~node.base|) (not (= |aws_linked_list_node_next_is_valid_#in~node.offset| 0)) (<= (+ |aws_linked_list_node_next_is_valid_#in~node.base| 1) 0))} {1295#(= |ULTIMATE.start_aws_linked_list_insert_after_~after#1.offset| 0)} #93#return; {1303#(not (= |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base| 0))} is VALID [2022-02-20 21:09:53,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 21:09:53,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:09:53,729 INFO L290 TraceCheckUtils]: 0: Hoare triple {1293#true} ~cond := #in~cond; {1293#true} is VALID [2022-02-20 21:09:53,729 INFO L290 TraceCheckUtils]: 1: Hoare triple {1293#true} assume !(0 == ~cond % 256); {1293#true} is VALID [2022-02-20 21:09:53,730 INFO L290 TraceCheckUtils]: 2: Hoare triple {1293#true} assume true; {1293#true} is VALID [2022-02-20 21:09:53,730 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1293#true} {1303#(not (= |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base| 0))} #95#return; {1303#(not (= |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base| 0))} is VALID [2022-02-20 21:09:53,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-02-20 21:09:53,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:09:53,738 INFO L290 TraceCheckUtils]: 0: Hoare triple {1293#true} ~cond := #in~cond; {1293#true} is VALID [2022-02-20 21:09:53,738 INFO L290 TraceCheckUtils]: 1: Hoare triple {1293#true} assume !(0 == ~cond % 256); {1293#true} is VALID [2022-02-20 21:09:53,738 INFO L290 TraceCheckUtils]: 2: Hoare triple {1293#true} assume true; {1293#true} is VALID [2022-02-20 21:09:53,739 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1293#true} {1303#(not (= |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base| 0))} #97#return; {1303#(not (= |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base| 0))} is VALID [2022-02-20 21:09:53,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-02-20 21:09:53,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:09:53,783 INFO L290 TraceCheckUtils]: 0: Hoare triple {1293#true} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short304 := ~node.base != 0 || ~node.offset != 0; {1322#(or |aws_linked_list_node_next_is_valid_#t~short304| (and (< 0 (+ |aws_linked_list_node_next_is_valid_#in~node.base| 1)) (<= |aws_linked_list_node_next_is_valid_#in~node.base| 0)))} is VALID [2022-02-20 21:09:53,783 INFO L290 TraceCheckUtils]: 1: Hoare triple {1322#(or |aws_linked_list_node_next_is_valid_#t~short304| (and (< 0 (+ |aws_linked_list_node_next_is_valid_#in~node.base| 1)) (<= |aws_linked_list_node_next_is_valid_#in~node.base| 0)))} assume !#t~short304; {1323#(and (< 0 (+ |aws_linked_list_node_next_is_valid_#in~node.base| 1)) (<= |aws_linked_list_node_next_is_valid_#in~node.base| 0))} is VALID [2022-02-20 21:09:53,784 INFO L290 TraceCheckUtils]: 2: Hoare triple {1323#(and (< 0 (+ |aws_linked_list_node_next_is_valid_#in~node.base| 1)) (<= |aws_linked_list_node_next_is_valid_#in~node.base| 0))} #t~short307 := #t~short304; {1323#(and (< 0 (+ |aws_linked_list_node_next_is_valid_#in~node.base| 1)) (<= |aws_linked_list_node_next_is_valid_#in~node.base| 0))} is VALID [2022-02-20 21:09:53,784 INFO L290 TraceCheckUtils]: 3: Hoare triple {1323#(and (< 0 (+ |aws_linked_list_node_next_is_valid_#in~node.base| 1)) (<= |aws_linked_list_node_next_is_valid_#in~node.base| 0))} assume !#t~short307; {1323#(and (< 0 (+ |aws_linked_list_node_next_is_valid_#in~node.base| 1)) (<= |aws_linked_list_node_next_is_valid_#in~node.base| 0))} is VALID [2022-02-20 21:09:53,785 INFO L290 TraceCheckUtils]: 4: Hoare triple {1323#(and (< 0 (+ |aws_linked_list_node_next_is_valid_#in~node.base| 1)) (<= |aws_linked_list_node_next_is_valid_#in~node.base| 0))} #res := (if 0 == (if #t~short307 then 1 else 0) then 0 else 1);havoc #t~mem303.base, #t~mem303.offset;havoc #t~short304;havoc #t~mem305.base, #t~mem305.offset;havoc #t~mem306.base, #t~mem306.offset;havoc #t~short307; {1323#(and (< 0 (+ |aws_linked_list_node_next_is_valid_#in~node.base| 1)) (<= |aws_linked_list_node_next_is_valid_#in~node.base| 0))} is VALID [2022-02-20 21:09:53,785 INFO L290 TraceCheckUtils]: 5: Hoare triple {1323#(and (< 0 (+ |aws_linked_list_node_next_is_valid_#in~node.base| 1)) (<= |aws_linked_list_node_next_is_valid_#in~node.base| 0))} assume true; {1323#(and (< 0 (+ |aws_linked_list_node_next_is_valid_#in~node.base| 1)) (<= |aws_linked_list_node_next_is_valid_#in~node.base| 0))} is VALID [2022-02-20 21:09:53,786 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1323#(and (< 0 (+ |aws_linked_list_node_next_is_valid_#in~node.base| 1)) (<= |aws_linked_list_node_next_is_valid_#in~node.base| 0))} {1303#(not (= |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base| 0))} #99#return; {1294#false} is VALID [2022-02-20 21:09:53,786 INFO L290 TraceCheckUtils]: 0: Hoare triple {1293#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(39, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(78, 4);~#s_can_fail_allocator_static~0.base, ~#s_can_fail_allocator_static~0.offset := 5, 0;call #Ultimate.allocInit(40, 5);call write~init~$Pointer$(#funAddr~s_can_fail_malloc_allocator.base, #funAddr~s_can_fail_malloc_allocator.offset, ~#s_can_fail_allocator_static~0.base, ~#s_can_fail_allocator_static~0.offset, 8);call write~init~$Pointer$(#funAddr~s_can_fail_free_allocator.base, #funAddr~s_can_fail_free_allocator.offset, ~#s_can_fail_allocator_static~0.base, 8 + ~#s_can_fail_allocator_static~0.offset, 8);call write~init~$Pointer$(#funAddr~s_can_fail_realloc_allocator.base, #funAddr~s_can_fail_realloc_allocator.offset, ~#s_can_fail_allocator_static~0.base, 16 + ~#s_can_fail_allocator_static~0.offset, 8);call write~init~$Pointer$(#funAddr~s_can_fail_calloc_allocator.base, #funAddr~s_can_fail_calloc_allocator.offset, ~#s_can_fail_allocator_static~0.base, 24 + ~#s_can_fail_allocator_static~0.offset, 8);call write~init~$Pointer$(0, 0, ~#s_can_fail_allocator_static~0.base, 32 + ~#s_can_fail_allocator_static~0.offset, 8);~tl_last_error~0 := 0; {1293#true} is VALID [2022-02-20 21:09:53,787 INFO L290 TraceCheckUtils]: 1: Hoare triple {1293#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;assume { :begin_inline_aws_linked_list_insert_after_harness } true;havoc aws_linked_list_insert_after_harness_#t~ret674#1, aws_linked_list_insert_after_harness_#t~ret675#1, aws_linked_list_insert_after_harness_#t~ret676#1, aws_linked_list_insert_after_harness_#t~ret677#1, aws_linked_list_insert_after_harness_#t~mem678#1.base, aws_linked_list_insert_after_harness_#t~mem678#1.offset, aws_linked_list_insert_after_harness_#t~mem679#1.base, aws_linked_list_insert_after_harness_#t~mem679#1.offset, aws_linked_list_insert_after_harness_~#after~0#1.base, aws_linked_list_insert_after_harness_~#after~0#1.offset, aws_linked_list_insert_after_harness_~#after_next~0#1.base, aws_linked_list_insert_after_harness_~#after_next~0#1.offset, aws_linked_list_insert_after_harness_~#to_add~0#1.base, aws_linked_list_insert_after_harness_~#to_add~0#1.offset;call aws_linked_list_insert_after_harness_~#after~0#1.base, aws_linked_list_insert_after_harness_~#after~0#1.offset := #Ultimate.allocOnStack(16);call aws_linked_list_insert_after_harness_~#after_next~0#1.base, aws_linked_list_insert_after_harness_~#after_next~0#1.offset := #Ultimate.allocOnStack(16);call aws_linked_list_insert_after_harness_~#to_add~0#1.base, aws_linked_list_insert_after_harness_~#to_add~0#1.offset := #Ultimate.allocOnStack(16);call write~$Pointer$(aws_linked_list_insert_after_harness_~#after_next~0#1.base, aws_linked_list_insert_after_harness_~#after_next~0#1.offset, aws_linked_list_insert_after_harness_~#after~0#1.base, aws_linked_list_insert_after_harness_~#after~0#1.offset, 8);call write~$Pointer$(aws_linked_list_insert_after_harness_~#after~0#1.base, aws_linked_list_insert_after_harness_~#after~0#1.offset, aws_linked_list_insert_after_harness_~#after_next~0#1.base, 8 + aws_linked_list_insert_after_harness_~#after_next~0#1.offset, 8);assume { :begin_inline_aws_linked_list_insert_after } true;aws_linked_list_insert_after_#in~after#1.base, aws_linked_list_insert_after_#in~after#1.offset, aws_linked_list_insert_after_#in~to_add#1.base, aws_linked_list_insert_after_#in~to_add#1.offset := aws_linked_list_insert_after_harness_~#after~0#1.base, aws_linked_list_insert_after_harness_~#after~0#1.offset, aws_linked_list_insert_after_harness_~#to_add~0#1.base, aws_linked_list_insert_after_harness_~#to_add~0#1.offset;havoc aws_linked_list_insert_after_#t~ret339#1, aws_linked_list_insert_after_#t~mem340#1.base, aws_linked_list_insert_after_#t~mem340#1.offset, aws_linked_list_insert_after_#t~mem341#1.base, aws_linked_list_insert_after_#t~mem341#1.offset, aws_linked_list_insert_after_#t~ret342#1, aws_linked_list_insert_after_#t~ret343#1, aws_linked_list_insert_after_#t~ret344#1, aws_linked_list_insert_after_#t~mem345#1.base, aws_linked_list_insert_after_#t~mem345#1.offset, aws_linked_list_insert_after_~after#1.base, aws_linked_list_insert_after_~after#1.offset, aws_linked_list_insert_after_~to_add#1.base, aws_linked_list_insert_after_~to_add#1.offset;aws_linked_list_insert_after_~after#1.base, aws_linked_list_insert_after_~after#1.offset := aws_linked_list_insert_after_#in~after#1.base, aws_linked_list_insert_after_#in~after#1.offset;aws_linked_list_insert_after_~to_add#1.base, aws_linked_list_insert_after_~to_add#1.offset := aws_linked_list_insert_after_#in~to_add#1.base, aws_linked_list_insert_after_#in~to_add#1.offset; {1295#(= |ULTIMATE.start_aws_linked_list_insert_after_~after#1.offset| 0)} is VALID [2022-02-20 21:09:53,787 INFO L272 TraceCheckUtils]: 2: Hoare triple {1295#(= |ULTIMATE.start_aws_linked_list_insert_after_~after#1.offset| 0)} call aws_linked_list_insert_after_#t~ret339#1 := aws_linked_list_node_next_is_valid(aws_linked_list_insert_after_~after#1.base, aws_linked_list_insert_after_~after#1.offset); {1293#true} is VALID [2022-02-20 21:09:53,788 INFO L290 TraceCheckUtils]: 3: Hoare triple {1293#true} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short304 := ~node.base != 0 || ~node.offset != 0; {1319#(or (not |aws_linked_list_node_next_is_valid_#t~short304|) (not (= |aws_linked_list_node_next_is_valid_#in~node.offset| 0)) (and (or (<= aws_linked_list_node_next_is_valid_~node.base 0) (<= aws_linked_list_node_next_is_valid_~node.base |aws_linked_list_node_next_is_valid_#in~node.base|)) (or (not (<= aws_linked_list_node_next_is_valid_~node.base 0)) (and (<= |aws_linked_list_node_next_is_valid_#in~node.base| aws_linked_list_node_next_is_valid_~node.base) (<= (+ aws_linked_list_node_next_is_valid_~node.base 1) 0)))))} is VALID [2022-02-20 21:09:53,789 INFO L290 TraceCheckUtils]: 4: Hoare triple {1319#(or (not |aws_linked_list_node_next_is_valid_#t~short304|) (not (= |aws_linked_list_node_next_is_valid_#in~node.offset| 0)) (and (or (<= aws_linked_list_node_next_is_valid_~node.base 0) (<= aws_linked_list_node_next_is_valid_~node.base |aws_linked_list_node_next_is_valid_#in~node.base|)) (or (not (<= aws_linked_list_node_next_is_valid_~node.base 0)) (and (<= |aws_linked_list_node_next_is_valid_#in~node.base| aws_linked_list_node_next_is_valid_~node.base) (<= (+ aws_linked_list_node_next_is_valid_~node.base 1) 0)))))} assume #t~short304;call #t~mem303.base, #t~mem303.offset := read~$Pointer$(~node.base, ~node.offset, 8);#t~short304 := #t~mem303.base != 0 || #t~mem303.offset != 0; {1320#(or (not (= |aws_linked_list_node_next_is_valid_#in~node.offset| 0)) (and (or (<= aws_linked_list_node_next_is_valid_~node.base 0) (<= aws_linked_list_node_next_is_valid_~node.base |aws_linked_list_node_next_is_valid_#in~node.base|)) (or (not (<= aws_linked_list_node_next_is_valid_~node.base 0)) (and (<= |aws_linked_list_node_next_is_valid_#in~node.base| aws_linked_list_node_next_is_valid_~node.base) (<= (+ aws_linked_list_node_next_is_valid_~node.base 1) 0)))))} is VALID [2022-02-20 21:09:53,789 INFO L290 TraceCheckUtils]: 5: Hoare triple {1320#(or (not (= |aws_linked_list_node_next_is_valid_#in~node.offset| 0)) (and (or (<= aws_linked_list_node_next_is_valid_~node.base 0) (<= aws_linked_list_node_next_is_valid_~node.base |aws_linked_list_node_next_is_valid_#in~node.base|)) (or (not (<= aws_linked_list_node_next_is_valid_~node.base 0)) (and (<= |aws_linked_list_node_next_is_valid_#in~node.base| aws_linked_list_node_next_is_valid_~node.base) (<= (+ aws_linked_list_node_next_is_valid_~node.base 1) 0)))))} #t~short307 := #t~short304; {1320#(or (not (= |aws_linked_list_node_next_is_valid_#in~node.offset| 0)) (and (or (<= aws_linked_list_node_next_is_valid_~node.base 0) (<= aws_linked_list_node_next_is_valid_~node.base |aws_linked_list_node_next_is_valid_#in~node.base|)) (or (not (<= aws_linked_list_node_next_is_valid_~node.base 0)) (and (<= |aws_linked_list_node_next_is_valid_#in~node.base| aws_linked_list_node_next_is_valid_~node.base) (<= (+ aws_linked_list_node_next_is_valid_~node.base 1) 0)))))} is VALID [2022-02-20 21:09:53,790 INFO L290 TraceCheckUtils]: 6: Hoare triple {1320#(or (not (= |aws_linked_list_node_next_is_valid_#in~node.offset| 0)) (and (or (<= aws_linked_list_node_next_is_valid_~node.base 0) (<= aws_linked_list_node_next_is_valid_~node.base |aws_linked_list_node_next_is_valid_#in~node.base|)) (or (not (<= aws_linked_list_node_next_is_valid_~node.base 0)) (and (<= |aws_linked_list_node_next_is_valid_#in~node.base| aws_linked_list_node_next_is_valid_~node.base) (<= (+ aws_linked_list_node_next_is_valid_~node.base 1) 0)))))} assume #t~short307;call #t~mem305.base, #t~mem305.offset := read~$Pointer$(~node.base, ~node.offset, 8);call #t~mem306.base, #t~mem306.offset := read~$Pointer$(#t~mem305.base, 8 + #t~mem305.offset, 8);#t~short307 := #t~mem306.base == ~node.base && #t~mem306.offset == ~node.offset; {1321#(or (<= 1 |aws_linked_list_node_next_is_valid_#in~node.base|) (not (= |aws_linked_list_node_next_is_valid_#in~node.offset| 0)) (<= (+ |aws_linked_list_node_next_is_valid_#in~node.base| 1) 0))} is VALID [2022-02-20 21:09:53,790 INFO L290 TraceCheckUtils]: 7: Hoare triple {1321#(or (<= 1 |aws_linked_list_node_next_is_valid_#in~node.base|) (not (= |aws_linked_list_node_next_is_valid_#in~node.offset| 0)) (<= (+ |aws_linked_list_node_next_is_valid_#in~node.base| 1) 0))} #res := (if 0 == (if #t~short307 then 1 else 0) then 0 else 1);havoc #t~mem303.base, #t~mem303.offset;havoc #t~short304;havoc #t~mem305.base, #t~mem305.offset;havoc #t~mem306.base, #t~mem306.offset;havoc #t~short307; {1321#(or (<= 1 |aws_linked_list_node_next_is_valid_#in~node.base|) (not (= |aws_linked_list_node_next_is_valid_#in~node.offset| 0)) (<= (+ |aws_linked_list_node_next_is_valid_#in~node.base| 1) 0))} is VALID [2022-02-20 21:09:53,793 INFO L290 TraceCheckUtils]: 8: Hoare triple {1321#(or (<= 1 |aws_linked_list_node_next_is_valid_#in~node.base|) (not (= |aws_linked_list_node_next_is_valid_#in~node.offset| 0)) (<= (+ |aws_linked_list_node_next_is_valid_#in~node.base| 1) 0))} assume true; {1321#(or (<= 1 |aws_linked_list_node_next_is_valid_#in~node.base|) (not (= |aws_linked_list_node_next_is_valid_#in~node.offset| 0)) (<= (+ |aws_linked_list_node_next_is_valid_#in~node.base| 1) 0))} is VALID [2022-02-20 21:09:53,794 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {1321#(or (<= 1 |aws_linked_list_node_next_is_valid_#in~node.base|) (not (= |aws_linked_list_node_next_is_valid_#in~node.offset| 0)) (<= (+ |aws_linked_list_node_next_is_valid_#in~node.base| 1) 0))} {1295#(= |ULTIMATE.start_aws_linked_list_insert_after_~after#1.offset| 0)} #93#return; {1303#(not (= |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base| 0))} is VALID [2022-02-20 21:09:53,794 INFO L272 TraceCheckUtils]: 10: Hoare triple {1303#(not (= |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base| 0))} call assume_abort_if_not(aws_linked_list_insert_after_#t~ret339#1); {1293#true} is VALID [2022-02-20 21:09:53,794 INFO L290 TraceCheckUtils]: 11: Hoare triple {1293#true} ~cond := #in~cond; {1293#true} is VALID [2022-02-20 21:09:53,794 INFO L290 TraceCheckUtils]: 12: Hoare triple {1293#true} assume !(0 == ~cond % 256); {1293#true} is VALID [2022-02-20 21:09:53,795 INFO L290 TraceCheckUtils]: 13: Hoare triple {1293#true} assume true; {1293#true} is VALID [2022-02-20 21:09:53,795 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {1293#true} {1303#(not (= |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base| 0))} #95#return; {1303#(not (= |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base| 0))} is VALID [2022-02-20 21:09:53,796 INFO L290 TraceCheckUtils]: 15: Hoare triple {1303#(not (= |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base| 0))} havoc aws_linked_list_insert_after_#t~ret339#1; {1303#(not (= |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base| 0))} is VALID [2022-02-20 21:09:53,796 INFO L272 TraceCheckUtils]: 16: Hoare triple {1303#(not (= |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base| 0))} call assume_abort_if_not((if 0 == (if aws_linked_list_insert_after_~to_add#1.base != 0 || aws_linked_list_insert_after_~to_add#1.offset != 0 then 1 else 0) then 0 else 1)); {1293#true} is VALID [2022-02-20 21:09:53,796 INFO L290 TraceCheckUtils]: 17: Hoare triple {1293#true} ~cond := #in~cond; {1293#true} is VALID [2022-02-20 21:09:53,796 INFO L290 TraceCheckUtils]: 18: Hoare triple {1293#true} assume !(0 == ~cond % 256); {1293#true} is VALID [2022-02-20 21:09:53,796 INFO L290 TraceCheckUtils]: 19: Hoare triple {1293#true} assume true; {1293#true} is VALID [2022-02-20 21:09:53,797 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1293#true} {1303#(not (= |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base| 0))} #97#return; {1303#(not (= |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base| 0))} is VALID [2022-02-20 21:09:53,797 INFO L290 TraceCheckUtils]: 21: Hoare triple {1303#(not (= |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base| 0))} call write~$Pointer$(aws_linked_list_insert_after_~after#1.base, aws_linked_list_insert_after_~after#1.offset, aws_linked_list_insert_after_~to_add#1.base, 8 + aws_linked_list_insert_after_~to_add#1.offset, 8);call aws_linked_list_insert_after_#t~mem340#1.base, aws_linked_list_insert_after_#t~mem340#1.offset := read~$Pointer$(aws_linked_list_insert_after_~after#1.base, aws_linked_list_insert_after_~after#1.offset, 8);call write~$Pointer$(aws_linked_list_insert_after_#t~mem340#1.base, aws_linked_list_insert_after_#t~mem340#1.offset, aws_linked_list_insert_after_~to_add#1.base, aws_linked_list_insert_after_~to_add#1.offset, 8);havoc aws_linked_list_insert_after_#t~mem340#1.base, aws_linked_list_insert_after_#t~mem340#1.offset;call aws_linked_list_insert_after_#t~mem341#1.base, aws_linked_list_insert_after_#t~mem341#1.offset := read~$Pointer$(aws_linked_list_insert_after_~after#1.base, aws_linked_list_insert_after_~after#1.offset, 8);call write~$Pointer$(aws_linked_list_insert_after_~to_add#1.base, aws_linked_list_insert_after_~to_add#1.offset, aws_linked_list_insert_after_#t~mem341#1.base, 8 + aws_linked_list_insert_after_#t~mem341#1.offset, 8);havoc aws_linked_list_insert_after_#t~mem341#1.base, aws_linked_list_insert_after_#t~mem341#1.offset;call write~$Pointer$(aws_linked_list_insert_after_~to_add#1.base, aws_linked_list_insert_after_~to_add#1.offset, aws_linked_list_insert_after_~after#1.base, aws_linked_list_insert_after_~after#1.offset, 8); {1303#(not (= |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base| 0))} is VALID [2022-02-20 21:09:53,797 INFO L272 TraceCheckUtils]: 22: Hoare triple {1303#(not (= |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base| 0))} call aws_linked_list_insert_after_#t~ret342#1 := aws_linked_list_node_next_is_valid(aws_linked_list_insert_after_~after#1.base, aws_linked_list_insert_after_~after#1.offset); {1293#true} is VALID [2022-02-20 21:09:53,798 INFO L290 TraceCheckUtils]: 23: Hoare triple {1293#true} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short304 := ~node.base != 0 || ~node.offset != 0; {1322#(or |aws_linked_list_node_next_is_valid_#t~short304| (and (< 0 (+ |aws_linked_list_node_next_is_valid_#in~node.base| 1)) (<= |aws_linked_list_node_next_is_valid_#in~node.base| 0)))} is VALID [2022-02-20 21:09:53,798 INFO L290 TraceCheckUtils]: 24: Hoare triple {1322#(or |aws_linked_list_node_next_is_valid_#t~short304| (and (< 0 (+ |aws_linked_list_node_next_is_valid_#in~node.base| 1)) (<= |aws_linked_list_node_next_is_valid_#in~node.base| 0)))} assume !#t~short304; {1323#(and (< 0 (+ |aws_linked_list_node_next_is_valid_#in~node.base| 1)) (<= |aws_linked_list_node_next_is_valid_#in~node.base| 0))} is VALID [2022-02-20 21:09:53,798 INFO L290 TraceCheckUtils]: 25: Hoare triple {1323#(and (< 0 (+ |aws_linked_list_node_next_is_valid_#in~node.base| 1)) (<= |aws_linked_list_node_next_is_valid_#in~node.base| 0))} #t~short307 := #t~short304; {1323#(and (< 0 (+ |aws_linked_list_node_next_is_valid_#in~node.base| 1)) (<= |aws_linked_list_node_next_is_valid_#in~node.base| 0))} is VALID [2022-02-20 21:09:53,799 INFO L290 TraceCheckUtils]: 26: Hoare triple {1323#(and (< 0 (+ |aws_linked_list_node_next_is_valid_#in~node.base| 1)) (<= |aws_linked_list_node_next_is_valid_#in~node.base| 0))} assume !#t~short307; {1323#(and (< 0 (+ |aws_linked_list_node_next_is_valid_#in~node.base| 1)) (<= |aws_linked_list_node_next_is_valid_#in~node.base| 0))} is VALID [2022-02-20 21:09:53,799 INFO L290 TraceCheckUtils]: 27: Hoare triple {1323#(and (< 0 (+ |aws_linked_list_node_next_is_valid_#in~node.base| 1)) (<= |aws_linked_list_node_next_is_valid_#in~node.base| 0))} #res := (if 0 == (if #t~short307 then 1 else 0) then 0 else 1);havoc #t~mem303.base, #t~mem303.offset;havoc #t~short304;havoc #t~mem305.base, #t~mem305.offset;havoc #t~mem306.base, #t~mem306.offset;havoc #t~short307; {1323#(and (< 0 (+ |aws_linked_list_node_next_is_valid_#in~node.base| 1)) (<= |aws_linked_list_node_next_is_valid_#in~node.base| 0))} is VALID [2022-02-20 21:09:53,800 INFO L290 TraceCheckUtils]: 28: Hoare triple {1323#(and (< 0 (+ |aws_linked_list_node_next_is_valid_#in~node.base| 1)) (<= |aws_linked_list_node_next_is_valid_#in~node.base| 0))} assume true; {1323#(and (< 0 (+ |aws_linked_list_node_next_is_valid_#in~node.base| 1)) (<= |aws_linked_list_node_next_is_valid_#in~node.base| 0))} is VALID [2022-02-20 21:09:53,800 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1323#(and (< 0 (+ |aws_linked_list_node_next_is_valid_#in~node.base| 1)) (<= |aws_linked_list_node_next_is_valid_#in~node.base| 0))} {1303#(not (= |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base| 0))} #99#return; {1294#false} is VALID [2022-02-20 21:09:53,800 INFO L272 TraceCheckUtils]: 30: Hoare triple {1294#false} call __VERIFIER_assert(aws_linked_list_insert_after_#t~ret342#1); {1294#false} is VALID [2022-02-20 21:09:53,801 INFO L290 TraceCheckUtils]: 31: Hoare triple {1294#false} ~cond := #in~cond; {1294#false} is VALID [2022-02-20 21:09:53,801 INFO L290 TraceCheckUtils]: 32: Hoare triple {1294#false} assume 0 == ~cond % 256; {1294#false} is VALID [2022-02-20 21:09:53,801 INFO L290 TraceCheckUtils]: 33: Hoare triple {1294#false} assume !false; {1294#false} is VALID [2022-02-20 21:09:53,801 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-20 21:09:53,801 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:09:53,801 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911632358] [2022-02-20 21:09:53,802 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911632358] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 21:09:53,802 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1401887610] [2022-02-20 21:09:53,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:09:53,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 21:09:53,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 21:09:53,804 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 21:09:53,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-20 21:09:53,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:09:53,982 INFO L263 TraceCheckSpWp]: Trace formula consists of 505 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-20 21:09:54,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:09:54,022 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 21:09:54,278 INFO L290 TraceCheckUtils]: 0: Hoare triple {1293#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(39, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(78, 4);~#s_can_fail_allocator_static~0.base, ~#s_can_fail_allocator_static~0.offset := 5, 0;call #Ultimate.allocInit(40, 5);call write~init~$Pointer$(#funAddr~s_can_fail_malloc_allocator.base, #funAddr~s_can_fail_malloc_allocator.offset, ~#s_can_fail_allocator_static~0.base, ~#s_can_fail_allocator_static~0.offset, 8);call write~init~$Pointer$(#funAddr~s_can_fail_free_allocator.base, #funAddr~s_can_fail_free_allocator.offset, ~#s_can_fail_allocator_static~0.base, 8 + ~#s_can_fail_allocator_static~0.offset, 8);call write~init~$Pointer$(#funAddr~s_can_fail_realloc_allocator.base, #funAddr~s_can_fail_realloc_allocator.offset, ~#s_can_fail_allocator_static~0.base, 16 + ~#s_can_fail_allocator_static~0.offset, 8);call write~init~$Pointer$(#funAddr~s_can_fail_calloc_allocator.base, #funAddr~s_can_fail_calloc_allocator.offset, ~#s_can_fail_allocator_static~0.base, 24 + ~#s_can_fail_allocator_static~0.offset, 8);call write~init~$Pointer$(0, 0, ~#s_can_fail_allocator_static~0.base, 32 + ~#s_can_fail_allocator_static~0.offset, 8);~tl_last_error~0 := 0; {1327#(< 0 |#StackHeapBarrier|)} is VALID [2022-02-20 21:09:54,280 INFO L290 TraceCheckUtils]: 1: Hoare triple {1327#(< 0 |#StackHeapBarrier|)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;assume { :begin_inline_aws_linked_list_insert_after_harness } true;havoc aws_linked_list_insert_after_harness_#t~ret674#1, aws_linked_list_insert_after_harness_#t~ret675#1, aws_linked_list_insert_after_harness_#t~ret676#1, aws_linked_list_insert_after_harness_#t~ret677#1, aws_linked_list_insert_after_harness_#t~mem678#1.base, aws_linked_list_insert_after_harness_#t~mem678#1.offset, aws_linked_list_insert_after_harness_#t~mem679#1.base, aws_linked_list_insert_after_harness_#t~mem679#1.offset, aws_linked_list_insert_after_harness_~#after~0#1.base, aws_linked_list_insert_after_harness_~#after~0#1.offset, aws_linked_list_insert_after_harness_~#after_next~0#1.base, aws_linked_list_insert_after_harness_~#after_next~0#1.offset, aws_linked_list_insert_after_harness_~#to_add~0#1.base, aws_linked_list_insert_after_harness_~#to_add~0#1.offset;call aws_linked_list_insert_after_harness_~#after~0#1.base, aws_linked_list_insert_after_harness_~#after~0#1.offset := #Ultimate.allocOnStack(16);call aws_linked_list_insert_after_harness_~#after_next~0#1.base, aws_linked_list_insert_after_harness_~#after_next~0#1.offset := #Ultimate.allocOnStack(16);call aws_linked_list_insert_after_harness_~#to_add~0#1.base, aws_linked_list_insert_after_harness_~#to_add~0#1.offset := #Ultimate.allocOnStack(16);call write~$Pointer$(aws_linked_list_insert_after_harness_~#after_next~0#1.base, aws_linked_list_insert_after_harness_~#after_next~0#1.offset, aws_linked_list_insert_after_harness_~#after~0#1.base, aws_linked_list_insert_after_harness_~#after~0#1.offset, 8);call write~$Pointer$(aws_linked_list_insert_after_harness_~#after~0#1.base, aws_linked_list_insert_after_harness_~#after~0#1.offset, aws_linked_list_insert_after_harness_~#after_next~0#1.base, 8 + aws_linked_list_insert_after_harness_~#after_next~0#1.offset, 8);assume { :begin_inline_aws_linked_list_insert_after } true;aws_linked_list_insert_after_#in~after#1.base, aws_linked_list_insert_after_#in~after#1.offset, aws_linked_list_insert_after_#in~to_add#1.base, aws_linked_list_insert_after_#in~to_add#1.offset := aws_linked_list_insert_after_harness_~#after~0#1.base, aws_linked_list_insert_after_harness_~#after~0#1.offset, aws_linked_list_insert_after_harness_~#to_add~0#1.base, aws_linked_list_insert_after_harness_~#to_add~0#1.offset;havoc aws_linked_list_insert_after_#t~ret339#1, aws_linked_list_insert_after_#t~mem340#1.base, aws_linked_list_insert_after_#t~mem340#1.offset, aws_linked_list_insert_after_#t~mem341#1.base, aws_linked_list_insert_after_#t~mem341#1.offset, aws_linked_list_insert_after_#t~ret342#1, aws_linked_list_insert_after_#t~ret343#1, aws_linked_list_insert_after_#t~ret344#1, aws_linked_list_insert_after_#t~mem345#1.base, aws_linked_list_insert_after_#t~mem345#1.offset, aws_linked_list_insert_after_~after#1.base, aws_linked_list_insert_after_~after#1.offset, aws_linked_list_insert_after_~to_add#1.base, aws_linked_list_insert_after_~to_add#1.offset;aws_linked_list_insert_after_~after#1.base, aws_linked_list_insert_after_~after#1.offset := aws_linked_list_insert_after_#in~after#1.base, aws_linked_list_insert_after_#in~after#1.offset;aws_linked_list_insert_after_~to_add#1.base, aws_linked_list_insert_after_~to_add#1.offset := aws_linked_list_insert_after_#in~to_add#1.base, aws_linked_list_insert_after_#in~to_add#1.offset; {1331#(< 1 |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base|)} is VALID [2022-02-20 21:09:54,280 INFO L272 TraceCheckUtils]: 2: Hoare triple {1331#(< 1 |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base|)} call aws_linked_list_insert_after_#t~ret339#1 := aws_linked_list_node_next_is_valid(aws_linked_list_insert_after_~after#1.base, aws_linked_list_insert_after_~after#1.offset); {1293#true} is VALID [2022-02-20 21:09:54,281 INFO L290 TraceCheckUtils]: 3: Hoare triple {1293#true} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short304 := ~node.base != 0 || ~node.offset != 0; {1293#true} is VALID [2022-02-20 21:09:54,281 INFO L290 TraceCheckUtils]: 4: Hoare triple {1293#true} assume #t~short304;call #t~mem303.base, #t~mem303.offset := read~$Pointer$(~node.base, ~node.offset, 8);#t~short304 := #t~mem303.base != 0 || #t~mem303.offset != 0; {1293#true} is VALID [2022-02-20 21:09:54,281 INFO L290 TraceCheckUtils]: 5: Hoare triple {1293#true} #t~short307 := #t~short304; {1293#true} is VALID [2022-02-20 21:09:54,281 INFO L290 TraceCheckUtils]: 6: Hoare triple {1293#true} assume #t~short307;call #t~mem305.base, #t~mem305.offset := read~$Pointer$(~node.base, ~node.offset, 8);call #t~mem306.base, #t~mem306.offset := read~$Pointer$(#t~mem305.base, 8 + #t~mem305.offset, 8);#t~short307 := #t~mem306.base == ~node.base && #t~mem306.offset == ~node.offset; {1293#true} is VALID [2022-02-20 21:09:54,281 INFO L290 TraceCheckUtils]: 7: Hoare triple {1293#true} #res := (if 0 == (if #t~short307 then 1 else 0) then 0 else 1);havoc #t~mem303.base, #t~mem303.offset;havoc #t~short304;havoc #t~mem305.base, #t~mem305.offset;havoc #t~mem306.base, #t~mem306.offset;havoc #t~short307; {1293#true} is VALID [2022-02-20 21:09:54,281 INFO L290 TraceCheckUtils]: 8: Hoare triple {1293#true} assume true; {1293#true} is VALID [2022-02-20 21:09:54,282 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {1293#true} {1331#(< 1 |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base|)} #93#return; {1331#(< 1 |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base|)} is VALID [2022-02-20 21:09:54,282 INFO L272 TraceCheckUtils]: 10: Hoare triple {1331#(< 1 |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base|)} call assume_abort_if_not(aws_linked_list_insert_after_#t~ret339#1); {1293#true} is VALID [2022-02-20 21:09:54,282 INFO L290 TraceCheckUtils]: 11: Hoare triple {1293#true} ~cond := #in~cond; {1293#true} is VALID [2022-02-20 21:09:54,282 INFO L290 TraceCheckUtils]: 12: Hoare triple {1293#true} assume !(0 == ~cond % 256); {1293#true} is VALID [2022-02-20 21:09:54,282 INFO L290 TraceCheckUtils]: 13: Hoare triple {1293#true} assume true; {1293#true} is VALID [2022-02-20 21:09:54,283 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {1293#true} {1331#(< 1 |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base|)} #95#return; {1331#(< 1 |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base|)} is VALID [2022-02-20 21:09:54,287 INFO L290 TraceCheckUtils]: 15: Hoare triple {1331#(< 1 |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base|)} havoc aws_linked_list_insert_after_#t~ret339#1; {1331#(< 1 |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base|)} is VALID [2022-02-20 21:09:54,288 INFO L272 TraceCheckUtils]: 16: Hoare triple {1331#(< 1 |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base|)} call assume_abort_if_not((if 0 == (if aws_linked_list_insert_after_~to_add#1.base != 0 || aws_linked_list_insert_after_~to_add#1.offset != 0 then 1 else 0) then 0 else 1)); {1293#true} is VALID [2022-02-20 21:09:54,288 INFO L290 TraceCheckUtils]: 17: Hoare triple {1293#true} ~cond := #in~cond; {1293#true} is VALID [2022-02-20 21:09:54,288 INFO L290 TraceCheckUtils]: 18: Hoare triple {1293#true} assume !(0 == ~cond % 256); {1293#true} is VALID [2022-02-20 21:09:54,288 INFO L290 TraceCheckUtils]: 19: Hoare triple {1293#true} assume true; {1293#true} is VALID [2022-02-20 21:09:54,290 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1293#true} {1331#(< 1 |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base|)} #97#return; {1331#(< 1 |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base|)} is VALID [2022-02-20 21:09:54,290 INFO L290 TraceCheckUtils]: 21: Hoare triple {1331#(< 1 |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base|)} call write~$Pointer$(aws_linked_list_insert_after_~after#1.base, aws_linked_list_insert_after_~after#1.offset, aws_linked_list_insert_after_~to_add#1.base, 8 + aws_linked_list_insert_after_~to_add#1.offset, 8);call aws_linked_list_insert_after_#t~mem340#1.base, aws_linked_list_insert_after_#t~mem340#1.offset := read~$Pointer$(aws_linked_list_insert_after_~after#1.base, aws_linked_list_insert_after_~after#1.offset, 8);call write~$Pointer$(aws_linked_list_insert_after_#t~mem340#1.base, aws_linked_list_insert_after_#t~mem340#1.offset, aws_linked_list_insert_after_~to_add#1.base, aws_linked_list_insert_after_~to_add#1.offset, 8);havoc aws_linked_list_insert_after_#t~mem340#1.base, aws_linked_list_insert_after_#t~mem340#1.offset;call aws_linked_list_insert_after_#t~mem341#1.base, aws_linked_list_insert_after_#t~mem341#1.offset := read~$Pointer$(aws_linked_list_insert_after_~after#1.base, aws_linked_list_insert_after_~after#1.offset, 8);call write~$Pointer$(aws_linked_list_insert_after_~to_add#1.base, aws_linked_list_insert_after_~to_add#1.offset, aws_linked_list_insert_after_#t~mem341#1.base, 8 + aws_linked_list_insert_after_#t~mem341#1.offset, 8);havoc aws_linked_list_insert_after_#t~mem341#1.base, aws_linked_list_insert_after_#t~mem341#1.offset;call write~$Pointer$(aws_linked_list_insert_after_~to_add#1.base, aws_linked_list_insert_after_~to_add#1.offset, aws_linked_list_insert_after_~after#1.base, aws_linked_list_insert_after_~after#1.offset, 8); {1331#(< 1 |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base|)} is VALID [2022-02-20 21:09:54,290 INFO L272 TraceCheckUtils]: 22: Hoare triple {1331#(< 1 |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base|)} call aws_linked_list_insert_after_#t~ret342#1 := aws_linked_list_node_next_is_valid(aws_linked_list_insert_after_~after#1.base, aws_linked_list_insert_after_~after#1.offset); {1293#true} is VALID [2022-02-20 21:09:54,291 INFO L290 TraceCheckUtils]: 23: Hoare triple {1293#true} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short304 := ~node.base != 0 || ~node.offset != 0; {1398#(or (<= |aws_linked_list_node_next_is_valid_#in~node.base| 0) |aws_linked_list_node_next_is_valid_#t~short304|)} is VALID [2022-02-20 21:09:54,291 INFO L290 TraceCheckUtils]: 24: Hoare triple {1398#(or (<= |aws_linked_list_node_next_is_valid_#in~node.base| 0) |aws_linked_list_node_next_is_valid_#t~short304|)} assume !#t~short304; {1402#(<= |aws_linked_list_node_next_is_valid_#in~node.base| 0)} is VALID [2022-02-20 21:09:54,293 INFO L290 TraceCheckUtils]: 25: Hoare triple {1402#(<= |aws_linked_list_node_next_is_valid_#in~node.base| 0)} #t~short307 := #t~short304; {1402#(<= |aws_linked_list_node_next_is_valid_#in~node.base| 0)} is VALID [2022-02-20 21:09:54,293 INFO L290 TraceCheckUtils]: 26: Hoare triple {1402#(<= |aws_linked_list_node_next_is_valid_#in~node.base| 0)} assume !#t~short307; {1402#(<= |aws_linked_list_node_next_is_valid_#in~node.base| 0)} is VALID [2022-02-20 21:09:54,293 INFO L290 TraceCheckUtils]: 27: Hoare triple {1402#(<= |aws_linked_list_node_next_is_valid_#in~node.base| 0)} #res := (if 0 == (if #t~short307 then 1 else 0) then 0 else 1);havoc #t~mem303.base, #t~mem303.offset;havoc #t~short304;havoc #t~mem305.base, #t~mem305.offset;havoc #t~mem306.base, #t~mem306.offset;havoc #t~short307; {1402#(<= |aws_linked_list_node_next_is_valid_#in~node.base| 0)} is VALID [2022-02-20 21:09:54,293 INFO L290 TraceCheckUtils]: 28: Hoare triple {1402#(<= |aws_linked_list_node_next_is_valid_#in~node.base| 0)} assume true; {1402#(<= |aws_linked_list_node_next_is_valid_#in~node.base| 0)} is VALID [2022-02-20 21:09:54,294 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1402#(<= |aws_linked_list_node_next_is_valid_#in~node.base| 0)} {1331#(< 1 |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base|)} #99#return; {1294#false} is VALID [2022-02-20 21:09:54,295 INFO L272 TraceCheckUtils]: 30: Hoare triple {1294#false} call __VERIFIER_assert(aws_linked_list_insert_after_#t~ret342#1); {1294#false} is VALID [2022-02-20 21:09:54,297 INFO L290 TraceCheckUtils]: 31: Hoare triple {1294#false} ~cond := #in~cond; {1294#false} is VALID [2022-02-20 21:09:54,297 INFO L290 TraceCheckUtils]: 32: Hoare triple {1294#false} assume 0 == ~cond % 256; {1294#false} is VALID [2022-02-20 21:09:54,297 INFO L290 TraceCheckUtils]: 33: Hoare triple {1294#false} assume !false; {1294#false} is VALID [2022-02-20 21:09:54,298 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-20 21:09:54,298 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 21:09:54,299 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1401887610] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:09:54,299 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 21:09:54,299 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 13 [2022-02-20 21:09:54,299 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840034122] [2022-02-20 21:09:54,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:09:54,300 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 34 [2022-02-20 21:09:54,300 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:09:54,301 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 21:09:54,322 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:09:54,322 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 21:09:54,322 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:09:54,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 21:09:54,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-02-20 21:09:54,324 INFO L87 Difference]: Start difference. First operand 71 states and 97 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 21:09:54,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:09:54,739 INFO L93 Difference]: Finished difference Result 141 states and 194 transitions. [2022-02-20 21:09:54,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 21:09:54,739 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 34 [2022-02-20 21:09:54,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:09:54,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 21:09:54,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 160 transitions. [2022-02-20 21:09:54,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 21:09:54,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 160 transitions. [2022-02-20 21:09:54,744 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 160 transitions. [2022-02-20 21:09:54,863 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 160 edges. 160 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:09:54,865 INFO L225 Difference]: With dead ends: 141 [2022-02-20 21:09:54,865 INFO L226 Difference]: Without dead ends: 73 [2022-02-20 21:09:54,866 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2022-02-20 21:09:54,866 INFO L933 BasicCegarLoop]: 58 mSDtfsCounter, 71 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 21:09:54,866 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [71 Valid, 198 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 21:09:54,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-02-20 21:09:54,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 67. [2022-02-20 21:09:54,894 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:09:54,895 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand has 67 states, 40 states have (on average 1.15) internal successors, (46), 42 states have internal predecessors, (46), 20 states have call successors, (20), 5 states have call predecessors, (20), 6 states have return successors, (22), 19 states have call predecessors, (22), 19 states have call successors, (22) [2022-02-20 21:09:54,895 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand has 67 states, 40 states have (on average 1.15) internal successors, (46), 42 states have internal predecessors, (46), 20 states have call successors, (20), 5 states have call predecessors, (20), 6 states have return successors, (22), 19 states have call predecessors, (22), 19 states have call successors, (22) [2022-02-20 21:09:54,895 INFO L87 Difference]: Start difference. First operand 73 states. Second operand has 67 states, 40 states have (on average 1.15) internal successors, (46), 42 states have internal predecessors, (46), 20 states have call successors, (20), 5 states have call predecessors, (20), 6 states have return successors, (22), 19 states have call predecessors, (22), 19 states have call successors, (22) [2022-02-20 21:09:54,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:09:54,898 INFO L93 Difference]: Finished difference Result 73 states and 98 transitions. [2022-02-20 21:09:54,898 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 98 transitions. [2022-02-20 21:09:54,914 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:09:54,914 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:09:54,914 INFO L74 IsIncluded]: Start isIncluded. First operand has 67 states, 40 states have (on average 1.15) internal successors, (46), 42 states have internal predecessors, (46), 20 states have call successors, (20), 5 states have call predecessors, (20), 6 states have return successors, (22), 19 states have call predecessors, (22), 19 states have call successors, (22) Second operand 73 states. [2022-02-20 21:09:54,915 INFO L87 Difference]: Start difference. First operand has 67 states, 40 states have (on average 1.15) internal successors, (46), 42 states have internal predecessors, (46), 20 states have call successors, (20), 5 states have call predecessors, (20), 6 states have return successors, (22), 19 states have call predecessors, (22), 19 states have call successors, (22) Second operand 73 states. [2022-02-20 21:09:54,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:09:54,917 INFO L93 Difference]: Finished difference Result 73 states and 98 transitions. [2022-02-20 21:09:54,917 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 98 transitions. [2022-02-20 21:09:54,918 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:09:54,918 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:09:54,918 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:09:54,918 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:09:54,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 40 states have (on average 1.15) internal successors, (46), 42 states have internal predecessors, (46), 20 states have call successors, (20), 5 states have call predecessors, (20), 6 states have return successors, (22), 19 states have call predecessors, (22), 19 states have call successors, (22) [2022-02-20 21:09:54,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 88 transitions. [2022-02-20 21:09:54,920 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 88 transitions. Word has length 34 [2022-02-20 21:09:54,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:09:54,921 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 88 transitions. [2022-02-20 21:09:54,921 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 21:09:54,921 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 88 transitions. [2022-02-20 21:09:54,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-02-20 21:09:54,921 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:09:54,922 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 21:09:54,941 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-20 21:09:55,135 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 21:09:55,136 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:09:55,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:09:55,137 INFO L85 PathProgramCache]: Analyzing trace with hash -88119081, now seen corresponding path program 1 times [2022-02-20 21:09:55,137 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:09:55,137 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759799621] [2022-02-20 21:09:55,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:09:55,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:09:55,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:09:55,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 21:09:55,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:09:55,427 INFO L290 TraceCheckUtils]: 0: Hoare triple {1865#true} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short304 := ~node.base != 0 || ~node.offset != 0; {1865#true} is VALID [2022-02-20 21:09:55,427 INFO L290 TraceCheckUtils]: 1: Hoare triple {1865#true} assume #t~short304;call #t~mem303.base, #t~mem303.offset := read~$Pointer$(~node.base, ~node.offset, 8);#t~short304 := #t~mem303.base != 0 || #t~mem303.offset != 0; {1865#true} is VALID [2022-02-20 21:09:55,427 INFO L290 TraceCheckUtils]: 2: Hoare triple {1865#true} #t~short307 := #t~short304; {1865#true} is VALID [2022-02-20 21:09:55,427 INFO L290 TraceCheckUtils]: 3: Hoare triple {1865#true} assume #t~short307;call #t~mem305.base, #t~mem305.offset := read~$Pointer$(~node.base, ~node.offset, 8);call #t~mem306.base, #t~mem306.offset := read~$Pointer$(#t~mem305.base, 8 + #t~mem305.offset, 8);#t~short307 := #t~mem306.base == ~node.base && #t~mem306.offset == ~node.offset; {1865#true} is VALID [2022-02-20 21:09:55,427 INFO L290 TraceCheckUtils]: 4: Hoare triple {1865#true} #res := (if 0 == (if #t~short307 then 1 else 0) then 0 else 1);havoc #t~mem303.base, #t~mem303.offset;havoc #t~short304;havoc #t~mem305.base, #t~mem305.offset;havoc #t~mem306.base, #t~mem306.offset;havoc #t~short307; {1865#true} is VALID [2022-02-20 21:09:55,427 INFO L290 TraceCheckUtils]: 5: Hoare triple {1865#true} assume true; {1865#true} is VALID [2022-02-20 21:09:55,428 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1865#true} {1867#(and (= |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_insert_after_~after#1.offset| 0))} #93#return; {1867#(and (= |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_insert_after_~after#1.offset| 0))} is VALID [2022-02-20 21:09:55,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 21:09:55,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:09:55,435 INFO L290 TraceCheckUtils]: 0: Hoare triple {1865#true} ~cond := #in~cond; {1865#true} is VALID [2022-02-20 21:09:55,436 INFO L290 TraceCheckUtils]: 1: Hoare triple {1865#true} assume !(0 == ~cond % 256); {1865#true} is VALID [2022-02-20 21:09:55,436 INFO L290 TraceCheckUtils]: 2: Hoare triple {1865#true} assume true; {1865#true} is VALID [2022-02-20 21:09:55,436 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1865#true} {1867#(and (= |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_insert_after_~after#1.offset| 0))} #95#return; {1867#(and (= |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_insert_after_~after#1.offset| 0))} is VALID [2022-02-20 21:09:55,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-02-20 21:09:55,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:09:55,444 INFO L290 TraceCheckUtils]: 0: Hoare triple {1865#true} ~cond := #in~cond; {1865#true} is VALID [2022-02-20 21:09:55,444 INFO L290 TraceCheckUtils]: 1: Hoare triple {1865#true} assume !(0 == ~cond % 256); {1865#true} is VALID [2022-02-20 21:09:55,444 INFO L290 TraceCheckUtils]: 2: Hoare triple {1865#true} assume true; {1865#true} is VALID [2022-02-20 21:09:55,445 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1865#true} {1867#(and (= |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_insert_after_~after#1.offset| 0))} #97#return; {1867#(and (= |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_insert_after_~after#1.offset| 0))} is VALID [2022-02-20 21:09:55,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-02-20 21:09:55,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:09:55,530 INFO L290 TraceCheckUtils]: 0: Hoare triple {1865#true} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short304 := ~node.base != 0 || ~node.offset != 0; {1907#(and (= aws_linked_list_node_next_is_valid_~node.base |aws_linked_list_node_next_is_valid_#in~node.base|) (= aws_linked_list_node_next_is_valid_~node.offset |aws_linked_list_node_next_is_valid_#in~node.offset|))} is VALID [2022-02-20 21:09:55,530 INFO L290 TraceCheckUtils]: 1: Hoare triple {1907#(and (= aws_linked_list_node_next_is_valid_~node.base |aws_linked_list_node_next_is_valid_#in~node.base|) (= aws_linked_list_node_next_is_valid_~node.offset |aws_linked_list_node_next_is_valid_#in~node.offset|))} assume #t~short304;call #t~mem303.base, #t~mem303.offset := read~$Pointer$(~node.base, ~node.offset, 8);#t~short304 := #t~mem303.base != 0 || #t~mem303.offset != 0; {1907#(and (= aws_linked_list_node_next_is_valid_~node.base |aws_linked_list_node_next_is_valid_#in~node.base|) (= aws_linked_list_node_next_is_valid_~node.offset |aws_linked_list_node_next_is_valid_#in~node.offset|))} is VALID [2022-02-20 21:09:55,531 INFO L290 TraceCheckUtils]: 2: Hoare triple {1907#(and (= aws_linked_list_node_next_is_valid_~node.base |aws_linked_list_node_next_is_valid_#in~node.base|) (= aws_linked_list_node_next_is_valid_~node.offset |aws_linked_list_node_next_is_valid_#in~node.offset|))} #t~short307 := #t~short304; {1907#(and (= aws_linked_list_node_next_is_valid_~node.base |aws_linked_list_node_next_is_valid_#in~node.base|) (= aws_linked_list_node_next_is_valid_~node.offset |aws_linked_list_node_next_is_valid_#in~node.offset|))} is VALID [2022-02-20 21:09:55,532 INFO L290 TraceCheckUtils]: 3: Hoare triple {1907#(and (= aws_linked_list_node_next_is_valid_~node.base |aws_linked_list_node_next_is_valid_#in~node.base|) (= aws_linked_list_node_next_is_valid_~node.offset |aws_linked_list_node_next_is_valid_#in~node.offset|))} assume #t~short307;call #t~mem305.base, #t~mem305.offset := read~$Pointer$(~node.base, ~node.offset, 8);call #t~mem306.base, #t~mem306.offset := read~$Pointer$(#t~mem305.base, 8 + #t~mem305.offset, 8);#t~short307 := #t~mem306.base == ~node.base && #t~mem306.offset == ~node.offset; {1908#(or (not (= (select (select |#memory_$Pointer$.offset| |aws_linked_list_node_next_is_valid_#in~node.base|) |aws_linked_list_node_next_is_valid_#in~node.offset|) 0)) (not |aws_linked_list_node_next_is_valid_#t~short307|) (and (= |aws_linked_list_node_next_is_valid_#in~node.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |aws_linked_list_node_next_is_valid_#in~node.base|) |aws_linked_list_node_next_is_valid_#in~node.offset|)) 8)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |aws_linked_list_node_next_is_valid_#in~node.base|) |aws_linked_list_node_next_is_valid_#in~node.offset|)) 8) |aws_linked_list_node_next_is_valid_#in~node.base|)))} is VALID [2022-02-20 21:09:55,533 INFO L290 TraceCheckUtils]: 4: Hoare triple {1908#(or (not (= (select (select |#memory_$Pointer$.offset| |aws_linked_list_node_next_is_valid_#in~node.base|) |aws_linked_list_node_next_is_valid_#in~node.offset|) 0)) (not |aws_linked_list_node_next_is_valid_#t~short307|) (and (= |aws_linked_list_node_next_is_valid_#in~node.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |aws_linked_list_node_next_is_valid_#in~node.base|) |aws_linked_list_node_next_is_valid_#in~node.offset|)) 8)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |aws_linked_list_node_next_is_valid_#in~node.base|) |aws_linked_list_node_next_is_valid_#in~node.offset|)) 8) |aws_linked_list_node_next_is_valid_#in~node.base|)))} #res := (if 0 == (if #t~short307 then 1 else 0) then 0 else 1);havoc #t~mem303.base, #t~mem303.offset;havoc #t~short304;havoc #t~mem305.base, #t~mem305.offset;havoc #t~mem306.base, #t~mem306.offset;havoc #t~short307; {1909#(or (not (= (select (select |#memory_$Pointer$.offset| |aws_linked_list_node_next_is_valid_#in~node.base|) |aws_linked_list_node_next_is_valid_#in~node.offset|) 0)) (and (= |aws_linked_list_node_next_is_valid_#in~node.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |aws_linked_list_node_next_is_valid_#in~node.base|) |aws_linked_list_node_next_is_valid_#in~node.offset|)) 8)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |aws_linked_list_node_next_is_valid_#in~node.base|) |aws_linked_list_node_next_is_valid_#in~node.offset|)) 8) |aws_linked_list_node_next_is_valid_#in~node.base|)) (and (<= |aws_linked_list_node_next_is_valid_#res| 0) (<= 0 |aws_linked_list_node_next_is_valid_#res|)))} is VALID [2022-02-20 21:09:55,533 INFO L290 TraceCheckUtils]: 5: Hoare triple {1909#(or (not (= (select (select |#memory_$Pointer$.offset| |aws_linked_list_node_next_is_valid_#in~node.base|) |aws_linked_list_node_next_is_valid_#in~node.offset|) 0)) (and (= |aws_linked_list_node_next_is_valid_#in~node.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |aws_linked_list_node_next_is_valid_#in~node.base|) |aws_linked_list_node_next_is_valid_#in~node.offset|)) 8)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |aws_linked_list_node_next_is_valid_#in~node.base|) |aws_linked_list_node_next_is_valid_#in~node.offset|)) 8) |aws_linked_list_node_next_is_valid_#in~node.base|)) (and (<= |aws_linked_list_node_next_is_valid_#res| 0) (<= 0 |aws_linked_list_node_next_is_valid_#res|)))} assume true; {1909#(or (not (= (select (select |#memory_$Pointer$.offset| |aws_linked_list_node_next_is_valid_#in~node.base|) |aws_linked_list_node_next_is_valid_#in~node.offset|) 0)) (and (= |aws_linked_list_node_next_is_valid_#in~node.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |aws_linked_list_node_next_is_valid_#in~node.base|) |aws_linked_list_node_next_is_valid_#in~node.offset|)) 8)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |aws_linked_list_node_next_is_valid_#in~node.base|) |aws_linked_list_node_next_is_valid_#in~node.offset|)) 8) |aws_linked_list_node_next_is_valid_#in~node.base|)) (and (<= |aws_linked_list_node_next_is_valid_#res| 0) (<= 0 |aws_linked_list_node_next_is_valid_#res|)))} is VALID [2022-02-20 21:09:55,535 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1909#(or (not (= (select (select |#memory_$Pointer$.offset| |aws_linked_list_node_next_is_valid_#in~node.base|) |aws_linked_list_node_next_is_valid_#in~node.offset|) 0)) (and (= |aws_linked_list_node_next_is_valid_#in~node.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |aws_linked_list_node_next_is_valid_#in~node.base|) |aws_linked_list_node_next_is_valid_#in~node.offset|)) 8)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |aws_linked_list_node_next_is_valid_#in~node.base|) |aws_linked_list_node_next_is_valid_#in~node.offset|)) 8) |aws_linked_list_node_next_is_valid_#in~node.base|)) (and (<= |aws_linked_list_node_next_is_valid_#res| 0) (<= 0 |aws_linked_list_node_next_is_valid_#res|)))} {1883#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base|) |ULTIMATE.start_aws_linked_list_insert_after_~after#1.offset|) |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.offset|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base|) |ULTIMATE.start_aws_linked_list_insert_after_~after#1.offset|) |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base|) (= |ULTIMATE.start_aws_linked_list_insert_after_~after#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base|) |ULTIMATE.start_aws_linked_list_insert_after_~after#1.offset|) 0))} #99#return; {1891#(and (= |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.offset| 0) (or (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base|) 8)) 0) |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.offset|) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base|) 8)) 0) |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base|) 8) 0)) (and (<= 0 |ULTIMATE.start_aws_linked_list_insert_after_#t~ret342#1|) (<= |ULTIMATE.start_aws_linked_list_insert_after_#t~ret342#1| 0))))} is VALID [2022-02-20 21:09:55,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-02-20 21:09:55,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:09:55,573 INFO L290 TraceCheckUtils]: 0: Hoare triple {1865#true} ~cond := #in~cond; {1910#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-02-20 21:09:55,573 INFO L290 TraceCheckUtils]: 1: Hoare triple {1910#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond % 256); {1911#(or (<= 1 |__VERIFIER_assert_#in~cond|) (<= (+ |__VERIFIER_assert_#in~cond| 1) 0))} is VALID [2022-02-20 21:09:55,574 INFO L290 TraceCheckUtils]: 2: Hoare triple {1911#(or (<= 1 |__VERIFIER_assert_#in~cond|) (<= (+ |__VERIFIER_assert_#in~cond| 1) 0))} assume true; {1911#(or (<= 1 |__VERIFIER_assert_#in~cond|) (<= (+ |__VERIFIER_assert_#in~cond| 1) 0))} is VALID [2022-02-20 21:09:55,575 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1911#(or (<= 1 |__VERIFIER_assert_#in~cond|) (<= (+ |__VERIFIER_assert_#in~cond| 1) 0))} {1891#(and (= |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.offset| 0) (or (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base|) 8)) 0) |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.offset|) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base|) 8)) 0) |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base|) 8) 0)) (and (<= 0 |ULTIMATE.start_aws_linked_list_insert_after_#t~ret342#1|) (<= |ULTIMATE.start_aws_linked_list_insert_after_#t~ret342#1| 0))))} #101#return; {1896#(and (= |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base|) 8)) 0) |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.offset|) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base|) 8)) 0) |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base|) 8) 0))} is VALID [2022-02-20 21:09:55,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-02-20 21:09:55,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:09:55,727 INFO L290 TraceCheckUtils]: 0: Hoare triple {1865#true} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short309 := ~node.base != 0 || ~node.offset != 0; {1912#(or (not (= |aws_linked_list_node_prev_is_valid_#in~node.offset| 0)) (and (= |aws_linked_list_node_prev_is_valid_#in~node.base| aws_linked_list_node_prev_is_valid_~node.base) (= (+ 8 aws_linked_list_node_prev_is_valid_~node.offset) 8)))} is VALID [2022-02-20 21:09:55,728 INFO L290 TraceCheckUtils]: 1: Hoare triple {1912#(or (not (= |aws_linked_list_node_prev_is_valid_#in~node.offset| 0)) (and (= |aws_linked_list_node_prev_is_valid_#in~node.base| aws_linked_list_node_prev_is_valid_~node.base) (= (+ 8 aws_linked_list_node_prev_is_valid_~node.offset) 8)))} assume #t~short309;call #t~mem308.base, #t~mem308.offset := read~$Pointer$(~node.base, 8 + ~node.offset, 8);#t~short309 := #t~mem308.base != 0 || #t~mem308.offset != 0; {1912#(or (not (= |aws_linked_list_node_prev_is_valid_#in~node.offset| 0)) (and (= |aws_linked_list_node_prev_is_valid_#in~node.base| aws_linked_list_node_prev_is_valid_~node.base) (= (+ 8 aws_linked_list_node_prev_is_valid_~node.offset) 8)))} is VALID [2022-02-20 21:09:55,729 INFO L290 TraceCheckUtils]: 2: Hoare triple {1912#(or (not (= |aws_linked_list_node_prev_is_valid_#in~node.offset| 0)) (and (= |aws_linked_list_node_prev_is_valid_#in~node.base| aws_linked_list_node_prev_is_valid_~node.base) (= (+ 8 aws_linked_list_node_prev_is_valid_~node.offset) 8)))} #t~short312 := #t~short309; {1912#(or (not (= |aws_linked_list_node_prev_is_valid_#in~node.offset| 0)) (and (= |aws_linked_list_node_prev_is_valid_#in~node.base| aws_linked_list_node_prev_is_valid_~node.base) (= (+ 8 aws_linked_list_node_prev_is_valid_~node.offset) 8)))} is VALID [2022-02-20 21:09:55,730 INFO L290 TraceCheckUtils]: 3: Hoare triple {1912#(or (not (= |aws_linked_list_node_prev_is_valid_#in~node.offset| 0)) (and (= |aws_linked_list_node_prev_is_valid_#in~node.base| aws_linked_list_node_prev_is_valid_~node.base) (= (+ 8 aws_linked_list_node_prev_is_valid_~node.offset) 8)))} assume #t~short312;call #t~mem310.base, #t~mem310.offset := read~$Pointer$(~node.base, 8 + ~node.offset, 8);call #t~mem311.base, #t~mem311.offset := read~$Pointer$(#t~mem310.base, #t~mem310.offset, 8);#t~short312 := #t~mem311.base == ~node.base && #t~mem311.offset == ~node.offset; {1913#(or (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |aws_linked_list_node_prev_is_valid_#in~node.base|) 8)) 0) 0)) |aws_linked_list_node_prev_is_valid_#t~short312| (not (= (select (select |#memory_$Pointer$.offset| |aws_linked_list_node_prev_is_valid_#in~node.base|) 8) 0)) (not (= |aws_linked_list_node_prev_is_valid_#in~node.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |aws_linked_list_node_prev_is_valid_#in~node.base|) 8)) 0))) (not (= |aws_linked_list_node_prev_is_valid_#in~node.offset| 0)))} is VALID [2022-02-20 21:09:55,731 INFO L290 TraceCheckUtils]: 4: Hoare triple {1913#(or (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |aws_linked_list_node_prev_is_valid_#in~node.base|) 8)) 0) 0)) |aws_linked_list_node_prev_is_valid_#t~short312| (not (= (select (select |#memory_$Pointer$.offset| |aws_linked_list_node_prev_is_valid_#in~node.base|) 8) 0)) (not (= |aws_linked_list_node_prev_is_valid_#in~node.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |aws_linked_list_node_prev_is_valid_#in~node.base|) 8)) 0))) (not (= |aws_linked_list_node_prev_is_valid_#in~node.offset| 0)))} #res := (if 0 == (if #t~short312 then 1 else 0) then 0 else 1);havoc #t~mem308.base, #t~mem308.offset;havoc #t~short309;havoc #t~mem310.base, #t~mem310.offset;havoc #t~mem311.base, #t~mem311.offset;havoc #t~short312; {1914#(or (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |aws_linked_list_node_prev_is_valid_#in~node.base|) 8)) 0) 0)) (not (= (select (select |#memory_$Pointer$.offset| |aws_linked_list_node_prev_is_valid_#in~node.base|) 8) 0)) (not (= |aws_linked_list_node_prev_is_valid_#in~node.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |aws_linked_list_node_prev_is_valid_#in~node.base|) 8)) 0))) (not (= |aws_linked_list_node_prev_is_valid_#in~node.offset| 0)) (and (<= |aws_linked_list_node_prev_is_valid_#res| 1) (<= 1 |aws_linked_list_node_prev_is_valid_#res|)))} is VALID [2022-02-20 21:09:55,731 INFO L290 TraceCheckUtils]: 5: Hoare triple {1914#(or (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |aws_linked_list_node_prev_is_valid_#in~node.base|) 8)) 0) 0)) (not (= (select (select |#memory_$Pointer$.offset| |aws_linked_list_node_prev_is_valid_#in~node.base|) 8) 0)) (not (= |aws_linked_list_node_prev_is_valid_#in~node.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |aws_linked_list_node_prev_is_valid_#in~node.base|) 8)) 0))) (not (= |aws_linked_list_node_prev_is_valid_#in~node.offset| 0)) (and (<= |aws_linked_list_node_prev_is_valid_#res| 1) (<= 1 |aws_linked_list_node_prev_is_valid_#res|)))} assume true; {1914#(or (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |aws_linked_list_node_prev_is_valid_#in~node.base|) 8)) 0) 0)) (not (= (select (select |#memory_$Pointer$.offset| |aws_linked_list_node_prev_is_valid_#in~node.base|) 8) 0)) (not (= |aws_linked_list_node_prev_is_valid_#in~node.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |aws_linked_list_node_prev_is_valid_#in~node.base|) 8)) 0))) (not (= |aws_linked_list_node_prev_is_valid_#in~node.offset| 0)) (and (<= |aws_linked_list_node_prev_is_valid_#res| 1) (<= 1 |aws_linked_list_node_prev_is_valid_#res|)))} is VALID [2022-02-20 21:09:55,733 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1914#(or (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |aws_linked_list_node_prev_is_valid_#in~node.base|) 8)) 0) 0)) (not (= (select (select |#memory_$Pointer$.offset| |aws_linked_list_node_prev_is_valid_#in~node.base|) 8) 0)) (not (= |aws_linked_list_node_prev_is_valid_#in~node.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |aws_linked_list_node_prev_is_valid_#in~node.base|) 8)) 0))) (not (= |aws_linked_list_node_prev_is_valid_#in~node.offset| 0)) (and (<= |aws_linked_list_node_prev_is_valid_#res| 1) (<= 1 |aws_linked_list_node_prev_is_valid_#res|)))} {1896#(and (= |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base|) 8)) 0) |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.offset|) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base|) 8)) 0) |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base|) 8) 0))} #103#return; {1904#(and (<= |ULTIMATE.start_aws_linked_list_insert_after_#t~ret343#1| 1) (<= 1 |ULTIMATE.start_aws_linked_list_insert_after_#t~ret343#1|))} is VALID [2022-02-20 21:09:55,733 INFO L290 TraceCheckUtils]: 0: Hoare triple {1865#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(39, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(78, 4);~#s_can_fail_allocator_static~0.base, ~#s_can_fail_allocator_static~0.offset := 5, 0;call #Ultimate.allocInit(40, 5);call write~init~$Pointer$(#funAddr~s_can_fail_malloc_allocator.base, #funAddr~s_can_fail_malloc_allocator.offset, ~#s_can_fail_allocator_static~0.base, ~#s_can_fail_allocator_static~0.offset, 8);call write~init~$Pointer$(#funAddr~s_can_fail_free_allocator.base, #funAddr~s_can_fail_free_allocator.offset, ~#s_can_fail_allocator_static~0.base, 8 + ~#s_can_fail_allocator_static~0.offset, 8);call write~init~$Pointer$(#funAddr~s_can_fail_realloc_allocator.base, #funAddr~s_can_fail_realloc_allocator.offset, ~#s_can_fail_allocator_static~0.base, 16 + ~#s_can_fail_allocator_static~0.offset, 8);call write~init~$Pointer$(#funAddr~s_can_fail_calloc_allocator.base, #funAddr~s_can_fail_calloc_allocator.offset, ~#s_can_fail_allocator_static~0.base, 24 + ~#s_can_fail_allocator_static~0.offset, 8);call write~init~$Pointer$(0, 0, ~#s_can_fail_allocator_static~0.base, 32 + ~#s_can_fail_allocator_static~0.offset, 8);~tl_last_error~0 := 0; {1865#true} is VALID [2022-02-20 21:09:55,734 INFO L290 TraceCheckUtils]: 1: Hoare triple {1865#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;assume { :begin_inline_aws_linked_list_insert_after_harness } true;havoc aws_linked_list_insert_after_harness_#t~ret674#1, aws_linked_list_insert_after_harness_#t~ret675#1, aws_linked_list_insert_after_harness_#t~ret676#1, aws_linked_list_insert_after_harness_#t~ret677#1, aws_linked_list_insert_after_harness_#t~mem678#1.base, aws_linked_list_insert_after_harness_#t~mem678#1.offset, aws_linked_list_insert_after_harness_#t~mem679#1.base, aws_linked_list_insert_after_harness_#t~mem679#1.offset, aws_linked_list_insert_after_harness_~#after~0#1.base, aws_linked_list_insert_after_harness_~#after~0#1.offset, aws_linked_list_insert_after_harness_~#after_next~0#1.base, aws_linked_list_insert_after_harness_~#after_next~0#1.offset, aws_linked_list_insert_after_harness_~#to_add~0#1.base, aws_linked_list_insert_after_harness_~#to_add~0#1.offset;call aws_linked_list_insert_after_harness_~#after~0#1.base, aws_linked_list_insert_after_harness_~#after~0#1.offset := #Ultimate.allocOnStack(16);call aws_linked_list_insert_after_harness_~#after_next~0#1.base, aws_linked_list_insert_after_harness_~#after_next~0#1.offset := #Ultimate.allocOnStack(16);call aws_linked_list_insert_after_harness_~#to_add~0#1.base, aws_linked_list_insert_after_harness_~#to_add~0#1.offset := #Ultimate.allocOnStack(16);call write~$Pointer$(aws_linked_list_insert_after_harness_~#after_next~0#1.base, aws_linked_list_insert_after_harness_~#after_next~0#1.offset, aws_linked_list_insert_after_harness_~#after~0#1.base, aws_linked_list_insert_after_harness_~#after~0#1.offset, 8);call write~$Pointer$(aws_linked_list_insert_after_harness_~#after~0#1.base, aws_linked_list_insert_after_harness_~#after~0#1.offset, aws_linked_list_insert_after_harness_~#after_next~0#1.base, 8 + aws_linked_list_insert_after_harness_~#after_next~0#1.offset, 8);assume { :begin_inline_aws_linked_list_insert_after } true;aws_linked_list_insert_after_#in~after#1.base, aws_linked_list_insert_after_#in~after#1.offset, aws_linked_list_insert_after_#in~to_add#1.base, aws_linked_list_insert_after_#in~to_add#1.offset := aws_linked_list_insert_after_harness_~#after~0#1.base, aws_linked_list_insert_after_harness_~#after~0#1.offset, aws_linked_list_insert_after_harness_~#to_add~0#1.base, aws_linked_list_insert_after_harness_~#to_add~0#1.offset;havoc aws_linked_list_insert_after_#t~ret339#1, aws_linked_list_insert_after_#t~mem340#1.base, aws_linked_list_insert_after_#t~mem340#1.offset, aws_linked_list_insert_after_#t~mem341#1.base, aws_linked_list_insert_after_#t~mem341#1.offset, aws_linked_list_insert_after_#t~ret342#1, aws_linked_list_insert_after_#t~ret343#1, aws_linked_list_insert_after_#t~ret344#1, aws_linked_list_insert_after_#t~mem345#1.base, aws_linked_list_insert_after_#t~mem345#1.offset, aws_linked_list_insert_after_~after#1.base, aws_linked_list_insert_after_~after#1.offset, aws_linked_list_insert_after_~to_add#1.base, aws_linked_list_insert_after_~to_add#1.offset;aws_linked_list_insert_after_~after#1.base, aws_linked_list_insert_after_~after#1.offset := aws_linked_list_insert_after_#in~after#1.base, aws_linked_list_insert_after_#in~after#1.offset;aws_linked_list_insert_after_~to_add#1.base, aws_linked_list_insert_after_~to_add#1.offset := aws_linked_list_insert_after_#in~to_add#1.base, aws_linked_list_insert_after_#in~to_add#1.offset; {1867#(and (= |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_insert_after_~after#1.offset| 0))} is VALID [2022-02-20 21:09:55,734 INFO L272 TraceCheckUtils]: 2: Hoare triple {1867#(and (= |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_insert_after_~after#1.offset| 0))} call aws_linked_list_insert_after_#t~ret339#1 := aws_linked_list_node_next_is_valid(aws_linked_list_insert_after_~after#1.base, aws_linked_list_insert_after_~after#1.offset); {1865#true} is VALID [2022-02-20 21:09:55,735 INFO L290 TraceCheckUtils]: 3: Hoare triple {1865#true} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short304 := ~node.base != 0 || ~node.offset != 0; {1865#true} is VALID [2022-02-20 21:09:55,735 INFO L290 TraceCheckUtils]: 4: Hoare triple {1865#true} assume #t~short304;call #t~mem303.base, #t~mem303.offset := read~$Pointer$(~node.base, ~node.offset, 8);#t~short304 := #t~mem303.base != 0 || #t~mem303.offset != 0; {1865#true} is VALID [2022-02-20 21:09:55,735 INFO L290 TraceCheckUtils]: 5: Hoare triple {1865#true} #t~short307 := #t~short304; {1865#true} is VALID [2022-02-20 21:09:55,735 INFO L290 TraceCheckUtils]: 6: Hoare triple {1865#true} assume #t~short307;call #t~mem305.base, #t~mem305.offset := read~$Pointer$(~node.base, ~node.offset, 8);call #t~mem306.base, #t~mem306.offset := read~$Pointer$(#t~mem305.base, 8 + #t~mem305.offset, 8);#t~short307 := #t~mem306.base == ~node.base && #t~mem306.offset == ~node.offset; {1865#true} is VALID [2022-02-20 21:09:55,735 INFO L290 TraceCheckUtils]: 7: Hoare triple {1865#true} #res := (if 0 == (if #t~short307 then 1 else 0) then 0 else 1);havoc #t~mem303.base, #t~mem303.offset;havoc #t~short304;havoc #t~mem305.base, #t~mem305.offset;havoc #t~mem306.base, #t~mem306.offset;havoc #t~short307; {1865#true} is VALID [2022-02-20 21:09:55,735 INFO L290 TraceCheckUtils]: 8: Hoare triple {1865#true} assume true; {1865#true} is VALID [2022-02-20 21:09:55,736 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {1865#true} {1867#(and (= |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_insert_after_~after#1.offset| 0))} #93#return; {1867#(and (= |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_insert_after_~after#1.offset| 0))} is VALID [2022-02-20 21:09:55,736 INFO L272 TraceCheckUtils]: 10: Hoare triple {1867#(and (= |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_insert_after_~after#1.offset| 0))} call assume_abort_if_not(aws_linked_list_insert_after_#t~ret339#1); {1865#true} is VALID [2022-02-20 21:09:55,736 INFO L290 TraceCheckUtils]: 11: Hoare triple {1865#true} ~cond := #in~cond; {1865#true} is VALID [2022-02-20 21:09:55,736 INFO L290 TraceCheckUtils]: 12: Hoare triple {1865#true} assume !(0 == ~cond % 256); {1865#true} is VALID [2022-02-20 21:09:55,737 INFO L290 TraceCheckUtils]: 13: Hoare triple {1865#true} assume true; {1865#true} is VALID [2022-02-20 21:09:55,737 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {1865#true} {1867#(and (= |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_insert_after_~after#1.offset| 0))} #95#return; {1867#(and (= |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_insert_after_~after#1.offset| 0))} is VALID [2022-02-20 21:09:55,738 INFO L290 TraceCheckUtils]: 15: Hoare triple {1867#(and (= |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_insert_after_~after#1.offset| 0))} havoc aws_linked_list_insert_after_#t~ret339#1; {1867#(and (= |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_insert_after_~after#1.offset| 0))} is VALID [2022-02-20 21:09:55,738 INFO L272 TraceCheckUtils]: 16: Hoare triple {1867#(and (= |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_insert_after_~after#1.offset| 0))} call assume_abort_if_not((if 0 == (if aws_linked_list_insert_after_~to_add#1.base != 0 || aws_linked_list_insert_after_~to_add#1.offset != 0 then 1 else 0) then 0 else 1)); {1865#true} is VALID [2022-02-20 21:09:55,738 INFO L290 TraceCheckUtils]: 17: Hoare triple {1865#true} ~cond := #in~cond; {1865#true} is VALID [2022-02-20 21:09:55,738 INFO L290 TraceCheckUtils]: 18: Hoare triple {1865#true} assume !(0 == ~cond % 256); {1865#true} is VALID [2022-02-20 21:09:55,738 INFO L290 TraceCheckUtils]: 19: Hoare triple {1865#true} assume true; {1865#true} is VALID [2022-02-20 21:09:55,739 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1865#true} {1867#(and (= |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_insert_after_~after#1.offset| 0))} #97#return; {1867#(and (= |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_insert_after_~after#1.offset| 0))} is VALID [2022-02-20 21:09:55,741 INFO L290 TraceCheckUtils]: 21: Hoare triple {1867#(and (= |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_insert_after_~after#1.offset| 0))} call write~$Pointer$(aws_linked_list_insert_after_~after#1.base, aws_linked_list_insert_after_~after#1.offset, aws_linked_list_insert_after_~to_add#1.base, 8 + aws_linked_list_insert_after_~to_add#1.offset, 8);call aws_linked_list_insert_after_#t~mem340#1.base, aws_linked_list_insert_after_#t~mem340#1.offset := read~$Pointer$(aws_linked_list_insert_after_~after#1.base, aws_linked_list_insert_after_~after#1.offset, 8);call write~$Pointer$(aws_linked_list_insert_after_#t~mem340#1.base, aws_linked_list_insert_after_#t~mem340#1.offset, aws_linked_list_insert_after_~to_add#1.base, aws_linked_list_insert_after_~to_add#1.offset, 8);havoc aws_linked_list_insert_after_#t~mem340#1.base, aws_linked_list_insert_after_#t~mem340#1.offset;call aws_linked_list_insert_after_#t~mem341#1.base, aws_linked_list_insert_after_#t~mem341#1.offset := read~$Pointer$(aws_linked_list_insert_after_~after#1.base, aws_linked_list_insert_after_~after#1.offset, 8);call write~$Pointer$(aws_linked_list_insert_after_~to_add#1.base, aws_linked_list_insert_after_~to_add#1.offset, aws_linked_list_insert_after_#t~mem341#1.base, 8 + aws_linked_list_insert_after_#t~mem341#1.offset, 8);havoc aws_linked_list_insert_after_#t~mem341#1.base, aws_linked_list_insert_after_#t~mem341#1.offset;call write~$Pointer$(aws_linked_list_insert_after_~to_add#1.base, aws_linked_list_insert_after_~to_add#1.offset, aws_linked_list_insert_after_~after#1.base, aws_linked_list_insert_after_~after#1.offset, 8); {1883#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base|) |ULTIMATE.start_aws_linked_list_insert_after_~after#1.offset|) |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.offset|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base|) |ULTIMATE.start_aws_linked_list_insert_after_~after#1.offset|) |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base|) (= |ULTIMATE.start_aws_linked_list_insert_after_~after#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base|) |ULTIMATE.start_aws_linked_list_insert_after_~after#1.offset|) 0))} is VALID [2022-02-20 21:09:55,741 INFO L272 TraceCheckUtils]: 22: Hoare triple {1883#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base|) |ULTIMATE.start_aws_linked_list_insert_after_~after#1.offset|) |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.offset|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base|) |ULTIMATE.start_aws_linked_list_insert_after_~after#1.offset|) |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base|) (= |ULTIMATE.start_aws_linked_list_insert_after_~after#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base|) |ULTIMATE.start_aws_linked_list_insert_after_~after#1.offset|) 0))} call aws_linked_list_insert_after_#t~ret342#1 := aws_linked_list_node_next_is_valid(aws_linked_list_insert_after_~after#1.base, aws_linked_list_insert_after_~after#1.offset); {1865#true} is VALID [2022-02-20 21:09:55,741 INFO L290 TraceCheckUtils]: 23: Hoare triple {1865#true} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short304 := ~node.base != 0 || ~node.offset != 0; {1907#(and (= aws_linked_list_node_next_is_valid_~node.base |aws_linked_list_node_next_is_valid_#in~node.base|) (= aws_linked_list_node_next_is_valid_~node.offset |aws_linked_list_node_next_is_valid_#in~node.offset|))} is VALID [2022-02-20 21:09:55,742 INFO L290 TraceCheckUtils]: 24: Hoare triple {1907#(and (= aws_linked_list_node_next_is_valid_~node.base |aws_linked_list_node_next_is_valid_#in~node.base|) (= aws_linked_list_node_next_is_valid_~node.offset |aws_linked_list_node_next_is_valid_#in~node.offset|))} assume #t~short304;call #t~mem303.base, #t~mem303.offset := read~$Pointer$(~node.base, ~node.offset, 8);#t~short304 := #t~mem303.base != 0 || #t~mem303.offset != 0; {1907#(and (= aws_linked_list_node_next_is_valid_~node.base |aws_linked_list_node_next_is_valid_#in~node.base|) (= aws_linked_list_node_next_is_valid_~node.offset |aws_linked_list_node_next_is_valid_#in~node.offset|))} is VALID [2022-02-20 21:09:55,742 INFO L290 TraceCheckUtils]: 25: Hoare triple {1907#(and (= aws_linked_list_node_next_is_valid_~node.base |aws_linked_list_node_next_is_valid_#in~node.base|) (= aws_linked_list_node_next_is_valid_~node.offset |aws_linked_list_node_next_is_valid_#in~node.offset|))} #t~short307 := #t~short304; {1907#(and (= aws_linked_list_node_next_is_valid_~node.base |aws_linked_list_node_next_is_valid_#in~node.base|) (= aws_linked_list_node_next_is_valid_~node.offset |aws_linked_list_node_next_is_valid_#in~node.offset|))} is VALID [2022-02-20 21:09:55,743 INFO L290 TraceCheckUtils]: 26: Hoare triple {1907#(and (= aws_linked_list_node_next_is_valid_~node.base |aws_linked_list_node_next_is_valid_#in~node.base|) (= aws_linked_list_node_next_is_valid_~node.offset |aws_linked_list_node_next_is_valid_#in~node.offset|))} assume #t~short307;call #t~mem305.base, #t~mem305.offset := read~$Pointer$(~node.base, ~node.offset, 8);call #t~mem306.base, #t~mem306.offset := read~$Pointer$(#t~mem305.base, 8 + #t~mem305.offset, 8);#t~short307 := #t~mem306.base == ~node.base && #t~mem306.offset == ~node.offset; {1908#(or (not (= (select (select |#memory_$Pointer$.offset| |aws_linked_list_node_next_is_valid_#in~node.base|) |aws_linked_list_node_next_is_valid_#in~node.offset|) 0)) (not |aws_linked_list_node_next_is_valid_#t~short307|) (and (= |aws_linked_list_node_next_is_valid_#in~node.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |aws_linked_list_node_next_is_valid_#in~node.base|) |aws_linked_list_node_next_is_valid_#in~node.offset|)) 8)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |aws_linked_list_node_next_is_valid_#in~node.base|) |aws_linked_list_node_next_is_valid_#in~node.offset|)) 8) |aws_linked_list_node_next_is_valid_#in~node.base|)))} is VALID [2022-02-20 21:09:55,744 INFO L290 TraceCheckUtils]: 27: Hoare triple {1908#(or (not (= (select (select |#memory_$Pointer$.offset| |aws_linked_list_node_next_is_valid_#in~node.base|) |aws_linked_list_node_next_is_valid_#in~node.offset|) 0)) (not |aws_linked_list_node_next_is_valid_#t~short307|) (and (= |aws_linked_list_node_next_is_valid_#in~node.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |aws_linked_list_node_next_is_valid_#in~node.base|) |aws_linked_list_node_next_is_valid_#in~node.offset|)) 8)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |aws_linked_list_node_next_is_valid_#in~node.base|) |aws_linked_list_node_next_is_valid_#in~node.offset|)) 8) |aws_linked_list_node_next_is_valid_#in~node.base|)))} #res := (if 0 == (if #t~short307 then 1 else 0) then 0 else 1);havoc #t~mem303.base, #t~mem303.offset;havoc #t~short304;havoc #t~mem305.base, #t~mem305.offset;havoc #t~mem306.base, #t~mem306.offset;havoc #t~short307; {1909#(or (not (= (select (select |#memory_$Pointer$.offset| |aws_linked_list_node_next_is_valid_#in~node.base|) |aws_linked_list_node_next_is_valid_#in~node.offset|) 0)) (and (= |aws_linked_list_node_next_is_valid_#in~node.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |aws_linked_list_node_next_is_valid_#in~node.base|) |aws_linked_list_node_next_is_valid_#in~node.offset|)) 8)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |aws_linked_list_node_next_is_valid_#in~node.base|) |aws_linked_list_node_next_is_valid_#in~node.offset|)) 8) |aws_linked_list_node_next_is_valid_#in~node.base|)) (and (<= |aws_linked_list_node_next_is_valid_#res| 0) (<= 0 |aws_linked_list_node_next_is_valid_#res|)))} is VALID [2022-02-20 21:09:55,744 INFO L290 TraceCheckUtils]: 28: Hoare triple {1909#(or (not (= (select (select |#memory_$Pointer$.offset| |aws_linked_list_node_next_is_valid_#in~node.base|) |aws_linked_list_node_next_is_valid_#in~node.offset|) 0)) (and (= |aws_linked_list_node_next_is_valid_#in~node.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |aws_linked_list_node_next_is_valid_#in~node.base|) |aws_linked_list_node_next_is_valid_#in~node.offset|)) 8)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |aws_linked_list_node_next_is_valid_#in~node.base|) |aws_linked_list_node_next_is_valid_#in~node.offset|)) 8) |aws_linked_list_node_next_is_valid_#in~node.base|)) (and (<= |aws_linked_list_node_next_is_valid_#res| 0) (<= 0 |aws_linked_list_node_next_is_valid_#res|)))} assume true; {1909#(or (not (= (select (select |#memory_$Pointer$.offset| |aws_linked_list_node_next_is_valid_#in~node.base|) |aws_linked_list_node_next_is_valid_#in~node.offset|) 0)) (and (= |aws_linked_list_node_next_is_valid_#in~node.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |aws_linked_list_node_next_is_valid_#in~node.base|) |aws_linked_list_node_next_is_valid_#in~node.offset|)) 8)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |aws_linked_list_node_next_is_valid_#in~node.base|) |aws_linked_list_node_next_is_valid_#in~node.offset|)) 8) |aws_linked_list_node_next_is_valid_#in~node.base|)) (and (<= |aws_linked_list_node_next_is_valid_#res| 0) (<= 0 |aws_linked_list_node_next_is_valid_#res|)))} is VALID [2022-02-20 21:09:55,746 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1909#(or (not (= (select (select |#memory_$Pointer$.offset| |aws_linked_list_node_next_is_valid_#in~node.base|) |aws_linked_list_node_next_is_valid_#in~node.offset|) 0)) (and (= |aws_linked_list_node_next_is_valid_#in~node.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |aws_linked_list_node_next_is_valid_#in~node.base|) |aws_linked_list_node_next_is_valid_#in~node.offset|)) 8)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |aws_linked_list_node_next_is_valid_#in~node.base|) |aws_linked_list_node_next_is_valid_#in~node.offset|)) 8) |aws_linked_list_node_next_is_valid_#in~node.base|)) (and (<= |aws_linked_list_node_next_is_valid_#res| 0) (<= 0 |aws_linked_list_node_next_is_valid_#res|)))} {1883#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base|) |ULTIMATE.start_aws_linked_list_insert_after_~after#1.offset|) |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.offset|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base|) |ULTIMATE.start_aws_linked_list_insert_after_~after#1.offset|) |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base|) (= |ULTIMATE.start_aws_linked_list_insert_after_~after#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base|) |ULTIMATE.start_aws_linked_list_insert_after_~after#1.offset|) 0))} #99#return; {1891#(and (= |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.offset| 0) (or (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base|) 8)) 0) |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.offset|) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base|) 8)) 0) |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base|) 8) 0)) (and (<= 0 |ULTIMATE.start_aws_linked_list_insert_after_#t~ret342#1|) (<= |ULTIMATE.start_aws_linked_list_insert_after_#t~ret342#1| 0))))} is VALID [2022-02-20 21:09:55,746 INFO L272 TraceCheckUtils]: 30: Hoare triple {1891#(and (= |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.offset| 0) (or (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base|) 8)) 0) |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.offset|) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base|) 8)) 0) |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base|) 8) 0)) (and (<= 0 |ULTIMATE.start_aws_linked_list_insert_after_#t~ret342#1|) (<= |ULTIMATE.start_aws_linked_list_insert_after_#t~ret342#1| 0))))} call __VERIFIER_assert(aws_linked_list_insert_after_#t~ret342#1); {1865#true} is VALID [2022-02-20 21:09:55,747 INFO L290 TraceCheckUtils]: 31: Hoare triple {1865#true} ~cond := #in~cond; {1910#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-02-20 21:09:55,747 INFO L290 TraceCheckUtils]: 32: Hoare triple {1910#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond % 256); {1911#(or (<= 1 |__VERIFIER_assert_#in~cond|) (<= (+ |__VERIFIER_assert_#in~cond| 1) 0))} is VALID [2022-02-20 21:09:55,748 INFO L290 TraceCheckUtils]: 33: Hoare triple {1911#(or (<= 1 |__VERIFIER_assert_#in~cond|) (<= (+ |__VERIFIER_assert_#in~cond| 1) 0))} assume true; {1911#(or (<= 1 |__VERIFIER_assert_#in~cond|) (<= (+ |__VERIFIER_assert_#in~cond| 1) 0))} is VALID [2022-02-20 21:09:55,749 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1911#(or (<= 1 |__VERIFIER_assert_#in~cond|) (<= (+ |__VERIFIER_assert_#in~cond| 1) 0))} {1891#(and (= |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.offset| 0) (or (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base|) 8)) 0) |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.offset|) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base|) 8)) 0) |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base|) 8) 0)) (and (<= 0 |ULTIMATE.start_aws_linked_list_insert_after_#t~ret342#1|) (<= |ULTIMATE.start_aws_linked_list_insert_after_#t~ret342#1| 0))))} #101#return; {1896#(and (= |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base|) 8)) 0) |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.offset|) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base|) 8)) 0) |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base|) 8) 0))} is VALID [2022-02-20 21:09:55,749 INFO L290 TraceCheckUtils]: 35: Hoare triple {1896#(and (= |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base|) 8)) 0) |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.offset|) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base|) 8)) 0) |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base|) 8) 0))} havoc aws_linked_list_insert_after_#t~ret342#1; {1896#(and (= |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base|) 8)) 0) |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.offset|) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base|) 8)) 0) |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base|) 8) 0))} is VALID [2022-02-20 21:09:55,750 INFO L272 TraceCheckUtils]: 36: Hoare triple {1896#(and (= |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base|) 8)) 0) |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.offset|) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base|) 8)) 0) |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base|) 8) 0))} call aws_linked_list_insert_after_#t~ret343#1 := aws_linked_list_node_prev_is_valid(aws_linked_list_insert_after_~to_add#1.base, aws_linked_list_insert_after_~to_add#1.offset); {1865#true} is VALID [2022-02-20 21:09:55,750 INFO L290 TraceCheckUtils]: 37: Hoare triple {1865#true} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short309 := ~node.base != 0 || ~node.offset != 0; {1912#(or (not (= |aws_linked_list_node_prev_is_valid_#in~node.offset| 0)) (and (= |aws_linked_list_node_prev_is_valid_#in~node.base| aws_linked_list_node_prev_is_valid_~node.base) (= (+ 8 aws_linked_list_node_prev_is_valid_~node.offset) 8)))} is VALID [2022-02-20 21:09:55,751 INFO L290 TraceCheckUtils]: 38: Hoare triple {1912#(or (not (= |aws_linked_list_node_prev_is_valid_#in~node.offset| 0)) (and (= |aws_linked_list_node_prev_is_valid_#in~node.base| aws_linked_list_node_prev_is_valid_~node.base) (= (+ 8 aws_linked_list_node_prev_is_valid_~node.offset) 8)))} assume #t~short309;call #t~mem308.base, #t~mem308.offset := read~$Pointer$(~node.base, 8 + ~node.offset, 8);#t~short309 := #t~mem308.base != 0 || #t~mem308.offset != 0; {1912#(or (not (= |aws_linked_list_node_prev_is_valid_#in~node.offset| 0)) (and (= |aws_linked_list_node_prev_is_valid_#in~node.base| aws_linked_list_node_prev_is_valid_~node.base) (= (+ 8 aws_linked_list_node_prev_is_valid_~node.offset) 8)))} is VALID [2022-02-20 21:09:55,751 INFO L290 TraceCheckUtils]: 39: Hoare triple {1912#(or (not (= |aws_linked_list_node_prev_is_valid_#in~node.offset| 0)) (and (= |aws_linked_list_node_prev_is_valid_#in~node.base| aws_linked_list_node_prev_is_valid_~node.base) (= (+ 8 aws_linked_list_node_prev_is_valid_~node.offset) 8)))} #t~short312 := #t~short309; {1912#(or (not (= |aws_linked_list_node_prev_is_valid_#in~node.offset| 0)) (and (= |aws_linked_list_node_prev_is_valid_#in~node.base| aws_linked_list_node_prev_is_valid_~node.base) (= (+ 8 aws_linked_list_node_prev_is_valid_~node.offset) 8)))} is VALID [2022-02-20 21:09:55,752 INFO L290 TraceCheckUtils]: 40: Hoare triple {1912#(or (not (= |aws_linked_list_node_prev_is_valid_#in~node.offset| 0)) (and (= |aws_linked_list_node_prev_is_valid_#in~node.base| aws_linked_list_node_prev_is_valid_~node.base) (= (+ 8 aws_linked_list_node_prev_is_valid_~node.offset) 8)))} assume #t~short312;call #t~mem310.base, #t~mem310.offset := read~$Pointer$(~node.base, 8 + ~node.offset, 8);call #t~mem311.base, #t~mem311.offset := read~$Pointer$(#t~mem310.base, #t~mem310.offset, 8);#t~short312 := #t~mem311.base == ~node.base && #t~mem311.offset == ~node.offset; {1913#(or (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |aws_linked_list_node_prev_is_valid_#in~node.base|) 8)) 0) 0)) |aws_linked_list_node_prev_is_valid_#t~short312| (not (= (select (select |#memory_$Pointer$.offset| |aws_linked_list_node_prev_is_valid_#in~node.base|) 8) 0)) (not (= |aws_linked_list_node_prev_is_valid_#in~node.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |aws_linked_list_node_prev_is_valid_#in~node.base|) 8)) 0))) (not (= |aws_linked_list_node_prev_is_valid_#in~node.offset| 0)))} is VALID [2022-02-20 21:09:55,753 INFO L290 TraceCheckUtils]: 41: Hoare triple {1913#(or (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |aws_linked_list_node_prev_is_valid_#in~node.base|) 8)) 0) 0)) |aws_linked_list_node_prev_is_valid_#t~short312| (not (= (select (select |#memory_$Pointer$.offset| |aws_linked_list_node_prev_is_valid_#in~node.base|) 8) 0)) (not (= |aws_linked_list_node_prev_is_valid_#in~node.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |aws_linked_list_node_prev_is_valid_#in~node.base|) 8)) 0))) (not (= |aws_linked_list_node_prev_is_valid_#in~node.offset| 0)))} #res := (if 0 == (if #t~short312 then 1 else 0) then 0 else 1);havoc #t~mem308.base, #t~mem308.offset;havoc #t~short309;havoc #t~mem310.base, #t~mem310.offset;havoc #t~mem311.base, #t~mem311.offset;havoc #t~short312; {1914#(or (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |aws_linked_list_node_prev_is_valid_#in~node.base|) 8)) 0) 0)) (not (= (select (select |#memory_$Pointer$.offset| |aws_linked_list_node_prev_is_valid_#in~node.base|) 8) 0)) (not (= |aws_linked_list_node_prev_is_valid_#in~node.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |aws_linked_list_node_prev_is_valid_#in~node.base|) 8)) 0))) (not (= |aws_linked_list_node_prev_is_valid_#in~node.offset| 0)) (and (<= |aws_linked_list_node_prev_is_valid_#res| 1) (<= 1 |aws_linked_list_node_prev_is_valid_#res|)))} is VALID [2022-02-20 21:09:55,753 INFO L290 TraceCheckUtils]: 42: Hoare triple {1914#(or (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |aws_linked_list_node_prev_is_valid_#in~node.base|) 8)) 0) 0)) (not (= (select (select |#memory_$Pointer$.offset| |aws_linked_list_node_prev_is_valid_#in~node.base|) 8) 0)) (not (= |aws_linked_list_node_prev_is_valid_#in~node.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |aws_linked_list_node_prev_is_valid_#in~node.base|) 8)) 0))) (not (= |aws_linked_list_node_prev_is_valid_#in~node.offset| 0)) (and (<= |aws_linked_list_node_prev_is_valid_#res| 1) (<= 1 |aws_linked_list_node_prev_is_valid_#res|)))} assume true; {1914#(or (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |aws_linked_list_node_prev_is_valid_#in~node.base|) 8)) 0) 0)) (not (= (select (select |#memory_$Pointer$.offset| |aws_linked_list_node_prev_is_valid_#in~node.base|) 8) 0)) (not (= |aws_linked_list_node_prev_is_valid_#in~node.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |aws_linked_list_node_prev_is_valid_#in~node.base|) 8)) 0))) (not (= |aws_linked_list_node_prev_is_valid_#in~node.offset| 0)) (and (<= |aws_linked_list_node_prev_is_valid_#res| 1) (<= 1 |aws_linked_list_node_prev_is_valid_#res|)))} is VALID [2022-02-20 21:09:55,755 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {1914#(or (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |aws_linked_list_node_prev_is_valid_#in~node.base|) 8)) 0) 0)) (not (= (select (select |#memory_$Pointer$.offset| |aws_linked_list_node_prev_is_valid_#in~node.base|) 8) 0)) (not (= |aws_linked_list_node_prev_is_valid_#in~node.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |aws_linked_list_node_prev_is_valid_#in~node.base|) 8)) 0))) (not (= |aws_linked_list_node_prev_is_valid_#in~node.offset| 0)) (and (<= |aws_linked_list_node_prev_is_valid_#res| 1) (<= 1 |aws_linked_list_node_prev_is_valid_#res|)))} {1896#(and (= |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base|) 8)) 0) |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.offset|) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base|) 8)) 0) |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base|) 8) 0))} #103#return; {1904#(and (<= |ULTIMATE.start_aws_linked_list_insert_after_#t~ret343#1| 1) (<= 1 |ULTIMATE.start_aws_linked_list_insert_after_#t~ret343#1|))} is VALID [2022-02-20 21:09:55,755 INFO L272 TraceCheckUtils]: 44: Hoare triple {1904#(and (<= |ULTIMATE.start_aws_linked_list_insert_after_#t~ret343#1| 1) (<= 1 |ULTIMATE.start_aws_linked_list_insert_after_#t~ret343#1|))} call __VERIFIER_assert(aws_linked_list_insert_after_#t~ret343#1); {1905#(and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1))} is VALID [2022-02-20 21:09:55,756 INFO L290 TraceCheckUtils]: 45: Hoare triple {1905#(and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1))} ~cond := #in~cond; {1906#(and (<= (div __VERIFIER_assert_~cond 256) 0) (<= 1 __VERIFIER_assert_~cond))} is VALID [2022-02-20 21:09:55,756 INFO L290 TraceCheckUtils]: 46: Hoare triple {1906#(and (<= (div __VERIFIER_assert_~cond 256) 0) (<= 1 __VERIFIER_assert_~cond))} assume 0 == ~cond % 256; {1866#false} is VALID [2022-02-20 21:09:55,757 INFO L290 TraceCheckUtils]: 47: Hoare triple {1866#false} assume !false; {1866#false} is VALID [2022-02-20 21:09:55,757 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-20 21:09:55,757 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:09:55,757 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759799621] [2022-02-20 21:09:55,757 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759799621] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 21:09:55,758 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1799727888] [2022-02-20 21:09:55,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:09:55,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 21:09:55,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 21:09:55,759 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 21:09:55,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-02-20 21:09:55,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:09:55,956 INFO L263 TraceCheckSpWp]: Trace formula consists of 562 conjuncts, 90 conjunts are in the unsatisfiable core [2022-02-20 21:09:55,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:09:55,983 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 21:09:56,114 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02-20 21:09:56,126 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 21:09:56,127 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 39 [2022-02-20 21:09:56,138 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-02-20 21:09:56,138 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 27 [2022-02-20 21:09:58,231 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_5| Int)) (not (= |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_5| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_5|) 0)))) is different from true [2022-02-20 21:10:00,416 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_6| Int)) (not (= |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_6| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_6|) 0)))) is different from true [2022-02-20 21:10:02,569 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_7| Int)) (not (= |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_7| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_7|) 0)))) is different from true [2022-02-20 21:10:06,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 21:10:06,848 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 81 [2022-02-20 21:10:06,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 21:10:06,885 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 147 treesize of output 117 [2022-02-20 21:10:06,901 WARN L325 FreeRefinementEngine]: Global settings require throwing the following exception [2022-02-20 21:10:06,921 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-02-20 21:10:07,107 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 21:10:07,108 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: v_arrayElimArr_3 at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:285) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:427) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:184) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:166) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:154) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:142) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:126) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:110) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:95) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:90) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:904) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:865) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:783) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:425) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:261) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:247) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:299) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:273) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:145) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:93) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:264) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:177) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:156) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-02-20 21:10:07,111 INFO L158 Benchmark]: Toolchain (without parser) took 19521.23ms. Allocated memory was 83.9MB in the beginning and 188.7MB in the end (delta: 104.9MB). Free memory was 45.1MB in the beginning and 59.6MB in the end (delta: -14.5MB). Peak memory consumption was 89.9MB. Max. memory is 16.1GB. [2022-02-20 21:10:07,111 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 83.9MB. Free memory was 54.4MB in the beginning and 54.3MB in the end (delta: 23.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 21:10:07,111 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1481.50ms. Allocated memory was 83.9MB in the beginning and 130.0MB in the end (delta: 46.1MB). Free memory was 44.9MB in the beginning and 88.3MB in the end (delta: -43.4MB). Peak memory consumption was 38.0MB. Max. memory is 16.1GB. [2022-02-20 21:10:07,112 INFO L158 Benchmark]: Boogie Procedure Inliner took 79.97ms. Allocated memory is still 130.0MB. Free memory was 88.3MB in the beginning and 82.6MB in the end (delta: 5.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-02-20 21:10:07,112 INFO L158 Benchmark]: Boogie Preprocessor took 28.03ms. Allocated memory is still 130.0MB. Free memory was 82.6MB in the beginning and 79.9MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 21:10:07,112 INFO L158 Benchmark]: RCFGBuilder took 441.67ms. Allocated memory is still 130.0MB. Free memory was 79.9MB in the beginning and 57.4MB in the end (delta: 22.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-02-20 21:10:07,112 INFO L158 Benchmark]: TraceAbstraction took 17484.24ms. Allocated memory was 130.0MB in the beginning and 188.7MB in the end (delta: 58.7MB). Free memory was 56.8MB in the beginning and 59.6MB in the end (delta: -2.8MB). Peak memory consumption was 56.3MB. Max. memory is 16.1GB. [2022-02-20 21:10:07,114 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 83.9MB. Free memory was 54.4MB in the beginning and 54.3MB in the end (delta: 23.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1481.50ms. Allocated memory was 83.9MB in the beginning and 130.0MB in the end (delta: 46.1MB). Free memory was 44.9MB in the beginning and 88.3MB in the end (delta: -43.4MB). Peak memory consumption was 38.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 79.97ms. Allocated memory is still 130.0MB. Free memory was 88.3MB in the beginning and 82.6MB in the end (delta: 5.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 28.03ms. Allocated memory is still 130.0MB. Free memory was 82.6MB in the beginning and 79.9MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 441.67ms. Allocated memory is still 130.0MB. Free memory was 79.9MB in the beginning and 57.4MB in the end (delta: 22.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 17484.24ms. Allocated memory was 130.0MB in the beginning and 188.7MB in the end (delta: 58.7MB). Free memory was 56.8MB in the beginning and 59.6MB in the end (delta: -2.8MB). Peak memory consumption was 56.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: v_arrayElimArr_3 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: v_arrayElimArr_3: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:285) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-02-20 21:10:07,131 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/aws-c-common/aws_linked_list_insert_after_harness.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 811b19098d8792ad6e5000a82cea527dd92a4bca0da5ce1bf33c0114316cf54d --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 21:10:08,753 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 21:10:08,756 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 21:10:08,794 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 21:10:08,794 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 21:10:08,797 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 21:10:08,798 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 21:10:08,801 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 21:10:08,803 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 21:10:08,806 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 21:10:08,807 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 21:10:08,808 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 21:10:08,808 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 21:10:08,810 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 21:10:08,811 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 21:10:08,815 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 21:10:08,816 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 21:10:08,816 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 21:10:08,818 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 21:10:08,822 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 21:10:08,823 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 21:10:08,828 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 21:10:08,828 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 21:10:08,830 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 21:10:08,834 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 21:10:08,834 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 21:10:08,835 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 21:10:08,836 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 21:10:08,836 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 21:10:08,837 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 21:10:08,837 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 21:10:08,838 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 21:10:08,839 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 21:10:08,839 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 21:10:08,840 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 21:10:08,840 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 21:10:08,841 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 21:10:08,841 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 21:10:08,841 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 21:10:08,842 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 21:10:08,843 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 21:10:08,846 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2022-02-20 21:10:08,873 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 21:10:08,873 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 21:10:08,874 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 21:10:08,874 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 21:10:08,874 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 21:10:08,875 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 21:10:08,875 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 21:10:08,876 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 21:10:08,876 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 21:10:08,876 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 21:10:08,877 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 21:10:08,877 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 21:10:08,877 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 21:10:08,877 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 21:10:08,877 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 21:10:08,877 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 21:10:08,877 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 21:10:08,878 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 21:10:08,878 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 21:10:08,878 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 21:10:08,878 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 21:10:08,878 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 21:10:08,878 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 21:10:08,878 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 21:10:08,879 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 21:10:08,879 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 21:10:08,879 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 21:10:08,879 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 21:10:08,879 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 21:10:08,879 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 21:10:08,879 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 21:10:08,879 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 21:10:08,880 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 21:10:08,880 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> Automizer 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 -> 811b19098d8792ad6e5000a82cea527dd92a4bca0da5ce1bf33c0114316cf54d [2022-02-20 21:10:09,126 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 21:10:09,144 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 21:10:09,146 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 21:10:09,147 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 21:10:09,148 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 21:10:09,149 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_linked_list_insert_after_harness.i [2022-02-20 21:10:09,197 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33e12cb9a/a821de6b83d04d2cb94182bd80987884/FLAG8c9dcd121 [2022-02-20 21:10:09,740 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 21:10:09,740 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_insert_after_harness.i [2022-02-20 21:10:09,766 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33e12cb9a/a821de6b83d04d2cb94182bd80987884/FLAG8c9dcd121 [2022-02-20 21:10:10,220 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33e12cb9a/a821de6b83d04d2cb94182bd80987884 [2022-02-20 21:10:10,222 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 21:10:10,223 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 21:10:10,225 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 21:10:10,225 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 21:10:10,228 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 21:10:10,228 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 09:10:10" (1/1) ... [2022-02-20 21:10:10,229 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77959a7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:10:10, skipping insertion in model container [2022-02-20 21:10:10,229 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 09:10:10" (1/1) ... [2022-02-20 21:10:10,233 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 21:10:10,298 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 21:10:10,464 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_insert_after_harness.i[4502,4515] [2022-02-20 21:10:10,468 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_insert_after_harness.i[4562,4575] [2022-02-20 21:10:10,859 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:10:10,862 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:10:10,862 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:10:10,863 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:10:10,864 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:10:10,879 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:10:10,880 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:10:10,881 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:10:10,882 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:10:10,890 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:10:10,891 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:10:10,893 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:10:10,894 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:10:11,093 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-02-20 21:10:11,095 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-02-20 21:10:11,099 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-02-20 21:10:11,100 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-02-20 21:10:11,101 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-02-20 21:10:11,101 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-02-20 21:10:11,103 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-02-20 21:10:11,105 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-02-20 21:10:11,106 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-02-20 21:10:11,107 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-02-20 21:10:11,187 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-02-20 21:10:11,204 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 21:10:11,219 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-02-20 21:10:11,243 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 21:10:11,248 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_insert_after_harness.i[4502,4515] [2022-02-20 21:10:11,249 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_insert_after_harness.i[4562,4575] [2022-02-20 21:10:11,291 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:10:11,296 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:10:11,296 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:10:11,297 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:10:11,298 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:10:11,305 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:10:11,311 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:10:11,312 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:10:11,316 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:10:11,317 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:10:11,317 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:10:11,318 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:10:11,318 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:10:11,358 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-02-20 21:10:11,359 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-02-20 21:10:11,359 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-02-20 21:10:11,360 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-02-20 21:10:11,364 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-02-20 21:10:11,365 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-02-20 21:10:11,365 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-02-20 21:10:11,366 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-02-20 21:10:11,366 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-02-20 21:10:11,366 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-02-20 21:10:11,388 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-02-20 21:10:11,408 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 21:10:11,415 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 21:10:11,431 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_insert_after_harness.i[4502,4515] [2022-02-20 21:10:11,436 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_insert_after_harness.i[4562,4575] [2022-02-20 21:10:11,482 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:10:11,482 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:10:11,482 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:10:11,483 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:10:11,483 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:10:11,490 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:10:11,490 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:10:11,492 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:10:11,492 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:10:11,493 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:10:11,493 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:10:11,494 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:10:11,494 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:10:11,520 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-02-20 21:10:11,520 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-02-20 21:10:11,521 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-02-20 21:10:11,521 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-02-20 21:10:11,522 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-02-20 21:10:11,522 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-02-20 21:10:11,523 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-02-20 21:10:11,523 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-02-20 21:10:11,523 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-02-20 21:10:11,524 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-02-20 21:10:11,549 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-02-20 21:10:11,559 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 21:10:11,695 INFO L208 MainTranslator]: Completed translation [2022-02-20 21:10:11,695 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:10:11 WrapperNode [2022-02-20 21:10:11,696 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 21:10:11,697 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 21:10:11,697 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 21:10:11,697 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 21:10:11,701 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:10:11" (1/1) ... [2022-02-20 21:10:11,774 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:10:11" (1/1) ... [2022-02-20 21:10:11,814 INFO L137 Inliner]: procedures = 698, calls = 1048, calls flagged for inlining = 50, calls inlined = 4, statements flattened = 79 [2022-02-20 21:10:11,815 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 21:10:11,816 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 21:10:11,816 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 21:10:11,816 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 21:10:11,822 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:10:11" (1/1) ... [2022-02-20 21:10:11,822 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:10:11" (1/1) ... [2022-02-20 21:10:11,829 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:10:11" (1/1) ... [2022-02-20 21:10:11,829 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:10:11" (1/1) ... [2022-02-20 21:10:11,852 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:10:11" (1/1) ... [2022-02-20 21:10:11,857 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:10:11" (1/1) ... [2022-02-20 21:10:11,860 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:10:11" (1/1) ... [2022-02-20 21:10:11,871 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 21:10:11,874 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 21:10:11,874 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 21:10:11,874 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 21:10:11,875 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:10:11" (1/1) ... [2022-02-20 21:10:11,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 21:10:11,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 21:10:11,908 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 21:10:11,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 21:10:11,936 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 21:10:11,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 21:10:11,937 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-20 21:10:11,937 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-20 21:10:11,937 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2022-02-20 21:10:11,937 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2022-02-20 21:10:11,937 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 21:10:11,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 21:10:11,937 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 21:10:11,937 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 21:10:11,938 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-02-20 21:10:11,938 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-02-20 21:10:11,938 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 21:10:11,938 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 21:10:11,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-02-20 21:10:11,938 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_prev_is_valid [2022-02-20 21:10:11,938 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_prev_is_valid [2022-02-20 21:10:12,110 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 21:10:12,111 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 21:10:12,395 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 21:10:12,400 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 21:10:12,401 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 21:10:12,402 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 09:10:12 BoogieIcfgContainer [2022-02-20 21:10:12,402 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 21:10:12,403 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 21:10:12,403 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 21:10:12,405 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 21:10:12,405 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 09:10:10" (1/3) ... [2022-02-20 21:10:12,406 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f326aaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 09:10:12, skipping insertion in model container [2022-02-20 21:10:12,406 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:10:11" (2/3) ... [2022-02-20 21:10:12,407 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f326aaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 09:10:12, skipping insertion in model container [2022-02-20 21:10:12,407 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 09:10:12" (3/3) ... [2022-02-20 21:10:12,410 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_linked_list_insert_after_harness.i [2022-02-20 21:10:12,413 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 21:10:12,413 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 21:10:12,441 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 21:10:12,445 INFO L339 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=PETRI_NET, 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, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 21:10:12,445 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 21:10:12,457 INFO L276 IsEmpty]: Start isEmpty. Operand has 63 states, 37 states have (on average 1.1891891891891893) internal successors, (44), 38 states have internal predecessors, (44), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-02-20 21:10:12,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-02-20 21:10:12,461 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:10:12,461 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 21:10:12,462 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:10:12,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:10:12,465 INFO L85 PathProgramCache]: Analyzing trace with hash -946824848, now seen corresponding path program 1 times [2022-02-20 21:10:12,474 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 21:10:12,474 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [85563974] [2022-02-20 21:10:12,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:10:12,475 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 21:10:12,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 21:10:12,477 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 21:10:12,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-02-20 21:10:12,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:12,700 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 1 conjunts are in the unsatisfiable core [2022-02-20 21:10:12,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:12,737 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 21:10:12,836 INFO L290 TraceCheckUtils]: 0: Hoare triple {66#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv64, 0bv64;assume 0bv1 == #valid[0bv64];assume ~bvult64(0bv64, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv64, 1bv64);call write~init~intINTTYPE1(48bv8, 1bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 1bv64, 1bv64, 1bv64);call #Ultimate.allocInit(39bv64, 2bv64);call #Ultimate.allocInit(12bv64, 3bv64);call #Ultimate.allocInit(78bv64, 4bv64);~#s_can_fail_allocator_static~0.base, ~#s_can_fail_allocator_static~0.offset := 5bv64, 0bv64;call #Ultimate.allocInit(40bv64, 5bv64);call write~init~$Pointer$(#funAddr~s_can_fail_malloc_allocator.base, #funAddr~s_can_fail_malloc_allocator.offset, ~#s_can_fail_allocator_static~0.base, ~#s_can_fail_allocator_static~0.offset, 8bv64);call write~init~$Pointer$(#funAddr~s_can_fail_free_allocator.base, #funAddr~s_can_fail_free_allocator.offset, ~#s_can_fail_allocator_static~0.base, ~bvadd64(8bv64, ~#s_can_fail_allocator_static~0.offset), 8bv64);call write~init~$Pointer$(#funAddr~s_can_fail_realloc_allocator.base, #funAddr~s_can_fail_realloc_allocator.offset, ~#s_can_fail_allocator_static~0.base, ~bvadd64(16bv64, ~#s_can_fail_allocator_static~0.offset), 8bv64);call write~init~$Pointer$(#funAddr~s_can_fail_calloc_allocator.base, #funAddr~s_can_fail_calloc_allocator.offset, ~#s_can_fail_allocator_static~0.base, ~bvadd64(24bv64, ~#s_can_fail_allocator_static~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#s_can_fail_allocator_static~0.base, ~bvadd64(32bv64, ~#s_can_fail_allocator_static~0.offset), 8bv64);~tl_last_error~0 := 0bv32; {66#true} is VALID [2022-02-20 21:10:12,837 INFO L290 TraceCheckUtils]: 1: Hoare triple {66#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;assume { :begin_inline_aws_linked_list_insert_after_harness } true;havoc aws_linked_list_insert_after_harness_#t~ret674#1, aws_linked_list_insert_after_harness_#t~ret675#1, aws_linked_list_insert_after_harness_#t~ret676#1, aws_linked_list_insert_after_harness_#t~ret677#1, aws_linked_list_insert_after_harness_#t~mem678#1.base, aws_linked_list_insert_after_harness_#t~mem678#1.offset, aws_linked_list_insert_after_harness_#t~mem679#1.base, aws_linked_list_insert_after_harness_#t~mem679#1.offset, aws_linked_list_insert_after_harness_~#after~0#1.base, aws_linked_list_insert_after_harness_~#after~0#1.offset, aws_linked_list_insert_after_harness_~#after_next~0#1.base, aws_linked_list_insert_after_harness_~#after_next~0#1.offset, aws_linked_list_insert_after_harness_~#to_add~0#1.base, aws_linked_list_insert_after_harness_~#to_add~0#1.offset;call aws_linked_list_insert_after_harness_~#after~0#1.base, aws_linked_list_insert_after_harness_~#after~0#1.offset := #Ultimate.allocOnStack(16bv64);call aws_linked_list_insert_after_harness_~#after_next~0#1.base, aws_linked_list_insert_after_harness_~#after_next~0#1.offset := #Ultimate.allocOnStack(16bv64);call aws_linked_list_insert_after_harness_~#to_add~0#1.base, aws_linked_list_insert_after_harness_~#to_add~0#1.offset := #Ultimate.allocOnStack(16bv64);call write~$Pointer$(aws_linked_list_insert_after_harness_~#after_next~0#1.base, aws_linked_list_insert_after_harness_~#after_next~0#1.offset, aws_linked_list_insert_after_harness_~#after~0#1.base, aws_linked_list_insert_after_harness_~#after~0#1.offset, 8bv64);call write~$Pointer$(aws_linked_list_insert_after_harness_~#after~0#1.base, aws_linked_list_insert_after_harness_~#after~0#1.offset, aws_linked_list_insert_after_harness_~#after_next~0#1.base, ~bvadd64(8bv64, aws_linked_list_insert_after_harness_~#after_next~0#1.offset), 8bv64);assume { :begin_inline_aws_linked_list_insert_after } true;aws_linked_list_insert_after_#in~after#1.base, aws_linked_list_insert_after_#in~after#1.offset, aws_linked_list_insert_after_#in~to_add#1.base, aws_linked_list_insert_after_#in~to_add#1.offset := aws_linked_list_insert_after_harness_~#after~0#1.base, aws_linked_list_insert_after_harness_~#after~0#1.offset, aws_linked_list_insert_after_harness_~#to_add~0#1.base, aws_linked_list_insert_after_harness_~#to_add~0#1.offset;havoc aws_linked_list_insert_after_#t~ret339#1, aws_linked_list_insert_after_#t~mem340#1.base, aws_linked_list_insert_after_#t~mem340#1.offset, aws_linked_list_insert_after_#t~mem341#1.base, aws_linked_list_insert_after_#t~mem341#1.offset, aws_linked_list_insert_after_#t~ret342#1, aws_linked_list_insert_after_#t~ret343#1, aws_linked_list_insert_after_#t~ret344#1, aws_linked_list_insert_after_#t~mem345#1.base, aws_linked_list_insert_after_#t~mem345#1.offset, aws_linked_list_insert_after_~after#1.base, aws_linked_list_insert_after_~after#1.offset, aws_linked_list_insert_after_~to_add#1.base, aws_linked_list_insert_after_~to_add#1.offset;aws_linked_list_insert_after_~after#1.base, aws_linked_list_insert_after_~after#1.offset := aws_linked_list_insert_after_#in~after#1.base, aws_linked_list_insert_after_#in~after#1.offset;aws_linked_list_insert_after_~to_add#1.base, aws_linked_list_insert_after_~to_add#1.offset := aws_linked_list_insert_after_#in~to_add#1.base, aws_linked_list_insert_after_#in~to_add#1.offset; {66#true} is VALID [2022-02-20 21:10:12,837 INFO L272 TraceCheckUtils]: 2: Hoare triple {66#true} call aws_linked_list_insert_after_#t~ret339#1 := aws_linked_list_node_next_is_valid(aws_linked_list_insert_after_~after#1.base, aws_linked_list_insert_after_~after#1.offset); {66#true} is VALID [2022-02-20 21:10:12,837 INFO L290 TraceCheckUtils]: 3: Hoare triple {66#true} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short304 := ~node.base != 0bv64 || ~node.offset != 0bv64; {66#true} is VALID [2022-02-20 21:10:12,838 INFO L290 TraceCheckUtils]: 4: Hoare triple {66#true} assume #t~short304;call #t~mem303.base, #t~mem303.offset := read~$Pointer$(~node.base, ~node.offset, 8bv64);#t~short304 := #t~mem303.base != 0bv64 || #t~mem303.offset != 0bv64; {66#true} is VALID [2022-02-20 21:10:12,838 INFO L290 TraceCheckUtils]: 5: Hoare triple {66#true} #t~short307 := #t~short304; {66#true} is VALID [2022-02-20 21:10:12,838 INFO L290 TraceCheckUtils]: 6: Hoare triple {66#true} assume #t~short307;call #t~mem305.base, #t~mem305.offset := read~$Pointer$(~node.base, ~node.offset, 8bv64);call #t~mem306.base, #t~mem306.offset := read~$Pointer$(#t~mem305.base, ~bvadd64(8bv64, #t~mem305.offset), 8bv64);#t~short307 := #t~mem306.base == ~node.base && #t~mem306.offset == ~node.offset; {66#true} is VALID [2022-02-20 21:10:12,838 INFO L290 TraceCheckUtils]: 7: Hoare triple {66#true} #res := (if 0bv32 == (if #t~short307 then 1bv32 else 0bv32) then 0bv8 else 1bv8);havoc #t~mem303.base, #t~mem303.offset;havoc #t~short304;havoc #t~mem305.base, #t~mem305.offset;havoc #t~mem306.base, #t~mem306.offset;havoc #t~short307; {66#true} is VALID [2022-02-20 21:10:12,838 INFO L290 TraceCheckUtils]: 8: Hoare triple {66#true} assume true; {66#true} is VALID [2022-02-20 21:10:12,839 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {66#true} {66#true} #93#return; {66#true} is VALID [2022-02-20 21:10:12,839 INFO L272 TraceCheckUtils]: 10: Hoare triple {66#true} call assume_abort_if_not(aws_linked_list_insert_after_#t~ret339#1); {66#true} is VALID [2022-02-20 21:10:12,839 INFO L290 TraceCheckUtils]: 11: Hoare triple {66#true} ~cond := #in~cond; {66#true} is VALID [2022-02-20 21:10:12,840 INFO L290 TraceCheckUtils]: 12: Hoare triple {66#true} assume 0bv8 == ~cond;assume false; {67#false} is VALID [2022-02-20 21:10:12,840 INFO L290 TraceCheckUtils]: 13: Hoare triple {67#false} assume true; {67#false} is VALID [2022-02-20 21:10:12,840 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {67#false} {66#true} #95#return; {67#false} is VALID [2022-02-20 21:10:12,840 INFO L290 TraceCheckUtils]: 15: Hoare triple {67#false} havoc aws_linked_list_insert_after_#t~ret339#1; {67#false} is VALID [2022-02-20 21:10:12,840 INFO L272 TraceCheckUtils]: 16: Hoare triple {67#false} call assume_abort_if_not((if 0bv32 == (if aws_linked_list_insert_after_~to_add#1.base != 0bv64 || aws_linked_list_insert_after_~to_add#1.offset != 0bv64 then 1bv32 else 0bv32) then 0bv8 else 1bv8)); {67#false} is VALID [2022-02-20 21:10:12,841 INFO L290 TraceCheckUtils]: 17: Hoare triple {67#false} ~cond := #in~cond; {67#false} is VALID [2022-02-20 21:10:12,841 INFO L290 TraceCheckUtils]: 18: Hoare triple {67#false} assume 0bv8 == ~cond;assume false; {67#false} is VALID [2022-02-20 21:10:12,841 INFO L290 TraceCheckUtils]: 19: Hoare triple {67#false} assume true; {67#false} is VALID [2022-02-20 21:10:12,841 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {67#false} {67#false} #97#return; {67#false} is VALID [2022-02-20 21:10:12,841 INFO L290 TraceCheckUtils]: 21: Hoare triple {67#false} call write~$Pointer$(aws_linked_list_insert_after_~after#1.base, aws_linked_list_insert_after_~after#1.offset, aws_linked_list_insert_after_~to_add#1.base, ~bvadd64(8bv64, aws_linked_list_insert_after_~to_add#1.offset), 8bv64);call aws_linked_list_insert_after_#t~mem340#1.base, aws_linked_list_insert_after_#t~mem340#1.offset := read~$Pointer$(aws_linked_list_insert_after_~after#1.base, aws_linked_list_insert_after_~after#1.offset, 8bv64);call write~$Pointer$(aws_linked_list_insert_after_#t~mem340#1.base, aws_linked_list_insert_after_#t~mem340#1.offset, aws_linked_list_insert_after_~to_add#1.base, aws_linked_list_insert_after_~to_add#1.offset, 8bv64);havoc aws_linked_list_insert_after_#t~mem340#1.base, aws_linked_list_insert_after_#t~mem340#1.offset;call aws_linked_list_insert_after_#t~mem341#1.base, aws_linked_list_insert_after_#t~mem341#1.offset := read~$Pointer$(aws_linked_list_insert_after_~after#1.base, aws_linked_list_insert_after_~after#1.offset, 8bv64);call write~$Pointer$(aws_linked_list_insert_after_~to_add#1.base, aws_linked_list_insert_after_~to_add#1.offset, aws_linked_list_insert_after_#t~mem341#1.base, ~bvadd64(8bv64, aws_linked_list_insert_after_#t~mem341#1.offset), 8bv64);havoc aws_linked_list_insert_after_#t~mem341#1.base, aws_linked_list_insert_after_#t~mem341#1.offset;call write~$Pointer$(aws_linked_list_insert_after_~to_add#1.base, aws_linked_list_insert_after_~to_add#1.offset, aws_linked_list_insert_after_~after#1.base, aws_linked_list_insert_after_~after#1.offset, 8bv64); {67#false} is VALID [2022-02-20 21:10:12,842 INFO L272 TraceCheckUtils]: 22: Hoare triple {67#false} call aws_linked_list_insert_after_#t~ret342#1 := aws_linked_list_node_next_is_valid(aws_linked_list_insert_after_~after#1.base, aws_linked_list_insert_after_~after#1.offset); {67#false} is VALID [2022-02-20 21:10:12,842 INFO L290 TraceCheckUtils]: 23: Hoare triple {67#false} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short304 := ~node.base != 0bv64 || ~node.offset != 0bv64; {67#false} is VALID [2022-02-20 21:10:12,842 INFO L290 TraceCheckUtils]: 24: Hoare triple {67#false} assume #t~short304;call #t~mem303.base, #t~mem303.offset := read~$Pointer$(~node.base, ~node.offset, 8bv64);#t~short304 := #t~mem303.base != 0bv64 || #t~mem303.offset != 0bv64; {67#false} is VALID [2022-02-20 21:10:12,842 INFO L290 TraceCheckUtils]: 25: Hoare triple {67#false} #t~short307 := #t~short304; {67#false} is VALID [2022-02-20 21:10:12,842 INFO L290 TraceCheckUtils]: 26: Hoare triple {67#false} assume #t~short307;call #t~mem305.base, #t~mem305.offset := read~$Pointer$(~node.base, ~node.offset, 8bv64);call #t~mem306.base, #t~mem306.offset := read~$Pointer$(#t~mem305.base, ~bvadd64(8bv64, #t~mem305.offset), 8bv64);#t~short307 := #t~mem306.base == ~node.base && #t~mem306.offset == ~node.offset; {67#false} is VALID [2022-02-20 21:10:12,843 INFO L290 TraceCheckUtils]: 27: Hoare triple {67#false} #res := (if 0bv32 == (if #t~short307 then 1bv32 else 0bv32) then 0bv8 else 1bv8);havoc #t~mem303.base, #t~mem303.offset;havoc #t~short304;havoc #t~mem305.base, #t~mem305.offset;havoc #t~mem306.base, #t~mem306.offset;havoc #t~short307; {67#false} is VALID [2022-02-20 21:10:12,843 INFO L290 TraceCheckUtils]: 28: Hoare triple {67#false} assume true; {67#false} is VALID [2022-02-20 21:10:12,843 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {67#false} {67#false} #99#return; {67#false} is VALID [2022-02-20 21:10:12,843 INFO L272 TraceCheckUtils]: 30: Hoare triple {67#false} call __VERIFIER_assert(aws_linked_list_insert_after_#t~ret342#1); {67#false} is VALID [2022-02-20 21:10:12,843 INFO L290 TraceCheckUtils]: 31: Hoare triple {67#false} ~cond := #in~cond; {67#false} is VALID [2022-02-20 21:10:12,844 INFO L290 TraceCheckUtils]: 32: Hoare triple {67#false} assume 0bv8 == ~cond; {67#false} is VALID [2022-02-20 21:10:12,844 INFO L290 TraceCheckUtils]: 33: Hoare triple {67#false} assume !false; {67#false} is VALID [2022-02-20 21:10:12,845 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 21:10:12,845 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 21:10:12,845 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 21:10:12,845 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [85563974] [2022-02-20 21:10:12,846 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [85563974] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:10:12,846 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:10:12,846 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 21:10:12,847 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633925749] [2022-02-20 21:10:12,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:10:12,851 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 34 [2022-02-20 21:10:12,852 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:10:12,854 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 21:10:12,893 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:10:12,894 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 21:10:12,894 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 21:10:12,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 21:10:12,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 21:10:12,909 INFO L87 Difference]: Start difference. First operand has 63 states, 37 states have (on average 1.1891891891891893) internal successors, (44), 38 states have internal predecessors, (44), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 21:10:13,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:10:13,060 INFO L93 Difference]: Finished difference Result 122 states and 174 transitions. [2022-02-20 21:10:13,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 21:10:13,060 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 34 [2022-02-20 21:10:13,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:10:13,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 21:10:13,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 174 transitions. [2022-02-20 21:10:13,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 21:10:13,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 174 transitions. [2022-02-20 21:10:13,075 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 174 transitions. [2022-02-20 21:10:13,244 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 174 edges. 174 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:10:13,253 INFO L225 Difference]: With dead ends: 122 [2022-02-20 21:10:13,254 INFO L226 Difference]: Without dead ends: 58 [2022-02-20 21:10:13,256 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 21:10:13,258 INFO L933 BasicCegarLoop]: 82 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 21:10:13,259 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 21:10:13,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-02-20 21:10:13,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2022-02-20 21:10:13,280 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:10:13,281 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand has 58 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 34 states have internal predecessors, (38), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-02-20 21:10:13,282 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand has 58 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 34 states have internal predecessors, (38), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-02-20 21:10:13,282 INFO L87 Difference]: Start difference. First operand 58 states. Second operand has 58 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 34 states have internal predecessors, (38), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-02-20 21:10:13,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:10:13,287 INFO L93 Difference]: Finished difference Result 58 states and 77 transitions. [2022-02-20 21:10:13,287 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 77 transitions. [2022-02-20 21:10:13,288 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:10:13,289 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:10:13,289 INFO L74 IsIncluded]: Start isIncluded. First operand has 58 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 34 states have internal predecessors, (38), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand 58 states. [2022-02-20 21:10:13,289 INFO L87 Difference]: Start difference. First operand has 58 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 34 states have internal predecessors, (38), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand 58 states. [2022-02-20 21:10:13,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:10:13,293 INFO L93 Difference]: Finished difference Result 58 states and 77 transitions. [2022-02-20 21:10:13,293 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 77 transitions. [2022-02-20 21:10:13,294 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:10:13,294 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:10:13,295 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:10:13,295 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:10:13,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 34 states have internal predecessors, (38), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-02-20 21:10:13,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 77 transitions. [2022-02-20 21:10:13,299 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 77 transitions. Word has length 34 [2022-02-20 21:10:13,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:10:13,299 INFO L470 AbstractCegarLoop]: Abstraction has 58 states and 77 transitions. [2022-02-20 21:10:13,299 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 21:10:13,300 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 77 transitions. [2022-02-20 21:10:13,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-02-20 21:10:13,300 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:10:13,301 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 21:10:13,314 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-02-20 21:10:13,513 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 21:10:13,514 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:10:13,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:10:13,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1749038484, now seen corresponding path program 1 times [2022-02-20 21:10:13,515 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 21:10:13,515 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [338418554] [2022-02-20 21:10:13,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:10:13,516 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 21:10:13,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 21:10:13,517 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 21:10:13,518 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-02-20 21:10:13,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:14,026 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 141 conjunts are in the unsatisfiable core [2022-02-20 21:10:14,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:14,070 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 21:10:14,160 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02-20 21:10:14,182 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-02-20 21:10:14,182 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 28 [2022-02-20 21:10:14,209 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 21:10:14,209 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2022-02-20 21:10:16,273 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_1| (_ BitVec 64))) (not (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_1|) (_ bv0 64)) |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_1|))) is different from true [2022-02-20 21:10:18,397 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_2| (_ BitVec 64))) (not (= |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_2| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_2|) (_ bv0 64))))) is different from true [2022-02-20 21:10:20,510 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_3| (_ BitVec 64))) (not (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_3|) (_ bv0 64)) |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_3|))) is different from true [2022-02-20 21:10:20,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 21:10:21,150 INFO L356 Elim1Store]: treesize reduction 275, result has 15.6 percent of original size [2022-02-20 21:10:21,151 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 371 treesize of output 246 [2022-02-20 21:10:21,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 21:10:21,176 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 189 treesize of output 71 [2022-02-20 21:10:22,514 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 21:10:23,016 INFO L356 Elim1Store]: treesize reduction 130, result has 50.0 percent of original size [2022-02-20 21:10:23,017 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 1 disjoint index pairs (out of 36 index pairs), introduced 15 new quantified variables, introduced 36 case distinctions, treesize of input 289 treesize of output 272 [2022-02-20 21:10:23,317 INFO L356 Elim1Store]: treesize reduction 161, result has 14.8 percent of original size [2022-02-20 21:10:23,317 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 7 disjoint index pairs (out of 36 index pairs), introduced 12 new quantified variables, introduced 22 case distinctions, treesize of input 217 treesize of output 167 [2022-02-20 21:10:23,593 INFO L290 TraceCheckUtils]: 0: Hoare triple {537#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv64, 0bv64;assume 0bv1 == #valid[0bv64];assume ~bvult64(0bv64, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv64, 1bv64);call write~init~intINTTYPE1(48bv8, 1bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 1bv64, 1bv64, 1bv64);call #Ultimate.allocInit(39bv64, 2bv64);call #Ultimate.allocInit(12bv64, 3bv64);call #Ultimate.allocInit(78bv64, 4bv64);~#s_can_fail_allocator_static~0.base, ~#s_can_fail_allocator_static~0.offset := 5bv64, 0bv64;call #Ultimate.allocInit(40bv64, 5bv64);call write~init~$Pointer$(#funAddr~s_can_fail_malloc_allocator.base, #funAddr~s_can_fail_malloc_allocator.offset, ~#s_can_fail_allocator_static~0.base, ~#s_can_fail_allocator_static~0.offset, 8bv64);call write~init~$Pointer$(#funAddr~s_can_fail_free_allocator.base, #funAddr~s_can_fail_free_allocator.offset, ~#s_can_fail_allocator_static~0.base, ~bvadd64(8bv64, ~#s_can_fail_allocator_static~0.offset), 8bv64);call write~init~$Pointer$(#funAddr~s_can_fail_realloc_allocator.base, #funAddr~s_can_fail_realloc_allocator.offset, ~#s_can_fail_allocator_static~0.base, ~bvadd64(16bv64, ~#s_can_fail_allocator_static~0.offset), 8bv64);call write~init~$Pointer$(#funAddr~s_can_fail_calloc_allocator.base, #funAddr~s_can_fail_calloc_allocator.offset, ~#s_can_fail_allocator_static~0.base, ~bvadd64(24bv64, ~#s_can_fail_allocator_static~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#s_can_fail_allocator_static~0.base, ~bvadd64(32bv64, ~#s_can_fail_allocator_static~0.offset), 8bv64);~tl_last_error~0 := 0bv32; {537#true} is VALID [2022-02-20 21:10:23,598 INFO L290 TraceCheckUtils]: 1: Hoare triple {537#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;assume { :begin_inline_aws_linked_list_insert_after_harness } true;havoc aws_linked_list_insert_after_harness_#t~ret674#1, aws_linked_list_insert_after_harness_#t~ret675#1, aws_linked_list_insert_after_harness_#t~ret676#1, aws_linked_list_insert_after_harness_#t~ret677#1, aws_linked_list_insert_after_harness_#t~mem678#1.base, aws_linked_list_insert_after_harness_#t~mem678#1.offset, aws_linked_list_insert_after_harness_#t~mem679#1.base, aws_linked_list_insert_after_harness_#t~mem679#1.offset, aws_linked_list_insert_after_harness_~#after~0#1.base, aws_linked_list_insert_after_harness_~#after~0#1.offset, aws_linked_list_insert_after_harness_~#after_next~0#1.base, aws_linked_list_insert_after_harness_~#after_next~0#1.offset, aws_linked_list_insert_after_harness_~#to_add~0#1.base, aws_linked_list_insert_after_harness_~#to_add~0#1.offset;call aws_linked_list_insert_after_harness_~#after~0#1.base, aws_linked_list_insert_after_harness_~#after~0#1.offset := #Ultimate.allocOnStack(16bv64);call aws_linked_list_insert_after_harness_~#after_next~0#1.base, aws_linked_list_insert_after_harness_~#after_next~0#1.offset := #Ultimate.allocOnStack(16bv64);call aws_linked_list_insert_after_harness_~#to_add~0#1.base, aws_linked_list_insert_after_harness_~#to_add~0#1.offset := #Ultimate.allocOnStack(16bv64);call write~$Pointer$(aws_linked_list_insert_after_harness_~#after_next~0#1.base, aws_linked_list_insert_after_harness_~#after_next~0#1.offset, aws_linked_list_insert_after_harness_~#after~0#1.base, aws_linked_list_insert_after_harness_~#after~0#1.offset, 8bv64);call write~$Pointer$(aws_linked_list_insert_after_harness_~#after~0#1.base, aws_linked_list_insert_after_harness_~#after~0#1.offset, aws_linked_list_insert_after_harness_~#after_next~0#1.base, ~bvadd64(8bv64, aws_linked_list_insert_after_harness_~#after_next~0#1.offset), 8bv64);assume { :begin_inline_aws_linked_list_insert_after } true;aws_linked_list_insert_after_#in~after#1.base, aws_linked_list_insert_after_#in~after#1.offset, aws_linked_list_insert_after_#in~to_add#1.base, aws_linked_list_insert_after_#in~to_add#1.offset := aws_linked_list_insert_after_harness_~#after~0#1.base, aws_linked_list_insert_after_harness_~#after~0#1.offset, aws_linked_list_insert_after_harness_~#to_add~0#1.base, aws_linked_list_insert_after_harness_~#to_add~0#1.offset;havoc aws_linked_list_insert_after_#t~ret339#1, aws_linked_list_insert_after_#t~mem340#1.base, aws_linked_list_insert_after_#t~mem340#1.offset, aws_linked_list_insert_after_#t~mem341#1.base, aws_linked_list_insert_after_#t~mem341#1.offset, aws_linked_list_insert_after_#t~ret342#1, aws_linked_list_insert_after_#t~ret343#1, aws_linked_list_insert_after_#t~ret344#1, aws_linked_list_insert_after_#t~mem345#1.base, aws_linked_list_insert_after_#t~mem345#1.offset, aws_linked_list_insert_after_~after#1.base, aws_linked_list_insert_after_~after#1.offset, aws_linked_list_insert_after_~to_add#1.base, aws_linked_list_insert_after_~to_add#1.offset;aws_linked_list_insert_after_~after#1.base, aws_linked_list_insert_after_~after#1.offset := aws_linked_list_insert_after_#in~after#1.base, aws_linked_list_insert_after_#in~after#1.offset;aws_linked_list_insert_after_~to_add#1.base, aws_linked_list_insert_after_~to_add#1.offset := aws_linked_list_insert_after_#in~to_add#1.base, aws_linked_list_insert_after_#in~to_add#1.offset; {545#(and (not (= |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base| |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base|) (_ bv0 64)) |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base|)) (= (_ bv0 64) |ULTIMATE.start_aws_linked_list_insert_after_~after#1.offset|) (= (_ bv0 64) |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.offset|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base|) (_ bv0 64)) |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base|)))} is VALID [2022-02-20 21:10:23,600 INFO L272 TraceCheckUtils]: 2: Hoare triple {545#(and (not (= |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base| |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base|) (_ bv0 64)) |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base|)) (= (_ bv0 64) |ULTIMATE.start_aws_linked_list_insert_after_~after#1.offset|) (= (_ bv0 64) |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.offset|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base|) (_ bv0 64)) |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base|)))} call aws_linked_list_insert_after_#t~ret339#1 := aws_linked_list_node_next_is_valid(aws_linked_list_insert_after_~after#1.base, aws_linked_list_insert_after_~after#1.offset); {549#(exists ((|v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_1| (_ BitVec 64))) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_1|) (_ bv0 64)) |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_1|)))} is VALID [2022-02-20 21:10:23,601 INFO L290 TraceCheckUtils]: 3: Hoare triple {549#(exists ((|v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_1| (_ BitVec 64))) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_1|) (_ bv0 64)) |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_1|)))} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short304 := ~node.base != 0bv64 || ~node.offset != 0bv64; {549#(exists ((|v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_1| (_ BitVec 64))) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_1|) (_ bv0 64)) |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_1|)))} is VALID [2022-02-20 21:10:23,601 INFO L290 TraceCheckUtils]: 4: Hoare triple {549#(exists ((|v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_1| (_ BitVec 64))) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_1|) (_ bv0 64)) |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_1|)))} assume #t~short304;call #t~mem303.base, #t~mem303.offset := read~$Pointer$(~node.base, ~node.offset, 8bv64);#t~short304 := #t~mem303.base != 0bv64 || #t~mem303.offset != 0bv64; {549#(exists ((|v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_1| (_ BitVec 64))) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_1|) (_ bv0 64)) |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_1|)))} is VALID [2022-02-20 21:10:23,602 INFO L290 TraceCheckUtils]: 5: Hoare triple {549#(exists ((|v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_1| (_ BitVec 64))) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_1|) (_ bv0 64)) |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_1|)))} #t~short307 := #t~short304; {549#(exists ((|v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_1| (_ BitVec 64))) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_1|) (_ bv0 64)) |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_1|)))} is VALID [2022-02-20 21:10:23,602 INFO L290 TraceCheckUtils]: 6: Hoare triple {549#(exists ((|v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_1| (_ BitVec 64))) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_1|) (_ bv0 64)) |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_1|)))} assume #t~short307;call #t~mem305.base, #t~mem305.offset := read~$Pointer$(~node.base, ~node.offset, 8bv64);call #t~mem306.base, #t~mem306.offset := read~$Pointer$(#t~mem305.base, ~bvadd64(8bv64, #t~mem305.offset), 8bv64);#t~short307 := #t~mem306.base == ~node.base && #t~mem306.offset == ~node.offset; {549#(exists ((|v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_1| (_ BitVec 64))) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_1|) (_ bv0 64)) |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_1|)))} is VALID [2022-02-20 21:10:23,603 INFO L290 TraceCheckUtils]: 7: Hoare triple {549#(exists ((|v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_1| (_ BitVec 64))) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_1|) (_ bv0 64)) |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_1|)))} #res := (if 0bv32 == (if #t~short307 then 1bv32 else 0bv32) then 0bv8 else 1bv8);havoc #t~mem303.base, #t~mem303.offset;havoc #t~short304;havoc #t~mem305.base, #t~mem305.offset;havoc #t~mem306.base, #t~mem306.offset;havoc #t~short307; {549#(exists ((|v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_1| (_ BitVec 64))) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_1|) (_ bv0 64)) |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_1|)))} is VALID [2022-02-20 21:10:23,603 INFO L290 TraceCheckUtils]: 8: Hoare triple {549#(exists ((|v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_1| (_ BitVec 64))) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_1|) (_ bv0 64)) |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_1|)))} assume true; {549#(exists ((|v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_1| (_ BitVec 64))) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_1|) (_ bv0 64)) |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_1|)))} is VALID [2022-02-20 21:10:23,604 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {549#(exists ((|v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_1| (_ BitVec 64))) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_1|) (_ bv0 64)) |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_1|)))} {545#(and (not (= |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base| |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base|) (_ bv0 64)) |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base|)) (= (_ bv0 64) |ULTIMATE.start_aws_linked_list_insert_after_~after#1.offset|) (= (_ bv0 64) |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.offset|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base|) (_ bv0 64)) |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base|)))} #93#return; {545#(and (not (= |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base| |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base|) (_ bv0 64)) |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base|)) (= (_ bv0 64) |ULTIMATE.start_aws_linked_list_insert_after_~after#1.offset|) (= (_ bv0 64) |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.offset|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base|) (_ bv0 64)) |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base|)))} is VALID [2022-02-20 21:10:23,605 INFO L272 TraceCheckUtils]: 10: Hoare triple {545#(and (not (= |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base| |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base|) (_ bv0 64)) |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base|)) (= (_ bv0 64) |ULTIMATE.start_aws_linked_list_insert_after_~after#1.offset|) (= (_ bv0 64) |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.offset|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base|) (_ bv0 64)) |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base|)))} call assume_abort_if_not(aws_linked_list_insert_after_#t~ret339#1); {574#(exists ((|v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_2| (_ BitVec 64))) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_2|) (_ bv0 64)) |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_2|)))} is VALID [2022-02-20 21:10:23,606 INFO L290 TraceCheckUtils]: 11: Hoare triple {574#(exists ((|v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_2| (_ BitVec 64))) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_2|) (_ bv0 64)) |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_2|)))} ~cond := #in~cond; {574#(exists ((|v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_2| (_ BitVec 64))) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_2|) (_ bv0 64)) |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_2|)))} is VALID [2022-02-20 21:10:23,607 INFO L290 TraceCheckUtils]: 12: Hoare triple {574#(exists ((|v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_2| (_ BitVec 64))) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_2|) (_ bv0 64)) |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_2|)))} assume !(0bv8 == ~cond); {574#(exists ((|v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_2| (_ BitVec 64))) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_2|) (_ bv0 64)) |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_2|)))} is VALID [2022-02-20 21:10:23,610 INFO L290 TraceCheckUtils]: 13: Hoare triple {574#(exists ((|v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_2| (_ BitVec 64))) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_2|) (_ bv0 64)) |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_2|)))} assume true; {574#(exists ((|v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_2| (_ BitVec 64))) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_2|) (_ bv0 64)) |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_2|)))} is VALID [2022-02-20 21:10:23,612 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {574#(exists ((|v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_2| (_ BitVec 64))) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_2|) (_ bv0 64)) |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_2|)))} {545#(and (not (= |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base| |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base|) (_ bv0 64)) |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base|)) (= (_ bv0 64) |ULTIMATE.start_aws_linked_list_insert_after_~after#1.offset|) (= (_ bv0 64) |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.offset|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base|) (_ bv0 64)) |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base|)))} #95#return; {545#(and (not (= |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base| |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base|) (_ bv0 64)) |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base|)) (= (_ bv0 64) |ULTIMATE.start_aws_linked_list_insert_after_~after#1.offset|) (= (_ bv0 64) |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.offset|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base|) (_ bv0 64)) |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base|)))} is VALID [2022-02-20 21:10:23,613 INFO L290 TraceCheckUtils]: 15: Hoare triple {545#(and (not (= |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base| |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base|) (_ bv0 64)) |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base|)) (= (_ bv0 64) |ULTIMATE.start_aws_linked_list_insert_after_~after#1.offset|) (= (_ bv0 64) |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.offset|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base|) (_ bv0 64)) |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base|)))} havoc aws_linked_list_insert_after_#t~ret339#1; {545#(and (not (= |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base| |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base|) (_ bv0 64)) |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base|)) (= (_ bv0 64) |ULTIMATE.start_aws_linked_list_insert_after_~after#1.offset|) (= (_ bv0 64) |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.offset|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base|) (_ bv0 64)) |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base|)))} is VALID [2022-02-20 21:10:23,615 INFO L272 TraceCheckUtils]: 16: Hoare triple {545#(and (not (= |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base| |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base|) (_ bv0 64)) |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base|)) (= (_ bv0 64) |ULTIMATE.start_aws_linked_list_insert_after_~after#1.offset|) (= (_ bv0 64) |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.offset|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base|) (_ bv0 64)) |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base|)))} call assume_abort_if_not((if 0bv32 == (if aws_linked_list_insert_after_~to_add#1.base != 0bv64 || aws_linked_list_insert_after_~to_add#1.offset != 0bv64 then 1bv32 else 0bv32) then 0bv8 else 1bv8)); {593#(exists ((|v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_3| (_ BitVec 64))) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_3|) (_ bv0 64)) |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_3|)))} is VALID [2022-02-20 21:10:23,615 INFO L290 TraceCheckUtils]: 17: Hoare triple {593#(exists ((|v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_3| (_ BitVec 64))) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_3|) (_ bv0 64)) |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_3|)))} ~cond := #in~cond; {593#(exists ((|v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_3| (_ BitVec 64))) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_3|) (_ bv0 64)) |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_3|)))} is VALID [2022-02-20 21:10:23,616 INFO L290 TraceCheckUtils]: 18: Hoare triple {593#(exists ((|v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_3| (_ BitVec 64))) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_3|) (_ bv0 64)) |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_3|)))} assume !(0bv8 == ~cond); {593#(exists ((|v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_3| (_ BitVec 64))) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_3|) (_ bv0 64)) |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_3|)))} is VALID [2022-02-20 21:10:23,616 INFO L290 TraceCheckUtils]: 19: Hoare triple {593#(exists ((|v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_3| (_ BitVec 64))) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_3|) (_ bv0 64)) |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_3|)))} assume true; {593#(exists ((|v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_3| (_ BitVec 64))) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_3|) (_ bv0 64)) |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_3|)))} is VALID [2022-02-20 21:10:23,617 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {593#(exists ((|v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_3| (_ BitVec 64))) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_3|) (_ bv0 64)) |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_3|)))} {545#(and (not (= |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base| |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base|) (_ bv0 64)) |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base|)) (= (_ bv0 64) |ULTIMATE.start_aws_linked_list_insert_after_~after#1.offset|) (= (_ bv0 64) |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.offset|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base|) (_ bv0 64)) |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base|)))} #97#return; {545#(and (not (= |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base| |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base|) (_ bv0 64)) |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base|)) (= (_ bv0 64) |ULTIMATE.start_aws_linked_list_insert_after_~after#1.offset|) (= (_ bv0 64) |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.offset|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base|) (_ bv0 64)) |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base|)))} is VALID [2022-02-20 21:10:23,666 INFO L290 TraceCheckUtils]: 21: Hoare triple {545#(and (not (= |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base| |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base|) (_ bv0 64)) |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.base|)) (= (_ bv0 64) |ULTIMATE.start_aws_linked_list_insert_after_~after#1.offset|) (= (_ bv0 64) |ULTIMATE.start_aws_linked_list_insert_after_~to_add#1.offset|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base|) (_ bv0 64)) |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base|)))} call write~$Pointer$(aws_linked_list_insert_after_~after#1.base, aws_linked_list_insert_after_~after#1.offset, aws_linked_list_insert_after_~to_add#1.base, ~bvadd64(8bv64, aws_linked_list_insert_after_~to_add#1.offset), 8bv64);call aws_linked_list_insert_after_#t~mem340#1.base, aws_linked_list_insert_after_#t~mem340#1.offset := read~$Pointer$(aws_linked_list_insert_after_~after#1.base, aws_linked_list_insert_after_~after#1.offset, 8bv64);call write~$Pointer$(aws_linked_list_insert_after_#t~mem340#1.base, aws_linked_list_insert_after_#t~mem340#1.offset, aws_linked_list_insert_after_~to_add#1.base, aws_linked_list_insert_after_~to_add#1.offset, 8bv64);havoc aws_linked_list_insert_after_#t~mem340#1.base, aws_linked_list_insert_after_#t~mem340#1.offset;call aws_linked_list_insert_after_#t~mem341#1.base, aws_linked_list_insert_after_#t~mem341#1.offset := read~$Pointer$(aws_linked_list_insert_after_~after#1.base, aws_linked_list_insert_after_~after#1.offset, 8bv64);call write~$Pointer$(aws_linked_list_insert_after_~to_add#1.base, aws_linked_list_insert_after_~to_add#1.offset, aws_linked_list_insert_after_#t~mem341#1.base, ~bvadd64(8bv64, aws_linked_list_insert_after_#t~mem341#1.offset), 8bv64);havoc aws_linked_list_insert_after_#t~mem341#1.base, aws_linked_list_insert_after_#t~mem341#1.offset;call write~$Pointer$(aws_linked_list_insert_after_~to_add#1.base, aws_linked_list_insert_after_~to_add#1.offset, aws_linked_list_insert_after_~after#1.base, aws_linked_list_insert_after_~after#1.offset, 8bv64); {609#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base|) |ULTIMATE.start_aws_linked_list_insert_after_~after#1.offset|)) (_ bv0 64)) |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base|)) (= (_ bv0 64) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base|) |ULTIMATE.start_aws_linked_list_insert_after_~after#1.offset|)) (_ bv0 64))) (bvadd (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base|) |ULTIMATE.start_aws_linked_list_insert_after_~after#1.offset|)) (_ bv0 64)) (_ bv8 64)))) (= (_ bv0 64) |ULTIMATE.start_aws_linked_list_insert_after_~after#1.offset|) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base|) |ULTIMATE.start_aws_linked_list_insert_after_~after#1.offset|)) (_ bv0 64)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base|) |ULTIMATE.start_aws_linked_list_insert_after_~after#1.offset|))) (= |ULTIMATE.start_aws_linked_list_insert_after_~after#1.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base|) |ULTIMATE.start_aws_linked_list_insert_after_~after#1.offset|)) (_ bv8 64))) (= (_ bv0 64) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base|) |ULTIMATE.start_aws_linked_list_insert_after_~after#1.offset|)) (= |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base|) |ULTIMATE.start_aws_linked_list_insert_after_~after#1.offset|)) (_ bv8 64))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base|) |ULTIMATE.start_aws_linked_list_insert_after_~after#1.offset|)) (_ bv0 64))) (bvadd (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base|) |ULTIMATE.start_aws_linked_list_insert_after_~after#1.offset|)) (_ bv0 64)) (_ bv8 64))) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base|) |ULTIMATE.start_aws_linked_list_insert_after_~after#1.offset|)))} is VALID [2022-02-20 21:10:25,675 WARN L272 TraceCheckUtils]: 22: Hoare triple {609#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base|) |ULTIMATE.start_aws_linked_list_insert_after_~after#1.offset|)) (_ bv0 64)) |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base|)) (= (_ bv0 64) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base|) |ULTIMATE.start_aws_linked_list_insert_after_~after#1.offset|)) (_ bv0 64))) (bvadd (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base|) |ULTIMATE.start_aws_linked_list_insert_after_~after#1.offset|)) (_ bv0 64)) (_ bv8 64)))) (= (_ bv0 64) |ULTIMATE.start_aws_linked_list_insert_after_~after#1.offset|) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base|) |ULTIMATE.start_aws_linked_list_insert_after_~after#1.offset|)) (_ bv0 64)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base|) |ULTIMATE.start_aws_linked_list_insert_after_~after#1.offset|))) (= |ULTIMATE.start_aws_linked_list_insert_after_~after#1.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base|) |ULTIMATE.start_aws_linked_list_insert_after_~after#1.offset|)) (_ bv8 64))) (= (_ bv0 64) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base|) |ULTIMATE.start_aws_linked_list_insert_after_~after#1.offset|)) (= |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base|) |ULTIMATE.start_aws_linked_list_insert_after_~after#1.offset|)) (_ bv8 64))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base|) |ULTIMATE.start_aws_linked_list_insert_after_~after#1.offset|)) (_ bv0 64))) (bvadd (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base|) |ULTIMATE.start_aws_linked_list_insert_after_~after#1.offset|)) (_ bv0 64)) (_ bv8 64))) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base|) |ULTIMATE.start_aws_linked_list_insert_after_~after#1.offset|)))} call aws_linked_list_insert_after_#t~ret342#1 := aws_linked_list_node_next_is_valid(aws_linked_list_insert_after_~after#1.base, aws_linked_list_insert_after_~after#1.offset); {613#(exists ((|v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4| (_ BitVec 64))) (and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64))) (_ bv0 64)) (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64)))) (= (_ bv0 64) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64))) (_ bv0 64))) (bvadd (_ bv8 64) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64))) (_ bv0 64))))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64))) (_ bv0 64)) |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64))) (_ bv8 64)) |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (= (_ bv0 64) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64))) (= (_ bv0 64) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64))) (_ bv8 64))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64))) (_ bv0 64))) (bvadd (_ bv8 64) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64))) (_ bv0 64)))) (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64)))))} is UNKNOWN [2022-02-20 21:10:25,678 INFO L290 TraceCheckUtils]: 23: Hoare triple {613#(exists ((|v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4| (_ BitVec 64))) (and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64))) (_ bv0 64)) (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64)))) (= (_ bv0 64) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64))) (_ bv0 64))) (bvadd (_ bv8 64) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64))) (_ bv0 64))))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64))) (_ bv0 64)) |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64))) (_ bv8 64)) |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (= (_ bv0 64) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64))) (= (_ bv0 64) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64))) (_ bv8 64))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64))) (_ bv0 64))) (bvadd (_ bv8 64) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64))) (_ bv0 64)))) (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64)))))} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short304 := ~node.base != 0bv64 || ~node.offset != 0bv64; {617#(and (= aws_linked_list_node_next_is_valid_~node.offset |aws_linked_list_node_next_is_valid_#in~node.offset|) (exists ((|v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4| (_ BitVec 64))) (and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64))) (_ bv0 64)) (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64)))) (= (_ bv0 64) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64))) (_ bv0 64))) (bvadd (_ bv8 64) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64))) (_ bv0 64))))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64))) (_ bv0 64)) |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64))) (_ bv8 64)) |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (= (_ bv0 64) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64))) (= (_ bv0 64) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64))) (_ bv8 64))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64))) (_ bv0 64))) (bvadd (_ bv8 64) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64))) (_ bv0 64)))) (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64))))) (= |aws_linked_list_node_next_is_valid_#in~node.base| aws_linked_list_node_next_is_valid_~node.base))} is VALID [2022-02-20 21:10:25,681 INFO L290 TraceCheckUtils]: 24: Hoare triple {617#(and (= aws_linked_list_node_next_is_valid_~node.offset |aws_linked_list_node_next_is_valid_#in~node.offset|) (exists ((|v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4| (_ BitVec 64))) (and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64))) (_ bv0 64)) (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64)))) (= (_ bv0 64) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64))) (_ bv0 64))) (bvadd (_ bv8 64) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64))) (_ bv0 64))))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64))) (_ bv0 64)) |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64))) (_ bv8 64)) |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (= (_ bv0 64) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64))) (= (_ bv0 64) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64))) (_ bv8 64))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64))) (_ bv0 64))) (bvadd (_ bv8 64) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64))) (_ bv0 64)))) (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64))))) (= |aws_linked_list_node_next_is_valid_#in~node.base| aws_linked_list_node_next_is_valid_~node.base))} assume #t~short304;call #t~mem303.base, #t~mem303.offset := read~$Pointer$(~node.base, ~node.offset, 8bv64);#t~short304 := #t~mem303.base != 0bv64 || #t~mem303.offset != 0bv64; {617#(and (= aws_linked_list_node_next_is_valid_~node.offset |aws_linked_list_node_next_is_valid_#in~node.offset|) (exists ((|v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4| (_ BitVec 64))) (and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64))) (_ bv0 64)) (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64)))) (= (_ bv0 64) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64))) (_ bv0 64))) (bvadd (_ bv8 64) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64))) (_ bv0 64))))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64))) (_ bv0 64)) |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64))) (_ bv8 64)) |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (= (_ bv0 64) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64))) (= (_ bv0 64) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64))) (_ bv8 64))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64))) (_ bv0 64))) (bvadd (_ bv8 64) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64))) (_ bv0 64)))) (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64))))) (= |aws_linked_list_node_next_is_valid_#in~node.base| aws_linked_list_node_next_is_valid_~node.base))} is VALID [2022-02-20 21:10:25,683 INFO L290 TraceCheckUtils]: 25: Hoare triple {617#(and (= aws_linked_list_node_next_is_valid_~node.offset |aws_linked_list_node_next_is_valid_#in~node.offset|) (exists ((|v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4| (_ BitVec 64))) (and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64))) (_ bv0 64)) (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64)))) (= (_ bv0 64) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64))) (_ bv0 64))) (bvadd (_ bv8 64) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64))) (_ bv0 64))))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64))) (_ bv0 64)) |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64))) (_ bv8 64)) |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (= (_ bv0 64) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64))) (= (_ bv0 64) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64))) (_ bv8 64))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64))) (_ bv0 64))) (bvadd (_ bv8 64) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64))) (_ bv0 64)))) (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64))))) (= |aws_linked_list_node_next_is_valid_#in~node.base| aws_linked_list_node_next_is_valid_~node.base))} #t~short307 := #t~short304; {617#(and (= aws_linked_list_node_next_is_valid_~node.offset |aws_linked_list_node_next_is_valid_#in~node.offset|) (exists ((|v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4| (_ BitVec 64))) (and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64))) (_ bv0 64)) (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64)))) (= (_ bv0 64) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64))) (_ bv0 64))) (bvadd (_ bv8 64) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64))) (_ bv0 64))))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64))) (_ bv0 64)) |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64))) (_ bv8 64)) |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (= (_ bv0 64) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64))) (= (_ bv0 64) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64))) (_ bv8 64))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64))) (_ bv0 64))) (bvadd (_ bv8 64) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64))) (_ bv0 64)))) (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64))))) (= |aws_linked_list_node_next_is_valid_#in~node.base| aws_linked_list_node_next_is_valid_~node.base))} is VALID [2022-02-20 21:10:25,694 INFO L290 TraceCheckUtils]: 26: Hoare triple {617#(and (= aws_linked_list_node_next_is_valid_~node.offset |aws_linked_list_node_next_is_valid_#in~node.offset|) (exists ((|v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4| (_ BitVec 64))) (and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64))) (_ bv0 64)) (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64)))) (= (_ bv0 64) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64))) (_ bv0 64))) (bvadd (_ bv8 64) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64))) (_ bv0 64))))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64))) (_ bv0 64)) |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64))) (_ bv8 64)) |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (= (_ bv0 64) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64))) (= (_ bv0 64) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64))) (_ bv8 64))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64))) (_ bv0 64))) (bvadd (_ bv8 64) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64))) (_ bv0 64)))) (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64))))) (= |aws_linked_list_node_next_is_valid_#in~node.base| aws_linked_list_node_next_is_valid_~node.base))} assume #t~short307;call #t~mem305.base, #t~mem305.offset := read~$Pointer$(~node.base, ~node.offset, 8bv64);call #t~mem306.base, #t~mem306.offset := read~$Pointer$(#t~mem305.base, ~bvadd64(8bv64, #t~mem305.offset), 8bv64);#t~short307 := #t~mem306.base == ~node.base && #t~mem306.offset == ~node.offset; {627#(and (or (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |aws_linked_list_node_next_is_valid_#in~node.base|) |aws_linked_list_node_next_is_valid_#in~node.offset|)) (bvadd (_ bv8 64) (select (select |#memory_$Pointer$.offset| |aws_linked_list_node_next_is_valid_#in~node.base|) |aws_linked_list_node_next_is_valid_#in~node.offset|))) |aws_linked_list_node_next_is_valid_#in~node.offset|) (= |aws_linked_list_node_next_is_valid_#in~node.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |aws_linked_list_node_next_is_valid_#in~node.base|) |aws_linked_list_node_next_is_valid_#in~node.offset|)) (bvadd (_ bv8 64) (select (select |#memory_$Pointer$.offset| |aws_linked_list_node_next_is_valid_#in~node.base|) |aws_linked_list_node_next_is_valid_#in~node.offset|)))) |aws_linked_list_node_next_is_valid_#t~short307|) (and (or (not (= |aws_linked_list_node_next_is_valid_#in~node.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |aws_linked_list_node_next_is_valid_#in~node.base|) |aws_linked_list_node_next_is_valid_#in~node.offset|)) (bvadd (_ bv8 64) (select (select |#memory_$Pointer$.offset| |aws_linked_list_node_next_is_valid_#in~node.base|) |aws_linked_list_node_next_is_valid_#in~node.offset|))))) (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |aws_linked_list_node_next_is_valid_#in~node.base|) |aws_linked_list_node_next_is_valid_#in~node.offset|)) (bvadd (_ bv8 64) (select (select |#memory_$Pointer$.offset| |aws_linked_list_node_next_is_valid_#in~node.base|) |aws_linked_list_node_next_is_valid_#in~node.offset|))) |aws_linked_list_node_next_is_valid_#in~node.offset|))) (not |aws_linked_list_node_next_is_valid_#t~short307|))) (exists ((|v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4| (_ BitVec 64))) (and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64))) (_ bv0 64)) (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64)))) (= (_ bv0 64) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64))) (_ bv0 64))) (bvadd (_ bv8 64) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64))) (_ bv0 64))))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64))) (_ bv0 64)) |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64))) (_ bv8 64)) |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (= (_ bv0 64) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64))) (= (_ bv0 64) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64))) (_ bv8 64))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64))) (_ bv0 64))) (bvadd (_ bv8 64) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64))) (_ bv0 64)))) (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64))))))} is VALID [2022-02-20 21:10:25,702 INFO L290 TraceCheckUtils]: 27: Hoare triple {627#(and (or (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |aws_linked_list_node_next_is_valid_#in~node.base|) |aws_linked_list_node_next_is_valid_#in~node.offset|)) (bvadd (_ bv8 64) (select (select |#memory_$Pointer$.offset| |aws_linked_list_node_next_is_valid_#in~node.base|) |aws_linked_list_node_next_is_valid_#in~node.offset|))) |aws_linked_list_node_next_is_valid_#in~node.offset|) (= |aws_linked_list_node_next_is_valid_#in~node.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |aws_linked_list_node_next_is_valid_#in~node.base|) |aws_linked_list_node_next_is_valid_#in~node.offset|)) (bvadd (_ bv8 64) (select (select |#memory_$Pointer$.offset| |aws_linked_list_node_next_is_valid_#in~node.base|) |aws_linked_list_node_next_is_valid_#in~node.offset|)))) |aws_linked_list_node_next_is_valid_#t~short307|) (and (or (not (= |aws_linked_list_node_next_is_valid_#in~node.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |aws_linked_list_node_next_is_valid_#in~node.base|) |aws_linked_list_node_next_is_valid_#in~node.offset|)) (bvadd (_ bv8 64) (select (select |#memory_$Pointer$.offset| |aws_linked_list_node_next_is_valid_#in~node.base|) |aws_linked_list_node_next_is_valid_#in~node.offset|))))) (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |aws_linked_list_node_next_is_valid_#in~node.base|) |aws_linked_list_node_next_is_valid_#in~node.offset|)) (bvadd (_ bv8 64) (select (select |#memory_$Pointer$.offset| |aws_linked_list_node_next_is_valid_#in~node.base|) |aws_linked_list_node_next_is_valid_#in~node.offset|))) |aws_linked_list_node_next_is_valid_#in~node.offset|))) (not |aws_linked_list_node_next_is_valid_#t~short307|))) (exists ((|v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4| (_ BitVec 64))) (and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64))) (_ bv0 64)) (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64)))) (= (_ bv0 64) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64))) (_ bv0 64))) (bvadd (_ bv8 64) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64))) (_ bv0 64))))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64))) (_ bv0 64)) |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64))) (_ bv8 64)) |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (= (_ bv0 64) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64))) (= (_ bv0 64) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64))) (_ bv8 64))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64))) (_ bv0 64))) (bvadd (_ bv8 64) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64))) (_ bv0 64)))) (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64))))))} #res := (if 0bv32 == (if #t~short307 then 1bv32 else 0bv32) then 0bv8 else 1bv8);havoc #t~mem303.base, #t~mem303.offset;havoc #t~short304;havoc #t~mem305.base, #t~mem305.offset;havoc #t~mem306.base, #t~mem306.offset;havoc #t~short307; {631#(and (or (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |aws_linked_list_node_next_is_valid_#in~node.base|) |aws_linked_list_node_next_is_valid_#in~node.offset|)) (bvadd (_ bv8 64) (select (select |#memory_$Pointer$.offset| |aws_linked_list_node_next_is_valid_#in~node.base|) |aws_linked_list_node_next_is_valid_#in~node.offset|))) |aws_linked_list_node_next_is_valid_#in~node.offset|) (= |aws_linked_list_node_next_is_valid_#in~node.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |aws_linked_list_node_next_is_valid_#in~node.base|) |aws_linked_list_node_next_is_valid_#in~node.offset|)) (bvadd (_ bv8 64) (select (select |#memory_$Pointer$.offset| |aws_linked_list_node_next_is_valid_#in~node.base|) |aws_linked_list_node_next_is_valid_#in~node.offset|)))) (= (_ bv1 8) |aws_linked_list_node_next_is_valid_#res|)) (and (or (not (= |aws_linked_list_node_next_is_valid_#in~node.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |aws_linked_list_node_next_is_valid_#in~node.base|) |aws_linked_list_node_next_is_valid_#in~node.offset|)) (bvadd (_ bv8 64) (select (select |#memory_$Pointer$.offset| |aws_linked_list_node_next_is_valid_#in~node.base|) |aws_linked_list_node_next_is_valid_#in~node.offset|))))) (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |aws_linked_list_node_next_is_valid_#in~node.base|) |aws_linked_list_node_next_is_valid_#in~node.offset|)) (bvadd (_ bv8 64) (select (select |#memory_$Pointer$.offset| |aws_linked_list_node_next_is_valid_#in~node.base|) |aws_linked_list_node_next_is_valid_#in~node.offset|))) |aws_linked_list_node_next_is_valid_#in~node.offset|))) (= |aws_linked_list_node_next_is_valid_#res| (_ bv0 8)))) (exists ((|v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4| (_ BitVec 64))) (and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64))) (_ bv0 64)) (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64)))) (= (_ bv0 64) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64))) (_ bv0 64))) (bvadd (_ bv8 64) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64))) (_ bv0 64))))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64))) (_ bv0 64)) |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64))) (_ bv8 64)) |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (= (_ bv0 64) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64))) (= (_ bv0 64) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64))) (_ bv8 64))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64))) (_ bv0 64))) (bvadd (_ bv8 64) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64))) (_ bv0 64)))) (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64))))))} is VALID [2022-02-20 21:10:25,713 INFO L290 TraceCheckUtils]: 28: Hoare triple {631#(and (or (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |aws_linked_list_node_next_is_valid_#in~node.base|) |aws_linked_list_node_next_is_valid_#in~node.offset|)) (bvadd (_ bv8 64) (select (select |#memory_$Pointer$.offset| |aws_linked_list_node_next_is_valid_#in~node.base|) |aws_linked_list_node_next_is_valid_#in~node.offset|))) |aws_linked_list_node_next_is_valid_#in~node.offset|) (= |aws_linked_list_node_next_is_valid_#in~node.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |aws_linked_list_node_next_is_valid_#in~node.base|) |aws_linked_list_node_next_is_valid_#in~node.offset|)) (bvadd (_ bv8 64) (select (select |#memory_$Pointer$.offset| |aws_linked_list_node_next_is_valid_#in~node.base|) |aws_linked_list_node_next_is_valid_#in~node.offset|)))) (= (_ bv1 8) |aws_linked_list_node_next_is_valid_#res|)) (and (or (not (= |aws_linked_list_node_next_is_valid_#in~node.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |aws_linked_list_node_next_is_valid_#in~node.base|) |aws_linked_list_node_next_is_valid_#in~node.offset|)) (bvadd (_ bv8 64) (select (select |#memory_$Pointer$.offset| |aws_linked_list_node_next_is_valid_#in~node.base|) |aws_linked_list_node_next_is_valid_#in~node.offset|))))) (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |aws_linked_list_node_next_is_valid_#in~node.base|) |aws_linked_list_node_next_is_valid_#in~node.offset|)) (bvadd (_ bv8 64) (select (select |#memory_$Pointer$.offset| |aws_linked_list_node_next_is_valid_#in~node.base|) |aws_linked_list_node_next_is_valid_#in~node.offset|))) |aws_linked_list_node_next_is_valid_#in~node.offset|))) (= |aws_linked_list_node_next_is_valid_#res| (_ bv0 8)))) (exists ((|v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4| (_ BitVec 64))) (and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64))) (_ bv0 64)) (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64)))) (= (_ bv0 64) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64))) (_ bv0 64))) (bvadd (_ bv8 64) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64))) (_ bv0 64))))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64))) (_ bv0 64)) |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64))) (_ bv8 64)) |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (= (_ bv0 64) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64))) (= (_ bv0 64) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64))) (_ bv8 64))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64))) (_ bv0 64))) (bvadd (_ bv8 64) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64))) (_ bv0 64)))) (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64))))))} assume true; {631#(and (or (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |aws_linked_list_node_next_is_valid_#in~node.base|) |aws_linked_list_node_next_is_valid_#in~node.offset|)) (bvadd (_ bv8 64) (select (select |#memory_$Pointer$.offset| |aws_linked_list_node_next_is_valid_#in~node.base|) |aws_linked_list_node_next_is_valid_#in~node.offset|))) |aws_linked_list_node_next_is_valid_#in~node.offset|) (= |aws_linked_list_node_next_is_valid_#in~node.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |aws_linked_list_node_next_is_valid_#in~node.base|) |aws_linked_list_node_next_is_valid_#in~node.offset|)) (bvadd (_ bv8 64) (select (select |#memory_$Pointer$.offset| |aws_linked_list_node_next_is_valid_#in~node.base|) |aws_linked_list_node_next_is_valid_#in~node.offset|)))) (= (_ bv1 8) |aws_linked_list_node_next_is_valid_#res|)) (and (or (not (= |aws_linked_list_node_next_is_valid_#in~node.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |aws_linked_list_node_next_is_valid_#in~node.base|) |aws_linked_list_node_next_is_valid_#in~node.offset|)) (bvadd (_ bv8 64) (select (select |#memory_$Pointer$.offset| |aws_linked_list_node_next_is_valid_#in~node.base|) |aws_linked_list_node_next_is_valid_#in~node.offset|))))) (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |aws_linked_list_node_next_is_valid_#in~node.base|) |aws_linked_list_node_next_is_valid_#in~node.offset|)) (bvadd (_ bv8 64) (select (select |#memory_$Pointer$.offset| |aws_linked_list_node_next_is_valid_#in~node.base|) |aws_linked_list_node_next_is_valid_#in~node.offset|))) |aws_linked_list_node_next_is_valid_#in~node.offset|))) (= |aws_linked_list_node_next_is_valid_#res| (_ bv0 8)))) (exists ((|v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4| (_ BitVec 64))) (and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64))) (_ bv0 64)) (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64)))) (= (_ bv0 64) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64))) (_ bv0 64))) (bvadd (_ bv8 64) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64))) (_ bv0 64))))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64))) (_ bv0 64)) |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64))) (_ bv8 64)) |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (= (_ bv0 64) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64))) (= (_ bv0 64) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64))) (_ bv8 64))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64))) (_ bv0 64))) (bvadd (_ bv8 64) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64))) (_ bv0 64)))) (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64))))))} is VALID [2022-02-20 21:10:25,717 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {631#(and (or (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |aws_linked_list_node_next_is_valid_#in~node.base|) |aws_linked_list_node_next_is_valid_#in~node.offset|)) (bvadd (_ bv8 64) (select (select |#memory_$Pointer$.offset| |aws_linked_list_node_next_is_valid_#in~node.base|) |aws_linked_list_node_next_is_valid_#in~node.offset|))) |aws_linked_list_node_next_is_valid_#in~node.offset|) (= |aws_linked_list_node_next_is_valid_#in~node.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |aws_linked_list_node_next_is_valid_#in~node.base|) |aws_linked_list_node_next_is_valid_#in~node.offset|)) (bvadd (_ bv8 64) (select (select |#memory_$Pointer$.offset| |aws_linked_list_node_next_is_valid_#in~node.base|) |aws_linked_list_node_next_is_valid_#in~node.offset|)))) (= (_ bv1 8) |aws_linked_list_node_next_is_valid_#res|)) (and (or (not (= |aws_linked_list_node_next_is_valid_#in~node.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |aws_linked_list_node_next_is_valid_#in~node.base|) |aws_linked_list_node_next_is_valid_#in~node.offset|)) (bvadd (_ bv8 64) (select (select |#memory_$Pointer$.offset| |aws_linked_list_node_next_is_valid_#in~node.base|) |aws_linked_list_node_next_is_valid_#in~node.offset|))))) (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |aws_linked_list_node_next_is_valid_#in~node.base|) |aws_linked_list_node_next_is_valid_#in~node.offset|)) (bvadd (_ bv8 64) (select (select |#memory_$Pointer$.offset| |aws_linked_list_node_next_is_valid_#in~node.base|) |aws_linked_list_node_next_is_valid_#in~node.offset|))) |aws_linked_list_node_next_is_valid_#in~node.offset|))) (= |aws_linked_list_node_next_is_valid_#res| (_ bv0 8)))) (exists ((|v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4| (_ BitVec 64))) (and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64))) (_ bv0 64)) (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64)))) (= (_ bv0 64) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64))) (_ bv0 64))) (bvadd (_ bv8 64) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64))) (_ bv0 64))))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64))) (_ bv0 64)) |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64))) (_ bv8 64)) |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (= (_ bv0 64) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64))) (= (_ bv0 64) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64))) (_ bv8 64))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64))) (_ bv0 64))) (bvadd (_ bv8 64) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64))) (_ bv0 64)))) (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_4|) (_ bv0 64))))))} {609#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base|) |ULTIMATE.start_aws_linked_list_insert_after_~after#1.offset|)) (_ bv0 64)) |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base|)) (= (_ bv0 64) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base|) |ULTIMATE.start_aws_linked_list_insert_after_~after#1.offset|)) (_ bv0 64))) (bvadd (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base|) |ULTIMATE.start_aws_linked_list_insert_after_~after#1.offset|)) (_ bv0 64)) (_ bv8 64)))) (= (_ bv0 64) |ULTIMATE.start_aws_linked_list_insert_after_~after#1.offset|) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base|) |ULTIMATE.start_aws_linked_list_insert_after_~after#1.offset|)) (_ bv0 64)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base|) |ULTIMATE.start_aws_linked_list_insert_after_~after#1.offset|))) (= |ULTIMATE.start_aws_linked_list_insert_after_~after#1.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base|) |ULTIMATE.start_aws_linked_list_insert_after_~after#1.offset|)) (_ bv8 64))) (= (_ bv0 64) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base|) |ULTIMATE.start_aws_linked_list_insert_after_~after#1.offset|)) (= |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base|) |ULTIMATE.start_aws_linked_list_insert_after_~after#1.offset|)) (_ bv8 64))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base|) |ULTIMATE.start_aws_linked_list_insert_after_~after#1.offset|)) (_ bv0 64))) (bvadd (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base|) |ULTIMATE.start_aws_linked_list_insert_after_~after#1.offset|)) (_ bv0 64)) (_ bv8 64))) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_insert_after_~after#1.base|) |ULTIMATE.start_aws_linked_list_insert_after_~after#1.offset|)))} #99#return; {638#(= (_ bv1 8) |ULTIMATE.start_aws_linked_list_insert_after_#t~ret342#1|)} is VALID [2022-02-20 21:10:25,718 INFO L272 TraceCheckUtils]: 30: Hoare triple {638#(= (_ bv1 8) |ULTIMATE.start_aws_linked_list_insert_after_#t~ret342#1|)} call __VERIFIER_assert(aws_linked_list_insert_after_#t~ret342#1); {642#(= (_ bv1 8) |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 21:10:25,727 INFO L290 TraceCheckUtils]: 31: Hoare triple {642#(= (_ bv1 8) |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {646#(= (_ bv1 8) __VERIFIER_assert_~cond)} is VALID [2022-02-20 21:10:25,728 INFO L290 TraceCheckUtils]: 32: Hoare triple {646#(= (_ bv1 8) __VERIFIER_assert_~cond)} assume 0bv8 == ~cond; {538#false} is VALID [2022-02-20 21:10:25,728 INFO L290 TraceCheckUtils]: 33: Hoare triple {538#false} assume !false; {538#false} is VALID [2022-02-20 21:10:25,728 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2022-02-20 21:10:25,728 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 21:10:26,883 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1495 treesize of output 1415 [2022-02-20 21:10:32,715 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1740 treesize of output 1716 [2022-02-20 21:10:37,312 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 21:10:37,312 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [338418554] [2022-02-20 21:10:37,312 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [338418554] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 21:10:37,312 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1299464787] [2022-02-20 21:10:37,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:10:37,312 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-02-20 21:10:37,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-02-20 21:10:37,314 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-02-20 21:10:37,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2022-02-20 21:10:39,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:39,019 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 48 conjunts are in the unsatisfiable core [2022-02-20 21:10:39,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:39,046 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 21:10:39,094 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02-20 21:10:39,106 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-02-20 21:10:39,106 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 28 [2022-02-20 21:10:39,124 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 21:10:39,124 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2022-02-20 21:10:41,158 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_7| (_ BitVec 64))) (not (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_7|) (_ bv0 64)) |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_7|))) is different from true [2022-02-20 21:10:43,238 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_8| (_ BitVec 64))) (not (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_8|) (_ bv0 64)) |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_8|))) is different from true [2022-02-20 21:10:45,337 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_9| (_ BitVec 64))) (not (= |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_9| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_9|) (_ bv0 64))))) is different from true [2022-02-20 21:10:45,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 21:10:45,478 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 130 treesize of output 106 [2022-02-20 21:10:45,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 21:10:45,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 21:10:45,513 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-02-20 21:10:45,537 WARN L325 FreeRefinementEngine]: Global settings require throwing the following exception [2022-02-20 21:10:45,557 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-02-20 21:10:45,747 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Forceful destruction successful, exit code 0 [2022-02-20 21:10:45,938 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2022-02-20 21:10:45,939 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: v_arrayElimArr_3 at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:285) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:427) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:184) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:166) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:154) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:142) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:126) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:110) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:95) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:90) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:904) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:865) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:783) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:425) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:261) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:247) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:299) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:273) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:145) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:93) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:264) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:177) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:156) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-02-20 21:10:45,943 INFO L158 Benchmark]: Toolchain (without parser) took 35719.30ms. Allocated memory was 60.8MB in the beginning and 176.2MB in the end (delta: 115.3MB). Free memory was 32.5MB in the beginning and 75.9MB in the end (delta: -43.4MB). Peak memory consumption was 75.6MB. Max. memory is 16.1GB. [2022-02-20 21:10:45,943 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 60.8MB. Free memory was 42.5MB in the beginning and 42.5MB in the end (delta: 51.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 21:10:45,943 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1470.48ms. Allocated memory was 60.8MB in the beginning and 94.4MB in the end (delta: 33.6MB). Free memory was 32.2MB in the beginning and 35.4MB in the end (delta: -3.1MB). Peak memory consumption was 35.8MB. Max. memory is 16.1GB. [2022-02-20 21:10:45,943 INFO L158 Benchmark]: Boogie Procedure Inliner took 118.71ms. Allocated memory is still 94.4MB. Free memory was 35.4MB in the beginning and 54.6MB in the end (delta: -19.2MB). Peak memory consumption was 2.3MB. Max. memory is 16.1GB. [2022-02-20 21:10:45,944 INFO L158 Benchmark]: Boogie Preprocessor took 57.60ms. Allocated memory is still 94.4MB. Free memory was 54.6MB in the beginning and 51.0MB in the end (delta: 3.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 21:10:45,944 INFO L158 Benchmark]: RCFGBuilder took 528.33ms. Allocated memory is still 94.4MB. Free memory was 51.0MB in the beginning and 51.6MB in the end (delta: -659.9kB). Peak memory consumption was 20.7MB. Max. memory is 16.1GB. [2022-02-20 21:10:45,944 INFO L158 Benchmark]: TraceAbstraction took 33538.73ms. Allocated memory was 94.4MB in the beginning and 176.2MB in the end (delta: 81.8MB). Free memory was 51.1MB in the beginning and 75.9MB in the end (delta: -24.7MB). Peak memory consumption was 58.9MB. Max. memory is 16.1GB. [2022-02-20 21:10:45,945 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 60.8MB. Free memory was 42.5MB in the beginning and 42.5MB in the end (delta: 51.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1470.48ms. Allocated memory was 60.8MB in the beginning and 94.4MB in the end (delta: 33.6MB). Free memory was 32.2MB in the beginning and 35.4MB in the end (delta: -3.1MB). Peak memory consumption was 35.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 118.71ms. Allocated memory is still 94.4MB. Free memory was 35.4MB in the beginning and 54.6MB in the end (delta: -19.2MB). Peak memory consumption was 2.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.60ms. Allocated memory is still 94.4MB. Free memory was 54.6MB in the beginning and 51.0MB in the end (delta: 3.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 528.33ms. Allocated memory is still 94.4MB. Free memory was 51.0MB in the beginning and 51.6MB in the end (delta: -659.9kB). Peak memory consumption was 20.7MB. Max. memory is 16.1GB. * TraceAbstraction took 33538.73ms. Allocated memory was 94.4MB in the beginning and 176.2MB in the end (delta: 81.8MB). Free memory was 51.1MB in the beginning and 75.9MB in the end (delta: -24.7MB). Peak memory consumption was 58.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: v_arrayElimArr_3 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: v_arrayElimArr_3: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:285) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-02-20 21:10:46,004 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: var is still there: v_arrayElimArr_3